WATCH: 0.00 CPU 0.01 WC . No.of.Axioms: 0 .. WATCH: 2.99 CPU 3.02 WC ............................... [E:600s]. [E:600s]. [E:600s][E:600s]. [E:600s]. [E:600s]. [E:600s][E:600s][E:600s]. [E:600s][E:600s][E:600s][E:600s].. [E:600s][E:600s]. [E:600s][E:600s][E:600s][E:600s]. [E:600s]. [E:600s]. [E:600s][E:600s]. [E:600s][E:600s][E:600s][E:600s][E:600s][E:600s]. [E:600s]. [E:600s]. [E:600s][E:600s] WATCH: 5.13 CPU 6.03 WC [E:600s][E:600s][E:600s]. [E:600s][E:600s][E:600s]. [E:600s][E:600s][E:600s][E:600s][E:600s]. [E:600s][E:600s].. [E:600s].. [E:600s] ******************************** * All subproblems solved!!! * ******************************** % SZS status Theorem for /CW/home-0/sutcliff/CASC/23/Problems/FNE/FNE063.p (rf:0,ps:3,sos:true,u:8,ude:true,foatp:e) %**** Beginning of derivation protocol **** % SZS output start CNFRefutation thf(tp_a,type,(a: ($i>($i>$o)))). thf(tp_a0,type,(a0: $o)). thf(tp_a1,type,(a1: ($i>$o))). thf(tp_a_member_of,type,(a_member_of: ($i>($i>$o)))). thf(tp_b,type,(b: ($i>$o))). thf(tp_b0,type,(b0: $o)). thf(tp_c,type,(c: ($i>$o))). thf(tp_e,type,(e: ($i>$o))). thf(tp_eq,type,(eq: ($i>($i>$o)))). thf(tp_f,type,(f: ($i>$i))). thf(tp_f0,type,(f0: $o)). thf(tp_g,type,(g: ($i>$o))). thf(tp_g0,type,(g0: $o)). thf(tp_p,type,(p: ($i>($i>$o)))). thf(tp_p1,type,(p1: ($i>$o))). thf(tp_q,type,(q: ($i>($i>$o)))). thf(tp_q0,type,(q0: $o)). thf(tp_q1,type,(q1: ($i>$o))). thf(tp_r,type,(r: ($i>($i>$o)))). thf(tp_r1,type,(r1: ($i>$o))). thf(tp_s,type,(s: ($i>($i>$o)))). thf(tp_s1,type,(s1: ($i>$o))). thf(tp_sK1,type,(sK1: $i)). thf(tp_sK10,type,(sK10: $i)). thf(tp_sK11,type,(sK11: $i)). thf(tp_sK12,type,(sK12: $i)). thf(tp_sK13,type,(sK13: $i)). thf(tp_sK14,type,(sK14: $i)). thf(tp_sK15,type,(sK15: $i)). thf(tp_sK16,type,(sK16: $i)). thf(tp_sK17,type,(sK17: $i)). thf(tp_sK18,type,(sK18: $i)). thf(tp_sK19,type,(sK19: $i)). thf(tp_sK2,type,(sK2: $i)). thf(tp_sK20,type,(sK20: $i)). thf(tp_sK21,type,(sK21: $i)). thf(tp_sK22,type,(sK22: $i)). thf(tp_sK23,type,(sK23: $i)). thf(tp_sK24,type,(sK24: $i)). thf(tp_sK25,type,(sK25: ($i>$i))). thf(tp_sK26,type,(sK26: $i)). thf(tp_sK27,type,(sK27: $i)). thf(tp_sK28,type,(sK28: $i)). thf(tp_sK29,type,(sK29: $i)). thf(tp_sK3,type,(sK3: $i)). thf(tp_sK30,type,(sK30: $i)). thf(tp_sK31,type,(sK31: $i)). thf(tp_sK32,type,(sK32: $i)). thf(tp_sK33,type,(sK33: $i)). thf(tp_sK34,type,(sK34: $i)). thf(tp_sK35,type,(sK35: $i)). thf(tp_sK36,type,(sK36: $i)). thf(tp_sK37,type,(sK37: $i)). thf(tp_sK38,type,(sK38: $i)). thf(tp_sK39,type,(sK39: $i)). thf(tp_sK4,type,(sK4: $i)). thf(tp_sK40,type,(sK40: $i)). thf(tp_sK41,type,(sK41: $i)). thf(tp_sK42,type,(sK42: $i)). thf(tp_sK43,type,(sK43: $i)). thf(tp_sK44,type,(sK44: $i)). thf(tp_sK45,type,(sK45: ($i>($i>$i)))). thf(tp_sK46,type,(sK46: $i)). thf(tp_sK47,type,(sK47: $i)). thf(tp_sK48,type,(sK48: $i)). thf(tp_sK49,type,(sK49: $i)). thf(tp_sK5,type,(sK5: $i)). thf(tp_sK50,type,(sK50: $i)). thf(tp_sK51,type,(sK51: $i)). thf(tp_sK52,type,(sK52: $i)). thf(tp_sK53,type,(sK53: $i)). thf(tp_sK54,type,(sK54: $i)). thf(tp_sK55,type,(sK55: $i)). thf(tp_sK56,type,(sK56: $i)). thf(tp_sK57,type,(sK57: $i)). thf(tp_sK58,type,(sK58: $i)). thf(tp_sK59,type,(sK59: $i)). thf(tp_sK6,type,(sK6: $i)). thf(tp_sK60,type,(sK60: $i)). thf(tp_sK61,type,(sK61: $i)). thf(tp_sK62,type,(sK62: $i)). thf(tp_sK63,type,(sK63: $i)). thf(tp_sK64,type,(sK64: $i)). thf(tp_sK65,type,(sK65: $i)). thf(tp_sK7,type,(sK7: $i)). thf(tp_sK8,type,(sK8: ($i>$i))). thf(tp_sK9,type,(sK9: $i)). thf(tp_z,type,(z: $i)). thf(1,conjecture,(((((((((((((((((((((((((((((((((((((((((((![B:$i,C:$i]: ((?[X:$i,Y:$i]: ((q1@X) & ((p1@(f@Y)) => ((p1@X) & ((r1@Y) => ((r1@B) & (r1@C))))))) <= (![Z:$i]: (q1@(f@Z))))) & (![A:$i,B:$i,C:$i]: ((?[X:$i,Y:$i]: (((q@X)@Y) & (p1@X))) <= ((((((r@B)@C) & (![X:$i]: ((s1@X) => (p1@X)))) & (![X:$i,Y:$i]: (((r@X)@Y) => ((q@X)@Y)))) & (s1@B)) & (s1@A))))) & ((?[Z:$i]: (![Y:$i]: ((r1@Z) | (p1@Y)))) <= (![X:$i]: (?[Y:$i]: ((p1@X) & (q1@Y)))))) & ((?[Z:$i]: ((a@Z)@Z)) <= (![X:$i]: (?[Y:$i]: (((a@Y)@Y) & ((a@X)@Y)))))) & (![A:$i,B:$i,C:$i]: ((?[X:$i,Y:$i]: (((q@X)@Y) & (p1@X))) <= (((((s1@A) & (![X:$i]: ((s1@X) => (p1@X)))) & (![X:$i,Y:$i]: (((r@X)@Y) => ((q@X)@Y)))) & ((r@B)@C)) & (s1@B))))) & (![A:$i,B:$i]: ((![Y:$i]: ((q1@Y) => (p1@Y))) => (?[X:$i]: (((p1@X) => (p1@A)) & ((q1@X) => (p1@B))))))) & (![A:$i,B:$i]: ((?[X:$i]: (((p1@B) <= (q1@X)) & ((p1@X) => (p1@A)))) <= (![Z:$i]: ((p1@Z) <= (q1@Z)))))) & (((?[X:$i]: (b@X)) <= (![X:$i]: (a1@X))) <= (?[X:$i]: ((a1@X) => (b@X))))) & ((?[X:$i]: (b@X)) => (?[X:$i]: ((b@X) | (a1@X))))) & ((?[Y:$i,X:$i]: ((a@X)@Y)) <=> (?[X:$i,Y:$i]: ((a@X)@Y)))) & ((?[Y:$i]: (p1@Y)) <=> (?[X:$i]: (p1@X)))) & (?[Z:$i]: (![X:$i]: (?[Y:$i]: (((((p@Z)@Y) & ((p@Y)@Z)) => ((p@Y)@X)) & ((?[W:$i]: ((p@W)@Y)) <= ((p@Y)@X))))))) & (?[X:$i]: (![Y:$i]: ((p1@X) => (p1@Y))))) & (![A:$i,B:$i]: (?[X:$i,Y:$i]: (((r1@Y) <= (p1@X)) => ((p1@A) => (r1@B)))))) & ((?[X:$i]: (p1@X)) => (?[Y:$i]: (p1@Y)))) & ((![X:$i]: ((p@X)@X)) <= (![X:$i,Y:$i]: ((p@X)@Y)))) & ((a0 | b0) | (b0 <=> a0))) & ((?[Z:$i]: ((r1@Z) <= (p1@Z))) <= ((![X:$i]: ((p1@X) => (q1@X))) & (?[Y:$i]: ((q1@Y) => (r1@Y)))))) & (![B:$i]: ((![Y:$i]: (((p@(f@Y))@Y) <= ((r1@Y) <= (r1@B)))) => (?[X:$i,Y:$i]: (((p@X)@Y) & (((q@X)@Y) <= ((q@(f@B))@B))))))) & (![A:$i,B:$i]: (?[X:$i,Y:$i]: (((((((((((p@X)@A) <= (q1@X)) & (q1@A)) & (q1@B)) & (r1@A)) & (r1@B)) & (s1@A)) & (((p@X)@Y) <= (s1@A))) & ((r1@Y) => ((p@B)@Y))) => ((p@A)@B))))) & ((b0 <=> a0) <= (a0 & b0))) & (![A:$i]: ((q1@A) <= ((g0 | f0) & (![X:$i]: ((p1@X) & (q1@X))))))) & ((p1@z) => (p1@z))) & ((?[X:$i]: (![Y:$i]: ((p@X)@Y))) => (![Y:$i]: (?[X:$i]: ((p@X)@Y))))) & (?[Y:$i]: ((p1@Y) <= (?[X:$i]: (p1@X))))) & (![B:$i]: (((q1@B) <= (![Y:$i]: ((p1@Y) <= (r1@Y)))) <= ((r1@B) & (![X:$i]: ((p1@X) => (q1@X))))))) & (![A:$i,B:$i]: ((![Y:$i]: ((q1@Y) => (p1@Y))) => (?[X:$i]: (((q1@X) => (p1@B)) & ((p1@X) => (p1@A))))))) & ((![X:$i,Y:$i]: ((![Z:$i]: (((a_member_of@Z)@Y) <=> ((a_member_of@Z)@X))) <=> ((eq@X)@Y))) => (![A:$i,B:$i]: (((eq@A)@B) => ((eq@B)@A))))) & ((?[Z:$i]: (p1@Z)) <= (?[X:$i]: (p1@X)))) & ((![X:$i]: (p1@X)) => ((![Y:$i]: (p1@Y)) & (![X:$i]: (p1@X))))) & (![A:$i,B:$i]: ((![X:$i]: (p1@X)) => ((p1@B) & (p1@A))))) & ((?[X:$i]: ((b@X) & (a1@X))) <= ((?[X:$i]: (a1@X)) & (![X:$i]: (b@X))))) & (~ (?[Y:$i]: (![X:$i]: (((a@X)@Y) <=> (~ ((a@X)@X))))))) & ((![X:$i]: ((a1@X) => (b@X))) => ((?[X:$i]: (a1@X)) => (?[X:$i]: (b@X))))) & (((![X:$i]: (q1@X)) <= (![X:$i]: (p1@X))) <= (![X:$i]: ((p1@X) => (q1@X))))) & ((![X:$i]: (p1@X)) => (?[Y:$i]: (p1@Y)))) & (((((b0 | (~ (b0))) & (q0 => q0)) <= a0) & (?[X:$i]: (p1@X))) <= (?[X:$i]: (p1@X)))) & (((?[Y:$i]: (q1@Y)) & (![X:$i]: (p1@X))) => (?[Z:$i]: (![Y:$i]: ((r1@Z) | (p1@Y)))))) & ((![A:$i,B:$i]: ((p1@A) & (p1@B))) <= (![X:$i]: (p1@X)))) & (![A:$i]: (?[X:$i,X2:$i,X3:$i,X4:$i,Y:$i]: ((((((p1@A) & (e@A)) & ((((s@X)@(f@X)) | (g@X)) <= (e@X))) & (((c@(f@X2)) | (g@X2)) <= (e@X2))) & (((s@A)@Y) => (p1@Y))) => (((p1@X3) & (g@X3)) | ((p1@X4) & (c@X4))))))) & (((~ (![X:$i]: ((b@X) <= (a1@X)))) & (![X:$i]: (((b@X) | (c@X)) <= (a1@X)))) => (?[X:$i]: ((c@X) & (a1@X))))) & (![B:$i,C:$i]: ((?[X:$i,Y:$i]: (((p1@(f@Y)) => (((r1@Y) => ((r1@B) & (r1@C))) & (p1@X))) & (q1@X))) <= (q1@(f@B))))) & (![C:$i,B:$i]: ((?[X:$i,Y:$i]: ((((p1@(f@Y)) => (p1@X)) & ((r1@Y) => ((r1@B) & (r1@C)))) & (q1@X))) <= (![Z:$i]: (q1@(f@Z)))))),file('/CW/home-0/sutcliff/CASC/23/Problems/FNE/FNE063.p',prove_this)). thf(2,negated_conjecture,(((((((((((((((((((((((((((((((((((((((((((((![B:$i,C:$i]: ((?[X:$i,Y:$i]: ((q1@X) & ((p1@(f@Y)) => ((p1@X) & ((r1@Y) => ((r1@B) & (r1@C))))))) <= (![Z:$i]: (q1@(f@Z))))) & (![A:$i,B:$i,C:$i]: ((?[X:$i,Y:$i]: (((q@X)@Y) & (p1@X))) <= ((((((r@B)@C) & (![X:$i]: ((s1@X) => (p1@X)))) & (![X:$i,Y:$i]: (((r@X)@Y) => ((q@X)@Y)))) & (s1@B)) & (s1@A))))) & ((?[Z:$i]: (![Y:$i]: ((r1@Z) | (p1@Y)))) <= (![X:$i]: (?[Y:$i]: ((p1@X) & (q1@Y)))))) & ((?[Z:$i]: ((a@Z)@Z)) <= (![X:$i]: (?[Y:$i]: (((a@Y)@Y) & ((a@X)@Y)))))) & (![A:$i,B:$i,C:$i]: ((?[X:$i,Y:$i]: (((q@X)@Y) & (p1@X))) <= (((((s1@A) & (![X:$i]: ((s1@X) => (p1@X)))) & (![X:$i,Y:$i]: (((r@X)@Y) => ((q@X)@Y)))) & ((r@B)@C)) & (s1@B))))) & (![A:$i,B:$i]: ((![Y:$i]: ((q1@Y) => (p1@Y))) => (?[X:$i]: (((p1@X) => (p1@A)) & ((q1@X) => (p1@B))))))) & (![A:$i,B:$i]: ((?[X:$i]: (((p1@B) <= (q1@X)) & ((p1@X) => (p1@A)))) <= (![Z:$i]: ((p1@Z) <= (q1@Z)))))) & (((?[X:$i]: (b@X)) <= (![X:$i]: (a1@X))) <= (?[X:$i]: ((a1@X) => (b@X))))) & ((?[X:$i]: (b@X)) => (?[X:$i]: ((b@X) | (a1@X))))) & ((?[Y:$i,X:$i]: ((a@X)@Y)) <=> (?[X:$i,Y:$i]: ((a@X)@Y)))) & ((?[Y:$i]: (p1@Y)) <=> (?[X:$i]: (p1@X)))) & (?[Z:$i]: (![X:$i]: (?[Y:$i]: (((((p@Z)@Y) & ((p@Y)@Z)) => ((p@Y)@X)) & ((?[W:$i]: ((p@W)@Y)) <= ((p@Y)@X))))))) & (?[X:$i]: (![Y:$i]: ((p1@X) => (p1@Y))))) & (![A:$i,B:$i]: (?[X:$i,Y:$i]: (((r1@Y) <= (p1@X)) => ((p1@A) => (r1@B)))))) & ((?[X:$i]: (p1@X)) => (?[Y:$i]: (p1@Y)))) & ((![X:$i]: ((p@X)@X)) <= (![X:$i,Y:$i]: ((p@X)@Y)))) & ((a0 | b0) | (b0 <=> a0))) & ((?[Z:$i]: ((r1@Z) <= (p1@Z))) <= ((![X:$i]: ((p1@X) => (q1@X))) & (?[Y:$i]: ((q1@Y) => (r1@Y)))))) & (![B:$i]: ((![Y:$i]: (((p@(f@Y))@Y) <= ((r1@Y) <= (r1@B)))) => (?[X:$i,Y:$i]: (((p@X)@Y) & (((q@X)@Y) <= ((q@(f@B))@B))))))) & (![A:$i,B:$i]: (?[X:$i,Y:$i]: (((((((((((p@X)@A) <= (q1@X)) & (q1@A)) & (q1@B)) & (r1@A)) & (r1@B)) & (s1@A)) & (((p@X)@Y) <= (s1@A))) & ((r1@Y) => ((p@B)@Y))) => ((p@A)@B))))) & ((b0 <=> a0) <= (a0 & b0))) & (![A:$i]: ((q1@A) <= ((g0 | f0) & (![X:$i]: ((p1@X) & (q1@X))))))) & ((p1@z) => (p1@z))) & ((?[X:$i]: (![Y:$i]: ((p@X)@Y))) => (![Y:$i]: (?[X:$i]: ((p@X)@Y))))) & (?[Y:$i]: ((p1@Y) <= (?[X:$i]: (p1@X))))) & (![B:$i]: (((q1@B) <= (![Y:$i]: ((p1@Y) <= (r1@Y)))) <= ((r1@B) & (![X:$i]: ((p1@X) => (q1@X))))))) & (![A:$i,B:$i]: ((![Y:$i]: ((q1@Y) => (p1@Y))) => (?[X:$i]: (((q1@X) => (p1@B)) & ((p1@X) => (p1@A))))))) & ((![X:$i,Y:$i]: ((![Z:$i]: (((a_member_of@Z)@Y) <=> ((a_member_of@Z)@X))) <=> ((eq@X)@Y))) => (![A:$i,B:$i]: (((eq@A)@B) => ((eq@B)@A))))) & ((?[Z:$i]: (p1@Z)) <= (?[X:$i]: (p1@X)))) & ((![X:$i]: (p1@X)) => ((![Y:$i]: (p1@Y)) & (![X:$i]: (p1@X))))) & (![A:$i,B:$i]: ((![X:$i]: (p1@X)) => ((p1@B) & (p1@A))))) & ((?[X:$i]: ((b@X) & (a1@X))) <= ((?[X:$i]: (a1@X)) & (![X:$i]: (b@X))))) & (~ (?[Y:$i]: (![X:$i]: (((a@X)@Y) <=> (~ ((a@X)@X))))))) & ((![X:$i]: ((a1@X) => (b@X))) => ((?[X:$i]: (a1@X)) => (?[X:$i]: (b@X))))) & (((![X:$i]: (q1@X)) <= (![X:$i]: (p1@X))) <= (![X:$i]: ((p1@X) => (q1@X))))) & ((![X:$i]: (p1@X)) => (?[Y:$i]: (p1@Y)))) & (((((b0 | (~ (b0))) & (q0 => q0)) <= a0) & (?[X:$i]: (p1@X))) <= (?[X:$i]: (p1@X)))) & (((?[Y:$i]: (q1@Y)) & (![X:$i]: (p1@X))) => (?[Z:$i]: (![Y:$i]: ((r1@Z) | (p1@Y)))))) & ((![A:$i,B:$i]: ((p1@A) & (p1@B))) <= (![X:$i]: (p1@X)))) & (![A:$i]: (?[X:$i,X2:$i,X3:$i,X4:$i,Y:$i]: ((((((p1@A) & (e@A)) & ((((s@X)@(f@X)) | (g@X)) <= (e@X))) & (((c@(f@X2)) | (g@X2)) <= (e@X2))) & (((s@A)@Y) => (p1@Y))) => (((p1@X3) & (g@X3)) | ((p1@X4) & (c@X4))))))) & (((~ (![X:$i]: ((b@X) <= (a1@X)))) & (![X:$i]: (((b@X) | (c@X)) <= (a1@X)))) => (?[X:$i]: ((c@X) & (a1@X))))) & (![B:$i,C:$i]: ((?[X:$i,Y:$i]: (((p1@(f@Y)) => (((r1@Y) => ((r1@B) & (r1@C))) & (p1@X))) & (q1@X))) <= (q1@(f@B))))) & (![C:$i,B:$i]: ((?[X:$i,Y:$i]: ((((p1@(f@Y)) => (p1@X)) & ((r1@Y) => ((r1@B) & (r1@C)))) & (q1@X))) <= (![Z:$i]: (q1@(f@Z))))))=$false)),inference(negate_conjecture,[status(cth)],[1])). thf(3,plain,(((((((((((((((((((((((((((((((((((((((((((((![B:$i,C:$i]: ((?[X:$i,Y:$i]: ((q1@X) & ((p1@(f@Y)) => ((p1@X) & ((r1@Y) => ((r1@B) & (r1@C))))))) <= (![Z:$i]: (q1@(f@Z))))) & (![A:$i,B:$i,C:$i]: ((?[X:$i,Y:$i]: (((q@X)@Y) & (p1@X))) <= ((((((r@B)@C) & (![X:$i]: ((s1@X) => (p1@X)))) & (![X:$i,Y:$i]: (((r@X)@Y) => ((q@X)@Y)))) & (s1@B)) & (s1@A))))) & ((?[Z:$i]: (![Y:$i]: ((r1@Z) | (p1@Y)))) <= (![X:$i]: (?[Y:$i]: ((p1@X) & (q1@Y)))))) & ((?[Z:$i]: ((a@Z)@Z)) <= (![X:$i]: (?[Y:$i]: (((a@Y)@Y) & ((a@X)@Y)))))) & (![A:$i,B:$i,C:$i]: ((?[X:$i,Y:$i]: (((q@X)@Y) & (p1@X))) <= (((((s1@A) & (![X:$i]: ((s1@X) => (p1@X)))) & (![X:$i,Y:$i]: (((r@X)@Y) => ((q@X)@Y)))) & ((r@B)@C)) & (s1@B))))) & (![A:$i,B:$i]: ((![Y:$i]: ((q1@Y) => (p1@Y))) => (?[X:$i]: (((p1@X) => (p1@A)) & ((q1@X) => (p1@B))))))) & (![A:$i,B:$i]: ((?[X:$i]: (((p1@B) <= (q1@X)) & ((p1@X) => (p1@A)))) <= (![Z:$i]: ((p1@Z) <= (q1@Z)))))) & (((?[X:$i]: (b@X)) <= (![X:$i]: (a1@X))) <= (?[X:$i]: ((a1@X) => (b@X))))) & ((?[X:$i]: (b@X)) => (?[X:$i]: ((b@X) | (a1@X))))) & ((?[Y:$i,X:$i]: ((a@X)@Y)) <=> (?[X:$i,Y:$i]: ((a@X)@Y)))) & ((?[Y:$i]: (p1@Y)) <=> (?[X:$i]: (p1@X)))) & (?[Z:$i]: (![X:$i]: (?[Y:$i]: (((((p@Z)@Y) & ((p@Y)@Z)) => ((p@Y)@X)) & ((?[W:$i]: ((p@W)@Y)) <= ((p@Y)@X))))))) & (?[X:$i]: (![Y:$i]: ((p1@X) => (p1@Y))))) & (![A:$i,B:$i]: (?[X:$i,Y:$i]: (((r1@Y) <= (p1@X)) => ((p1@A) => (r1@B)))))) & ((?[X:$i]: (p1@X)) => (?[Y:$i]: (p1@Y)))) & ((![X:$i]: ((p@X)@X)) <= (![X:$i,Y:$i]: ((p@X)@Y)))) & ((a0 | b0) | (b0 <=> a0))) & ((?[Z:$i]: ((r1@Z) <= (p1@Z))) <= ((![X:$i]: ((p1@X) => (q1@X))) & (?[Y:$i]: ((q1@Y) => (r1@Y)))))) & (![B:$i]: ((![Y:$i]: (((p@(f@Y))@Y) <= ((r1@Y) <= (r1@B)))) => (?[X:$i,Y:$i]: (((p@X)@Y) & (((q@X)@Y) <= ((q@(f@B))@B))))))) & (![A:$i,B:$i]: (?[X:$i,Y:$i]: (((((((((((p@X)@A) <= (q1@X)) & (q1@A)) & (q1@B)) & (r1@A)) & (r1@B)) & (s1@A)) & (((p@X)@Y) <= (s1@A))) & ((r1@Y) => ((p@B)@Y))) => ((p@A)@B))))) & ((b0 <=> a0) <= (a0 & b0))) & (![A:$i]: ((q1@A) <= ((g0 | f0) & (![X:$i]: ((p1@X) & (q1@X))))))) & ((p1@z) => (p1@z))) & ((?[X:$i]: (![Y:$i]: ((p@X)@Y))) => (![Y:$i]: (?[X:$i]: ((p@X)@Y))))) & (?[Y:$i]: ((p1@Y) <= (?[X:$i]: (p1@X))))) & (![B:$i]: (((q1@B) <= (![Y:$i]: ((p1@Y) <= (r1@Y)))) <= ((r1@B) & (![X:$i]: ((p1@X) => (q1@X))))))) & (![A:$i,B:$i]: ((![Y:$i]: ((q1@Y) => (p1@Y))) => (?[X:$i]: (((q1@X) => (p1@B)) & ((p1@X) => (p1@A))))))) & ((![X:$i,Y:$i]: ((![Z:$i]: (((a_member_of@Z)@Y) <=> ((a_member_of@Z)@X))) <=> ((eq@X)@Y))) => (![A:$i,B:$i]: (((eq@A)@B) => ((eq@B)@A))))) & ((?[Z:$i]: (p1@Z)) <= (?[X:$i]: (p1@X)))) & ((![X:$i]: (p1@X)) => ((![Y:$i]: (p1@Y)) & (![X:$i]: (p1@X))))) & (![A:$i,B:$i]: ((![X:$i]: (p1@X)) => ((p1@B) & (p1@A))))) & ((?[X:$i]: ((b@X) & (a1@X))) <= ((?[X:$i]: (a1@X)) & (![X:$i]: (b@X))))) & (~ (?[Y:$i]: (![X:$i]: (((a@X)@Y) <=> (~ ((a@X)@X))))))) & ((![X:$i]: ((a1@X) => (b@X))) => ((?[X:$i]: (a1@X)) => (?[X:$i]: (b@X))))) & (((![X:$i]: (q1@X)) <= (![X:$i]: (p1@X))) <= (![X:$i]: ((p1@X) => (q1@X))))) & ((![X:$i]: (p1@X)) => (?[Y:$i]: (p1@Y)))) & (((((b0 | (~ (b0))) & (q0 => q0)) <= a0) & (?[X:$i]: (p1@X))) <= (?[X:$i]: (p1@X)))) & (((?[Y:$i]: (q1@Y)) & (![X:$i]: (p1@X))) => (?[Z:$i]: (![Y:$i]: ((r1@Z) | (p1@Y)))))) & ((![A:$i,B:$i]: ((p1@A) & (p1@B))) <= (![X:$i]: (p1@X)))) & (![A:$i]: (?[X:$i,X2:$i,X3:$i,X4:$i,Y:$i]: ((((((p1@A) & (e@A)) & ((((s@X)@(f@X)) | (g@X)) <= (e@X))) & (((c@(f@X2)) | (g@X2)) <= (e@X2))) & (((s@A)@Y) => (p1@Y))) => (((p1@X3) & (g@X3)) | ((p1@X4) & (c@X4))))))) & (((~ (![X:$i]: ((b@X) <= (a1@X)))) & (![X:$i]: (((b@X) | (c@X)) <= (a1@X)))) => (?[X:$i]: ((c@X) & (a1@X))))) & (![B:$i,C:$i]: ((?[X:$i,Y:$i]: (((p1@(f@Y)) => (((r1@Y) => ((r1@B) & (r1@C))) & (p1@X))) & (q1@X))) <= (q1@(f@B))))) & (![C:$i,B:$i]: ((?[X:$i,Y:$i]: ((((p1@(f@Y)) => (p1@X)) & ((r1@Y) => ((r1@B) & (r1@C)))) & (q1@X))) <= (![Z:$i]: (q1@(f@Z))))))=$false)),inference(unfold_def,[status(thm)],[2])). thf(4,plain,(((![B:$i,C:$i]: ((?[X:$i,Y:$i]: ((q1@X) & ((p1@(f@Y)) => ((p1@X) & ((r1@Y) => ((r1@B) & (r1@C))))))) <= (![Z:$i]: (q1@(f@Z)))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(5,plain,(((![A:$i,B:$i,C:$i]: ((?[X:$i,Y:$i]: (((q@X)@Y) & (p1@X))) <= ((((((r@B)@C) & (![X:$i]: ((s1@X) => (p1@X)))) & (![X:$i,Y:$i]: (((r@X)@Y) => ((q@X)@Y)))) & (s1@B)) & (s1@A))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(6,plain,((((?[Z:$i]: (![Y:$i]: ((r1@Z) | (p1@Y)))) <= (![X:$i]: (?[Y:$i]: ((p1@X) & (q1@Y)))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(7,plain,((((?[Z:$i]: ((a@Z)@Z)) <= (![X:$i]: (?[Y:$i]: (((a@Y)@Y) & ((a@X)@Y)))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(8,plain,(((![A:$i,B:$i,C:$i]: ((?[X:$i,Y:$i]: (((q@X)@Y) & (p1@X))) <= (((((s1@A) & (![X:$i]: ((s1@X) => (p1@X)))) & (![X:$i,Y:$i]: (((r@X)@Y) => ((q@X)@Y)))) & ((r@B)@C)) & (s1@B))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(9,plain,(((![A:$i,B:$i]: ((![Y:$i]: ((q1@Y) => (p1@Y))) => (?[X:$i]: (((p1@X) => (p1@A)) & ((q1@X) => (p1@B))))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(10,plain,(((![A:$i,B:$i]: ((?[X:$i]: (((p1@B) <= (q1@X)) & ((p1@X) => (p1@A)))) <= (![Z:$i]: ((p1@Z) <= (q1@Z)))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(11,plain,(((((?[X:$i]: (b@X)) <= (![X:$i]: (a1@X))) <= (?[X:$i]: ((a1@X) => (b@X))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(12,plain,((((?[X:$i]: (b@X)) => (?[X:$i]: ((b@X) | (a1@X))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(13,plain,((((?[Y:$i,X:$i]: ((a@X)@Y)) => (?[X:$i,Y:$i]: ((a@X)@Y)))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(14,plain,((((?[X:$i,Y:$i]: ((a@X)@Y)) => (?[Y:$i,X:$i]: ((a@X)@Y)))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(15,plain,((((?[Y:$i]: (p1@Y)) => (?[X:$i]: (p1@X)))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(16,plain,((((?[X:$i]: (p1@X)) => (?[Y:$i]: (p1@Y)))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(17,plain,(((?[Z:$i]: (![X:$i]: (?[Y:$i]: (((((p@Z)@Y) & ((p@Y)@Z)) => ((p@Y)@X)) & ((?[W:$i]: ((p@W)@Y)) <= ((p@Y)@X))))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(18,plain,(((?[X:$i]: (![Y:$i]: ((p1@X) => (p1@Y))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(19,plain,(((![A:$i,B:$i]: (?[X:$i,Y:$i]: (((r1@Y) <= (p1@X)) => ((p1@A) => (r1@B)))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(20,plain,((((?[X:$i]: (p1@X)) => (?[Y:$i]: (p1@Y)))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(21,plain,((((![X:$i]: ((p@X)@X)) <= (![X:$i,Y:$i]: ((p@X)@Y)))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(22,plain,((((a0 | b0) | (b0 <=> a0))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(23,plain,((((?[Z:$i]: ((r1@Z) <= (p1@Z))) <= ((![X:$i]: ((p1@X) => (q1@X))) & (?[Y:$i]: ((q1@Y) => (r1@Y)))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(24,plain,(((![B:$i]: ((![Y:$i]: (((p@(f@Y))@Y) <= ((r1@Y) <= (r1@B)))) => (?[X:$i,Y:$i]: (((p@X)@Y) & (((q@X)@Y) <= ((q@(f@B))@B))))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(25,plain,(((![A:$i,B:$i]: (?[X:$i,Y:$i]: (((((((((((p@X)@A) <= (q1@X)) & (q1@A)) & (q1@B)) & (r1@A)) & (r1@B)) & (s1@A)) & (((p@X)@Y) <= (s1@A))) & ((r1@Y) => ((p@B)@Y))) => ((p@A)@B))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(26,plain,((((b0 <=> a0) <= (a0 & b0))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(27,plain,(((![A:$i]: ((q1@A) <= ((g0 | f0) & (![X:$i]: ((p1@X) & (q1@X))))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(28,plain,((((p1@z) => (p1@z))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(29,plain,((((?[X:$i]: (![Y:$i]: ((p@X)@Y))) => (![Y:$i]: (?[X:$i]: ((p@X)@Y))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(30,plain,(((?[Y:$i]: ((p1@Y) <= (?[X:$i]: (p1@X))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(31,plain,(((![B:$i]: (((q1@B) <= (![Y:$i]: ((p1@Y) <= (r1@Y)))) <= ((r1@B) & (![X:$i]: ((p1@X) => (q1@X))))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(32,plain,(((![A:$i,B:$i]: ((![Y:$i]: ((q1@Y) => (p1@Y))) => (?[X:$i]: (((q1@X) => (p1@B)) & ((p1@X) => (p1@A))))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(33,plain,((((![X:$i,Y:$i]: ((![Z:$i]: (((a_member_of@Z)@Y) <=> ((a_member_of@Z)@X))) <=> ((eq@X)@Y))) => (![A:$i,B:$i]: (((eq@A)@B) => ((eq@B)@A))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(34,plain,((((?[Z:$i]: (p1@Z)) <= (?[X:$i]: (p1@X)))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(35,plain,((((![X:$i]: (p1@X)) => ((![Y:$i]: (p1@Y)) & (![X:$i]: (p1@X))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(36,plain,(((![A:$i,B:$i]: ((![X:$i]: (p1@X)) => ((p1@B) & (p1@A))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(37,plain,((((?[X:$i]: ((b@X) & (a1@X))) <= ((?[X:$i]: (a1@X)) & (![X:$i]: (b@X))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(38,plain,(((~ (?[Y:$i]: (![X:$i]: (((a@X)@Y) <=> (~ ((a@X)@X))))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(39,plain,((((![X:$i]: ((a1@X) => (b@X))) => ((?[X:$i]: (a1@X)) => (?[X:$i]: (b@X))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(40,plain,(((((![X:$i]: (q1@X)) <= (![X:$i]: (p1@X))) <= (![X:$i]: ((p1@X) => (q1@X))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(41,plain,((((![X:$i]: (p1@X)) => (?[Y:$i]: (p1@Y)))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(42,plain,(((((((b0 | (~ (b0))) & (q0 => q0)) <= a0) & (?[X:$i]: (p1@X))) <= (?[X:$i]: (p1@X)))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(43,plain,(((((?[Y:$i]: (q1@Y)) & (![X:$i]: (p1@X))) => (?[Z:$i]: (![Y:$i]: ((r1@Z) | (p1@Y)))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(44,plain,((((![A:$i,B:$i]: ((p1@A) & (p1@B))) <= (![X:$i]: (p1@X)))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(45,plain,(((![A:$i]: (?[X:$i,X2:$i,X3:$i,X4:$i,Y:$i]: ((((((p1@A) & (e@A)) & ((((s@X)@(f@X)) | (g@X)) <= (e@X))) & (((c@(f@X2)) | (g@X2)) <= (e@X2))) & (((s@A)@Y) => (p1@Y))) => (((p1@X3) & (g@X3)) | ((p1@X4) & (c@X4))))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(46,plain,(((((~ (![X:$i]: ((b@X) <= (a1@X)))) & (![X:$i]: (((b@X) | (c@X)) <= (a1@X)))) => (?[X:$i]: ((c@X) & (a1@X))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(47,plain,(((![B:$i,C:$i]: ((?[X:$i,Y:$i]: (((p1@(f@Y)) => (((r1@Y) => ((r1@B) & (r1@C))) & (p1@X))) & (q1@X))) <= (q1@(f@B))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(48,plain,(((![C:$i,B:$i]: ((?[X:$i,Y:$i]: ((((p1@(f@Y)) => (p1@X)) & ((r1@Y) => ((r1@B) & (r1@C)))) & (q1@X))) <= (![Z:$i]: (q1@(f@Z)))))=$false)),inference(split_conjecture,[split_conjecture(split,[])],[3])). thf(49,plain,(((~ (![B:$i,C:$i]: ((?[X:$i,Y:$i]: ((q1@X) & ((p1@(f@Y)) => ((p1@X) & ((r1@Y) => ((r1@B) & (r1@C))))))) <= (![Z:$i]: (q1@(f@Z))))))=$true)),inference(polarity_switch,[status(thm)],[4])). thf(50,plain,(((~ (![A:$i,B:$i,C:$i]: ((?[X:$i,Y:$i]: (((q@X)@Y) & (p1@X))) <= ((((((r@B)@C) & (![X:$i]: ((s1@X) => (p1@X)))) & (![X:$i,Y:$i]: (((r@X)@Y) => ((q@X)@Y)))) & (s1@B)) & (s1@A)))))=$true)),inference(polarity_switch,[status(thm)],[5])). thf(51,plain,(((~ ((?[Z:$i]: (![Y:$i]: ((r1@Z) | (p1@Y)))) <= (![X:$i]: (?[Y:$i]: ((p1@X) & (q1@Y))))))=$true)),inference(polarity_switch,[status(thm)],[6])). thf(52,plain,(((~ ((?[Z:$i]: ((a@Z)@Z)) <= (![X:$i]: (?[Y:$i]: (((a@Y)@Y) & ((a@X)@Y))))))=$true)),inference(polarity_switch,[status(thm)],[7])). thf(53,plain,(((~ (![A:$i,B:$i,C:$i]: ((?[X:$i,Y:$i]: (((q@X)@Y) & (p1@X))) <= (((((s1@A) & (![X:$i]: ((s1@X) => (p1@X)))) & (![X:$i,Y:$i]: (((r@X)@Y) => ((q@X)@Y)))) & ((r@B)@C)) & (s1@B)))))=$true)),inference(polarity_switch,[status(thm)],[8])). thf(54,plain,(((~ (![A:$i,B:$i]: ((![Y:$i]: ((q1@Y) => (p1@Y))) => (?[X:$i]: (((p1@X) => (p1@A)) & ((q1@X) => (p1@B)))))))=$true)),inference(polarity_switch,[status(thm)],[9])). thf(55,plain,(((~ (![A:$i,B:$i]: ((?[X:$i]: (((p1@B) <= (q1@X)) & ((p1@X) => (p1@A)))) <= (![Z:$i]: ((p1@Z) <= (q1@Z))))))=$true)),inference(polarity_switch,[status(thm)],[10])). thf(56,plain,(((~ (((?[X:$i]: (b@X)) <= (![X:$i]: (a1@X))) <= (?[X:$i]: ((a1@X) => (b@X)))))=$true)),inference(polarity_switch,[status(thm)],[11])). thf(57,plain,(((~ ((?[X:$i]: (b@X)) => (?[X:$i]: ((b@X) | (a1@X)))))=$true)),inference(polarity_switch,[status(thm)],[12])). thf(58,plain,(((~ ((?[Y:$i,X:$i]: ((a@X)@Y)) => (?[X:$i,Y:$i]: ((a@X)@Y))))=$true)),inference(polarity_switch,[status(thm)],[13])). thf(59,plain,(((~ ((?[X:$i,Y:$i]: ((a@X)@Y)) => (?[Y:$i,X:$i]: ((a@X)@Y))))=$true)),inference(polarity_switch,[status(thm)],[14])). thf(60,plain,(((~ ((?[Y:$i]: (p1@Y)) => (?[X:$i]: (p1@X))))=$true)),inference(polarity_switch,[status(thm)],[15])). thf(61,plain,(((~ ((?[X:$i]: (p1@X)) => (?[Y:$i]: (p1@Y))))=$true)),inference(polarity_switch,[status(thm)],[16])). thf(62,plain,(((~ (?[Z:$i]: (![X:$i]: (?[Y:$i]: (((((p@Z)@Y) & ((p@Y)@Z)) => ((p@Y)@X)) & ((?[W:$i]: ((p@W)@Y)) <= ((p@Y)@X)))))))=$true)),inference(polarity_switch,[status(thm)],[17])). thf(63,plain,(((~ (?[X:$i]: (![Y:$i]: ((p1@X) => (p1@Y)))))=$true)),inference(polarity_switch,[status(thm)],[18])). thf(64,plain,(((~ (![A:$i,B:$i]: (?[X:$i,Y:$i]: (((r1@Y) <= (p1@X)) => ((p1@A) => (r1@B))))))=$true)),inference(polarity_switch,[status(thm)],[19])). thf(65,plain,(((~ ((?[X:$i]: (p1@X)) => (?[Y:$i]: (p1@Y))))=$true)),inference(polarity_switch,[status(thm)],[20])). thf(66,plain,(((~ ((![X:$i]: ((p@X)@X)) <= (![X:$i,Y:$i]: ((p@X)@Y))))=$true)),inference(polarity_switch,[status(thm)],[21])). thf(67,plain,(((~ ((a0 | b0) | (b0 <=> a0)))=$true)),inference(polarity_switch,[status(thm)],[22])). thf(68,plain,(((~ ((?[Z:$i]: ((r1@Z) <= (p1@Z))) <= ((![X:$i]: ((p1@X) => (q1@X))) & (?[Y:$i]: ((q1@Y) => (r1@Y))))))=$true)),inference(polarity_switch,[status(thm)],[23])). thf(69,plain,(((~ (![B:$i]: ((![Y:$i]: (((p@(f@Y))@Y) <= ((r1@Y) <= (r1@B)))) => (?[X:$i,Y:$i]: (((p@X)@Y) & (((q@X)@Y) <= ((q@(f@B))@B)))))))=$true)),inference(polarity_switch,[status(thm)],[24])). thf(70,plain,(((~ (![A:$i,B:$i]: (?[X:$i,Y:$i]: (((((((((((p@X)@A) <= (q1@X)) & (q1@A)) & (q1@B)) & (r1@A)) & (r1@B)) & (s1@A)) & (((p@X)@Y) <= (s1@A))) & ((r1@Y) => ((p@B)@Y))) => ((p@A)@B)))))=$true)),inference(polarity_switch,[status(thm)],[25])). thf(71,plain,(((~ ((b0 <=> a0) <= (a0 & b0)))=$true)),inference(polarity_switch,[status(thm)],[26])). thf(72,plain,(((~ (![A:$i]: ((q1@A) <= ((g0 | f0) & (![X:$i]: ((p1@X) & (q1@X)))))))=$true)),inference(polarity_switch,[status(thm)],[27])). thf(73,plain,(((~ ((p1@z) => (p1@z)))=$true)),inference(polarity_switch,[status(thm)],[28])). thf(74,plain,(((~ ((?[X:$i]: (![Y:$i]: ((p@X)@Y))) => (![Y:$i]: (?[X:$i]: ((p@X)@Y)))))=$true)),inference(polarity_switch,[status(thm)],[29])). thf(75,plain,(((~ (?[Y:$i]: ((p1@Y) <= (?[X:$i]: (p1@X)))))=$true)),inference(polarity_switch,[status(thm)],[30])). thf(76,plain,(((~ (![B:$i]: (((q1@B) <= (![Y:$i]: ((p1@Y) <= (r1@Y)))) <= ((r1@B) & (![X:$i]: ((p1@X) => (q1@X)))))))=$true)),inference(polarity_switch,[status(thm)],[31])). thf(77,plain,(((~ (![A:$i,B:$i]: ((![Y:$i]: ((q1@Y) => (p1@Y))) => (?[X:$i]: (((q1@X) => (p1@B)) & ((p1@X) => (p1@A)))))))=$true)),inference(polarity_switch,[status(thm)],[32])). thf(78,plain,(((~ ((![X:$i,Y:$i]: ((![Z:$i]: (((a_member_of@Z)@Y) <=> ((a_member_of@Z)@X))) <=> ((eq@X)@Y))) => (![A:$i,B:$i]: (((eq@A)@B) => ((eq@B)@A)))))=$true)),inference(polarity_switch,[status(thm)],[33])). thf(79,plain,(((~ ((?[Z:$i]: (p1@Z)) <= (?[X:$i]: (p1@X))))=$true)),inference(polarity_switch,[status(thm)],[34])). thf(80,plain,(((~ ((![X:$i]: (p1@X)) => ((![Y:$i]: (p1@Y)) & (![X:$i]: (p1@X)))))=$true)),inference(polarity_switch,[status(thm)],[35])). thf(81,plain,(((~ (![A:$i,B:$i]: ((![X:$i]: (p1@X)) => ((p1@B) & (p1@A)))))=$true)),inference(polarity_switch,[status(thm)],[36])). thf(82,plain,(((~ ((?[X:$i]: ((b@X) & (a1@X))) <= ((?[X:$i]: (a1@X)) & (![X:$i]: (b@X)))))=$true)),inference(polarity_switch,[status(thm)],[37])). thf(83,plain,(((?[Y:$i]: (![X:$i]: (((a@X)@Y) <=> (~ ((a@X)@X)))))=$true)),inference(polarity_switch,[status(thm)],[38])). thf(84,plain,(((~ ((![X:$i]: ((a1@X) => (b@X))) => ((?[X:$i]: (a1@X)) => (?[X:$i]: (b@X)))))=$true)),inference(polarity_switch,[status(thm)],[39])). thf(85,plain,(((~ (((![X:$i]: (q1@X)) <= (![X:$i]: (p1@X))) <= (![X:$i]: ((p1@X) => (q1@X)))))=$true)),inference(polarity_switch,[status(thm)],[40])). thf(86,plain,(((~ ((![X:$i]: (p1@X)) => (?[Y:$i]: (p1@Y))))=$true)),inference(polarity_switch,[status(thm)],[41])). thf(87,plain,(((~ (((((b0 | (~ (b0))) & (q0 => q0)) <= a0) & (?[X:$i]: (p1@X))) <= (?[X:$i]: (p1@X))))=$true)),inference(polarity_switch,[status(thm)],[42])). thf(88,plain,(((~ (((?[Y:$i]: (q1@Y)) & (![X:$i]: (p1@X))) => (?[Z:$i]: (![Y:$i]: ((r1@Z) | (p1@Y))))))=$true)),inference(polarity_switch,[status(thm)],[43])). thf(89,plain,(((~ ((![A:$i,B:$i]: ((p1@A) & (p1@B))) <= (![X:$i]: (p1@X))))=$true)),inference(polarity_switch,[status(thm)],[44])). thf(90,plain,(((~ (![A:$i]: (?[X:$i,X2:$i,X3:$i,X4:$i,Y:$i]: ((((((p1@A) & (e@A)) & ((((s@X)@(f@X)) | (g@X)) <= (e@X))) & (((c@(f@X2)) | (g@X2)) <= (e@X2))) & (((s@A)@Y) => (p1@Y))) => (((p1@X3) & (g@X3)) | ((p1@X4) & (c@X4)))))))=$true)),inference(polarity_switch,[status(thm)],[45])). thf(91,plain,(((~ (((~ (![X:$i]: ((b@X) <= (a1@X)))) & (![X:$i]: (((b@X) | (c@X)) <= (a1@X)))) => (?[X:$i]: ((c@X) & (a1@X)))))=$true)),inference(polarity_switch,[status(thm)],[46])). thf(92,plain,(((~ (![B:$i,C:$i]: ((?[X:$i,Y:$i]: (((p1@(f@Y)) => (((r1@Y) => ((r1@B) & (r1@C))) & (p1@X))) & (q1@X))) <= (q1@(f@B)))))=$true)),inference(polarity_switch,[status(thm)],[47])). thf(93,plain,(((~ (![C:$i,B:$i]: ((?[X:$i,Y:$i]: ((((p1@(f@Y)) => (p1@X)) & ((r1@Y) => ((r1@B) & (r1@C)))) & (q1@X))) <= (![Z:$i]: (q1@(f@Z))))))=$true)),inference(polarity_switch,[status(thm)],[48])). thf(94,plain,((((![Z:$i]: (q1@(f@Z))) & (((![Y:$i]: (p1@(f@Y))) | (![X:$i]: (~ (q1@X)))) & ((![X:$i]: (((![Y:$i]: (r1@Y)) | (~ (p1@X))) | (~ (q1@X)))) & (![SY151:$i]: ((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SY151))) | (~ (q1@SY151)))))))=$true)),inference(extcnf_combined,[status(esa)],[49])). thf(95,plain,(((((((![X:$i,Y:$i]: ((~ ((r@X)@Y)) | ((q@X)@Y))) & ((![X:$i]: ((~ (s1@X)) | (p1@X))) & ((r@sK4)@sK5))) & (s1@sK4)) & (s1@sK3)) & (![X:$i]: ((~ (p1@X)) | (![Y:$i]: (~ ((q@X)@Y))))))=$true)),inference(extcnf_combined,[status(esa)],[50])). thf(96,plain,(((((![X:$i]: (p1@X)) & (q1@sK7)) & ((~ (p1@sK6)) & (![Z:$i]: (~ (r1@Z)))))=$true)),inference(extcnf_combined,[status(esa)],[51])). thf(97,plain,((((![X:$i]: (((a@(sK8@X))@(sK8@X)) & ((a@X)@(sK8@X)))) & (![Z:$i]: (~ ((a@Z)@Z))))=$true)),inference(extcnf_combined,[status(esa)],[52])). thf(98,plain,(((((((![X:$i,Y:$i]: ((~ ((r@X)@Y)) | ((q@X)@Y))) & ((![X:$i]: ((~ (s1@X)) | (p1@X))) & (s1@sK9))) & ((r@sK10)@sK11)) & (s1@sK10)) & (![X:$i]: ((~ (p1@X)) | (![Y:$i]: (~ ((q@X)@Y))))))=$true)),inference(extcnf_combined,[status(esa)],[53])). thf(99,plain,((((![Y:$i]: ((~ (q1@Y)) | (p1@Y))) & (((![X:$i]: ((p1@X) | (q1@X))) & ((![X:$i]: (p1@X)) | (~ (p1@sK13)))) & (((~ (p1@sK12)) | (![X:$i]: (q1@X))) & ((~ (p1@sK12)) | (~ (p1@sK13))))))=$true)),inference(extcnf_combined,[status(esa)],[54])). thf(100,plain,((((![Z:$i]: ((~ (q1@Z)) | (p1@Z))) & (((![X:$i]: ((q1@X) | (p1@X))) & ((![X:$i]: (q1@X)) | (~ (p1@sK14)))) & (((~ (p1@sK15)) | (![X:$i]: (p1@X))) & ((~ (p1@sK15)) | (~ (p1@sK14))))))=$true)),inference(extcnf_combined,[status(esa)],[55])). thf(101,plain,(((((~ (a1@sK17)) | (b@sK16)) & ((![X:$i]: (a1@X)) & (![X:$i]: (~ (b@X)))))=$true)),inference(extcnf_combined,[status(esa)],[56])). thf(102,plain,((((b@sK18) & ((![X:$i]: (~ (a1@X))) & (![X:$i]: (~ (b@X)))))=$true)),inference(extcnf_combined,[status(esa)],[57])). thf(103,plain,(((((a@sK20)@sK19) & (![X:$i,Y:$i]: (~ ((a@X)@Y))))=$true)),inference(extcnf_combined,[status(esa)],[58])). thf(104,plain,(((((a@sK21)@sK22) & (![Y:$i,X:$i]: (~ ((a@X)@Y))))=$true)),inference(extcnf_combined,[status(esa)],[59])). thf(105,plain,((((p1@sK23) & (![X:$i]: (~ (p1@X))))=$true)),inference(extcnf_combined,[status(esa)],[60])). thf(106,plain,((((p1@sK24) & (![Y:$i]: (~ (p1@Y))))=$true)),inference(extcnf_combined,[status(esa)],[61])). thf(107,plain,(((![Z:$i]: ((((![SY188:$i]: (((p@SY188)@(sK25@Z)) | ((p@Z)@SY188))) & (![SY189:$i]: (((p@SY189)@(sK25@Z)) | ((p@SY189)@Z)))) & (![SY190:$i]: (((p@SY190)@(sK25@Z)) | (~ ((p@SY190)@(sK25@Z)))))) & (((![Y:$i]: ((![W:$i]: (~ ((p@W)@Y))) | ((p@Z)@Y))) & (![Y:$i]: ((![W:$i]: (~ ((p@W)@Y))) | ((p@Y)@Z)))) & (![SY195:$i]: ((![W:$i]: (~ ((p@W)@SY195))) | (~ ((p@SY195)@(sK25@Z))))))))=$true)),inference(extcnf_combined,[status(esa)],[62])). thf(108,plain,((((![X:$i]: (p1@X)) & (~ (p1@sK26)))=$true)),inference(extcnf_combined,[status(esa)],[63])). thf(109,plain,(((((![X:$i]: (~ (p1@X))) | (![Y:$i]: (r1@Y))) & ((p1@sK27) & (~ (r1@sK28))))=$true)),inference(extcnf_combined,[status(esa)],[64])). thf(110,plain,((((p1@sK29) & (![Y:$i]: (~ (p1@Y))))=$true)),inference(extcnf_combined,[status(esa)],[65])). thf(111,plain,((((![X:$i,Y:$i]: ((p@X)@Y)) & (~ ((p@sK30)@sK30)))=$true)),inference(extcnf_combined,[status(esa)],[66])). thf(112,plain,((((((~ (a0)) | (~ (b0))) & (a0 | b0)) & ((~ (a0)) & (~ (b0))))=$true)),inference(extcnf_combined,[status(esa)],[67])). thf(113,plain,(((((![X:$i]: ((~ (p1@X)) | (q1@X))) & ((~ (q1@sK32)) | (r1@sK31))) & ((![Z:$i]: (p1@Z)) & (![Z:$i]: (~ (r1@Z)))))=$true)),inference(extcnf_combined,[status(esa)],[68])). thf(114,plain,((((((r1@sK33) | (![Y:$i]: ((p@(f@Y))@Y))) & (![Y:$i]: ((~ (r1@Y)) | ((p@(f@Y))@Y)))) & ((((q@(f@sK33))@sK33) | (![X:$i,Y:$i]: (~ ((p@X)@Y)))) & (![X:$i,Y:$i]: ((~ ((q@X)@Y)) | (~ ((p@X)@Y))))))=$true)),inference(extcnf_combined,[status(esa)],[69])). thf(115,plain,(((((((((((![SY209:$i]: ((~ (q1@SY209)) | ((p@SY209)@sK34))) & (q1@sK34)) & (q1@sK35)) & (r1@sK34)) & (r1@sK35)) & (s1@sK34)) & ((~ (s1@sK34)) | (![X:$i,Y:$i]: ((p@X)@Y)))) & (![SY216:$i]: ((~ (r1@SY216)) | ((p@sK35)@SY216)))) & (~ ((p@sK34)@sK35)))=$true)),inference(extcnf_combined,[status(esa)],[70])). thf(116,plain,((((a0 & b0) & (((~ (a0)) | (~ (b0))) & (a0 | b0)))=$true)),inference(extcnf_combined,[status(esa)],[71])). thf(117,plain,((((((![X:$i]: (p1@X)) & (![X:$i]: (q1@X))) & (f0 | g0)) & (~ (q1@sK36)))=$true)),inference(extcnf_combined,[status(esa)],[72])). thf(118,plain,(((~ ($true))=$true)),inference(extcnf_combined,[status(esa)],[73])). thf(119,plain,((((![SY218:$i]: ((p@sK38)@SY218)) & (![SY217:$i]: (~ ((p@SY217)@sK37))))=$true)),inference(extcnf_combined,[status(esa)],[74])). thf(120,plain,((((p1@sK39) & (![Y:$i]: (~ (p1@Y))))=$true)),inference(extcnf_combined,[status(esa)],[75])). thf(121,plain,(((((![X:$i]: ((~ (p1@X)) | (q1@X))) & (r1@sK40)) & ((![Y:$i]: ((~ (r1@Y)) | (p1@Y))) & (~ (q1@sK40))))=$true)),inference(extcnf_combined,[status(esa)],[76])). thf(122,plain,((((![Y:$i]: ((~ (q1@Y)) | (p1@Y))) & (((![X:$i]: ((q1@X) | (p1@X))) & ((![X:$i]: (q1@X)) | (~ (p1@sK41)))) & (((~ (p1@sK42)) | (![X:$i]: (p1@X))) & ((~ (p1@sK42)) | (~ (p1@sK41))))))=$true)),inference(extcnf_combined,[status(esa)],[77])). thf(123,plain,(((((![X:$i,Y:$i]: ((((~ ((a_member_of@((sK45@Y)@X))@Y)) | (~ ((a_member_of@((sK45@Y)@X))@X))) & (((a_member_of@((sK45@Y)@X))@Y) | ((a_member_of@((sK45@Y)@X))@X))) | ((eq@X)@Y))) & (![X:$i,Y:$i]: ((~ ((eq@X)@Y)) | ((![Z:$i]: ((~ ((a_member_of@Z)@Y)) | ((a_member_of@Z)@X))) & (![Z:$i]: ((~ ((a_member_of@Z)@X)) | ((a_member_of@Z)@Y))))))) & (((eq@sK43)@sK44) & (~ ((eq@sK44)@sK43))))=$true)),inference(extcnf_combined,[status(esa)],[78])). thf(124,plain,((((p1@sK46) & (![Z:$i]: (~ (p1@Z))))=$true)),inference(extcnf_combined,[status(esa)],[79])). thf(125,plain,((((![X:$i]: (p1@X)) & ((~ (p1@sK48)) | (~ (p1@sK47))))=$true)),inference(extcnf_combined,[status(esa)],[80])). thf(126,plain,((((![X:$i]: (p1@X)) & ((~ (p1@sK50)) | (~ (p1@sK49))))=$true)),inference(extcnf_combined,[status(esa)],[81])). thf(127,plain,(((((![X:$i]: (b@X)) & (a1@sK51)) & (![X:$i]: ((~ (a1@X)) | (~ (b@X)))))=$true)),inference(extcnf_combined,[status(esa)],[82])). thf(128,plain,((((![SY227:$i]: ((~ ((a@SY227)@sK52)) | (~ ((a@SY227)@SY227)))) & (![SY228:$i]: (((a@SY228)@SY228) | ((a@SY228)@sK52))))=$true)),inference(extcnf_combined,[status(esa)],[83])). thf(129,plain,((((![X:$i]: ((~ (a1@X)) | (b@X))) & ((a1@sK53) & (![X:$i]: (~ (b@X)))))=$true)),inference(extcnf_combined,[status(esa)],[84])). thf(130,plain,((((![X:$i]: ((~ (p1@X)) | (q1@X))) & ((![X:$i]: (p1@X)) & (~ (q1@sK54))))=$true)),inference(extcnf_combined,[status(esa)],[85])). thf(131,plain,((((![X:$i]: (p1@X)) & (![Y:$i]: (~ (p1@Y))))=$true)),inference(extcnf_combined,[status(esa)],[86])). thf(132,plain,((((p1@sK55) & ((a0 | (![X:$i]: (~ (p1@X)))) & (((~ ($true)) | (~ ($true))) | (![X:$i]: (~ (p1@X))))))=$true)),inference(extcnf_combined,[status(esa)],[87])). thf(133,plain,(((((![X:$i]: (p1@X)) & (q1@sK57)) & ((~ (p1@sK56)) & (![Z:$i]: (~ (r1@Z)))))=$true)),inference(extcnf_combined,[status(esa)],[88])). thf(134,plain,((((![X:$i]: (p1@X)) & ((~ (p1@sK59)) | (~ (p1@sK58))))=$true)),inference(extcnf_combined,[status(esa)],[89])). thf(135,plain,(((![SY229:$i,SY230:$i,SY231:$i]: ((((((e@sK60) & (p1@sK60)) & ((~ (e@SY229)) | ((g@SY229) | ((s@SY229)@(f@SY229))))) & ((~ (e@SY230)) | ((c@(f@SY230)) | (g@SY230)))) & (![SY232:$i]: ((~ ((s@sK60)@SY232)) | (p1@SY232)))) & (((~ (g@SY231)) | (~ (p1@SY231))) & (![X4:$i]: ((~ (c@X4)) | (~ (p1@X4)))))))=$true)),inference(extcnf_combined,[status(esa)],[90])). thf(136,plain,((((((a1@sK61) & (~ (b@sK61))) & (![X:$i]: ((~ (a1@X)) | ((b@X) | (c@X))))) & (![X:$i]: ((~ (a1@X)) | (~ (c@X)))))=$true)),inference(extcnf_combined,[status(esa)],[91])). thf(137,plain,((((q1@(f@sK62)) & (((![Y:$i]: (p1@(f@Y))) | (![X:$i]: (~ (q1@X)))) & ((![X:$i]: (((![Y:$i]: (r1@Y)) | (~ (p1@X))) | (~ (q1@X)))) & (![SY244:$i]: ((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SY244))) | (~ (q1@SY244)))))))=$true)),inference(extcnf_combined,[status(esa)],[92])). thf(138,plain,((((![Z:$i]: (q1@(f@Z))) & ((((![Y:$i]: ((p1@(f@Y)) | (r1@Y))) | (![X:$i]: (~ (q1@X)))) & (((![Y:$i]: (p1@(f@Y))) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (![X:$i]: (~ (q1@X))))) & ((![X:$i]: (((~ (p1@X)) | (![Y:$i]: (r1@Y))) | (~ (q1@X)))) & (![SY259:$i]: (((~ (p1@SY259)) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (~ (q1@SY259)))))))=$true)),inference(extcnf_combined,[status(esa)],[93])). thf(139,plain,((((![Z:$i]: (q1@(f@Z))) & (((![Y:$i]: (p1@(f@Y))) | (![X:$i]: (~ (q1@X)))) & ((![X:$i]: (((![Y:$i]: (r1@Y)) | (~ (p1@X))) | (~ (q1@X)))) & (![SY151:$i]: ((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SY151))) | (~ (q1@SY151)))))))=$true)),inference(copy,[status(thm)],[94])). thf(140,plain,(((~ ((~ (![SX0:$i]: (q1@(f@SX0)))) | (~ (~ ((~ ((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SX0))) | (~ (q1@SX0)))))))))))))=$true)),inference(unfold_def,[status(thm)],[139])). thf(141,plain,((((~ (![SX0:$i]: (q1@(f@SX0)))) | (~ (~ ((~ ((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SX0))) | (~ (q1@SX0))))))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[140])). thf(142,plain,(((~ (![SX0:$i]: (q1@(f@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[141])). thf(143,plain,(((~ (~ ((~ ((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SX0))) | (~ (q1@SX0)))))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[141])). thf(144,plain,(((![SX0:$i]: (q1@(f@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[142])). thf(145,plain,(((~ ((~ ((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SX0))) | (~ (q1@SX0))))))))))=$true)),inference(extcnf_not_neg,[status(thm)],[143])). thf(146,plain,(![SV1:$i]: (((q1@(f@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[144])). thf(147,plain,((((~ ((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SX0))) | (~ (q1@SX0)))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[145])). thf(148,plain,(((~ ((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[147])). thf(149,plain,(((~ (~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SX0))) | (~ (q1@SX0))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[147])). thf(150,plain,((((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[148])). thf(151,plain,(((~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SX0))) | (~ (q1@SX0)))))))=$true)),inference(extcnf_not_neg,[status(thm)],[149])). thf(152,plain,(((![SX0:$i]: (p1@(f@SX0)))=$true) | ((![SX0:$i]: (~ (q1@SX0)))=$true)),inference(extcnf_or_pos,[status(thm)],[150])). thf(153,plain,((((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SX0))) | (~ (q1@SX0))))))=$false)),inference(extcnf_not_pos,[status(thm)],[151])). thf(154,plain,(![SV2:$i]: (((p1@(f@SV2))=$true) | ((![SX0:$i]: (~ (q1@SX0)))=$true))),inference(extcnf_forall_pos,[status(thm)],[152])). thf(155,plain,(((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[153])). thf(156,plain,(((~ (![SX0:$i]: ((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SX0))) | (~ (q1@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[153])). thf(157,plain,(![SV2:$i,SV3:$i]: (((~ (q1@SV3))=$true) | ((p1@(f@SV2))=$true))),inference(extcnf_forall_pos,[status(thm)],[154])). thf(158,plain,(((![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[155])). thf(159,plain,(((![SX0:$i]: ((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SX0))) | (~ (q1@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[156])). thf(160,plain,(![SV2:$i,SV3:$i]: (((q1@SV3)=$false) | ((p1@(f@SV2))=$true))),inference(extcnf_not_pos,[status(thm)],[157])). thf(161,plain,(![SV4:$i]: (((((![SX1:$i]: (r1@SX1)) | (~ (p1@SV4))) | (~ (q1@SV4)))=$true))),inference(extcnf_forall_pos,[status(thm)],[158])). thf(162,plain,(![SV5:$i]: ((((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SV5))) | (~ (q1@SV5)))=$true))),inference(extcnf_forall_pos,[status(thm)],[159])). thf(163,plain,(![SV4:$i]: ((((![SX1:$i]: (r1@SX1)) | (~ (p1@SV4)))=$true) | ((~ (q1@SV4))=$true))),inference(extcnf_or_pos,[status(thm)],[161])). thf(164,plain,(![SV5:$i]: (((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SV5)))=$true) | ((~ (q1@SV5))=$true))),inference(extcnf_or_pos,[status(thm)],[162])). thf(165,plain,(![SV4:$i]: (((q1@SV4)=$false) | (((![SX1:$i]: (r1@SX1)) | (~ (p1@SV4)))=$true))),inference(extcnf_not_pos,[status(thm)],[163])). thf(166,plain,(![SV5:$i]: (((q1@SV5)=$false) | ((((~ (r1@sK1)) | (~ (r1@sK2))) | (~ (p1@SV5)))=$true))),inference(extcnf_not_pos,[status(thm)],[164])). thf(167,plain,(![SV4:$i]: (((![SX1:$i]: (r1@SX1))=$true) | ((~ (p1@SV4))=$true) | ((q1@SV4)=$false))),inference(extcnf_or_pos,[status(thm)],[165])). thf(168,plain,(![SV5:$i]: ((((~ (r1@sK1)) | (~ (r1@sK2)))=$true) | ((~ (p1@SV5))=$true) | ((q1@SV5)=$false))),inference(extcnf_or_pos,[status(thm)],[166])). thf(169,plain,(![SV4:$i,SV6:$i]: (((r1@SV6)=$true) | ((q1@SV4)=$false) | ((~ (p1@SV4))=$true))),inference(extcnf_forall_pos,[status(thm)],[167])). thf(170,plain,(![SV5:$i]: (((p1@SV5)=$false) | ((q1@SV5)=$false) | (((~ (r1@sK1)) | (~ (r1@sK2)))=$true))),inference(extcnf_not_pos,[status(thm)],[168])). thf(171,plain,(![SV6:$i,SV4:$i]: (((p1@SV4)=$false) | ((r1@SV6)=$true) | ((q1@SV4)=$false))),inference(extcnf_not_pos,[status(thm)],[169])). thf(172,plain,(![SV5:$i]: (((~ (r1@sK1))=$true) | ((~ (r1@sK2))=$true) | ((q1@SV5)=$false) | ((p1@SV5)=$false))),inference(extcnf_or_pos,[status(thm)],[170])). thf(173,plain,(![SV5:$i]: (((r1@sK1)=$false) | ((q1@SV5)=$false) | ((p1@SV5)=$false) | ((~ (r1@sK2))=$true))),inference(extcnf_not_pos,[status(thm)],[172])). thf(174,plain,(![SV5:$i]: (((r1@sK2)=$false) | ((r1@sK1)=$false) | ((q1@SV5)=$false) | ((p1@SV5)=$false))),inference(extcnf_not_pos,[status(thm)],[173])). thf(175,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:lit(ti(at(ti(q1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_146) 2 : :![X2]:![X3]:(lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o))|(~(lit(ti(at(ti(q1,ft(i,o)),ti(X3,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_171) 3 : :![X4]:![X5]:(~(lit(ti(at(ti(q1,ft(i,o)),ti(X5,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X4,i)),i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_160) 4 : :![X6]:(~(lit(ti(at(ti(r1,ft(i,o)),ti(sK2,i)),o)))|(~(lit(ti(at(ti(r1,ft(i,o)),ti(sK1,i)),o)))|(~(lit(ti(at(ti(q1,ft(i,o)),ti(X6,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X6,i)),o)))))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_174) 5 : :![X2]:![X3]:(lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X3,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o)))) : fof_simplification(2) 6 : :![X4]:![X5]:(~lit(ti(at(ti(q1,ft(i,o)),ti(X5,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X4,i)),i)),o))) : fof_simplification(3) 7 : :![X6]:(~lit(ti(at(ti(r1,ft(i,o)),ti(sK2,i)),o))|(~lit(ti(at(ti(r1,ft(i,o)),ti(sK1,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X6,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X6,i)),o))))) : fof_simplification(4) # Garbage collection reclaimed 25 unused term cells. 8 : :![X2]:lit(ti(at(ti(q1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X2,i)),i)),o)) : variable_rename(1) 9 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o))] : split_conjunct(8) 10 : :![X4]:![X5]:(lit(ti(at(ti(r1,ft(i,o)),ti(X4,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X5,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X5,i)),o)))) : variable_rename(5) 11 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(10) 12 : :![X6]:![X7]:(~lit(ti(at(ti(q1,ft(i,o)),ti(X7,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X6,i)),i)),o))) : variable_rename(6) 13 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))] : split_conjunct(12) 14 : :![X7]:(~lit(ti(at(ti(r1,ft(i,o)),ti(sK2,i)),o))|(~lit(ti(at(ti(r1,ft(i,o)),ti(sK1,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X7,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X7,i)),o))))) : variable_rename(7) 15 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(sK1,i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(sK2,i)),o))] : split_conjunct(14) # Garbage collection reclaimed 87 unused term cells. # Auto-Ordering is analysing problem. # Problem is type HHNFNFFSF22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type HHNFNFFSF22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.007 s 16 : :[--lit(ti(at(ti(r1,ft(i,o)),ti(sK2,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : csr(15,11) 17 : :[--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : csr(16,11) # Presaturation interreduction done 18 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o))] : spm(13,9) 19 : :[--lit(ti(at(ti(q1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o))] : spm(17,18) 20 : :[++$true,--lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))] : rw(13,18) 21 : :[--$true] : rw(19,9) 22 : :[] : cn(21) 23 : :[] : 22 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 4 # Removed by relevancy pruning : 0 # Initial clauses : 4 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 4 # Processed clauses : 8 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 8 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 1 # Backward-rewritten : 1 # Generated clauses : 2 # ...of the previous two non-trivial : 1 # Contextual simplify-reflections : 2 # Paramodulations : 2 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 3 # Positive orientable unit clauses : 2 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 1 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 3 # Rec. Clause-clause subsumption calls : 3 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 5 # Indexed BW rewrite successes : 1 # Unification attempts : 8 # Unification successes : 4 # Backwards rewriting index : 20 leaves, 1.30+/-0.900 terms/leaf # Paramod-from index : 1 leaves, 2.00+/-0.000 terms/leaf # Paramod-into index : 18 leaves, 1.22+/-0.629 terms/leaf # ------------------------------------------------- # User time : 0.007 s # System time : 0.000 s # Total time : 0.007 s # Maximum resident set size: 2556 pages ),[status(thm)],[146,174,160,171])). thf(176,plain,(((((((![X:$i,Y:$i]: ((~ ((r@X)@Y)) | ((q@X)@Y))) & ((![X:$i]: ((~ (s1@X)) | (p1@X))) & ((r@sK4)@sK5))) & (s1@sK4)) & (s1@sK3)) & (![X:$i]: ((~ (p1@X)) | (![Y:$i]: (~ ((q@X)@Y))))))=$true)),inference(copy,[status(thm)],[95])). thf(177,plain,(((~ ((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5)))))))) | (~ (s1@sK4))))) | (~ (s1@sK3))))) | (~ (![SX0:$i]: ((~ (p1@SX0)) | (![SX1:$i]: (~ ((q@SX0)@SX1))))))))=$true)),inference(unfold_def,[status(thm)],[176])). thf(178,plain,((((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5)))))))) | (~ (s1@sK4))))) | (~ (s1@sK3))))) | (~ (![SX0:$i]: ((~ (p1@SX0)) | (![SX1:$i]: (~ ((q@SX0)@SX1)))))))=$false)),inference(extcnf_not_pos,[status(thm)],[177])). thf(179,plain,(((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5)))))))) | (~ (s1@sK4))))) | (~ (s1@sK3)))))=$false)),inference(extcnf_or_neg,[status(thm)],[178])). thf(180,plain,(((~ (![SX0:$i]: ((~ (p1@SX0)) | (![SX1:$i]: (~ ((q@SX0)@SX1))))))=$false)),inference(extcnf_or_neg,[status(thm)],[178])). thf(181,plain,(((~ ((~ (~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5)))))))) | (~ (s1@sK4))))) | (~ (s1@sK3))))=$true)),inference(extcnf_not_neg,[status(thm)],[179])). thf(182,plain,(((![SX0:$i]: ((~ (p1@SX0)) | (![SX1:$i]: (~ ((q@SX0)@SX1)))))=$true)),inference(extcnf_not_neg,[status(thm)],[180])). thf(183,plain,((((~ (~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5)))))))) | (~ (s1@sK4))))) | (~ (s1@sK3)))=$false)),inference(extcnf_not_pos,[status(thm)],[181])). thf(184,plain,(![SV1:$i]: ((((~ (p1@SV1)) | (![SY261:$i]: (~ ((q@SV1)@SY261))))=$true))),inference(extcnf_forall_pos,[status(thm)],[182])). thf(185,plain,(((~ (~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5)))))))) | (~ (s1@sK4)))))=$false)),inference(extcnf_or_neg,[status(thm)],[183])). thf(187,plain,(![SV1:$i]: (((~ (p1@SV1))=$true) | ((![SY261:$i]: (~ ((q@SV1)@SY261)))=$true))),inference(extcnf_or_pos,[status(thm)],[184])). thf(188,plain,(((~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5)))))))) | (~ (s1@sK4))))=$true)),inference(extcnf_not_neg,[status(thm)],[185])). thf(190,plain,(![SV2:$i,SV1:$i]: (((~ ((q@SV1)@SV2))=$true) | ((~ (p1@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[187])). thf(191,plain,((((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5)))))))) | (~ (s1@sK4)))=$false)),inference(extcnf_not_pos,[status(thm)],[188])). thf(192,plain,(![SV2:$i,SV1:$i]: (((p1@SV1)=$false) | ((~ ((q@SV1)@SV2))=$true))),inference(extcnf_not_pos,[status(thm)],[190])). thf(193,plain,(((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[191])). thf(194,plain,(((~ (s1@sK4))=$false)),inference(extcnf_or_neg,[status(thm)],[191])). thf(195,plain,(![SV2:$i,SV1:$i]: ((((q@SV1)@SV2)=$false) | ((p1@SV1)=$false))),inference(extcnf_not_pos,[status(thm)],[192])). thf(196,plain,(((~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5)))))))=$true)),inference(extcnf_not_neg,[status(thm)],[193])). thf(197,plain,(((s1@sK4)=$true)),inference(extcnf_not_neg,[status(thm)],[194])). thf(198,plain,((((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5))))))=$false)),inference(extcnf_not_pos,[status(thm)],[196])). thf(199,plain,(((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1))))=$false)),inference(extcnf_or_neg,[status(thm)],[198])). thf(200,plain,(((~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5)))))=$false)),inference(extcnf_or_neg,[status(thm)],[198])). thf(201,plain,(((![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))=$true)),inference(extcnf_not_neg,[status(thm)],[199])). thf(202,plain,(((~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5))))=$true)),inference(extcnf_not_neg,[status(thm)],[200])). thf(203,plain,(![SV3:$i]: (((![SY262:$i]: ((~ ((r@SV3)@SY262)) | ((q@SV3)@SY262)))=$true))),inference(extcnf_forall_pos,[status(thm)],[201])). thf(204,plain,((((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ ((r@sK4)@sK5)))=$false)),inference(extcnf_not_pos,[status(thm)],[202])). thf(205,plain,(![SV4:$i,SV3:$i]: ((((~ ((r@SV3)@SV4)) | ((q@SV3)@SV4))=$true))),inference(extcnf_forall_pos,[status(thm)],[203])). thf(206,plain,(((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[204])). thf(207,plain,(((~ ((r@sK4)@sK5))=$false)),inference(extcnf_or_neg,[status(thm)],[204])). thf(208,plain,(![SV4:$i,SV3:$i]: (((~ ((r@SV3)@SV4))=$true) | (((q@SV3)@SV4)=$true))),inference(extcnf_or_pos,[status(thm)],[205])). thf(209,plain,(((![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[206])). thf(210,plain,((((r@sK4)@sK5)=$true)),inference(extcnf_not_neg,[status(thm)],[207])). thf(211,plain,(![SV4:$i,SV3:$i]: ((((r@SV3)@SV4)=$false) | (((q@SV3)@SV4)=$true))),inference(extcnf_not_pos,[status(thm)],[208])). thf(212,plain,(![SV5:$i]: ((((~ (s1@SV5)) | (p1@SV5))=$true))),inference(extcnf_forall_pos,[status(thm)],[209])). thf(213,plain,(![SV5:$i]: (((~ (s1@SV5))=$true) | ((p1@SV5)=$true))),inference(extcnf_or_pos,[status(thm)],[212])). thf(214,plain,(![SV5:$i]: (((s1@SV5)=$false) | ((p1@SV5)=$true))),inference(extcnf_not_pos,[status(thm)],[213])). thf(215,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(sK4,i)),ft(i,o)),ti(sK5,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_210) 2 : :![X1]:![X2]:(~(lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o)))|lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_211) 3 : :lit(ti(at(ti(s1,ft(i,o)),ti(sK3,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_189) 4 : :![X3]:(~(lit(ti(at(ti(s1,ft(i,o)),ti(X3,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_214) 5 : :![X4]:![X5]:(~(lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X4,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X5,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_195) 6 : :lit(ti(at(ti(s1,ft(i,o)),ti(sK4,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_197) 7 : :![X1]:![X2]:(~lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o))|lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o))) : fof_simplification(2) 8 : :![X3]:(~lit(ti(at(ti(s1,ft(i,o)),ti(X3,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : fof_simplification(4) 9 : :![X4]:![X5]:(~lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X4,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X5,i)),o))) : fof_simplification(5) # Garbage collection reclaimed 16 unused term cells. 10 : :[++lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(sK4,i)),ft(i,o)),ti(sK5,i)),o))] : split_conjunct(1) 11 : :![X3]:![X4]:(~lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(X4,i)),ft(i,o)),ti(X3,i)),o))|lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X4,i)),ft(i,o)),ti(X3,i)),o))) : variable_rename(7) 12 : :[++lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : split_conjunct(11) 13 : :[++lit(ti(at(ti(s1,ft(i,o)),ti(sK3,i)),o))] : split_conjunct(3) 14 : :![X4]:(~lit(ti(at(ti(s1,ft(i,o)),ti(X4,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X4,i)),o))) : variable_rename(8) 15 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(s1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(14) 16 : :![X6]:![X7]:(~lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X7,i)),ft(i,o)),ti(X6,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X7,i)),o))) : variable_rename(9) 17 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : split_conjunct(16) # Garbage collection reclaimed 83 unused term cells. 18 : :[++lit(ti(at(ti(s1,ft(i,o)),ti(sK4,i)),o))] : split_conjunct(6) # Auto-Ordering is analysing problem. # Problem is type HHNFNFFSS22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type HHNFNFFSS22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s # Presaturation interreduction done 19 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : spm(17,12) 20 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(sK4,i)),o))] : spm(19,10) 21 : :[--lit(ti(at(ti(s1,ft(i,o)),ti(sK4,i)),o))] : spm(20,15) 22 : :[--$true] : rw(21,18) 23 : :[] : cn(22) 24 : :[] : 23 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 6 # Removed by relevancy pruning : 0 # Initial clauses : 6 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 6 # Processed clauses : 14 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 14 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 3 # ...of the previous two non-trivial : 2 # Contextual simplify-reflections : 0 # Paramodulations : 3 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 8 # Positive orientable unit clauses : 3 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 4 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 8 # Indexed BW rewrite successes : 0 # Unification attempts : 32 # Unification successes : 7 # Backwards rewriting index : 33 leaves, 1.55+/-1.689 terms/leaf # Paramod-from index : 1 leaves, 5.00+/-0.000 terms/leaf # Paramod-into index : 31 leaves, 1.52+/-1.500 terms/leaf # ------------------------------------------------- # User time : 0.000 s # System time : 0.003 s # Total time : 0.003 s # Maximum resident set size: 2600 pages ),[status(thm)],[210,197,195,214,211])). thf(216,plain,(((((![X:$i]: (p1@X)) & (q1@sK7)) & ((~ (p1@sK6)) & (![Z:$i]: (~ (r1@Z)))))=$true)),inference(copy,[status(thm)],[96])). thf(217,plain,(((~ ((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (q1@sK7))))) | (~ (~ ((~ (~ (p1@sK6))) | (~ (![SX0:$i]: (~ (r1@SX0)))))))))=$true)),inference(unfold_def,[status(thm)],[216])). thf(218,plain,((((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (q1@sK7))))) | (~ (~ ((~ (~ (p1@sK6))) | (~ (![SX0:$i]: (~ (r1@SX0))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[217])). thf(219,plain,(((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (q1@sK7)))))=$false)),inference(extcnf_or_neg,[status(thm)],[218])). thf(220,plain,(((~ (~ ((~ (~ (p1@sK6))) | (~ (![SX0:$i]: (~ (r1@SX0)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[218])). thf(221,plain,(((~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (q1@sK7))))=$true)),inference(extcnf_not_neg,[status(thm)],[219])). thf(222,plain,(((~ ((~ (~ (p1@sK6))) | (~ (![SX0:$i]: (~ (r1@SX0))))))=$true)),inference(extcnf_not_neg,[status(thm)],[220])). thf(223,plain,((((~ (![SX0:$i]: (p1@SX0))) | (~ (q1@sK7)))=$false)),inference(extcnf_not_pos,[status(thm)],[221])). thf(224,plain,((((~ (~ (p1@sK6))) | (~ (![SX0:$i]: (~ (r1@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[222])). thf(225,plain,(((~ (![SX0:$i]: (p1@SX0)))=$false)),inference(extcnf_or_neg,[status(thm)],[223])). thf(227,plain,(((~ (~ (p1@sK6)))=$false)),inference(extcnf_or_neg,[status(thm)],[224])). thf(229,plain,(((![SX0:$i]: (p1@SX0))=$true)),inference(extcnf_not_neg,[status(thm)],[225])). thf(231,plain,(((~ (p1@sK6))=$true)),inference(extcnf_not_neg,[status(thm)],[227])). thf(233,plain,(![SV1:$i]: (((p1@SV1)=$true))),inference(extcnf_forall_pos,[status(thm)],[229])). thf(234,plain,(((p1@sK6)=$false)),inference(extcnf_not_pos,[status(thm)],[231])). thf(237,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_233) 2 : :~(lit(ti(at(ti(p1,ft(i,o)),ti(sK6,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_234) 3 : :![X2]:~(lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_236) 4 : :lit(ti(at(ti(q1,ft(i,o)),ti(sK7,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_230) 5 : :~lit(ti(at(ti(p1,ft(i,o)),ti(sK6,i)),o)) : fof_simplification(2) 6 : :![X2]:~lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o)) : fof_simplification(3) # Garbage collection reclaimed 5 unused term cells. 7 : :![X2]:lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(1) 8 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(7) 9 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(sK6,i)),o))] : split_conjunct(5) 10 : :![X3]:~lit(ti(at(ti(r1,ft(i,o)),ti(X3,i)),o)) : variable_rename(6) 11 : :[--lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(10) 12 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(sK7,i)),o))] : split_conjunct(4) # Garbage collection reclaimed 21 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.007 s 13 : :[--$true] : rw(9,8) 14 : :[] : cn(13) # SZS intermediate status Theorem # SZS answers Tuple [|_] 15 : :[] : eval_answer_literal(14) # Presaturation interreduction done 16 : :[] : 15 : 'proof' # Proof found! # Parsed axioms : 4 # Removed by relevancy pruning : 0 # Initial clauses : 4 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 4 # Processed clauses : 4 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 3 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 3 # Positive orientable unit clauses : 2 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 2 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 18 leaves, 1.22+/-0.629 terms/leaf # Paramod-from index : 1 leaves, 2.00+/-0.000 terms/leaf # Paramod-into index : 17 leaves, 1.24+/-0.644 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.003 s # Total time : 0.007 s # Maximum resident set size: 2448 pages ),[status(thm)],[233,234])). thf(238,plain,((((![X:$i]: (((a@(sK8@X))@(sK8@X)) & ((a@X)@(sK8@X)))) & (![Z:$i]: (~ ((a@Z)@Z))))=$true)),inference(copy,[status(thm)],[97])). thf(239,plain,(((~ ((~ (![SX0:$i]: (~ ((~ ((a@(sK8@SX0))@(sK8@SX0))) | (~ ((a@SX0)@(sK8@SX0))))))) | (~ (![SX0:$i]: (~ ((a@SX0)@SX0))))))=$true)),inference(unfold_def,[status(thm)],[238])). thf(240,plain,((((~ (![SX0:$i]: (~ ((~ ((a@(sK8@SX0))@(sK8@SX0))) | (~ ((a@SX0)@(sK8@SX0))))))) | (~ (![SX0:$i]: (~ ((a@SX0)@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[239])). thf(241,plain,(((~ (![SX0:$i]: (~ ((~ ((a@(sK8@SX0))@(sK8@SX0))) | (~ ((a@SX0)@(sK8@SX0)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[240])). thf(242,plain,(((~ (![SX0:$i]: (~ ((a@SX0)@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[240])). thf(243,plain,(((![SX0:$i]: (~ ((~ ((a@(sK8@SX0))@(sK8@SX0))) | (~ ((a@SX0)@(sK8@SX0))))))=$true)),inference(extcnf_not_neg,[status(thm)],[241])). thf(244,plain,(((![SX0:$i]: (~ ((a@SX0)@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[242])). thf(245,plain,(![SV1:$i]: (((~ ((~ ((a@(sK8@SV1))@(sK8@SV1))) | (~ ((a@SV1)@(sK8@SV1)))))=$true))),inference(extcnf_forall_pos,[status(thm)],[243])). thf(246,plain,(![SV2:$i]: (((~ ((a@SV2)@SV2))=$true))),inference(extcnf_forall_pos,[status(thm)],[244])). thf(247,plain,(![SV1:$i]: ((((~ ((a@(sK8@SV1))@(sK8@SV1))) | (~ ((a@SV1)@(sK8@SV1))))=$false))),inference(extcnf_not_pos,[status(thm)],[245])). thf(248,plain,(![SV2:$i]: ((((a@SV2)@SV2)=$false))),inference(extcnf_not_pos,[status(thm)],[246])). thf(249,plain,(![SV1:$i]: (((~ ((a@(sK8@SV1))@(sK8@SV1)))=$false))),inference(extcnf_or_neg,[status(thm)],[247])). thf(251,plain,(![SV1:$i]: ((((a@(sK8@SV1))@(sK8@SV1))=$true))),inference(extcnf_not_neg,[status(thm)],[249])). thf(253,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:~(lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_248) 2 : :![X2]:lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(at(ti(sK8,ft(i,i)),ti(X2,i)),i)),ft(i,o)),ti(at(ti(sK8,ft(i,i)),ti(X2,i)),i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_251) 3 : :![X2]:lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(at(ti(sK8,ft(i,i)),ti(X2,i)),i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_252) 4 : :![X1]:~lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X1,i)),o)) : fof_simplification(1) # Garbage collection reclaimed 3 unused term cells. 5 : :![X2]:~lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X2,i)),o)) : variable_rename(4) 6 : :[--lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X1,i)),o))] : split_conjunct(5) 7 : :![X3]:lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(at(ti(sK8,ft(i,i)),ti(X3,i)),i)),ft(i,o)),ti(at(ti(sK8,ft(i,i)),ti(X3,i)),i)),o)) : variable_rename(2) 8 : :[++lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(at(ti(sK8,ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(at(ti(sK8,ft(i,i)),ti(X1,i)),i)),o))] : split_conjunct(7) # Garbage collection reclaimed 24 unused term cells. 9 : :![X3]:lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(at(ti(sK8,ft(i,i)),ti(X3,i)),i)),o)) : variable_rename(3) 10 : :[++lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(at(ti(sK8,ft(i,i)),ti(X1,i)),i)),o))] : split_conjunct(9) # Garbage collection reclaimed 20 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNSNFFSF22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNSNFFSF22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 11 : :[] : sr(8,6) # SZS intermediate status Theorem # SZS answers Tuple [|_] 12 : :[] : eval_answer_literal(11) # Presaturation interreduction done 13 : :[] : 12 : 'proof' # Proof found! # Parsed axioms : 3 # Removed by relevancy pruning : 0 # Initial clauses : 3 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 3 # Processed clauses : 3 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 2 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 2 # Positive orientable unit clauses : 1 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 1 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 19 leaves, 1.11+/-0.307 terms/leaf # Paramod-from index : 1 leaves, 1.00+/-0.000 terms/leaf # Paramod-into index : 18 leaves, 1.11+/-0.314 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2436 pages ),[status(thm)],[248,251])). thf(254,plain,(((((((![X:$i,Y:$i]: ((~ ((r@X)@Y)) | ((q@X)@Y))) & ((![X:$i]: ((~ (s1@X)) | (p1@X))) & (s1@sK9))) & ((r@sK10)@sK11)) & (s1@sK10)) & (![X:$i]: ((~ (p1@X)) | (![Y:$i]: (~ ((q@X)@Y))))))=$true)),inference(copy,[status(thm)],[98])). thf(255,plain,(((~ ((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9)))))))) | (~ ((r@sK10)@sK11))))) | (~ (s1@sK10))))) | (~ (![SX0:$i]: ((~ (p1@SX0)) | (![SX1:$i]: (~ ((q@SX0)@SX1))))))))=$true)),inference(unfold_def,[status(thm)],[254])). thf(256,plain,((((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9)))))))) | (~ ((r@sK10)@sK11))))) | (~ (s1@sK10))))) | (~ (![SX0:$i]: ((~ (p1@SX0)) | (![SX1:$i]: (~ ((q@SX0)@SX1)))))))=$false)),inference(extcnf_not_pos,[status(thm)],[255])). thf(257,plain,(((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9)))))))) | (~ ((r@sK10)@sK11))))) | (~ (s1@sK10)))))=$false)),inference(extcnf_or_neg,[status(thm)],[256])). thf(258,plain,(((~ (![SX0:$i]: ((~ (p1@SX0)) | (![SX1:$i]: (~ ((q@SX0)@SX1))))))=$false)),inference(extcnf_or_neg,[status(thm)],[256])). thf(259,plain,(((~ ((~ (~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9)))))))) | (~ ((r@sK10)@sK11))))) | (~ (s1@sK10))))=$true)),inference(extcnf_not_neg,[status(thm)],[257])). thf(260,plain,(((![SX0:$i]: ((~ (p1@SX0)) | (![SX1:$i]: (~ ((q@SX0)@SX1)))))=$true)),inference(extcnf_not_neg,[status(thm)],[258])). thf(261,plain,((((~ (~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9)))))))) | (~ ((r@sK10)@sK11))))) | (~ (s1@sK10)))=$false)),inference(extcnf_not_pos,[status(thm)],[259])). thf(262,plain,(![SV1:$i]: ((((~ (p1@SV1)) | (![SY263:$i]: (~ ((q@SV1)@SY263))))=$true))),inference(extcnf_forall_pos,[status(thm)],[260])). thf(263,plain,(((~ (~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9)))))))) | (~ ((r@sK10)@sK11)))))=$false)),inference(extcnf_or_neg,[status(thm)],[261])). thf(264,plain,(((~ (s1@sK10))=$false)),inference(extcnf_or_neg,[status(thm)],[261])). thf(265,plain,(![SV1:$i]: (((~ (p1@SV1))=$true) | ((![SY263:$i]: (~ ((q@SV1)@SY263)))=$true))),inference(extcnf_or_pos,[status(thm)],[262])). thf(266,plain,(((~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9)))))))) | (~ ((r@sK10)@sK11))))=$true)),inference(extcnf_not_neg,[status(thm)],[263])). thf(267,plain,(((s1@sK10)=$true)),inference(extcnf_not_neg,[status(thm)],[264])). thf(268,plain,(![SV2:$i,SV1:$i]: (((~ ((q@SV1)@SV2))=$true) | ((~ (p1@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[265])). thf(269,plain,((((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9)))))))) | (~ ((r@sK10)@sK11)))=$false)),inference(extcnf_not_pos,[status(thm)],[266])). thf(270,plain,(![SV2:$i,SV1:$i]: (((p1@SV1)=$false) | ((~ ((q@SV1)@SV2))=$true))),inference(extcnf_not_pos,[status(thm)],[268])). thf(271,plain,(((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[269])). thf(272,plain,(((~ ((r@sK10)@sK11))=$false)),inference(extcnf_or_neg,[status(thm)],[269])). thf(273,plain,(![SV2:$i,SV1:$i]: ((((q@SV1)@SV2)=$false) | ((p1@SV1)=$false))),inference(extcnf_not_pos,[status(thm)],[270])). thf(274,plain,(((~ ((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9)))))))=$true)),inference(extcnf_not_neg,[status(thm)],[271])). thf(275,plain,((((r@sK10)@sK11)=$true)),inference(extcnf_not_neg,[status(thm)],[272])). thf(276,plain,((((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))) | (~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9))))))=$false)),inference(extcnf_not_pos,[status(thm)],[274])). thf(277,plain,(((~ (![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1))))=$false)),inference(extcnf_or_neg,[status(thm)],[276])). thf(278,plain,(((~ (~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9)))))=$false)),inference(extcnf_or_neg,[status(thm)],[276])). thf(279,plain,(((![SX0:$i,SX1:$i]: ((~ ((r@SX0)@SX1)) | ((q@SX0)@SX1)))=$true)),inference(extcnf_not_neg,[status(thm)],[277])). thf(280,plain,(((~ ((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9))))=$true)),inference(extcnf_not_neg,[status(thm)],[278])). thf(281,plain,(![SV3:$i]: (((![SY264:$i]: ((~ ((r@SV3)@SY264)) | ((q@SV3)@SY264)))=$true))),inference(extcnf_forall_pos,[status(thm)],[279])). thf(282,plain,((((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))) | (~ (s1@sK9)))=$false)),inference(extcnf_not_pos,[status(thm)],[280])). thf(283,plain,(![SV4:$i,SV3:$i]: ((((~ ((r@SV3)@SV4)) | ((q@SV3)@SV4))=$true))),inference(extcnf_forall_pos,[status(thm)],[281])). thf(284,plain,(((~ (![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[282])). thf(286,plain,(![SV4:$i,SV3:$i]: (((~ ((r@SV3)@SV4))=$true) | (((q@SV3)@SV4)=$true))),inference(extcnf_or_pos,[status(thm)],[283])). thf(287,plain,(((![SX0:$i]: ((~ (s1@SX0)) | (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[284])). thf(289,plain,(![SV4:$i,SV3:$i]: ((((r@SV3)@SV4)=$false) | (((q@SV3)@SV4)=$true))),inference(extcnf_not_pos,[status(thm)],[286])). thf(290,plain,(![SV5:$i]: ((((~ (s1@SV5)) | (p1@SV5))=$true))),inference(extcnf_forall_pos,[status(thm)],[287])). thf(291,plain,(![SV5:$i]: (((~ (s1@SV5))=$true) | ((p1@SV5)=$true))),inference(extcnf_or_pos,[status(thm)],[290])). thf(292,plain,(![SV5:$i]: (((s1@SV5)=$false) | ((p1@SV5)=$true))),inference(extcnf_not_pos,[status(thm)],[291])). thf(293,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(sK10,i)),ft(i,o)),ti(sK11,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_275) 2 : :lit(ti(at(ti(s1,ft(i,o)),ti(sK9,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_288) 3 : :![X1]:![X2]:(~(lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o)))|lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_289) 4 : :lit(ti(at(ti(s1,ft(i,o)),ti(sK10,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_267) 5 : :![X3]:(~(lit(ti(at(ti(s1,ft(i,o)),ti(X3,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_292) 6 : :![X4]:![X5]:(~(lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X4,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X5,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_273) 7 : :![X1]:![X2]:(~lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o))|lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o))) : fof_simplification(3) 8 : :![X3]:(~lit(ti(at(ti(s1,ft(i,o)),ti(X3,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : fof_simplification(5) 9 : :![X4]:![X5]:(~lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X4,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X5,i)),o))) : fof_simplification(6) # Garbage collection reclaimed 16 unused term cells. 10 : :[++lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(sK10,i)),ft(i,o)),ti(sK11,i)),o))] : split_conjunct(1) 11 : :[++lit(ti(at(ti(s1,ft(i,o)),ti(sK9,i)),o))] : split_conjunct(2) 12 : :![X3]:![X4]:(~lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(X4,i)),ft(i,o)),ti(X3,i)),o))|lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X4,i)),ft(i,o)),ti(X3,i)),o))) : variable_rename(7) 13 : :[++lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : split_conjunct(12) 14 : :[++lit(ti(at(ti(s1,ft(i,o)),ti(sK10,i)),o))] : split_conjunct(4) 15 : :![X4]:(~lit(ti(at(ti(s1,ft(i,o)),ti(X4,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X4,i)),o))) : variable_rename(8) 16 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(s1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(15) 17 : :![X6]:![X7]:(~lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X7,i)),ft(i,o)),ti(X6,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X7,i)),o))) : variable_rename(9) 18 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : split_conjunct(17) # Garbage collection reclaimed 84 unused term cells. # Auto-Ordering is analysing problem. # Problem is type HHNFNFFSS22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type HHNFNFFSS22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s # Presaturation interreduction done 19 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(at(ti(r,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : spm(18,13) 20 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(sK10,i)),o))] : spm(19,10) 21 : :[--lit(ti(at(ti(s1,ft(i,o)),ti(sK10,i)),o))] : spm(20,16) 22 : :[--$true] : rw(21,14) 23 : :[] : cn(22) 24 : :[] : 23 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 6 # Removed by relevancy pruning : 0 # Initial clauses : 6 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 6 # Processed clauses : 14 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 14 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 3 # ...of the previous two non-trivial : 2 # Contextual simplify-reflections : 0 # Paramodulations : 3 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 8 # Positive orientable unit clauses : 3 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 4 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 8 # Indexed BW rewrite successes : 0 # Unification attempts : 32 # Unification successes : 7 # Backwards rewriting index : 33 leaves, 1.55+/-1.689 terms/leaf # Paramod-from index : 1 leaves, 5.00+/-0.000 terms/leaf # Paramod-into index : 31 leaves, 1.52+/-1.500 terms/leaf # ------------------------------------------------- # User time : 0.000 s # System time : 0.003 s # Total time : 0.003 s # Maximum resident set size: 2600 pages ),[status(thm)],[275,273,292,267,289])). thf(294,plain,((((![Y:$i]: ((~ (q1@Y)) | (p1@Y))) & (((![X:$i]: ((p1@X) | (q1@X))) & ((![X:$i]: (p1@X)) | (~ (p1@sK13)))) & (((~ (p1@sK12)) | (![X:$i]: (q1@X))) & ((~ (p1@sK12)) | (~ (p1@sK13))))))=$true)),inference(copy,[status(thm)],[99])). thf(295,plain,(((~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | (p1@SX0)))) | (~ (~ ((~ (~ ((~ (![SX0:$i]: ((p1@SX0) | (q1@SX0)))) | (~ ((![SX0:$i]: (p1@SX0)) | (~ (p1@sK13))))))) | (~ (~ ((~ ((~ (p1@sK12)) | (![SX0:$i]: (q1@SX0)))) | (~ ((~ (p1@sK12)) | (~ (p1@sK13))))))))))))=$true)),inference(unfold_def,[status(thm)],[294])). thf(296,plain,((((~ (![SX0:$i]: ((~ (q1@SX0)) | (p1@SX0)))) | (~ (~ ((~ (~ ((~ (![SX0:$i]: ((p1@SX0) | (q1@SX0)))) | (~ ((![SX0:$i]: (p1@SX0)) | (~ (p1@sK13))))))) | (~ (~ ((~ ((~ (p1@sK12)) | (![SX0:$i]: (q1@SX0)))) | (~ ((~ (p1@sK12)) | (~ (p1@sK13)))))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[295])). thf(297,plain,(((~ (![SX0:$i]: ((~ (q1@SX0)) | (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[296])). thf(298,plain,(((~ (~ ((~ (~ ((~ (![SX0:$i]: ((p1@SX0) | (q1@SX0)))) | (~ ((![SX0:$i]: (p1@SX0)) | (~ (p1@sK13))))))) | (~ (~ ((~ ((~ (p1@sK12)) | (![SX0:$i]: (q1@SX0)))) | (~ ((~ (p1@sK12)) | (~ (p1@sK13))))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[296])). thf(299,plain,(((![SX0:$i]: ((~ (q1@SX0)) | (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[297])). thf(300,plain,(((~ ((~ (~ ((~ (![SX0:$i]: ((p1@SX0) | (q1@SX0)))) | (~ ((![SX0:$i]: (p1@SX0)) | (~ (p1@sK13))))))) | (~ (~ ((~ ((~ (p1@sK12)) | (![SX0:$i]: (q1@SX0)))) | (~ ((~ (p1@sK12)) | (~ (p1@sK13)))))))))=$true)),inference(extcnf_not_neg,[status(thm)],[298])). thf(301,plain,(![SV1:$i]: ((((~ (q1@SV1)) | (p1@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[299])). thf(302,plain,((((~ (~ ((~ (![SX0:$i]: ((p1@SX0) | (q1@SX0)))) | (~ ((![SX0:$i]: (p1@SX0)) | (~ (p1@sK13))))))) | (~ (~ ((~ ((~ (p1@sK12)) | (![SX0:$i]: (q1@SX0)))) | (~ ((~ (p1@sK12)) | (~ (p1@sK13))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[300])). thf(303,plain,(![SV1:$i]: (((~ (q1@SV1))=$true) | ((p1@SV1)=$true))),inference(extcnf_or_pos,[status(thm)],[301])). thf(304,plain,(((~ (~ ((~ (![SX0:$i]: ((p1@SX0) | (q1@SX0)))) | (~ ((![SX0:$i]: (p1@SX0)) | (~ (p1@sK13)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[302])). thf(305,plain,(((~ (~ ((~ ((~ (p1@sK12)) | (![SX0:$i]: (q1@SX0)))) | (~ ((~ (p1@sK12)) | (~ (p1@sK13)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[302])). thf(306,plain,(![SV1:$i]: (((q1@SV1)=$false) | ((p1@SV1)=$true))),inference(extcnf_not_pos,[status(thm)],[303])). thf(307,plain,(((~ ((~ (![SX0:$i]: ((p1@SX0) | (q1@SX0)))) | (~ ((![SX0:$i]: (p1@SX0)) | (~ (p1@sK13))))))=$true)),inference(extcnf_not_neg,[status(thm)],[304])). thf(308,plain,(((~ ((~ ((~ (p1@sK12)) | (![SX0:$i]: (q1@SX0)))) | (~ ((~ (p1@sK12)) | (~ (p1@sK13))))))=$true)),inference(extcnf_not_neg,[status(thm)],[305])). thf(309,plain,((((~ (![SX0:$i]: ((p1@SX0) | (q1@SX0)))) | (~ ((![SX0:$i]: (p1@SX0)) | (~ (p1@sK13)))))=$false)),inference(extcnf_not_pos,[status(thm)],[307])). thf(310,plain,((((~ ((~ (p1@sK12)) | (![SX0:$i]: (q1@SX0)))) | (~ ((~ (p1@sK12)) | (~ (p1@sK13)))))=$false)),inference(extcnf_not_pos,[status(thm)],[308])). thf(311,plain,(((~ (![SX0:$i]: ((p1@SX0) | (q1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[309])). thf(314,plain,(((~ ((~ (p1@sK12)) | (~ (p1@sK13))))=$false)),inference(extcnf_or_neg,[status(thm)],[310])). thf(315,plain,(((![SX0:$i]: ((p1@SX0) | (q1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[311])). thf(318,plain,((((~ (p1@sK12)) | (~ (p1@sK13)))=$true)),inference(extcnf_not_neg,[status(thm)],[314])). thf(319,plain,(![SV2:$i]: ((((p1@SV2) | (q1@SV2))=$true))),inference(extcnf_forall_pos,[status(thm)],[315])). thf(322,plain,(((~ (p1@sK12))=$true) | ((~ (p1@sK13))=$true)),inference(extcnf_or_pos,[status(thm)],[318])). thf(323,plain,(![SV2:$i]: (((p1@SV2)=$true) | ((q1@SV2)=$true))),inference(extcnf_or_pos,[status(thm)],[319])). thf(326,plain,(((p1@sK13)=$false) | ((~ (p1@sK12))=$true)),inference(extcnf_not_pos,[status(thm)],[322])). thf(329,plain,(((p1@sK12)=$false) | ((p1@sK13)=$false)),inference(extcnf_not_pos,[status(thm)],[326])). thf(330,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :(~(lit(ti(at(ti(p1,ft(i,o)),ti(sK12,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(sK13,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_329) 2 : :![X1]:(lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_323) 3 : :![X2]:(~(lit(ti(at(ti(p1,ft(i,o)),ti(sK13,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_327) 4 : :![X3]:(~(lit(ti(at(ti(p1,ft(i,o)),ti(sK12,i)),o)))|lit(ti(at(ti(q1,ft(i,o)),ti(X3,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_328) 5 : :![X4]:(~(lit(ti(at(ti(q1,ft(i,o)),ti(X4,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(X4,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_306) 6 : :(~lit(ti(at(ti(p1,ft(i,o)),ti(sK12,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(sK13,i)),o))) : fof_simplification(1) 7 : :![X2]:(~lit(ti(at(ti(p1,ft(i,o)),ti(sK13,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : fof_simplification(3) 8 : :![X3]:(~lit(ti(at(ti(p1,ft(i,o)),ti(sK12,i)),o))|lit(ti(at(ti(q1,ft(i,o)),ti(X3,i)),o))) : fof_simplification(4) 9 : :![X4]:(~lit(ti(at(ti(q1,ft(i,o)),ti(X4,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X4,i)),o))) : fof_simplification(5) # Garbage collection reclaimed 13 unused term cells. 10 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(sK13,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(sK12,i)),o))] : split_conjunct(6) 11 : :![X2]:(lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : variable_rename(2) 12 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(11) 13 : :![X3]:(~lit(ti(at(ti(p1,ft(i,o)),ti(sK13,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : variable_rename(7) 14 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(sK13,i)),o))] : split_conjunct(13) 15 : :![X4]:(~lit(ti(at(ti(p1,ft(i,o)),ti(sK12,i)),o))|lit(ti(at(ti(q1,ft(i,o)),ti(X4,i)),o))) : variable_rename(8) 16 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(sK12,i)),o))] : split_conjunct(15) 17 : :![X5]:(~lit(ti(at(ti(q1,ft(i,o)),ti(X5,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X5,i)),o))) : variable_rename(9) 18 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(17) # Garbage collection reclaimed 58 unused term cells. # Auto-Ordering is analysing problem. # Problem is type GHNFGFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type GHNFGFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 19 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : csr(18,12) 20 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),++$true] : rw(12,19) 21 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--$true] : rw(16,19) 22 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : cn(21) 23 : :[--$true,--lit(ti(at(ti(p1,ft(i,o)),ti(sK13,i)),o))] : rw(10,19) 24 : :[--$true,--$true] : rw(23,19) 25 : :[] : cn(24) # SZS intermediate status Theorem # SZS answers Tuple [|_] 26 : :[] : eval_answer_literal(25) # Presaturation interreduction done 27 : :[] : 26 : 'proof' # Proof found! # Parsed axioms : 5 # Removed by relevancy pruning : 0 # Initial clauses : 5 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 5 # Processed clauses : 4 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 3 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 1 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 1 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 2 # Positive orientable unit clauses : 2 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 1 # ...number of literals in the above : 2 # Clause-clause subsumption calls (NU) : 1 # Rec. Clause-clause subsumption calls : 1 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 3 # Indexed BW rewrite successes : 1 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 13 leaves, 1.15+/-0.361 terms/leaf # Paramod-from index : 1 leaves, 2.00+/-0.000 terms/leaf # Paramod-into index : 12 leaves, 1.17+/-0.373 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2492 pages ),[status(thm)],[329,306,323])). thf(331,plain,((((![Z:$i]: ((~ (q1@Z)) | (p1@Z))) & (((![X:$i]: ((q1@X) | (p1@X))) & ((![X:$i]: (q1@X)) | (~ (p1@sK14)))) & (((~ (p1@sK15)) | (![X:$i]: (p1@X))) & ((~ (p1@sK15)) | (~ (p1@sK14))))))=$true)),inference(copy,[status(thm)],[100])). thf(332,plain,(((~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | (p1@SX0)))) | (~ (~ ((~ (~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK14))))))) | (~ (~ ((~ ((~ (p1@sK15)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK15)) | (~ (p1@sK14))))))))))))=$true)),inference(unfold_def,[status(thm)],[331])). thf(333,plain,((((~ (![SX0:$i]: ((~ (q1@SX0)) | (p1@SX0)))) | (~ (~ ((~ (~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK14))))))) | (~ (~ ((~ ((~ (p1@sK15)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK15)) | (~ (p1@sK14)))))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[332])). thf(334,plain,(((~ (![SX0:$i]: ((~ (q1@SX0)) | (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[333])). thf(335,plain,(((~ (~ ((~ (~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK14))))))) | (~ (~ ((~ ((~ (p1@sK15)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK15)) | (~ (p1@sK14))))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[333])). thf(336,plain,(((![SX0:$i]: ((~ (q1@SX0)) | (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[334])). thf(337,plain,(((~ ((~ (~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK14))))))) | (~ (~ ((~ ((~ (p1@sK15)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK15)) | (~ (p1@sK14)))))))))=$true)),inference(extcnf_not_neg,[status(thm)],[335])). thf(338,plain,(![SV1:$i]: ((((~ (q1@SV1)) | (p1@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[336])). thf(339,plain,((((~ (~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK14))))))) | (~ (~ ((~ ((~ (p1@sK15)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK15)) | (~ (p1@sK14))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[337])). thf(340,plain,(![SV1:$i]: (((~ (q1@SV1))=$true) | ((p1@SV1)=$true))),inference(extcnf_or_pos,[status(thm)],[338])). thf(341,plain,(((~ (~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK14)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[339])). thf(342,plain,(((~ (~ ((~ ((~ (p1@sK15)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK15)) | (~ (p1@sK14)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[339])). thf(343,plain,(![SV1:$i]: (((q1@SV1)=$false) | ((p1@SV1)=$true))),inference(extcnf_not_pos,[status(thm)],[340])). thf(344,plain,(((~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK14))))))=$true)),inference(extcnf_not_neg,[status(thm)],[341])). thf(345,plain,(((~ ((~ ((~ (p1@sK15)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK15)) | (~ (p1@sK14))))))=$true)),inference(extcnf_not_neg,[status(thm)],[342])). thf(346,plain,((((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK14)))))=$false)),inference(extcnf_not_pos,[status(thm)],[344])). thf(347,plain,((((~ ((~ (p1@sK15)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK15)) | (~ (p1@sK14)))))=$false)),inference(extcnf_not_pos,[status(thm)],[345])). thf(348,plain,(((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[346])). thf(351,plain,(((~ ((~ (p1@sK15)) | (~ (p1@sK14))))=$false)),inference(extcnf_or_neg,[status(thm)],[347])). thf(352,plain,(((![SX0:$i]: ((q1@SX0) | (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[348])). thf(355,plain,((((~ (p1@sK15)) | (~ (p1@sK14)))=$true)),inference(extcnf_not_neg,[status(thm)],[351])). thf(356,plain,(![SV2:$i]: ((((q1@SV2) | (p1@SV2))=$true))),inference(extcnf_forall_pos,[status(thm)],[352])). thf(359,plain,(((~ (p1@sK15))=$true) | ((~ (p1@sK14))=$true)),inference(extcnf_or_pos,[status(thm)],[355])). thf(360,plain,(![SV2:$i]: (((q1@SV2)=$true) | ((p1@SV2)=$true))),inference(extcnf_or_pos,[status(thm)],[356])). thf(363,plain,(((p1@sK14)=$false) | ((~ (p1@sK15))=$true)),inference(extcnf_not_pos,[status(thm)],[359])). thf(366,plain,(((p1@sK15)=$false) | ((p1@sK14)=$false)),inference(extcnf_not_pos,[status(thm)],[363])). thf(367,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:(~(lit(ti(at(ti(p1,ft(i,o)),ti(sK14,i)),o)))|lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_364) 2 : :![X2]:(~(lit(ti(at(ti(p1,ft(i,o)),ti(sK15,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_365) 3 : :![X3]:(~(lit(ti(at(ti(q1,ft(i,o)),ti(X3,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_343) 4 : :(~(lit(ti(at(ti(p1,ft(i,o)),ti(sK15,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(sK14,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_366) 5 : :![X4]:(lit(ti(at(ti(q1,ft(i,o)),ti(X4,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X4,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_360) 6 : :![X1]:(~lit(ti(at(ti(p1,ft(i,o)),ti(sK14,i)),o))|lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))) : fof_simplification(1) 7 : :![X2]:(~lit(ti(at(ti(p1,ft(i,o)),ti(sK15,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : fof_simplification(2) 8 : :![X3]:(~lit(ti(at(ti(q1,ft(i,o)),ti(X3,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : fof_simplification(3) 9 : :(~lit(ti(at(ti(p1,ft(i,o)),ti(sK15,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(sK14,i)),o))) : fof_simplification(4) # Garbage collection reclaimed 13 unused term cells. 10 : :![X2]:(~lit(ti(at(ti(p1,ft(i,o)),ti(sK14,i)),o))|lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))) : variable_rename(6) 11 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(sK14,i)),o))] : split_conjunct(10) 12 : :![X3]:(~lit(ti(at(ti(p1,ft(i,o)),ti(sK15,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : variable_rename(7) 13 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(sK15,i)),o))] : split_conjunct(12) 14 : :![X4]:(~lit(ti(at(ti(q1,ft(i,o)),ti(X4,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X4,i)),o))) : variable_rename(8) 15 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(14) 16 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(sK14,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(sK15,i)),o))] : split_conjunct(9) 17 : :![X5]:(lit(ti(at(ti(q1,ft(i,o)),ti(X5,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X5,i)),o))) : variable_rename(5) 18 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(17) # Garbage collection reclaimed 57 unused term cells. # Auto-Ordering is analysing problem. # Problem is type GHNFGFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type GHNFGFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 19 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : csr(15,18) 20 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),++$true] : rw(18,19) 21 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--$true] : rw(11,19) 22 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : cn(21) 23 : :[--$true,--lit(ti(at(ti(p1,ft(i,o)),ti(sK15,i)),o))] : rw(16,19) 24 : :[--$true,--$true] : rw(23,19) 25 : :[] : cn(24) # SZS intermediate status Theorem # SZS answers Tuple [|_] 26 : :[] : eval_answer_literal(25) # Presaturation interreduction done 27 : :[] : 26 : 'proof' # Proof found! # Parsed axioms : 5 # Removed by relevancy pruning : 0 # Initial clauses : 5 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 5 # Processed clauses : 4 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 3 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 1 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 1 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 2 # Positive orientable unit clauses : 2 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 1 # ...number of literals in the above : 2 # Clause-clause subsumption calls (NU) : 1 # Rec. Clause-clause subsumption calls : 1 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 3 # Indexed BW rewrite successes : 1 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 13 leaves, 1.15+/-0.361 terms/leaf # Paramod-from index : 1 leaves, 2.00+/-0.000 terms/leaf # Paramod-into index : 12 leaves, 1.17+/-0.373 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2492 pages ),[status(thm)],[343,360,366])). thf(368,plain,(((((~ (a1@sK17)) | (b@sK16)) & ((![X:$i]: (a1@X)) & (![X:$i]: (~ (b@X)))))=$true)),inference(copy,[status(thm)],[101])). thf(369,plain,(((~ ((~ ((~ (a1@sK17)) | (b@sK16))) | (~ (~ ((~ (![SX0:$i]: (a1@SX0))) | (~ (![SX0:$i]: (~ (b@SX0)))))))))=$true)),inference(unfold_def,[status(thm)],[368])). thf(370,plain,((((~ ((~ (a1@sK17)) | (b@sK16))) | (~ (~ ((~ (![SX0:$i]: (a1@SX0))) | (~ (![SX0:$i]: (~ (b@SX0))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[369])). thf(371,plain,(((~ ((~ (a1@sK17)) | (b@sK16)))=$false)),inference(extcnf_or_neg,[status(thm)],[370])). thf(372,plain,(((~ (~ ((~ (![SX0:$i]: (a1@SX0))) | (~ (![SX0:$i]: (~ (b@SX0)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[370])). thf(373,plain,((((~ (a1@sK17)) | (b@sK16))=$true)),inference(extcnf_not_neg,[status(thm)],[371])). thf(374,plain,(((~ ((~ (![SX0:$i]: (a1@SX0))) | (~ (![SX0:$i]: (~ (b@SX0))))))=$true)),inference(extcnf_not_neg,[status(thm)],[372])). thf(375,plain,(((~ (a1@sK17))=$true) | ((b@sK16)=$true)),inference(extcnf_or_pos,[status(thm)],[373])). thf(376,plain,((((~ (![SX0:$i]: (a1@SX0))) | (~ (![SX0:$i]: (~ (b@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[374])). thf(377,plain,(((a1@sK17)=$false) | ((b@sK16)=$true)),inference(extcnf_not_pos,[status(thm)],[375])). thf(378,plain,(((~ (![SX0:$i]: (a1@SX0)))=$false)),inference(extcnf_or_neg,[status(thm)],[376])). thf(379,plain,(((~ (![SX0:$i]: (~ (b@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[376])). thf(380,plain,(((![SX0:$i]: (a1@SX0))=$true)),inference(extcnf_not_neg,[status(thm)],[378])). thf(381,plain,(((![SX0:$i]: (~ (b@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[379])). thf(382,plain,(![SV1:$i]: (((a1@SV1)=$true))),inference(extcnf_forall_pos,[status(thm)],[380])). thf(383,plain,(![SV2:$i]: (((~ (b@SV2))=$true))),inference(extcnf_forall_pos,[status(thm)],[381])). thf(384,plain,(![SV2:$i]: (((b@SV2)=$false))),inference(extcnf_not_pos,[status(thm)],[383])). thf(385,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :(lit(ti(at(ti(b,ft(i,o)),ti(sK16,i)),o))|~(lit(ti(at(ti(a1,ft(i,o)),ti(sK17,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_377) 2 : :![X1]:lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_382) 3 : :![X2]:~(lit(ti(at(ti(b,ft(i,o)),ti(X2,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_384) 4 : :(lit(ti(at(ti(b,ft(i,o)),ti(sK16,i)),o))|~lit(ti(at(ti(a1,ft(i,o)),ti(sK17,i)),o))) : fof_simplification(1) 5 : :![X2]:~lit(ti(at(ti(b,ft(i,o)),ti(X2,i)),o)) : fof_simplification(3) # Garbage collection reclaimed 6 unused term cells. 6 : :[++lit(ti(at(ti(b,ft(i,o)),ti(sK16,i)),o)),--lit(ti(at(ti(a1,ft(i,o)),ti(sK17,i)),o))] : split_conjunct(4) 7 : :![X2]:lit(ti(at(ti(a1,ft(i,o)),ti(X2,i)),o)) : variable_rename(2) 8 : :[++lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(7) 9 : :![X3]:~lit(ti(at(ti(b,ft(i,o)),ti(X3,i)),o)) : variable_rename(5) 10 : :[--lit(ti(at(ti(b,ft(i,o)),ti(X1,i)),o))] : split_conjunct(9) # Garbage collection reclaimed 22 unused term cells. # Auto-Ordering is analysing problem. # Problem is type HUNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type HUNFNFFSF22MM # Auto-Mode selected heuristic H_____102_C18_F1_PI_AE_Q4_CS_SP_S1S # and selection function SelectComplexAHP. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.007 s 11 : :[++lit(ti(at(ti(b,ft(i,o)),ti(sK16,i)),o)),--$true] : rw(6,8) 12 : :[++lit(ti(at(ti(b,ft(i,o)),ti(sK16,i)),o))] : cn(11) 13 : :[] : sr(12,10) # SZS intermediate status Theorem # SZS answers Tuple [|_] 14 : :[] : eval_answer_literal(13) 15 : :[] : 14 : 'proof' # Proof found! # Parsed axioms : 3 # Removed by relevancy pruning : 0 # Initial clauses : 3 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 3 # Processed clauses : 3 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 2 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 2 # Positive orientable unit clauses : 1 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 1 # Indexed BW rewrite successes : 0 # Unification attempts : 3 # Unification successes : 1 # Backwards rewriting index : 13 leaves, 1.15+/-0.361 terms/leaf # Paramod-from index : 1 leaves, 1.00+/-0.000 terms/leaf # Paramod-into index : 12 leaves, 1.17+/-0.373 terms/leaf # ------------------------------------------------- # User time : 0.007 s # System time : 0.000 s # Total time : 0.007 s # Maximum resident set size: 2432 pages ),[status(thm)],[377,384,382])). thf(386,plain,((((b@sK18) & ((![X:$i]: (~ (a1@X))) & (![X:$i]: (~ (b@X)))))=$true)),inference(copy,[status(thm)],[102])). thf(387,plain,(((~ ((~ (b@sK18)) | (~ (~ ((~ (![SX0:$i]: (~ (a1@SX0)))) | (~ (![SX0:$i]: (~ (b@SX0)))))))))=$true)),inference(unfold_def,[status(thm)],[386])). thf(388,plain,((((~ (b@sK18)) | (~ (~ ((~ (![SX0:$i]: (~ (a1@SX0)))) | (~ (![SX0:$i]: (~ (b@SX0))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[387])). thf(389,plain,(((~ (b@sK18))=$false)),inference(extcnf_or_neg,[status(thm)],[388])). thf(390,plain,(((~ (~ ((~ (![SX0:$i]: (~ (a1@SX0)))) | (~ (![SX0:$i]: (~ (b@SX0)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[388])). thf(391,plain,(((b@sK18)=$true)),inference(extcnf_not_neg,[status(thm)],[389])). thf(392,plain,(((~ ((~ (![SX0:$i]: (~ (a1@SX0)))) | (~ (![SX0:$i]: (~ (b@SX0))))))=$true)),inference(extcnf_not_neg,[status(thm)],[390])). thf(393,plain,((((~ (![SX0:$i]: (~ (a1@SX0)))) | (~ (![SX0:$i]: (~ (b@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[392])). thf(395,plain,(((~ (![SX0:$i]: (~ (b@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[393])). thf(397,plain,(((![SX0:$i]: (~ (b@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[395])). thf(399,plain,(![SV2:$i]: (((~ (b@SV2))=$true))),inference(extcnf_forall_pos,[status(thm)],[397])). thf(401,plain,(![SV2:$i]: (((b@SV2)=$false))),inference(extcnf_not_pos,[status(thm)],[399])). thf(402,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:~(lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_400) 2 : :![X2]:~(lit(ti(at(ti(b,ft(i,o)),ti(X2,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_401) 3 : :lit(ti(at(ti(b,ft(i,o)),ti(sK18,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_391) 4 : :![X1]:~lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o)) : fof_simplification(1) 5 : :![X2]:~lit(ti(at(ti(b,ft(i,o)),ti(X2,i)),o)) : fof_simplification(2) # Garbage collection reclaimed 6 unused term cells. 6 : :![X2]:~lit(ti(at(ti(a1,ft(i,o)),ti(X2,i)),o)) : variable_rename(4) 7 : :[--lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(6) 8 : :![X3]:~lit(ti(at(ti(b,ft(i,o)),ti(X3,i)),o)) : variable_rename(5) 9 : :[--lit(ti(at(ti(b,ft(i,o)),ti(X1,i)),o))] : split_conjunct(8) 10 : :[++lit(ti(at(ti(b,ft(i,o)),ti(sK18,i)),o))] : split_conjunct(3) # Garbage collection reclaimed 20 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 11 : :[] : sr(10,9) # SZS intermediate status Theorem # SZS answers Tuple [|_] 12 : :[] : eval_answer_literal(11) # Presaturation interreduction done 13 : :[] : 12 : 'proof' # Proof found! # Parsed axioms : 3 # Removed by relevancy pruning : 0 # Initial clauses : 3 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 3 # Processed clauses : 3 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 2 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 2 # Positive orientable unit clauses : 0 # Positive unorientable unit clauses: 0 # Negative unit clauses : 2 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 13 leaves, 1.15+/-0.361 terms/leaf # Paramod-from index : 0 leaves, 0.00+/-0.000 terms/leaf # Paramod-into index : 12 leaves, 1.17+/-0.373 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2420 pages ),[status(thm)],[401,391])). thf(403,plain,(((((a@sK20)@sK19) & (![X:$i,Y:$i]: (~ ((a@X)@Y))))=$true)),inference(copy,[status(thm)],[103])). thf(404,plain,(((~ ((~ ((a@sK20)@sK19)) | (~ (![SX0:$i,SX1:$i]: (~ ((a@SX0)@SX1))))))=$true)),inference(unfold_def,[status(thm)],[403])). thf(405,plain,((((~ ((a@sK20)@sK19)) | (~ (![SX0:$i,SX1:$i]: (~ ((a@SX0)@SX1)))))=$false)),inference(extcnf_not_pos,[status(thm)],[404])). thf(406,plain,(((~ ((a@sK20)@sK19))=$false)),inference(extcnf_or_neg,[status(thm)],[405])). thf(407,plain,(((~ (![SX0:$i,SX1:$i]: (~ ((a@SX0)@SX1))))=$false)),inference(extcnf_or_neg,[status(thm)],[405])). thf(408,plain,((((a@sK20)@sK19)=$true)),inference(extcnf_not_neg,[status(thm)],[406])). thf(409,plain,(((![SX0:$i,SX1:$i]: (~ ((a@SX0)@SX1)))=$true)),inference(extcnf_not_neg,[status(thm)],[407])). thf(410,plain,(![SV1:$i]: (((![SY265:$i]: (~ ((a@SV1)@SY265)))=$true))),inference(extcnf_forall_pos,[status(thm)],[409])). thf(411,plain,(![SV2:$i,SV1:$i]: (((~ ((a@SV1)@SV2))=$true))),inference(extcnf_forall_pos,[status(thm)],[410])). thf(412,plain,(![SV2:$i,SV1:$i]: ((((a@SV1)@SV2)=$false))),inference(extcnf_not_pos,[status(thm)],[411])). thf(413,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(sK20,i)),ft(i,o)),ti(sK19,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_408) 2 : :![X1]:![X2]:~(lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_412) 3 : :![X1]:![X2]:~lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o)) : fof_simplification(2) # Garbage collection reclaimed 4 unused term cells. 4 : :[++lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(sK20,i)),ft(i,o)),ti(sK19,i)),o))] : split_conjunct(1) 5 : :![X3]:![X4]:~lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X4,i)),ft(i,o)),ti(X3,i)),o)) : variable_rename(3) 6 : :[--lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : split_conjunct(5) # Garbage collection reclaimed 19 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFNFFSF22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFNFFSF22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 7 : :[] : sr(4,6) # SZS intermediate status Theorem # SZS answers Tuple [|_] 8 : :[] : eval_answer_literal(7) # Presaturation interreduction done 9 : :[] : 8 : 'proof' # Proof found! # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 2 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 0 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 13 leaves, 1.08+/-0.266 terms/leaf # Paramod-from index : 0 leaves, 0.00+/-0.000 terms/leaf # Paramod-into index : 12 leaves, 1.08+/-0.276 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2416 pages ),[status(thm)],[408,412])). thf(414,plain,(((((a@sK21)@sK22) & (![Y:$i,X:$i]: (~ ((a@X)@Y))))=$true)),inference(copy,[status(thm)],[104])). thf(415,plain,(((~ ((~ ((a@sK21)@sK22)) | (~ (![SX0:$i,SX1:$i]: (~ ((a@SX1)@SX0))))))=$true)),inference(unfold_def,[status(thm)],[414])). thf(416,plain,((((~ ((a@sK21)@sK22)) | (~ (![SX0:$i,SX1:$i]: (~ ((a@SX1)@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[415])). thf(417,plain,(((~ ((a@sK21)@sK22))=$false)),inference(extcnf_or_neg,[status(thm)],[416])). thf(418,plain,(((~ (![SX0:$i,SX1:$i]: (~ ((a@SX1)@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[416])). thf(419,plain,((((a@sK21)@sK22)=$true)),inference(extcnf_not_neg,[status(thm)],[417])). thf(420,plain,(((![SX0:$i,SX1:$i]: (~ ((a@SX1)@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[418])). thf(421,plain,(![SV1:$i]: (((![SY266:$i]: (~ ((a@SY266)@SV1)))=$true))),inference(extcnf_forall_pos,[status(thm)],[420])). thf(422,plain,(![SV1:$i,SV2:$i]: (((~ ((a@SV2)@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[421])). thf(423,plain,(![SV1:$i,SV2:$i]: ((((a@SV2)@SV1)=$false))),inference(extcnf_not_pos,[status(thm)],[422])). thf(424,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(sK21,i)),ft(i,o)),ti(sK22,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_419) 2 : :![X1]:![X2]:~(lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_423) 3 : :![X1]:![X2]:~lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o)) : fof_simplification(2) # Garbage collection reclaimed 4 unused term cells. 4 : :[++lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(sK21,i)),ft(i,o)),ti(sK22,i)),o))] : split_conjunct(1) 5 : :![X3]:![X4]:~lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X4,i)),ft(i,o)),ti(X3,i)),o)) : variable_rename(3) 6 : :[--lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : split_conjunct(5) # Garbage collection reclaimed 19 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFNFFSF22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFNFFSF22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 7 : :[] : sr(4,6) # SZS intermediate status Theorem # SZS answers Tuple [|_] 8 : :[] : eval_answer_literal(7) # Presaturation interreduction done 9 : :[] : 8 : 'proof' # Proof found! # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 2 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 0 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 13 leaves, 1.08+/-0.266 terms/leaf # Paramod-from index : 0 leaves, 0.00+/-0.000 terms/leaf # Paramod-into index : 12 leaves, 1.08+/-0.276 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2416 pages ),[status(thm)],[419,423])). thf(425,plain,((((p1@sK23) & (![X:$i]: (~ (p1@X))))=$true)),inference(copy,[status(thm)],[105])). thf(426,plain,(((~ ((~ (p1@sK23)) | (~ (![SX0:$i]: (~ (p1@SX0))))))=$true)),inference(unfold_def,[status(thm)],[425])). thf(427,plain,((((~ (p1@sK23)) | (~ (![SX0:$i]: (~ (p1@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[426])). thf(428,plain,(((~ (p1@sK23))=$false)),inference(extcnf_or_neg,[status(thm)],[427])). thf(429,plain,(((~ (![SX0:$i]: (~ (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[427])). thf(430,plain,(((p1@sK23)=$true)),inference(extcnf_not_neg,[status(thm)],[428])). thf(431,plain,(((![SX0:$i]: (~ (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[429])). thf(432,plain,(![SV1:$i]: (((~ (p1@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[431])). thf(433,plain,(![SV1:$i]: (((p1@SV1)=$false))),inference(extcnf_not_pos,[status(thm)],[432])). thf(434,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(p1,ft(i,o)),ti(sK23,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_430) 2 : :![X1]:~(lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_433) 3 : :![X1]:~lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : fof_simplification(2) # Garbage collection reclaimed 3 unused term cells. 4 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(sK23,i)),o))] : split_conjunct(1) 5 : :![X2]:~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(3) 6 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(5) # Garbage collection reclaimed 9 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 7 : :[] : sr(4,6) # SZS intermediate status Theorem # SZS answers Tuple [|_] 8 : :[] : eval_answer_literal(7) # Presaturation interreduction done 9 : :[] : 8 : 'proof' # Proof found! # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 2 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 0 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 10 leaves, 1.00+/-0.000 terms/leaf # Paramod-from index : 0 leaves, 0.00+/-0.000 terms/leaf # Paramod-into index : 9 leaves, 1.00+/-0.000 terms/leaf # ------------------------------------------------- # User time : 0.007 s # System time : 0.000 s # Total time : 0.007 s # Maximum resident set size: 2412 pages ),[status(thm)],[430,433])). thf(435,plain,((((p1@sK24) & (![Y:$i]: (~ (p1@Y))))=$true)),inference(copy,[status(thm)],[106])). thf(436,plain,(((~ ((~ (p1@sK24)) | (~ (![SX0:$i]: (~ (p1@SX0))))))=$true)),inference(unfold_def,[status(thm)],[435])). thf(437,plain,((((~ (p1@sK24)) | (~ (![SX0:$i]: (~ (p1@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[436])). thf(438,plain,(((~ (p1@sK24))=$false)),inference(extcnf_or_neg,[status(thm)],[437])). thf(439,plain,(((~ (![SX0:$i]: (~ (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[437])). thf(440,plain,(((p1@sK24)=$true)),inference(extcnf_not_neg,[status(thm)],[438])). thf(441,plain,(((![SX0:$i]: (~ (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[439])). thf(442,plain,(![SV1:$i]: (((~ (p1@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[441])). thf(443,plain,(![SV1:$i]: (((p1@SV1)=$false))),inference(extcnf_not_pos,[status(thm)],[442])). thf(444,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(p1,ft(i,o)),ti(sK24,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_440) 2 : :![X1]:~(lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_443) 3 : :![X1]:~lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : fof_simplification(2) # Garbage collection reclaimed 3 unused term cells. 4 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(sK24,i)),o))] : split_conjunct(1) 5 : :![X2]:~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(3) 6 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(5) # Garbage collection reclaimed 9 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 7 : :[] : sr(4,6) # SZS intermediate status Theorem # SZS answers Tuple [|_] 8 : :[] : eval_answer_literal(7) # Presaturation interreduction done 9 : :[] : 8 : 'proof' # Proof found! # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 2 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 0 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 10 leaves, 1.00+/-0.000 terms/leaf # Paramod-from index : 0 leaves, 0.00+/-0.000 terms/leaf # Paramod-into index : 9 leaves, 1.00+/-0.000 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2408 pages ),[status(thm)],[440,443])). thf(445,plain,(((![Z:$i]: ((((![SY188:$i]: (((p@SY188)@(sK25@Z)) | ((p@Z)@SY188))) & (![SY189:$i]: (((p@SY189)@(sK25@Z)) | ((p@SY189)@Z)))) & (![SY190:$i]: (((p@SY190)@(sK25@Z)) | (~ ((p@SY190)@(sK25@Z)))))) & (((![Y:$i]: ((![W:$i]: (~ ((p@W)@Y))) | ((p@Z)@Y))) & (![Y:$i]: ((![W:$i]: (~ ((p@W)@Y))) | ((p@Y)@Z)))) & (![SY195:$i]: ((![W:$i]: (~ ((p@W)@SY195))) | (~ ((p@SY195)@(sK25@Z))))))))=$true)),inference(copy,[status(thm)],[107])). thf(446,plain,(((![SX0:$i]: (~ ((~ (~ ((~ (~ ((~ (![SX1:$i]: (((p@SX1)@(sK25@SX0)) | ((p@SX0)@SX1)))) | (~ (![SX1:$i]: (((p@SX1)@(sK25@SX0)) | ((p@SX1)@SX0))))))) | (~ (![SX1:$i]: (((p@SX1)@(sK25@SX0)) | (~ ((p@SX1)@(sK25@SX0))))))))) | (~ (~ ((~ (~ ((~ (![SX1:$i]: ((![SX2:$i]: (~ ((p@SX2)@SX1))) | ((p@SX0)@SX1)))) | (~ (![SX1:$i]: ((![SX2:$i]: (~ ((p@SX2)@SX1))) | ((p@SX1)@SX0))))))) | (~ (![SX1:$i]: ((![SX2:$i]: (~ ((p@SX2)@SX1))) | (~ ((p@SX1)@(sK25@SX0))))))))))))=$true)),inference(unfold_def,[status(thm)],[445])). thf(447,plain,(![SV1:$i]: (((~ ((~ (~ ((~ (~ ((~ (![SY267:$i]: (((p@SY267)@(sK25@SV1)) | ((p@SV1)@SY267)))) | (~ (![SY268:$i]: (((p@SY268)@(sK25@SV1)) | ((p@SY268)@SV1))))))) | (~ (![SY269:$i]: (((p@SY269)@(sK25@SV1)) | (~ ((p@SY269)@(sK25@SV1))))))))) | (~ (~ ((~ (~ ((~ (![SY270:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY270))) | ((p@SV1)@SY270)))) | (~ (![SY272:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY272))) | ((p@SY272)@SV1))))))) | (~ (![SY274:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY274))) | (~ ((p@SY274)@(sK25@SV1)))))))))))=$true))),inference(extcnf_forall_pos,[status(thm)],[446])). thf(448,plain,(![SV1:$i]: ((((~ (~ ((~ (~ ((~ (![SY267:$i]: (((p@SY267)@(sK25@SV1)) | ((p@SV1)@SY267)))) | (~ (![SY268:$i]: (((p@SY268)@(sK25@SV1)) | ((p@SY268)@SV1))))))) | (~ (![SY269:$i]: (((p@SY269)@(sK25@SV1)) | (~ ((p@SY269)@(sK25@SV1))))))))) | (~ (~ ((~ (~ ((~ (![SY270:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY270))) | ((p@SV1)@SY270)))) | (~ (![SY272:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY272))) | ((p@SY272)@SV1))))))) | (~ (![SY274:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY274))) | (~ ((p@SY274)@(sK25@SV1))))))))))=$false))),inference(extcnf_not_pos,[status(thm)],[447])). thf(449,plain,(![SV1:$i]: (((~ (~ ((~ (~ ((~ (![SY267:$i]: (((p@SY267)@(sK25@SV1)) | ((p@SV1)@SY267)))) | (~ (![SY268:$i]: (((p@SY268)@(sK25@SV1)) | ((p@SY268)@SV1))))))) | (~ (![SY269:$i]: (((p@SY269)@(sK25@SV1)) | (~ ((p@SY269)@(sK25@SV1)))))))))=$false))),inference(extcnf_or_neg,[status(thm)],[448])). thf(450,plain,(![SV1:$i]: (((~ (~ ((~ (~ ((~ (![SY270:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY270))) | ((p@SV1)@SY270)))) | (~ (![SY272:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY272))) | ((p@SY272)@SV1))))))) | (~ (![SY274:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY274))) | (~ ((p@SY274)@(sK25@SV1)))))))))=$false))),inference(extcnf_or_neg,[status(thm)],[448])). thf(451,plain,(![SV1:$i]: (((~ ((~ (~ ((~ (![SY267:$i]: (((p@SY267)@(sK25@SV1)) | ((p@SV1)@SY267)))) | (~ (![SY268:$i]: (((p@SY268)@(sK25@SV1)) | ((p@SY268)@SV1))))))) | (~ (![SY269:$i]: (((p@SY269)@(sK25@SV1)) | (~ ((p@SY269)@(sK25@SV1))))))))=$true))),inference(extcnf_not_neg,[status(thm)],[449])). thf(452,plain,(![SV1:$i]: (((~ ((~ (~ ((~ (![SY270:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY270))) | ((p@SV1)@SY270)))) | (~ (![SY272:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY272))) | ((p@SY272)@SV1))))))) | (~ (![SY274:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY274))) | (~ ((p@SY274)@(sK25@SV1))))))))=$true))),inference(extcnf_not_neg,[status(thm)],[450])). thf(453,plain,(![SV1:$i]: ((((~ (~ ((~ (![SY267:$i]: (((p@SY267)@(sK25@SV1)) | ((p@SV1)@SY267)))) | (~ (![SY268:$i]: (((p@SY268)@(sK25@SV1)) | ((p@SY268)@SV1))))))) | (~ (![SY269:$i]: (((p@SY269)@(sK25@SV1)) | (~ ((p@SY269)@(sK25@SV1)))))))=$false))),inference(extcnf_not_pos,[status(thm)],[451])). thf(454,plain,(![SV1:$i]: ((((~ (~ ((~ (![SY270:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY270))) | ((p@SV1)@SY270)))) | (~ (![SY272:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY272))) | ((p@SY272)@SV1))))))) | (~ (![SY274:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY274))) | (~ ((p@SY274)@(sK25@SV1)))))))=$false))),inference(extcnf_not_pos,[status(thm)],[452])). thf(455,plain,(![SV1:$i]: (((~ (~ ((~ (![SY267:$i]: (((p@SY267)@(sK25@SV1)) | ((p@SV1)@SY267)))) | (~ (![SY268:$i]: (((p@SY268)@(sK25@SV1)) | ((p@SY268)@SV1)))))))=$false))),inference(extcnf_or_neg,[status(thm)],[453])). thf(457,plain,(![SV1:$i]: (((~ (~ ((~ (![SY270:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY270))) | ((p@SV1)@SY270)))) | (~ (![SY272:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY272))) | ((p@SY272)@SV1)))))))=$false))),inference(extcnf_or_neg,[status(thm)],[454])). thf(458,plain,(![SV1:$i]: (((~ (![SY274:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY274))) | (~ ((p@SY274)@(sK25@SV1))))))=$false))),inference(extcnf_or_neg,[status(thm)],[454])). thf(459,plain,(![SV1:$i]: (((~ ((~ (![SY267:$i]: (((p@SY267)@(sK25@SV1)) | ((p@SV1)@SY267)))) | (~ (![SY268:$i]: (((p@SY268)@(sK25@SV1)) | ((p@SY268)@SV1))))))=$true))),inference(extcnf_not_neg,[status(thm)],[455])). thf(461,plain,(![SV1:$i]: (((~ ((~ (![SY270:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY270))) | ((p@SV1)@SY270)))) | (~ (![SY272:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY272))) | ((p@SY272)@SV1))))))=$true))),inference(extcnf_not_neg,[status(thm)],[457])). thf(462,plain,(![SV1:$i]: (((![SY274:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY274))) | (~ ((p@SY274)@(sK25@SV1)))))=$true))),inference(extcnf_not_neg,[status(thm)],[458])). thf(463,plain,(![SV1:$i]: ((((~ (![SY267:$i]: (((p@SY267)@(sK25@SV1)) | ((p@SV1)@SY267)))) | (~ (![SY268:$i]: (((p@SY268)@(sK25@SV1)) | ((p@SY268)@SV1)))))=$false))),inference(extcnf_not_pos,[status(thm)],[459])). thf(465,plain,(![SV1:$i]: ((((~ (![SY270:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY270))) | ((p@SV1)@SY270)))) | (~ (![SY272:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY272))) | ((p@SY272)@SV1)))))=$false))),inference(extcnf_not_pos,[status(thm)],[461])). thf(466,plain,(![SV1:$i,SV3:$i]: ((((![SY276:$i]: (~ ((p@SY276)@SV3))) | (~ ((p@SV3)@(sK25@SV1))))=$true))),inference(extcnf_forall_pos,[status(thm)],[462])). thf(467,plain,(![SV1:$i]: (((~ (![SY267:$i]: (((p@SY267)@(sK25@SV1)) | ((p@SV1)@SY267))))=$false))),inference(extcnf_or_neg,[status(thm)],[463])). thf(471,plain,(![SV1:$i]: (((~ (![SY272:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY272))) | ((p@SY272)@SV1))))=$false))),inference(extcnf_or_neg,[status(thm)],[465])). thf(472,plain,(![SV1:$i,SV3:$i]: (((![SY276:$i]: (~ ((p@SY276)@SV3)))=$true) | ((~ ((p@SV3)@(sK25@SV1)))=$true))),inference(extcnf_or_pos,[status(thm)],[466])). thf(473,plain,(![SV1:$i]: (((![SY267:$i]: (((p@SY267)@(sK25@SV1)) | ((p@SV1)@SY267)))=$true))),inference(extcnf_not_neg,[status(thm)],[467])). thf(477,plain,(![SV1:$i]: (((![SY272:$i]: ((![SX2:$i]: (~ ((p@SX2)@SY272))) | ((p@SY272)@SV1)))=$true))),inference(extcnf_not_neg,[status(thm)],[471])). thf(478,plain,(![SV1:$i,SV3:$i,SV4:$i]: (((~ ((p@SV4)@SV3))=$true) | ((~ ((p@SV3)@(sK25@SV1)))=$true))),inference(extcnf_forall_pos,[status(thm)],[472])). thf(479,plain,(![SV1:$i,SV5:$i]: (((((p@SV5)@(sK25@SV1)) | ((p@SV1)@SV5))=$true))),inference(extcnf_forall_pos,[status(thm)],[473])). thf(482,plain,(![SV1:$i,SV8:$i]: ((((![SY278:$i]: (~ ((p@SY278)@SV8))) | ((p@SV8)@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[477])). thf(483,plain,(![SV4:$i,SV1:$i,SV3:$i]: ((((p@SV3)@(sK25@SV1))=$false) | ((~ ((p@SV4)@SV3))=$true))),inference(extcnf_not_pos,[status(thm)],[478])). thf(484,plain,(![SV1:$i,SV5:$i]: ((((p@SV5)@(sK25@SV1))=$true) | (((p@SV1)@SV5)=$true))),inference(extcnf_or_pos,[status(thm)],[479])). thf(487,plain,(![SV1:$i,SV8:$i]: (((![SY278:$i]: (~ ((p@SY278)@SV8)))=$true) | (((p@SV8)@SV1)=$true))),inference(extcnf_or_pos,[status(thm)],[482])). thf(488,plain,(![SV1:$i,SV3:$i,SV4:$i]: ((((p@SV4)@SV3)=$false) | (((p@SV3)@(sK25@SV1))=$false))),inference(extcnf_not_pos,[status(thm)],[483])). thf(490,plain,(![SV1:$i,SV8:$i,SV10:$i]: (((~ ((p@SV10)@SV8))=$true) | (((p@SV8)@SV1)=$true))),inference(extcnf_forall_pos,[status(thm)],[487])). thf(492,plain,(![SV1:$i,SV8:$i,SV10:$i]: ((((p@SV10)@SV8)=$false) | (((p@SV8)@SV1)=$true))),inference(extcnf_not_pos,[status(thm)],[490])). thf(493,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:![X2]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X1,i)),i)),o))|lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_484) 2 : :![X1]:![X3]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X1,i)),i)),o))|lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_485) 3 : :![X1]:![X4]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X4,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X1,i)),i)),o))|~(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X4,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X1,i)),i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_475) 4 : :![X1]:![X5]:![X6]:(~(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X6,i)),ft(i,o)),ti(X5,i)),o)))|~(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X1,i)),i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_488) 5 : :![X1]:![X7]:![X8]:(~(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X8,i)),ft(i,o)),ti(X7,i)),o)))|lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X7,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_491) 6 : :![X1]:![X9]:![X10]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X9,i)),ft(i,o)),ti(X1,i)),o))|~(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X10,i)),ft(i,o)),ti(X9,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_492) 7 : :![X1]:![X4]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X4,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X1,i)),i)),o))|~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X4,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X1,i)),i)),o))) : fof_simplification(3) 8 : :![X1]:![X5]:![X6]:(~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X6,i)),ft(i,o)),ti(X5,i)),o))|~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X1,i)),i)),o))) : fof_simplification(4) 9 : :![X1]:![X7]:![X8]:(~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X8,i)),ft(i,o)),ti(X7,i)),o))|lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X7,i)),o))) : fof_simplification(5) 10 : :![X1]:![X9]:![X10]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X9,i)),ft(i,o)),ti(X1,i)),o))|~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X10,i)),ft(i,o)),ti(X9,i)),o))) : fof_simplification(6) # Garbage collection reclaimed 24 unused term cells. 11 : :![X3]:![X4]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X4,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X3,i)),i)),o))|lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X4,i)),o))) : variable_rename(1) 12 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X1,i)),i)),o))] : split_conjunct(11) 13 : :![X4]:![X5]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X4,i)),i)),o))|lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X4,i)),o))) : variable_rename(2) 14 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X2,i)),i)),o))] : split_conjunct(13) 15 : :![X5]:![X6]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X6,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X5,i)),i)),o))|~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X6,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X5,i)),i)),o))) : variable_rename(7) 16 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X2,i)),i)),o)),--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X2,i)),i)),o))] : split_conjunct(15) 17 : :![X7]:![X8]:![X9]:(~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X9,i)),ft(i,o)),ti(X8,i)),o))|~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X8,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X7,i)),i)),o))) : variable_rename(8) 18 : :[--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X2,i)),i)),o)),--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X1,i)),o))] : split_conjunct(17) 19 : :![X9]:![X10]:![X11]:(~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X11,i)),ft(i,o)),ti(X10,i)),o))|lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X9,i)),ft(i,o)),ti(X10,i)),o))) : variable_rename(9) 20 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X2,i)),o))] : split_conjunct(19) # Garbage collection reclaimed 123 unused term cells. 21 : :![X11]:![X12]:![X13]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X12,i)),ft(i,o)),ti(X11,i)),o))|~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X13,i)),ft(i,o)),ti(X12,i)),o))) : variable_rename(10) 22 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X3,i)),o)),--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : split_conjunct(21) # Garbage collection reclaimed 37 unused term cells. # Auto-Ordering is analysing problem. # Problem is type GHNFNFFMF22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type GHNFNFFMF22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.007 s 23 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(at(ti(sK25,ft(i,i)),ti(X1,i)),i)),o))] : csr(12,22) 24 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),++$true] : rw(14,23) 25 : :[--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X1,i)),o)),--$true] : rw(18,23) 26 : :[--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X1,i)),o))] : cn(25) 27 : :[] : sr(23,26) # Presaturation interreduction done 28 : :[] : 27 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 6 # Removed by relevancy pruning : 0 # Initial clauses : 6 # Removed in clause preprocessing : 1 # Initial clauses in saturation : 5 # Processed clauses : 5 # ...of these trivial : 1 # ...subsumed : 0 # ...remaining for further processing : 4 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 1 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 1 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 3 # Positive orientable unit clauses : 0 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 2 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 6 # Rec. Clause-clause subsumption calls : 6 # Unit Clause-clause subsumption calls : 2 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 3 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 13 leaves, 1.77+/-0.890 terms/leaf # Paramod-from index : 1 leaves, 1.00+/-0.000 terms/leaf # Paramod-into index : 12 leaves, 1.83+/-0.898 terms/leaf # ------------------------------------------------- # User time : 0.007 s # System time : 0.000 s # Total time : 0.007 s # Maximum resident set size: 2524 pages ),[status(thm)],[484,492,488])). thf(494,plain,((((![X:$i]: (p1@X)) & (~ (p1@sK26)))=$true)),inference(copy,[status(thm)],[108])). thf(495,plain,(((~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (~ (p1@sK26)))))=$true)),inference(unfold_def,[status(thm)],[494])). thf(496,plain,((((~ (![SX0:$i]: (p1@SX0))) | (~ (~ (p1@sK26))))=$false)),inference(extcnf_not_pos,[status(thm)],[495])). thf(497,plain,(((~ (![SX0:$i]: (p1@SX0)))=$false)),inference(extcnf_or_neg,[status(thm)],[496])). thf(498,plain,(((~ (~ (p1@sK26)))=$false)),inference(extcnf_or_neg,[status(thm)],[496])). thf(499,plain,(((![SX0:$i]: (p1@SX0))=$true)),inference(extcnf_not_neg,[status(thm)],[497])). thf(500,plain,(((~ (p1@sK26))=$true)),inference(extcnf_not_neg,[status(thm)],[498])). thf(501,plain,(![SV1:$i]: (((p1@SV1)=$true))),inference(extcnf_forall_pos,[status(thm)],[499])). thf(502,plain,(((p1@sK26)=$false)),inference(extcnf_not_pos,[status(thm)],[500])). thf(503,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_501) 2 : :~(lit(ti(at(ti(p1,ft(i,o)),ti(sK26,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_502) 3 : :~lit(ti(at(ti(p1,ft(i,o)),ti(sK26,i)),o)) : fof_simplification(2) # Garbage collection reclaimed 2 unused term cells. 4 : :![X2]:lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(1) 5 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(4) 6 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(sK26,i)),o))] : split_conjunct(3) # Garbage collection reclaimed 9 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFGFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFGFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 7 : :[--$true] : rw(6,5) 8 : :[] : cn(7) # SZS intermediate status Theorem # SZS answers Tuple [|_] 9 : :[] : eval_answer_literal(8) # Presaturation interreduction done 10 : :[] : 9 : 'proof' # Proof found! # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 2 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 1 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 10 leaves, 1.00+/-0.000 terms/leaf # Paramod-from index : 1 leaves, 1.00+/-0.000 terms/leaf # Paramod-into index : 9 leaves, 1.00+/-0.000 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2420 pages ),[status(thm)],[501,502])). thf(504,plain,(((((![X:$i]: (~ (p1@X))) | (![Y:$i]: (r1@Y))) & ((p1@sK27) & (~ (r1@sK28))))=$true)),inference(copy,[status(thm)],[109])). thf(505,plain,(((~ ((~ ((![SX0:$i]: (~ (p1@SX0))) | (![SX0:$i]: (r1@SX0)))) | (~ (~ ((~ (p1@sK27)) | (~ (~ (r1@sK28))))))))=$true)),inference(unfold_def,[status(thm)],[504])). thf(506,plain,((((~ ((![SX0:$i]: (~ (p1@SX0))) | (![SX0:$i]: (r1@SX0)))) | (~ (~ ((~ (p1@sK27)) | (~ (~ (r1@sK28)))))))=$false)),inference(extcnf_not_pos,[status(thm)],[505])). thf(507,plain,(((~ ((![SX0:$i]: (~ (p1@SX0))) | (![SX0:$i]: (r1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[506])). thf(508,plain,(((~ (~ ((~ (p1@sK27)) | (~ (~ (r1@sK28))))))=$false)),inference(extcnf_or_neg,[status(thm)],[506])). thf(509,plain,((((![SX0:$i]: (~ (p1@SX0))) | (![SX0:$i]: (r1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[507])). thf(510,plain,(((~ ((~ (p1@sK27)) | (~ (~ (r1@sK28)))))=$true)),inference(extcnf_not_neg,[status(thm)],[508])). thf(511,plain,(((![SX0:$i]: (~ (p1@SX0)))=$true) | ((![SX0:$i]: (r1@SX0))=$true)),inference(extcnf_or_pos,[status(thm)],[509])). thf(512,plain,((((~ (p1@sK27)) | (~ (~ (r1@sK28))))=$false)),inference(extcnf_not_pos,[status(thm)],[510])). thf(513,plain,(![SV1:$i]: (((~ (p1@SV1))=$true) | ((![SX0:$i]: (r1@SX0))=$true))),inference(extcnf_forall_pos,[status(thm)],[511])). thf(514,plain,(((~ (p1@sK27))=$false)),inference(extcnf_or_neg,[status(thm)],[512])). thf(515,plain,(((~ (~ (r1@sK28)))=$false)),inference(extcnf_or_neg,[status(thm)],[512])). thf(516,plain,(![SV1:$i]: (((p1@SV1)=$false) | ((![SX0:$i]: (r1@SX0))=$true))),inference(extcnf_not_pos,[status(thm)],[513])). thf(517,plain,(((p1@sK27)=$true)),inference(extcnf_not_neg,[status(thm)],[514])). thf(518,plain,(((~ (r1@sK28))=$true)),inference(extcnf_not_neg,[status(thm)],[515])). thf(519,plain,(![SV1:$i,SV2:$i]: (((r1@SV2)=$true) | ((p1@SV1)=$false))),inference(extcnf_forall_pos,[status(thm)],[516])). thf(520,plain,(((r1@sK28)=$false)),inference(extcnf_not_pos,[status(thm)],[518])). thf(521,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(p1,ft(i,o)),ti(sK27,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_517) 2 : :![X1]:![X2]:(lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_519) 3 : :~(lit(ti(at(ti(r1,ft(i,o)),ti(sK28,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_520) 4 : :![X1]:![X2]:(lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))) : fof_simplification(2) 5 : :~lit(ti(at(ti(r1,ft(i,o)),ti(sK28,i)),o)) : fof_simplification(3) # Garbage collection reclaimed 7 unused term cells. 6 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(sK27,i)),o))] : split_conjunct(1) 7 : :![X3]:![X4]:(lit(ti(at(ti(r1,ft(i,o)),ti(X4,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : variable_rename(4) 8 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(7) 9 : :[--lit(ti(at(ti(r1,ft(i,o)),ti(sK28,i)),o))] : split_conjunct(5) # Garbage collection reclaimed 20 unused term cells. # Auto-Ordering is analysing problem. # Problem is type HUNFGFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type HUNFGFFSF22MM # Auto-Mode selected heuristic H_____102_C18_F1_PI_AE_Q4_CS_SP_S1S # and selection function SelectComplexAHP. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 10 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))] : spm(8,6) 11 : :[++$true,--lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))] : rw(8,10) 12 : :[--$true] : rw(9,10) 13 : :[] : cn(12) 14 : :[] : 13 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 3 # Removed by relevancy pruning : 0 # Initial clauses : 3 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 3 # Processed clauses : 4 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 4 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 2 # Generated clauses : 1 # ...of the previous two non-trivial : 1 # Contextual simplify-reflections : 0 # Paramodulations : 1 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 2 # Positive orientable unit clauses : 2 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 5 # Indexed BW rewrite successes : 2 # Unification attempts : 7 # Unification successes : 3 # Backwards rewriting index : 15 leaves, 1.13+/-0.340 terms/leaf # Paramod-from index : 1 leaves, 2.00+/-0.000 terms/leaf # Paramod-into index : 14 leaves, 1.14+/-0.350 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2468 pages ),[status(thm)],[517,520,519])). thf(522,plain,((((p1@sK29) & (![Y:$i]: (~ (p1@Y))))=$true)),inference(copy,[status(thm)],[110])). thf(523,plain,(((~ ((~ (p1@sK29)) | (~ (![SX0:$i]: (~ (p1@SX0))))))=$true)),inference(unfold_def,[status(thm)],[522])). thf(524,plain,((((~ (p1@sK29)) | (~ (![SX0:$i]: (~ (p1@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[523])). thf(525,plain,(((~ (p1@sK29))=$false)),inference(extcnf_or_neg,[status(thm)],[524])). thf(526,plain,(((~ (![SX0:$i]: (~ (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[524])). thf(527,plain,(((p1@sK29)=$true)),inference(extcnf_not_neg,[status(thm)],[525])). thf(528,plain,(((![SX0:$i]: (~ (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[526])). thf(529,plain,(![SV1:$i]: (((~ (p1@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[528])). thf(530,plain,(![SV1:$i]: (((p1@SV1)=$false))),inference(extcnf_not_pos,[status(thm)],[529])). thf(531,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(p1,ft(i,o)),ti(sK29,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_527) 2 : :![X1]:~(lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_530) 3 : :![X1]:~lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : fof_simplification(2) # Garbage collection reclaimed 3 unused term cells. 4 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(sK29,i)),o))] : split_conjunct(1) 5 : :![X2]:~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(3) 6 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(5) # Garbage collection reclaimed 9 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 7 : :[] : sr(4,6) # SZS intermediate status Theorem # SZS answers Tuple [|_] 8 : :[] : eval_answer_literal(7) # Presaturation interreduction done 9 : :[] : 8 : 'proof' # Proof found! # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 2 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 0 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 10 leaves, 1.00+/-0.000 terms/leaf # Paramod-from index : 0 leaves, 0.00+/-0.000 terms/leaf # Paramod-into index : 9 leaves, 1.00+/-0.000 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2404 pages ),[status(thm)],[527,530])). thf(532,plain,((((![X:$i,Y:$i]: ((p@X)@Y)) & (~ ((p@sK30)@sK30)))=$true)),inference(copy,[status(thm)],[111])). thf(533,plain,(((~ ((~ (![SX0:$i,SX1:$i]: ((p@SX0)@SX1))) | (~ (~ ((p@sK30)@sK30)))))=$true)),inference(unfold_def,[status(thm)],[532])). thf(534,plain,((((~ (![SX0:$i,SX1:$i]: ((p@SX0)@SX1))) | (~ (~ ((p@sK30)@sK30))))=$false)),inference(extcnf_not_pos,[status(thm)],[533])). thf(535,plain,(((~ (![SX0:$i,SX1:$i]: ((p@SX0)@SX1)))=$false)),inference(extcnf_or_neg,[status(thm)],[534])). thf(536,plain,(((~ (~ ((p@sK30)@sK30)))=$false)),inference(extcnf_or_neg,[status(thm)],[534])). thf(537,plain,(((![SX0:$i,SX1:$i]: ((p@SX0)@SX1))=$true)),inference(extcnf_not_neg,[status(thm)],[535])). thf(538,plain,(((~ ((p@sK30)@sK30))=$true)),inference(extcnf_not_neg,[status(thm)],[536])). thf(539,plain,(![SV1:$i]: (((![SY279:$i]: ((p@SV1)@SY279))=$true))),inference(extcnf_forall_pos,[status(thm)],[537])). thf(540,plain,((((p@sK30)@sK30)=$false)),inference(extcnf_not_pos,[status(thm)],[538])). thf(541,plain,(![SV2:$i,SV1:$i]: ((((p@SV1)@SV2)=$true))),inference(extcnf_forall_pos,[status(thm)],[539])). thf(542,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :~(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(sK30,i)),ft(i,o)),ti(sK30,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_540) 2 : :![X1]:![X2]:lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_541) 3 : :~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(sK30,i)),ft(i,o)),ti(sK30,i)),o)) : fof_simplification(1) # Garbage collection reclaimed 2 unused term cells. 4 : :[--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(sK30,i)),ft(i,o)),ti(sK30,i)),o))] : split_conjunct(3) 5 : :![X3]:![X4]:lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X4,i)),ft(i,o)),ti(X3,i)),o)) : variable_rename(2) 6 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : split_conjunct(5) # Garbage collection reclaimed 19 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFGFFSF22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFGFFSF22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 7 : :[--$true] : rw(4,6) 8 : :[] : cn(7) # SZS intermediate status Theorem # SZS answers Tuple [|_] 9 : :[] : eval_answer_literal(8) # Presaturation interreduction done 10 : :[] : 9 : 'proof' # Proof found! # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 2 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 1 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 13 leaves, 1.08+/-0.266 terms/leaf # Paramod-from index : 1 leaves, 1.00+/-0.000 terms/leaf # Paramod-into index : 12 leaves, 1.08+/-0.276 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.003 s # Total time : 0.007 s # Maximum resident set size: 2424 pages ),[status(thm)],[540,541])). thf(543,plain,((((((~ (a0)) | (~ (b0))) & (a0 | b0)) & ((~ (a0)) & (~ (b0))))=$true)),inference(copy,[status(thm)],[112])). thf(544,plain,(((~ ((~ (~ ((~ ((~ (a0)) | (~ (b0)))) | (~ (a0 | b0))))) | (~ (~ ((~ (~ (a0))) | (~ (~ (b0))))))))=$true)),inference(unfold_def,[status(thm)],[543])). thf(545,plain,((((~ (~ ((~ ((~ (a0)) | (~ (b0)))) | (~ (a0 | b0))))) | (~ (~ ((~ (~ (a0))) | (~ (~ (b0)))))))=$false)),inference(extcnf_not_pos,[status(thm)],[544])). thf(546,plain,(((~ (~ ((~ ((~ (a0)) | (~ (b0)))) | (~ (a0 | b0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[545])). thf(547,plain,(((~ (~ ((~ (~ (a0))) | (~ (~ (b0))))))=$false)),inference(extcnf_or_neg,[status(thm)],[545])). thf(548,plain,(((~ ((~ ((~ (a0)) | (~ (b0)))) | (~ (a0 | b0))))=$true)),inference(extcnf_not_neg,[status(thm)],[546])). thf(549,plain,(((~ ((~ (~ (a0))) | (~ (~ (b0)))))=$true)),inference(extcnf_not_neg,[status(thm)],[547])). thf(550,plain,((((~ ((~ (a0)) | (~ (b0)))) | (~ (a0 | b0)))=$false)),inference(extcnf_not_pos,[status(thm)],[548])). thf(551,plain,((((~ (~ (a0))) | (~ (~ (b0))))=$false)),inference(extcnf_not_pos,[status(thm)],[549])). thf(553,plain,(((~ (a0 | b0))=$false)),inference(extcnf_or_neg,[status(thm)],[550])). thf(554,plain,(((~ (~ (a0)))=$false)),inference(extcnf_or_neg,[status(thm)],[551])). thf(555,plain,(((~ (~ (b0)))=$false)),inference(extcnf_or_neg,[status(thm)],[551])). thf(557,plain,(((a0 | b0)=$true)),inference(extcnf_not_neg,[status(thm)],[553])). thf(558,plain,(((~ (a0))=$true)),inference(extcnf_not_neg,[status(thm)],[554])). thf(559,plain,(((~ (b0))=$true)),inference(extcnf_not_neg,[status(thm)],[555])). thf(561,plain,(((a0)=$true) | ((b0)=$true)),inference(extcnf_or_pos,[status(thm)],[557])). thf(562,plain,(((a0)=$false)),inference(extcnf_not_pos,[status(thm)],[558])). thf(563,plain,(((b0)=$false)),inference(extcnf_not_pos,[status(thm)],[559])). thf(566,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :(lit(ti(b0,o))|lit(ti(a0,o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_561) 2 : :~(lit(ti(a0,o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_562) 3 : :~(lit(ti(b0,o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_563) 4 : :(~(lit(ti(b0,o)))|~(lit(ti(a0,o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_565) 5 : :~lit(ti(a0,o)) : fof_simplification(2) 6 : :~lit(ti(b0,o)) : fof_simplification(3) 7 : :(~lit(ti(b0,o))|~lit(ti(a0,o))) : fof_simplification(4) # Garbage collection reclaimed 3 unused term cells. 8 : :[++lit(ti(a0,o)),++lit(ti(b0,o))] : split_conjunct(1) 9 : :[--lit(ti(a0,o))] : split_conjunct(5) 10 : :[--lit(ti(b0,o))] : split_conjunct(6) 11 : :[--lit(ti(a0,o)),--lit(ti(b0,o))] : split_conjunct(7) # Auto-Ordering is analysing problem. # Problem is type GHNFGFFSF22SS # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type GHNFGFFSF22SS # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.007 s 12 : :[++lit(ti(a0,o))] : sr(8,10) 13 : :[] : sr(12,9) # SZS intermediate status Theorem # SZS answers Tuple [|_] 14 : :[] : eval_answer_literal(13) # Presaturation interreduction done 15 : :[] : 14 : 'proof' # Proof found! # Parsed axioms : 4 # Removed by relevancy pruning : 0 # Initial clauses : 4 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 4 # Processed clauses : 3 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 2 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 2 # Positive orientable unit clauses : 0 # Positive unorientable unit clauses: 0 # Negative unit clauses : 2 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 1 # ...number of literals in the above : 2 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 8 leaves, 1.00+/-0.000 terms/leaf # Paramod-from index : 0 leaves, 0.00+/-0.000 terms/leaf # Paramod-into index : 7 leaves, 1.00+/-0.000 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.003 s # Total time : 0.007 s # Maximum resident set size: 2448 pages ),[status(thm)],[561,563,562])). thf(567,plain,(((((![X:$i]: ((~ (p1@X)) | (q1@X))) & ((~ (q1@sK32)) | (r1@sK31))) & ((![Z:$i]: (p1@Z)) & (![Z:$i]: (~ (r1@Z)))))=$true)),inference(copy,[status(thm)],[113])). thf(568,plain,(((~ ((~ (~ ((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))) | (~ ((~ (q1@sK32)) | (r1@sK31)))))) | (~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (~ (r1@SX0)))))))))=$true)),inference(unfold_def,[status(thm)],[567])). thf(569,plain,((((~ (~ ((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))) | (~ ((~ (q1@sK32)) | (r1@sK31)))))) | (~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (~ (r1@SX0))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[568])). thf(570,plain,(((~ (~ ((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))) | (~ ((~ (q1@sK32)) | (r1@sK31))))))=$false)),inference(extcnf_or_neg,[status(thm)],[569])). thf(571,plain,(((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (~ (r1@SX0)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[569])). thf(572,plain,(((~ ((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))) | (~ ((~ (q1@sK32)) | (r1@sK31)))))=$true)),inference(extcnf_not_neg,[status(thm)],[570])). thf(573,plain,(((~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (~ (r1@SX0))))))=$true)),inference(extcnf_not_neg,[status(thm)],[571])). thf(574,plain,((((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))) | (~ ((~ (q1@sK32)) | (r1@sK31))))=$false)),inference(extcnf_not_pos,[status(thm)],[572])). thf(575,plain,((((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (~ (r1@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[573])). thf(576,plain,(((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[574])). thf(577,plain,(((~ ((~ (q1@sK32)) | (r1@sK31)))=$false)),inference(extcnf_or_neg,[status(thm)],[574])). thf(578,plain,(((~ (![SX0:$i]: (p1@SX0)))=$false)),inference(extcnf_or_neg,[status(thm)],[575])). thf(579,plain,(((~ (![SX0:$i]: (~ (r1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[575])). thf(580,plain,(((![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[576])). thf(581,plain,((((~ (q1@sK32)) | (r1@sK31))=$true)),inference(extcnf_not_neg,[status(thm)],[577])). thf(582,plain,(((![SX0:$i]: (p1@SX0))=$true)),inference(extcnf_not_neg,[status(thm)],[578])). thf(583,plain,(((![SX0:$i]: (~ (r1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[579])). thf(584,plain,(![SV1:$i]: ((((~ (p1@SV1)) | (q1@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[580])). thf(585,plain,(((~ (q1@sK32))=$true) | ((r1@sK31)=$true)),inference(extcnf_or_pos,[status(thm)],[581])). thf(586,plain,(![SV2:$i]: (((p1@SV2)=$true))),inference(extcnf_forall_pos,[status(thm)],[582])). thf(587,plain,(![SV3:$i]: (((~ (r1@SV3))=$true))),inference(extcnf_forall_pos,[status(thm)],[583])). thf(588,plain,(![SV1:$i]: (((~ (p1@SV1))=$true) | ((q1@SV1)=$true))),inference(extcnf_or_pos,[status(thm)],[584])). thf(589,plain,(((q1@sK32)=$false) | ((r1@sK31)=$true)),inference(extcnf_not_pos,[status(thm)],[585])). thf(590,plain,(![SV3:$i]: (((r1@SV3)=$false))),inference(extcnf_not_pos,[status(thm)],[587])). thf(591,plain,(![SV1:$i]: (((p1@SV1)=$false) | ((q1@SV1)=$true))),inference(extcnf_not_pos,[status(thm)],[588])). thf(592,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_586) 2 : :(lit(ti(at(ti(r1,ft(i,o)),ti(sK31,i)),o))|~(lit(ti(at(ti(q1,ft(i,o)),ti(sK32,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_589) 3 : :![X2]:~(lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_590) 4 : :![X3]:(lit(ti(at(ti(q1,ft(i,o)),ti(X3,i)),o))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_591) 5 : :(lit(ti(at(ti(r1,ft(i,o)),ti(sK31,i)),o))|~lit(ti(at(ti(q1,ft(i,o)),ti(sK32,i)),o))) : fof_simplification(2) 6 : :![X2]:~lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o)) : fof_simplification(3) 7 : :![X3]:(lit(ti(at(ti(q1,ft(i,o)),ti(X3,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : fof_simplification(4) # Garbage collection reclaimed 10 unused term cells. 8 : :![X2]:lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(1) 9 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(8) 10 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(sK31,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(sK32,i)),o))] : split_conjunct(5) 11 : :![X3]:~lit(ti(at(ti(r1,ft(i,o)),ti(X3,i)),o)) : variable_rename(6) 12 : :[--lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(11) 13 : :![X4]:(lit(ti(at(ti(q1,ft(i,o)),ti(X4,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X4,i)),o))) : variable_rename(7) 14 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(13) # Garbage collection reclaimed 43 unused term cells. # Auto-Ordering is analysing problem. # Problem is type HUNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type HUNFNFFSF22MM # Auto-Mode selected heuristic H_____102_C18_F1_PI_AE_Q4_CS_SP_S1S # and selection function SelectComplexAHP. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 15 : :[--lit(ti(at(ti(q1,ft(i,o)),ti(sK32,i)),o))] : sr(10,12) 16 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--$true] : rw(14,9) 17 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : cn(16) 18 : :[--$true] : rw(15,17) 19 : :[] : cn(18) 20 : :[] : 19 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 4 # Removed by relevancy pruning : 0 # Initial clauses : 4 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 4 # Processed clauses : 4 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 4 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 1 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 3 # Positive orientable unit clauses : 2 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 4 # Indexed BW rewrite successes : 1 # Unification attempts : 8 # Unification successes : 2 # Backwards rewriting index : 16 leaves, 1.25+/-0.661 terms/leaf # Paramod-from index : 1 leaves, 2.00+/-0.000 terms/leaf # Paramod-into index : 15 leaves, 1.27+/-0.680 terms/leaf # ------------------------------------------------- # User time : 0.000 s # System time : 0.003 s # Total time : 0.003 s # Maximum resident set size: 2456 pages ),[status(thm)],[586,591,590,589])). thf(593,plain,((((((r1@sK33) | (![Y:$i]: ((p@(f@Y))@Y))) & (![Y:$i]: ((~ (r1@Y)) | ((p@(f@Y))@Y)))) & ((((q@(f@sK33))@sK33) | (![X:$i,Y:$i]: (~ ((p@X)@Y)))) & (![X:$i,Y:$i]: ((~ ((q@X)@Y)) | (~ ((p@X)@Y))))))=$true)),inference(copy,[status(thm)],[114])). thf(594,plain,(((~ ((~ (~ ((~ ((r1@sK33) | (![SX0:$i]: ((p@(f@SX0))@SX0)))) | (~ (![SX0:$i]: ((~ (r1@SX0)) | ((p@(f@SX0))@SX0))))))) | (~ (~ ((~ (((q@(f@sK33))@sK33) | (![SX0:$i,SX1:$i]: (~ ((p@SX0)@SX1))))) | (~ (![SX0:$i,SX1:$i]: ((~ ((q@SX0)@SX1)) | (~ ((p@SX0)@SX1))))))))))=$true)),inference(unfold_def,[status(thm)],[593])). thf(595,plain,((((~ (~ ((~ ((r1@sK33) | (![SX0:$i]: ((p@(f@SX0))@SX0)))) | (~ (![SX0:$i]: ((~ (r1@SX0)) | ((p@(f@SX0))@SX0))))))) | (~ (~ ((~ (((q@(f@sK33))@sK33) | (![SX0:$i,SX1:$i]: (~ ((p@SX0)@SX1))))) | (~ (![SX0:$i,SX1:$i]: ((~ ((q@SX0)@SX1)) | (~ ((p@SX0)@SX1)))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[594])). thf(596,plain,(((~ (~ ((~ ((r1@sK33) | (![SX0:$i]: ((p@(f@SX0))@SX0)))) | (~ (![SX0:$i]: ((~ (r1@SX0)) | ((p@(f@SX0))@SX0)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[595])). thf(597,plain,(((~ (~ ((~ (((q@(f@sK33))@sK33) | (![SX0:$i,SX1:$i]: (~ ((p@SX0)@SX1))))) | (~ (![SX0:$i,SX1:$i]: ((~ ((q@SX0)@SX1)) | (~ ((p@SX0)@SX1))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[595])). thf(598,plain,(((~ ((~ ((r1@sK33) | (![SX0:$i]: ((p@(f@SX0))@SX0)))) | (~ (![SX0:$i]: ((~ (r1@SX0)) | ((p@(f@SX0))@SX0))))))=$true)),inference(extcnf_not_neg,[status(thm)],[596])). thf(599,plain,(((~ ((~ (((q@(f@sK33))@sK33) | (![SX0:$i,SX1:$i]: (~ ((p@SX0)@SX1))))) | (~ (![SX0:$i,SX1:$i]: ((~ ((q@SX0)@SX1)) | (~ ((p@SX0)@SX1)))))))=$true)),inference(extcnf_not_neg,[status(thm)],[597])). thf(600,plain,((((~ ((r1@sK33) | (![SX0:$i]: ((p@(f@SX0))@SX0)))) | (~ (![SX0:$i]: ((~ (r1@SX0)) | ((p@(f@SX0))@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[598])). thf(601,plain,((((~ (((q@(f@sK33))@sK33) | (![SX0:$i,SX1:$i]: (~ ((p@SX0)@SX1))))) | (~ (![SX0:$i,SX1:$i]: ((~ ((q@SX0)@SX1)) | (~ ((p@SX0)@SX1))))))=$false)),inference(extcnf_not_pos,[status(thm)],[599])). thf(602,plain,(((~ ((r1@sK33) | (![SX0:$i]: ((p@(f@SX0))@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[600])). thf(603,plain,(((~ (![SX0:$i]: ((~ (r1@SX0)) | ((p@(f@SX0))@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[600])). thf(604,plain,(((~ (((q@(f@sK33))@sK33) | (![SX0:$i,SX1:$i]: (~ ((p@SX0)@SX1)))))=$false)),inference(extcnf_or_neg,[status(thm)],[601])). thf(605,plain,(((~ (![SX0:$i,SX1:$i]: ((~ ((q@SX0)@SX1)) | (~ ((p@SX0)@SX1)))))=$false)),inference(extcnf_or_neg,[status(thm)],[601])). thf(606,plain,((((r1@sK33) | (![SX0:$i]: ((p@(f@SX0))@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[602])). thf(607,plain,(((![SX0:$i]: ((~ (r1@SX0)) | ((p@(f@SX0))@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[603])). thf(608,plain,(((((q@(f@sK33))@sK33) | (![SX0:$i,SX1:$i]: (~ ((p@SX0)@SX1))))=$true)),inference(extcnf_not_neg,[status(thm)],[604])). thf(609,plain,(((![SX0:$i,SX1:$i]: ((~ ((q@SX0)@SX1)) | (~ ((p@SX0)@SX1))))=$true)),inference(extcnf_not_neg,[status(thm)],[605])). thf(610,plain,(((r1@sK33)=$true) | ((![SX0:$i]: ((p@(f@SX0))@SX0))=$true)),inference(extcnf_or_pos,[status(thm)],[606])). thf(611,plain,(![SV1:$i]: ((((~ (r1@SV1)) | ((p@(f@SV1))@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[607])). thf(612,plain,((((q@(f@sK33))@sK33)=$true) | ((![SX0:$i,SX1:$i]: (~ ((p@SX0)@SX1)))=$true)),inference(extcnf_or_pos,[status(thm)],[608])). thf(613,plain,(![SV2:$i]: (((![SY280:$i]: ((~ ((q@SV2)@SY280)) | (~ ((p@SV2)@SY280))))=$true))),inference(extcnf_forall_pos,[status(thm)],[609])). thf(614,plain,(![SV3:$i]: ((((p@(f@SV3))@SV3)=$true) | ((r1@sK33)=$true))),inference(extcnf_forall_pos,[status(thm)],[610])). thf(615,plain,(![SV1:$i]: (((~ (r1@SV1))=$true) | (((p@(f@SV1))@SV1)=$true))),inference(extcnf_or_pos,[status(thm)],[611])). thf(616,plain,(![SV4:$i]: (((![SY281:$i]: (~ ((p@SV4)@SY281)))=$true) | (((q@(f@sK33))@sK33)=$true))),inference(extcnf_forall_pos,[status(thm)],[612])). thf(617,plain,(![SV5:$i,SV2:$i]: ((((~ ((q@SV2)@SV5)) | (~ ((p@SV2)@SV5)))=$true))),inference(extcnf_forall_pos,[status(thm)],[613])). thf(618,plain,(![SV1:$i]: (((r1@SV1)=$false) | (((p@(f@SV1))@SV1)=$true))),inference(extcnf_not_pos,[status(thm)],[615])). thf(619,plain,(![SV6:$i,SV4:$i]: (((~ ((p@SV4)@SV6))=$true) | (((q@(f@sK33))@sK33)=$true))),inference(extcnf_forall_pos,[status(thm)],[616])). thf(620,plain,(![SV5:$i,SV2:$i]: (((~ ((q@SV2)@SV5))=$true) | ((~ ((p@SV2)@SV5))=$true))),inference(extcnf_or_pos,[status(thm)],[617])). thf(621,plain,(![SV6:$i,SV4:$i]: ((((p@SV4)@SV6)=$false) | (((q@(f@sK33))@sK33)=$true))),inference(extcnf_not_pos,[status(thm)],[619])). thf(622,plain,(![SV5:$i,SV2:$i]: ((((p@SV2)@SV5)=$false) | ((~ ((q@SV2)@SV5))=$true))),inference(extcnf_not_pos,[status(thm)],[620])). thf(623,plain,(![SV5:$i,SV2:$i]: ((((q@SV2)@SV5)=$false) | (((p@SV2)@SV5)=$false))),inference(extcnf_not_pos,[status(thm)],[622])). thf(624,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X1,i)),o))|~(lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_618) 2 : :![X2]:![X3]:(lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(sK33,i)),i)),ft(i,o)),ti(sK33,i)),o))|~(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X2,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_621) 3 : :![X4]:![X5]:(~(lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X4,i)),o)))|~(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X4,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_623) 4 : :![X6]:(lit(ti(at(ti(r1,ft(i,o)),ti(sK33,i)),o))|lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(X6,i)),i)),ft(i,o)),ti(X6,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_614) 5 : :![X1]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X1,i)),o))|~lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))) : fof_simplification(1) 6 : :![X2]:![X3]:(lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(sK33,i)),i)),ft(i,o)),ti(sK33,i)),o))|~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X2,i)),o))) : fof_simplification(2) 7 : :![X4]:![X5]:(~lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X4,i)),o))|~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X4,i)),o))) : fof_simplification(3) # Garbage collection reclaimed 16 unused term cells. 8 : :![X2]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(X2,i)),i)),ft(i,o)),ti(X2,i)),o))|~lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o))) : variable_rename(5) 9 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(8) 10 : :![X4]:![X5]:(lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(sK33,i)),i)),ft(i,o)),ti(sK33,i)),o))|~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X4,i)),o))) : variable_rename(6) 11 : :[++lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(sK33,i)),i)),ft(i,o)),ti(sK33,i)),o)),--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : split_conjunct(10) 12 : :![X6]:![X7]:(~lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X7,i)),ft(i,o)),ti(X6,i)),o))|~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X7,i)),ft(i,o)),ti(X6,i)),o))) : variable_rename(7) 13 : :[--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : split_conjunct(12) 14 : :![X7]:(lit(ti(at(ti(r1,ft(i,o)),ti(sK33,i)),o))|lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(X7,i)),i)),ft(i,o)),ti(X7,i)),o))) : variable_rename(4) 15 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X1,i)),o)),++lit(ti(at(ti(r1,ft(i,o)),ti(sK33,i)),o))] : split_conjunct(14) # Garbage collection reclaimed 87 unused term cells. # Auto-Ordering is analysing problem. # Problem is type GHNFNFFSF22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type GHNFNFFSF22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.007 s # Presaturation interreduction done 16 : :[++lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(sK33,i)),i)),ft(i,o)),ti(sK33,i)),o)),++lit(ti(at(ti(r1,ft(i,o)),ti(sK33,i)),o))] : spm(11,15) 17 : :[++lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(sK33,i)),i)),ft(i,o)),ti(sK33,i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))] : spm(11,9) 18 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(sK33,i)),o)),--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(sK33,i)),i)),ft(i,o)),ti(sK33,i)),o))] : spm(13,16) 19 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(sK33,i)),o))] : csr(18,15) 20 : :[++lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(sK33,i)),i)),ft(i,o)),ti(sK33,i)),o)),++$true] : rw(16,19) 21 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X1,i)),o)),++$true] : rw(15,19) 22 : :[++lit(ti(at(ti(at(ti(q,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(sK33,i)),i)),ft(i,o)),ti(sK33,i)),o))] : spm(17,19) 23 : :[--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(at(ti(f,ft(i,i)),ti(sK33,i)),i)),ft(i,o)),ti(sK33,i)),o))] : spm(13,22) 24 : :[++$true,--lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))] : rw(17,22) 25 : :[++$true,--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : rw(11,22) 26 : :[--lit(ti(at(ti(r1,ft(i,o)),ti(sK33,i)),o))] : spm(23,9) 27 : :[--$true] : rw(26,19) 28 : :[] : cn(27) 29 : :[] : 28 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 4 # Removed by relevancy pruning : 0 # Initial clauses : 4 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 4 # Processed clauses : 13 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 13 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 4 # Generated clauses : 6 # ...of the previous two non-trivial : 5 # Contextual simplify-reflections : 1 # Paramodulations : 6 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 5 # Positive orientable unit clauses : 2 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 2 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 4 # Rec. Clause-clause subsumption calls : 4 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 12 # Indexed BW rewrite successes : 2 # Unification attempts : 29 # Unification successes : 10 # Backwards rewriting index : 31 leaves, 1.71+/-1.610 terms/leaf # Paramod-from index : 1 leaves, 3.00+/-0.000 terms/leaf # Paramod-into index : 28 leaves, 1.57+/-1.147 terms/leaf # ------------------------------------------------- # User time : 0.007 s # System time : 0.000 s # Total time : 0.007 s # Maximum resident set size: 2612 pages ),[status(thm)],[618,614,623,621])). thf(625,plain,(((((((((((![SY209:$i]: ((~ (q1@SY209)) | ((p@SY209)@sK34))) & (q1@sK34)) & (q1@sK35)) & (r1@sK34)) & (r1@sK35)) & (s1@sK34)) & ((~ (s1@sK34)) | (![X:$i,Y:$i]: ((p@X)@Y)))) & (![SY216:$i]: ((~ (r1@SY216)) | ((p@sK35)@SY216)))) & (~ ((p@sK34)@sK35)))=$true)),inference(copy,[status(thm)],[115])). thf(626,plain,(((~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | ((p@SX0)@sK34)))) | (~ (q1@sK34))))) | (~ (q1@sK35))))) | (~ (r1@sK34))))) | (~ (r1@sK35))))) | (~ (s1@sK34))))) | (~ ((~ (s1@sK34)) | (![SX0:$i,SX1:$i]: ((p@SX0)@SX1))))))) | (~ (![SX0:$i]: ((~ (r1@SX0)) | ((p@sK35)@SX0))))))) | (~ (~ ((p@sK34)@sK35)))))=$true)),inference(unfold_def,[status(thm)],[625])). thf(627,plain,((((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | ((p@SX0)@sK34)))) | (~ (q1@sK34))))) | (~ (q1@sK35))))) | (~ (r1@sK34))))) | (~ (r1@sK35))))) | (~ (s1@sK34))))) | (~ ((~ (s1@sK34)) | (![SX0:$i,SX1:$i]: ((p@SX0)@SX1))))))) | (~ (![SX0:$i]: ((~ (r1@SX0)) | ((p@sK35)@SX0))))))) | (~ (~ ((p@sK34)@sK35))))=$false)),inference(extcnf_not_pos,[status(thm)],[626])). thf(628,plain,(((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | ((p@SX0)@sK34)))) | (~ (q1@sK34))))) | (~ (q1@sK35))))) | (~ (r1@sK34))))) | (~ (r1@sK35))))) | (~ (s1@sK34))))) | (~ ((~ (s1@sK34)) | (![SX0:$i,SX1:$i]: ((p@SX0)@SX1))))))) | (~ (![SX0:$i]: ((~ (r1@SX0)) | ((p@sK35)@SX0)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[627])). thf(629,plain,(((~ (~ ((p@sK34)@sK35)))=$false)),inference(extcnf_or_neg,[status(thm)],[627])). thf(630,plain,(((~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | ((p@SX0)@sK34)))) | (~ (q1@sK34))))) | (~ (q1@sK35))))) | (~ (r1@sK34))))) | (~ (r1@sK35))))) | (~ (s1@sK34))))) | (~ ((~ (s1@sK34)) | (![SX0:$i,SX1:$i]: ((p@SX0)@SX1))))))) | (~ (![SX0:$i]: ((~ (r1@SX0)) | ((p@sK35)@SX0))))))=$true)),inference(extcnf_not_neg,[status(thm)],[628])). thf(631,plain,(((~ ((p@sK34)@sK35))=$true)),inference(extcnf_not_neg,[status(thm)],[629])). thf(632,plain,((((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | ((p@SX0)@sK34)))) | (~ (q1@sK34))))) | (~ (q1@sK35))))) | (~ (r1@sK34))))) | (~ (r1@sK35))))) | (~ (s1@sK34))))) | (~ ((~ (s1@sK34)) | (![SX0:$i,SX1:$i]: ((p@SX0)@SX1))))))) | (~ (![SX0:$i]: ((~ (r1@SX0)) | ((p@sK35)@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[630])). thf(633,plain,((((p@sK34)@sK35)=$false)),inference(extcnf_not_pos,[status(thm)],[631])). thf(634,plain,(((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | ((p@SX0)@sK34)))) | (~ (q1@sK34))))) | (~ (q1@sK35))))) | (~ (r1@sK34))))) | (~ (r1@sK35))))) | (~ (s1@sK34))))) | (~ ((~ (s1@sK34)) | (![SX0:$i,SX1:$i]: ((p@SX0)@SX1)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[632])). thf(636,plain,(((~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | ((p@SX0)@sK34)))) | (~ (q1@sK34))))) | (~ (q1@sK35))))) | (~ (r1@sK34))))) | (~ (r1@sK35))))) | (~ (s1@sK34))))) | (~ ((~ (s1@sK34)) | (![SX0:$i,SX1:$i]: ((p@SX0)@SX1))))))=$true)),inference(extcnf_not_neg,[status(thm)],[634])). thf(638,plain,((((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | ((p@SX0)@sK34)))) | (~ (q1@sK34))))) | (~ (q1@sK35))))) | (~ (r1@sK34))))) | (~ (r1@sK35))))) | (~ (s1@sK34))))) | (~ ((~ (s1@sK34)) | (![SX0:$i,SX1:$i]: ((p@SX0)@SX1)))))=$false)),inference(extcnf_not_pos,[status(thm)],[636])). thf(640,plain,(((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | ((p@SX0)@sK34)))) | (~ (q1@sK34))))) | (~ (q1@sK35))))) | (~ (r1@sK34))))) | (~ (r1@sK35))))) | (~ (s1@sK34)))))=$false)),inference(extcnf_or_neg,[status(thm)],[638])). thf(641,plain,(((~ ((~ (s1@sK34)) | (![SX0:$i,SX1:$i]: ((p@SX0)@SX1))))=$false)),inference(extcnf_or_neg,[status(thm)],[638])). thf(643,plain,(((~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | ((p@SX0)@sK34)))) | (~ (q1@sK34))))) | (~ (q1@sK35))))) | (~ (r1@sK34))))) | (~ (r1@sK35))))) | (~ (s1@sK34))))=$true)),inference(extcnf_not_neg,[status(thm)],[640])). thf(644,plain,((((~ (s1@sK34)) | (![SX0:$i,SX1:$i]: ((p@SX0)@SX1)))=$true)),inference(extcnf_not_neg,[status(thm)],[641])). thf(646,plain,((((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | ((p@SX0)@sK34)))) | (~ (q1@sK34))))) | (~ (q1@sK35))))) | (~ (r1@sK34))))) | (~ (r1@sK35))))) | (~ (s1@sK34)))=$false)),inference(extcnf_not_pos,[status(thm)],[643])). thf(647,plain,(((~ (s1@sK34))=$true) | ((![SX0:$i,SX1:$i]: ((p@SX0)@SX1))=$true)),inference(extcnf_or_pos,[status(thm)],[644])). thf(649,plain,(((~ (s1@sK34))=$false)),inference(extcnf_or_neg,[status(thm)],[646])). thf(650,plain,(((s1@sK34)=$false) | ((![SX0:$i,SX1:$i]: ((p@SX0)@SX1))=$true)),inference(extcnf_not_pos,[status(thm)],[647])). thf(652,plain,(((s1@sK34)=$true)),inference(extcnf_not_neg,[status(thm)],[649])). thf(653,plain,(![SV2:$i]: (((![SY282:$i]: ((p@SV2)@SY282))=$true) | ((s1@sK34)=$false))),inference(extcnf_forall_pos,[status(thm)],[650])). thf(655,plain,(![SV3:$i,SV2:$i]: ((((p@SV2)@SV3)=$true) | ((s1@sK34)=$false))),inference(extcnf_forall_pos,[status(thm)],[653])). thf(678,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(r1,ft(i,o)),ti(sK35,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_659) 2 : :lit(ti(at(ti(q1,ft(i,o)),ti(sK34,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_674) 3 : :lit(ti(at(ti(s1,ft(i,o)),ti(sK34,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_652) 4 : :lit(ti(at(ti(r1,ft(i,o)),ti(sK34,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_664) 5 : :![X1]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK34,i)),o))|~(lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_677) 6 : :![X2]:![X3]:(~(lit(ti(at(ti(s1,ft(i,o)),ti(sK34,i)),o)))|lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X2,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_655) 7 : :~(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(sK34,i)),ft(i,o)),ti(sK35,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_633) 8 : :![X4]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(sK35,i)),ft(i,o)),ti(X4,i)),o))|~(lit(ti(at(ti(r1,ft(i,o)),ti(X4,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_645) 9 : :lit(ti(at(ti(q1,ft(i,o)),ti(sK35,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_669) 10 : :![X1]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK34,i)),o))|~lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))) : fof_simplification(5) 11 : :![X2]:![X3]:(~lit(ti(at(ti(s1,ft(i,o)),ti(sK34,i)),o))|lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X2,i)),o))) : fof_simplification(6) 12 : :~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(sK34,i)),ft(i,o)),ti(sK35,i)),o)) : fof_simplification(7) 13 : :![X4]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(sK35,i)),ft(i,o)),ti(X4,i)),o))|~lit(ti(at(ti(r1,ft(i,o)),ti(X4,i)),o))) : fof_simplification(8) # Garbage collection reclaimed 14 unused term cells. 14 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(sK35,i)),o))] : split_conjunct(1) 15 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(sK34,i)),o))] : split_conjunct(2) 16 : :[++lit(ti(at(ti(s1,ft(i,o)),ti(sK34,i)),o))] : split_conjunct(3) 17 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(sK34,i)),o))] : split_conjunct(4) 18 : :![X2]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(sK34,i)),o))|~lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))) : variable_rename(10) 19 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK34,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(18) 20 : :![X4]:![X5]:(~lit(ti(at(ti(s1,ft(i,o)),ti(sK34,i)),o))|lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X4,i)),o))) : variable_rename(11) 21 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(s1,ft(i,o)),ti(sK34,i)),o))] : split_conjunct(20) 22 : :[--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(sK34,i)),ft(i,o)),ti(sK35,i)),o))] : split_conjunct(12) 23 : :![X5]:(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(sK35,i)),ft(i,o)),ti(X5,i)),o))|~lit(ti(at(ti(r1,ft(i,o)),ti(X5,i)),o))) : variable_rename(13) 24 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(sK35,i)),ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(23) 25 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(sK35,i)),o))] : split_conjunct(9) # Garbage collection reclaimed 64 unused term cells. # Auto-Ordering is analysing problem. # Problem is type HUNFGFFSS22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type HUNFGFFSS22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 26 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),--$true] : rw(21,16) 27 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : cn(26) 28 : :[++$true,--lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))] : rw(24,27) 29 : :[--$true] : rw(22,27) 30 : :[] : cn(29) # SZS intermediate status Theorem # SZS answers Tuple [|_] 31 : :[] : eval_answer_literal(30) # Presaturation interreduction done 32 : :[] : 31 : 'proof' # Proof found! # Parsed axioms : 9 # Removed by relevancy pruning : 0 # Initial clauses : 9 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 9 # Processed clauses : 8 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 7 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 1 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 6 # Positive orientable unit clauses : 6 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 1 # ...number of literals in the above : 2 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 17 # Indexed BW rewrite successes : 1 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 28 leaves, 1.39+/-1.291 terms/leaf # Paramod-from index : 1 leaves, 6.00+/-0.000 terms/leaf # Paramod-into index : 27 leaves, 1.41+/-1.313 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2556 pages ),[status(thm)],[652,633,655])). thf(679,plain,((((a0 & b0) & (((~ (a0)) | (~ (b0))) & (a0 | b0)))=$true)),inference(copy,[status(thm)],[116])). thf(680,plain,(((~ ((~ (~ ((~ (a0)) | (~ (b0))))) | (~ (~ ((~ ((~ (a0)) | (~ (b0)))) | (~ (a0 | b0)))))))=$true)),inference(unfold_def,[status(thm)],[679])). thf(681,plain,((((~ (~ ((~ (a0)) | (~ (b0))))) | (~ (~ ((~ ((~ (a0)) | (~ (b0)))) | (~ (a0 | b0))))))=$false)),inference(extcnf_not_pos,[status(thm)],[680])). thf(682,plain,(((~ (~ ((~ (a0)) | (~ (b0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[681])). thf(683,plain,(((~ (~ ((~ ((~ (a0)) | (~ (b0)))) | (~ (a0 | b0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[681])). thf(684,plain,(((~ ((~ (a0)) | (~ (b0))))=$true)),inference(extcnf_not_neg,[status(thm)],[682])). thf(685,plain,(((~ ((~ ((~ (a0)) | (~ (b0)))) | (~ (a0 | b0))))=$true)),inference(extcnf_not_neg,[status(thm)],[683])). thf(686,plain,((((~ (a0)) | (~ (b0)))=$false)),inference(extcnf_not_pos,[status(thm)],[684])). thf(687,plain,((((~ ((~ (a0)) | (~ (b0)))) | (~ (a0 | b0)))=$false)),inference(extcnf_not_pos,[status(thm)],[685])). thf(688,plain,(((~ (a0))=$false)),inference(extcnf_or_neg,[status(thm)],[686])). thf(689,plain,(((~ (b0))=$false)),inference(extcnf_or_neg,[status(thm)],[686])). thf(690,plain,(((~ ((~ (a0)) | (~ (b0))))=$false)),inference(extcnf_or_neg,[status(thm)],[687])). thf(692,plain,(((a0)=$true)),inference(extcnf_not_neg,[status(thm)],[688])). thf(693,plain,(((b0)=$true)),inference(extcnf_not_neg,[status(thm)],[689])). thf(694,plain,((((~ (a0)) | (~ (b0)))=$true)),inference(extcnf_not_neg,[status(thm)],[690])). thf(696,plain,(((~ (a0))=$true) | ((~ (b0))=$true)),inference(extcnf_or_pos,[status(thm)],[694])). thf(698,plain,(((a0)=$false) | ((~ (b0))=$true)),inference(extcnf_not_pos,[status(thm)],[696])). thf(699,plain,(((b0)=$false) | ((a0)=$false)),inference(extcnf_not_pos,[status(thm)],[698])). thf(700,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(b0,o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_693) 2 : :(lit(ti(b0,o))|lit(ti(a0,o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_697) 3 : :(~(lit(ti(b0,o)))|~(lit(ti(a0,o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_699) 4 : :lit(ti(a0,o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_692) 5 : :(~lit(ti(b0,o))|~lit(ti(a0,o))) : fof_simplification(3) # Garbage collection reclaimed 3 unused term cells. 6 : :[++lit(ti(b0,o))] : split_conjunct(1) 7 : :[++lit(ti(a0,o)),++lit(ti(b0,o))] : split_conjunct(2) 8 : :[--lit(ti(a0,o)),--lit(ti(b0,o))] : split_conjunct(5) 9 : :[++lit(ti(a0,o))] : split_conjunct(4) # Auto-Ordering is analysing problem. # Problem is type GHNFGFFSS22SS # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type GHNFGFFSS22SS # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 10 : :[++$true,++lit(ti(a0,o))] : rw(7,6) 11 : :[++$true,++$true] : rw(10,9) 12 : :[++$true] : cn(11) 13 : :[--$true,--lit(ti(a0,o))] : rw(8,6) 14 : :[--$true,--$true] : rw(13,9) 15 : :[] : cn(14) # SZS intermediate status Theorem # SZS answers Tuple [|_] 16 : :[] : eval_answer_literal(15) # Presaturation interreduction done 17 : :[] : 16 : 'proof' # Proof found! # Parsed axioms : 4 # Removed by relevancy pruning : 0 # Initial clauses : 4 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 4 # Processed clauses : 4 # ...of these trivial : 1 # ...subsumed : 0 # ...remaining for further processing : 2 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 2 # Positive orientable unit clauses : 2 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 8 leaves, 1.00+/-0.000 terms/leaf # Paramod-from index : 2 leaves, 1.00+/-0.000 terms/leaf # Paramod-into index : 7 leaves, 1.00+/-0.000 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2424 pages ),[status(thm)],[693,692,699])). thf(701,plain,((((((![X:$i]: (p1@X)) & (![X:$i]: (q1@X))) & (f0 | g0)) & (~ (q1@sK36)))=$true)),inference(copy,[status(thm)],[117])). thf(702,plain,(((~ ((~ (~ ((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (q1@SX0)))))) | (~ (f0 | g0))))) | (~ (~ (q1@sK36)))))=$true)),inference(unfold_def,[status(thm)],[701])). thf(703,plain,((((~ (~ ((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (q1@SX0)))))) | (~ (f0 | g0))))) | (~ (~ (q1@sK36))))=$false)),inference(extcnf_not_pos,[status(thm)],[702])). thf(704,plain,(((~ (~ ((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (q1@SX0)))))) | (~ (f0 | g0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[703])). thf(705,plain,(((~ (~ (q1@sK36)))=$false)),inference(extcnf_or_neg,[status(thm)],[703])). thf(706,plain,(((~ ((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (q1@SX0)))))) | (~ (f0 | g0))))=$true)),inference(extcnf_not_neg,[status(thm)],[704])). thf(707,plain,(((~ (q1@sK36))=$true)),inference(extcnf_not_neg,[status(thm)],[705])). thf(708,plain,((((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (q1@SX0)))))) | (~ (f0 | g0)))=$false)),inference(extcnf_not_pos,[status(thm)],[706])). thf(709,plain,(((q1@sK36)=$false)),inference(extcnf_not_pos,[status(thm)],[707])). thf(710,plain,(((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (q1@SX0))))))=$false)),inference(extcnf_or_neg,[status(thm)],[708])). thf(712,plain,(((~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (q1@SX0)))))=$true)),inference(extcnf_not_neg,[status(thm)],[710])). thf(714,plain,((((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (q1@SX0))))=$false)),inference(extcnf_not_pos,[status(thm)],[712])). thf(717,plain,(((~ (![SX0:$i]: (q1@SX0)))=$false)),inference(extcnf_or_neg,[status(thm)],[714])). thf(719,plain,(((![SX0:$i]: (q1@SX0))=$true)),inference(extcnf_not_neg,[status(thm)],[717])). thf(721,plain,(![SV2:$i]: (((q1@SV2)=$true))),inference(extcnf_forall_pos,[status(thm)],[719])). thf(722,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :(lit(ti(g0,o))|lit(ti(f0,o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_715) 2 : :![X1]:lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_720) 3 : :![X2]:lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_721) 4 : :~(lit(ti(at(ti(q1,ft(i,o)),ti(sK36,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_709) 5 : :~lit(ti(at(ti(q1,ft(i,o)),ti(sK36,i)),o)) : fof_simplification(4) # Garbage collection reclaimed 2 unused term cells. 6 : :[++lit(ti(f0,o)),++lit(ti(g0,o))] : split_conjunct(1) 7 : :![X2]:lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(2) 8 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(7) 9 : :![X3]:lit(ti(at(ti(q1,ft(i,o)),ti(X3,i)),o)) : variable_rename(3) 10 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(9) 11 : :[--lit(ti(at(ti(q1,ft(i,o)),ti(sK36,i)),o))] : split_conjunct(5) # Garbage collection reclaimed 23 unused term cells. # Auto-Ordering is analysing problem. # Problem is type GUNSGFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type GUNSGFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 12 : :[--$true] : rw(11,10) 13 : :[] : cn(12) # SZS intermediate status Theorem # SZS answers Tuple [|_] 14 : :[] : eval_answer_literal(13) # Presaturation interreduction done 15 : :[] : 14 : 'proof' # Proof found! # Parsed axioms : 4 # Removed by relevancy pruning : 0 # Initial clauses : 4 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 4 # Processed clauses : 4 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 3 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 3 # Positive orientable unit clauses : 2 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 1 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 1 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 19 leaves, 1.11+/-0.307 terms/leaf # Paramod-from index : 2 leaves, 1.50+/-0.500 terms/leaf # Paramod-into index : 15 leaves, 1.13+/-0.340 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.003 s # Total time : 0.007 s # Maximum resident set size: 2484 pages ),[status(thm)],[721,709])). thf(723,plain,(((~ ($true))=$true)),inference(copy,[status(thm)],[118])). thf(724,plain,((($true)=$false)),inference(extcnf_not_pos,[status(thm)],[723])). thf(725,plain,((($false)=$true)),inference(sim,[status(thm)],[724])). thf(726,plain,((((![SY218:$i]: ((p@sK38)@SY218)) & (![SY217:$i]: (~ ((p@SY217)@sK37))))=$true)),inference(copy,[status(thm)],[119])). thf(727,plain,(((~ ((~ (![SX0:$i]: ((p@sK38)@SX0))) | (~ (![SX0:$i]: (~ ((p@SX0)@sK37))))))=$true)),inference(unfold_def,[status(thm)],[726])). thf(728,plain,((((~ (![SX0:$i]: ((p@sK38)@SX0))) | (~ (![SX0:$i]: (~ ((p@SX0)@sK37)))))=$false)),inference(extcnf_not_pos,[status(thm)],[727])). thf(729,plain,(((~ (![SX0:$i]: ((p@sK38)@SX0)))=$false)),inference(extcnf_or_neg,[status(thm)],[728])). thf(730,plain,(((~ (![SX0:$i]: (~ ((p@SX0)@sK37))))=$false)),inference(extcnf_or_neg,[status(thm)],[728])). thf(731,plain,(((![SX0:$i]: ((p@sK38)@SX0))=$true)),inference(extcnf_not_neg,[status(thm)],[729])). thf(732,plain,(((![SX0:$i]: (~ ((p@SX0)@sK37)))=$true)),inference(extcnf_not_neg,[status(thm)],[730])). thf(733,plain,(![SV1:$i]: ((((p@sK38)@SV1)=$true))),inference(extcnf_forall_pos,[status(thm)],[731])). thf(734,plain,(![SV2:$i]: (((~ ((p@SV2)@sK37))=$true))),inference(extcnf_forall_pos,[status(thm)],[732])). thf(735,plain,(![SV2:$i]: ((((p@SV2)@sK37)=$false))),inference(extcnf_not_pos,[status(thm)],[734])). thf(736,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(sK38,i)),ft(i,o)),ti(X1,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_733) 2 : :![X2]:~(lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(sK37,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_735) 3 : :![X2]:~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(sK37,i)),o)) : fof_simplification(2) # Garbage collection reclaimed 3 unused term cells. 4 : :![X2]:lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(sK38,i)),ft(i,o)),ti(X2,i)),o)) : variable_rename(1) 5 : :[++lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(sK38,i)),ft(i,o)),ti(X1,i)),o))] : split_conjunct(4) 6 : :![X3]:~lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(sK37,i)),o)) : variable_rename(3) 7 : :[--lit(ti(at(ti(at(ti(p,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK37,i)),o))] : split_conjunct(6) # Garbage collection reclaimed 23 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFNFFSF22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFNFFSF22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s # Presaturation interreduction done 8 : :[] : spm(7,5) 9 : :[] : 8 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 4 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 4 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 1 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 1 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 2 # Positive orientable unit clauses : 1 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 3 # Unification successes : 2 # Backwards rewriting index : 19 leaves, 1.16+/-0.365 terms/leaf # Paramod-from index : 1 leaves, 1.00+/-0.000 terms/leaf # Paramod-into index : 18 leaves, 1.17+/-0.373 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2456 pages ),[status(thm)],[733,735])). thf(737,plain,((((p1@sK39) & (![Y:$i]: (~ (p1@Y))))=$true)),inference(copy,[status(thm)],[120])). thf(738,plain,(((~ ((~ (p1@sK39)) | (~ (![SX0:$i]: (~ (p1@SX0))))))=$true)),inference(unfold_def,[status(thm)],[737])). thf(739,plain,((((~ (p1@sK39)) | (~ (![SX0:$i]: (~ (p1@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[738])). thf(740,plain,(((~ (p1@sK39))=$false)),inference(extcnf_or_neg,[status(thm)],[739])). thf(741,plain,(((~ (![SX0:$i]: (~ (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[739])). thf(742,plain,(((p1@sK39)=$true)),inference(extcnf_not_neg,[status(thm)],[740])). thf(743,plain,(((![SX0:$i]: (~ (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[741])). thf(744,plain,(![SV1:$i]: (((~ (p1@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[743])). thf(745,plain,(![SV1:$i]: (((p1@SV1)=$false))),inference(extcnf_not_pos,[status(thm)],[744])). thf(746,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(p1,ft(i,o)),ti(sK39,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_742) 2 : :![X1]:~(lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_745) 3 : :![X1]:~lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : fof_simplification(2) # Garbage collection reclaimed 3 unused term cells. 4 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(sK39,i)),o))] : split_conjunct(1) 5 : :![X2]:~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(3) 6 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(5) # Garbage collection reclaimed 9 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 7 : :[] : sr(4,6) # SZS intermediate status Theorem # SZS answers Tuple [|_] 8 : :[] : eval_answer_literal(7) # Presaturation interreduction done 9 : :[] : 8 : 'proof' # Proof found! # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 2 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 0 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 10 leaves, 1.00+/-0.000 terms/leaf # Paramod-from index : 0 leaves, 0.00+/-0.000 terms/leaf # Paramod-into index : 9 leaves, 1.00+/-0.000 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2412 pages ),[status(thm)],[742,745])). thf(747,plain,(((((![X:$i]: ((~ (p1@X)) | (q1@X))) & (r1@sK40)) & ((![Y:$i]: ((~ (r1@Y)) | (p1@Y))) & (~ (q1@sK40))))=$true)),inference(copy,[status(thm)],[121])). thf(748,plain,(((~ ((~ (~ ((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))) | (~ (r1@sK40))))) | (~ (~ ((~ (![SX0:$i]: ((~ (r1@SX0)) | (p1@SX0)))) | (~ (~ (q1@sK40))))))))=$true)),inference(unfold_def,[status(thm)],[747])). thf(749,plain,((((~ (~ ((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))) | (~ (r1@sK40))))) | (~ (~ ((~ (![SX0:$i]: ((~ (r1@SX0)) | (p1@SX0)))) | (~ (~ (q1@sK40)))))))=$false)),inference(extcnf_not_pos,[status(thm)],[748])). thf(750,plain,(((~ (~ ((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))) | (~ (r1@sK40)))))=$false)),inference(extcnf_or_neg,[status(thm)],[749])). thf(751,plain,(((~ (~ ((~ (![SX0:$i]: ((~ (r1@SX0)) | (p1@SX0)))) | (~ (~ (q1@sK40))))))=$false)),inference(extcnf_or_neg,[status(thm)],[749])). thf(752,plain,(((~ ((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))) | (~ (r1@sK40))))=$true)),inference(extcnf_not_neg,[status(thm)],[750])). thf(753,plain,(((~ ((~ (![SX0:$i]: ((~ (r1@SX0)) | (p1@SX0)))) | (~ (~ (q1@sK40)))))=$true)),inference(extcnf_not_neg,[status(thm)],[751])). thf(754,plain,((((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))) | (~ (r1@sK40)))=$false)),inference(extcnf_not_pos,[status(thm)],[752])). thf(755,plain,((((~ (![SX0:$i]: ((~ (r1@SX0)) | (p1@SX0)))) | (~ (~ (q1@sK40))))=$false)),inference(extcnf_not_pos,[status(thm)],[753])). thf(756,plain,(((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[754])). thf(757,plain,(((~ (r1@sK40))=$false)),inference(extcnf_or_neg,[status(thm)],[754])). thf(758,plain,(((~ (![SX0:$i]: ((~ (r1@SX0)) | (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[755])). thf(759,plain,(((~ (~ (q1@sK40)))=$false)),inference(extcnf_or_neg,[status(thm)],[755])). thf(760,plain,(((![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[756])). thf(761,plain,(((r1@sK40)=$true)),inference(extcnf_not_neg,[status(thm)],[757])). thf(762,plain,(((![SX0:$i]: ((~ (r1@SX0)) | (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[758])). thf(763,plain,(((~ (q1@sK40))=$true)),inference(extcnf_not_neg,[status(thm)],[759])). thf(764,plain,(![SV1:$i]: ((((~ (p1@SV1)) | (q1@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[760])). thf(765,plain,(![SV2:$i]: ((((~ (r1@SV2)) | (p1@SV2))=$true))),inference(extcnf_forall_pos,[status(thm)],[762])). thf(766,plain,(((q1@sK40)=$false)),inference(extcnf_not_pos,[status(thm)],[763])). thf(767,plain,(![SV1:$i]: (((~ (p1@SV1))=$true) | ((q1@SV1)=$true))),inference(extcnf_or_pos,[status(thm)],[764])). thf(768,plain,(![SV2:$i]: (((~ (r1@SV2))=$true) | ((p1@SV2)=$true))),inference(extcnf_or_pos,[status(thm)],[765])). thf(769,plain,(![SV1:$i]: (((p1@SV1)=$false) | ((q1@SV1)=$true))),inference(extcnf_not_pos,[status(thm)],[767])). thf(770,plain,(![SV2:$i]: (((r1@SV2)=$false) | ((p1@SV2)=$true))),inference(extcnf_not_pos,[status(thm)],[768])). thf(771,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:(~(lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_770) 2 : :![X2]:(lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_769) 3 : :lit(ti(at(ti(r1,ft(i,o)),ti(sK40,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_761) 4 : :~(lit(ti(at(ti(q1,ft(i,o)),ti(sK40,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_766) 5 : :![X1]:(~lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))) : fof_simplification(1) 6 : :![X2]:(lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : fof_simplification(2) 7 : :~lit(ti(at(ti(q1,ft(i,o)),ti(sK40,i)),o)) : fof_simplification(4) # Garbage collection reclaimed 10 unused term cells. 8 : :![X2]:(~lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : variable_rename(5) 9 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(8) 10 : :![X3]:(lit(ti(at(ti(q1,ft(i,o)),ti(X3,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : variable_rename(6) 11 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(10) 12 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(sK40,i)),o))] : split_conjunct(3) 13 : :[--lit(ti(at(ti(q1,ft(i,o)),ti(sK40,i)),o))] : split_conjunct(7) # Garbage collection reclaimed 35 unused term cells. # Auto-Ordering is analysing problem. # Problem is type HUNFGFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type HUNFGFFSF22MM # Auto-Mode selected heuristic H_____102_C18_F1_PI_AE_Q4_CS_SP_S1S # and selection function SelectComplexAHP. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 14 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(sK40,i)),o))] : spm(9,12) 15 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(sK40,i)),o))] : spm(11,14) 16 : :[] : sr(15,13) 17 : :[] : 16 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 4 # Removed by relevancy pruning : 0 # Initial clauses : 4 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 4 # Processed clauses : 5 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 5 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 2 # ...of the previous two non-trivial : 1 # Contextual simplify-reflections : 0 # Paramodulations : 2 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 5 # Positive orientable unit clauses : 2 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 2 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 6 # Indexed BW rewrite successes : 0 # Unification attempts : 12 # Unification successes : 4 # Backwards rewriting index : 21 leaves, 1.48+/-1.468 terms/leaf # Paramod-from index : 1 leaves, 2.00+/-0.000 terms/leaf # Paramod-into index : 19 leaves, 1.42+/-1.228 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2476 pages ),[status(thm)],[770,766,761,769])). thf(772,plain,((((![Y:$i]: ((~ (q1@Y)) | (p1@Y))) & (((![X:$i]: ((q1@X) | (p1@X))) & ((![X:$i]: (q1@X)) | (~ (p1@sK41)))) & (((~ (p1@sK42)) | (![X:$i]: (p1@X))) & ((~ (p1@sK42)) | (~ (p1@sK41))))))=$true)),inference(copy,[status(thm)],[122])). thf(773,plain,(((~ ((~ (![SX0:$i]: ((~ (q1@SX0)) | (p1@SX0)))) | (~ (~ ((~ (~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK41))))))) | (~ (~ ((~ ((~ (p1@sK42)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK42)) | (~ (p1@sK41))))))))))))=$true)),inference(unfold_def,[status(thm)],[772])). thf(774,plain,((((~ (![SX0:$i]: ((~ (q1@SX0)) | (p1@SX0)))) | (~ (~ ((~ (~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK41))))))) | (~ (~ ((~ ((~ (p1@sK42)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK42)) | (~ (p1@sK41)))))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[773])). thf(775,plain,(((~ (![SX0:$i]: ((~ (q1@SX0)) | (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[774])). thf(776,plain,(((~ (~ ((~ (~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK41))))))) | (~ (~ ((~ ((~ (p1@sK42)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK42)) | (~ (p1@sK41))))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[774])). thf(777,plain,(((![SX0:$i]: ((~ (q1@SX0)) | (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[775])). thf(778,plain,(((~ ((~ (~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK41))))))) | (~ (~ ((~ ((~ (p1@sK42)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK42)) | (~ (p1@sK41)))))))))=$true)),inference(extcnf_not_neg,[status(thm)],[776])). thf(779,plain,(![SV1:$i]: ((((~ (q1@SV1)) | (p1@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[777])). thf(780,plain,((((~ (~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK41))))))) | (~ (~ ((~ ((~ (p1@sK42)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK42)) | (~ (p1@sK41))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[778])). thf(781,plain,(![SV1:$i]: (((~ (q1@SV1))=$true) | ((p1@SV1)=$true))),inference(extcnf_or_pos,[status(thm)],[779])). thf(782,plain,(((~ (~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK41)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[780])). thf(783,plain,(((~ (~ ((~ ((~ (p1@sK42)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK42)) | (~ (p1@sK41)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[780])). thf(784,plain,(![SV1:$i]: (((q1@SV1)=$false) | ((p1@SV1)=$true))),inference(extcnf_not_pos,[status(thm)],[781])). thf(785,plain,(((~ ((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK41))))))=$true)),inference(extcnf_not_neg,[status(thm)],[782])). thf(786,plain,(((~ ((~ ((~ (p1@sK42)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK42)) | (~ (p1@sK41))))))=$true)),inference(extcnf_not_neg,[status(thm)],[783])). thf(787,plain,((((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0)))) | (~ ((![SX0:$i]: (q1@SX0)) | (~ (p1@sK41)))))=$false)),inference(extcnf_not_pos,[status(thm)],[785])). thf(788,plain,((((~ ((~ (p1@sK42)) | (![SX0:$i]: (p1@SX0)))) | (~ ((~ (p1@sK42)) | (~ (p1@sK41)))))=$false)),inference(extcnf_not_pos,[status(thm)],[786])). thf(789,plain,(((~ (![SX0:$i]: ((q1@SX0) | (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[787])). thf(792,plain,(((~ ((~ (p1@sK42)) | (~ (p1@sK41))))=$false)),inference(extcnf_or_neg,[status(thm)],[788])). thf(793,plain,(((![SX0:$i]: ((q1@SX0) | (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[789])). thf(796,plain,((((~ (p1@sK42)) | (~ (p1@sK41)))=$true)),inference(extcnf_not_neg,[status(thm)],[792])). thf(797,plain,(![SV2:$i]: ((((q1@SV2) | (p1@SV2))=$true))),inference(extcnf_forall_pos,[status(thm)],[793])). thf(800,plain,(((~ (p1@sK42))=$true) | ((~ (p1@sK41))=$true)),inference(extcnf_or_pos,[status(thm)],[796])). thf(801,plain,(![SV2:$i]: (((q1@SV2)=$true) | ((p1@SV2)=$true))),inference(extcnf_or_pos,[status(thm)],[797])). thf(804,plain,(((p1@sK41)=$false) | ((~ (p1@sK42))=$true)),inference(extcnf_not_pos,[status(thm)],[800])). thf(807,plain,(((p1@sK42)=$false) | ((p1@sK41)=$false)),inference(extcnf_not_pos,[status(thm)],[804])). thf(808,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:(~(lit(ti(at(ti(p1,ft(i,o)),ti(sK41,i)),o)))|lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_805) 2 : :![X2]:(~(lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_784) 3 : :![X3]:(~(lit(ti(at(ti(p1,ft(i,o)),ti(sK42,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_806) 4 : :(~(lit(ti(at(ti(p1,ft(i,o)),ti(sK42,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(sK41,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_807) 5 : :![X4]:(lit(ti(at(ti(q1,ft(i,o)),ti(X4,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X4,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_801) 6 : :![X1]:(~lit(ti(at(ti(p1,ft(i,o)),ti(sK41,i)),o))|lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))) : fof_simplification(1) 7 : :![X2]:(~lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : fof_simplification(2) 8 : :![X3]:(~lit(ti(at(ti(p1,ft(i,o)),ti(sK42,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : fof_simplification(3) 9 : :(~lit(ti(at(ti(p1,ft(i,o)),ti(sK42,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(sK41,i)),o))) : fof_simplification(4) # Garbage collection reclaimed 13 unused term cells. 10 : :![X2]:(~lit(ti(at(ti(p1,ft(i,o)),ti(sK41,i)),o))|lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))) : variable_rename(6) 11 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(sK41,i)),o))] : split_conjunct(10) 12 : :![X3]:(~lit(ti(at(ti(q1,ft(i,o)),ti(X3,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : variable_rename(7) 13 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(12) 14 : :![X4]:(~lit(ti(at(ti(p1,ft(i,o)),ti(sK42,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X4,i)),o))) : variable_rename(8) 15 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(sK42,i)),o))] : split_conjunct(14) 16 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(sK41,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(sK42,i)),o))] : split_conjunct(9) 17 : :![X5]:(lit(ti(at(ti(q1,ft(i,o)),ti(X5,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X5,i)),o))) : variable_rename(5) 18 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(17) # Garbage collection reclaimed 57 unused term cells. # Auto-Ordering is analysing problem. # Problem is type GHNFGFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type GHNFGFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.007 s 19 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : csr(13,18) 20 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),++$true] : rw(18,19) 21 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--$true] : rw(11,19) 22 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : cn(21) 23 : :[--$true,--lit(ti(at(ti(p1,ft(i,o)),ti(sK42,i)),o))] : rw(16,19) 24 : :[--$true,--$true] : rw(23,19) 25 : :[] : cn(24) # SZS intermediate status Theorem # SZS answers Tuple [|_] 26 : :[] : eval_answer_literal(25) # Presaturation interreduction done 27 : :[] : 26 : 'proof' # Proof found! # Parsed axioms : 5 # Removed by relevancy pruning : 0 # Initial clauses : 5 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 5 # Processed clauses : 4 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 3 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 1 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 1 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 2 # Positive orientable unit clauses : 2 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 1 # ...number of literals in the above : 2 # Clause-clause subsumption calls (NU) : 1 # Rec. Clause-clause subsumption calls : 1 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 3 # Indexed BW rewrite successes : 1 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 13 leaves, 1.15+/-0.361 terms/leaf # Paramod-from index : 1 leaves, 2.00+/-0.000 terms/leaf # Paramod-into index : 12 leaves, 1.17+/-0.373 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.003 s # Total time : 0.007 s # Maximum resident set size: 2496 pages ),[status(thm)],[784,801,807])). thf(809,plain,(((((![X:$i,Y:$i]: ((((~ ((a_member_of@((sK45@Y)@X))@Y)) | (~ ((a_member_of@((sK45@Y)@X))@X))) & (((a_member_of@((sK45@Y)@X))@Y) | ((a_member_of@((sK45@Y)@X))@X))) | ((eq@X)@Y))) & (![X:$i,Y:$i]: ((~ ((eq@X)@Y)) | ((![Z:$i]: ((~ ((a_member_of@Z)@Y)) | ((a_member_of@Z)@X))) & (![Z:$i]: ((~ ((a_member_of@Z)@X)) | ((a_member_of@Z)@Y))))))) & (((eq@sK43)@sK44) & (~ ((eq@sK44)@sK43))))=$true)),inference(copy,[status(thm)],[123])). thf(810,plain,(((~ ((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((~ ((~ ((a_member_of@((sK45@SX1)@SX0))@SX1)) | (~ ((a_member_of@((sK45@SX1)@SX0))@SX0)))) | (~ (((a_member_of@((sK45@SX1)@SX0))@SX1) | ((a_member_of@((sK45@SX1)@SX0))@SX0))))) | ((eq@SX0)@SX1)))) | (~ (![SX0:$i,SX1:$i]: ((~ ((eq@SX0)@SX1)) | (~ ((~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX1)) | ((a_member_of@SX2)@SX0)))) | (~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX0)) | ((a_member_of@SX2)@SX1)))))))))))) | (~ (~ ((~ ((eq@sK43)@sK44)) | (~ (~ ((eq@sK44)@sK43))))))))=$true)),inference(unfold_def,[status(thm)],[809])). thf(811,plain,((((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((~ ((~ ((a_member_of@((sK45@SX1)@SX0))@SX1)) | (~ ((a_member_of@((sK45@SX1)@SX0))@SX0)))) | (~ (((a_member_of@((sK45@SX1)@SX0))@SX1) | ((a_member_of@((sK45@SX1)@SX0))@SX0))))) | ((eq@SX0)@SX1)))) | (~ (![SX0:$i,SX1:$i]: ((~ ((eq@SX0)@SX1)) | (~ ((~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX1)) | ((a_member_of@SX2)@SX0)))) | (~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX0)) | ((a_member_of@SX2)@SX1)))))))))))) | (~ (~ ((~ ((eq@sK43)@sK44)) | (~ (~ ((eq@sK44)@sK43)))))))=$false)),inference(extcnf_not_pos,[status(thm)],[810])). thf(812,plain,(((~ (~ ((~ (![SX0:$i,SX1:$i]: ((~ ((~ ((~ ((a_member_of@((sK45@SX1)@SX0))@SX1)) | (~ ((a_member_of@((sK45@SX1)@SX0))@SX0)))) | (~ (((a_member_of@((sK45@SX1)@SX0))@SX1) | ((a_member_of@((sK45@SX1)@SX0))@SX0))))) | ((eq@SX0)@SX1)))) | (~ (![SX0:$i,SX1:$i]: ((~ ((eq@SX0)@SX1)) | (~ ((~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX1)) | ((a_member_of@SX2)@SX0)))) | (~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX0)) | ((a_member_of@SX2)@SX1))))))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[811])). thf(813,plain,(((~ (~ ((~ ((eq@sK43)@sK44)) | (~ (~ ((eq@sK44)@sK43))))))=$false)),inference(extcnf_or_neg,[status(thm)],[811])). thf(814,plain,(((~ ((~ (![SX0:$i,SX1:$i]: ((~ ((~ ((~ ((a_member_of@((sK45@SX1)@SX0))@SX1)) | (~ ((a_member_of@((sK45@SX1)@SX0))@SX0)))) | (~ (((a_member_of@((sK45@SX1)@SX0))@SX1) | ((a_member_of@((sK45@SX1)@SX0))@SX0))))) | ((eq@SX0)@SX1)))) | (~ (![SX0:$i,SX1:$i]: ((~ ((eq@SX0)@SX1)) | (~ ((~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX1)) | ((a_member_of@SX2)@SX0)))) | (~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX0)) | ((a_member_of@SX2)@SX1)))))))))))=$true)),inference(extcnf_not_neg,[status(thm)],[812])). thf(815,plain,(((~ ((~ ((eq@sK43)@sK44)) | (~ (~ ((eq@sK44)@sK43)))))=$true)),inference(extcnf_not_neg,[status(thm)],[813])). thf(816,plain,((((~ (![SX0:$i,SX1:$i]: ((~ ((~ ((~ ((a_member_of@((sK45@SX1)@SX0))@SX1)) | (~ ((a_member_of@((sK45@SX1)@SX0))@SX0)))) | (~ (((a_member_of@((sK45@SX1)@SX0))@SX1) | ((a_member_of@((sK45@SX1)@SX0))@SX0))))) | ((eq@SX0)@SX1)))) | (~ (![SX0:$i,SX1:$i]: ((~ ((eq@SX0)@SX1)) | (~ ((~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX1)) | ((a_member_of@SX2)@SX0)))) | (~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX0)) | ((a_member_of@SX2)@SX1))))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[814])). thf(817,plain,((((~ ((eq@sK43)@sK44)) | (~ (~ ((eq@sK44)@sK43))))=$false)),inference(extcnf_not_pos,[status(thm)],[815])). thf(818,plain,(((~ (![SX0:$i,SX1:$i]: ((~ ((~ ((~ ((a_member_of@((sK45@SX1)@SX0))@SX1)) | (~ ((a_member_of@((sK45@SX1)@SX0))@SX0)))) | (~ (((a_member_of@((sK45@SX1)@SX0))@SX1) | ((a_member_of@((sK45@SX1)@SX0))@SX0))))) | ((eq@SX0)@SX1))))=$false)),inference(extcnf_or_neg,[status(thm)],[816])). thf(819,plain,(((~ (![SX0:$i,SX1:$i]: ((~ ((eq@SX0)@SX1)) | (~ ((~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX1)) | ((a_member_of@SX2)@SX0)))) | (~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX0)) | ((a_member_of@SX2)@SX1)))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[816])). thf(820,plain,(((~ ((eq@sK43)@sK44))=$false)),inference(extcnf_or_neg,[status(thm)],[817])). thf(821,plain,(((~ (~ ((eq@sK44)@sK43)))=$false)),inference(extcnf_or_neg,[status(thm)],[817])). thf(822,plain,(((![SX0:$i,SX1:$i]: ((~ ((~ ((~ ((a_member_of@((sK45@SX1)@SX0))@SX1)) | (~ ((a_member_of@((sK45@SX1)@SX0))@SX0)))) | (~ (((a_member_of@((sK45@SX1)@SX0))@SX1) | ((a_member_of@((sK45@SX1)@SX0))@SX0))))) | ((eq@SX0)@SX1)))=$true)),inference(extcnf_not_neg,[status(thm)],[818])). thf(823,plain,(((![SX0:$i,SX1:$i]: ((~ ((eq@SX0)@SX1)) | (~ ((~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX1)) | ((a_member_of@SX2)@SX0)))) | (~ (![SX2:$i]: ((~ ((a_member_of@SX2)@SX0)) | ((a_member_of@SX2)@SX1))))))))=$true)),inference(extcnf_not_neg,[status(thm)],[819])). thf(824,plain,((((eq@sK43)@sK44)=$true)),inference(extcnf_not_neg,[status(thm)],[820])). thf(825,plain,(((~ ((eq@sK44)@sK43))=$true)),inference(extcnf_not_neg,[status(thm)],[821])). thf(826,plain,(![SV1:$i]: (((![SY283:$i]: ((~ ((~ ((~ ((a_member_of@((sK45@SY283)@SV1))@SY283)) | (~ ((a_member_of@((sK45@SY283)@SV1))@SV1)))) | (~ (((a_member_of@((sK45@SY283)@SV1))@SY283) | ((a_member_of@((sK45@SY283)@SV1))@SV1))))) | ((eq@SV1)@SY283)))=$true))),inference(extcnf_forall_pos,[status(thm)],[822])). thf(827,plain,(![SV2:$i]: (((![SY284:$i]: ((~ ((eq@SV2)@SY284)) | (~ ((~ (![SY285:$i]: ((~ ((a_member_of@SY285)@SY284)) | ((a_member_of@SY285)@SV2)))) | (~ (![SY286:$i]: ((~ ((a_member_of@SY286)@SV2)) | ((a_member_of@SY286)@SY284))))))))=$true))),inference(extcnf_forall_pos,[status(thm)],[823])). thf(828,plain,((((eq@sK44)@sK43)=$false)),inference(extcnf_not_pos,[status(thm)],[825])). thf(829,plain,(![SV1:$i,SV3:$i]: ((((~ ((~ ((~ ((a_member_of@((sK45@SV3)@SV1))@SV3)) | (~ ((a_member_of@((sK45@SV3)@SV1))@SV1)))) | (~ (((a_member_of@((sK45@SV3)@SV1))@SV3) | ((a_member_of@((sK45@SV3)@SV1))@SV1))))) | ((eq@SV1)@SV3))=$true))),inference(extcnf_forall_pos,[status(thm)],[826])). thf(830,plain,(![SV4:$i,SV2:$i]: ((((~ ((eq@SV2)@SV4)) | (~ ((~ (![SY287:$i]: ((~ ((a_member_of@SY287)@SV4)) | ((a_member_of@SY287)@SV2)))) | (~ (![SY288:$i]: ((~ ((a_member_of@SY288)@SV2)) | ((a_member_of@SY288)@SV4)))))))=$true))),inference(extcnf_forall_pos,[status(thm)],[827])). thf(831,plain,(![SV1:$i,SV3:$i]: (((~ ((~ ((~ ((a_member_of@((sK45@SV3)@SV1))@SV3)) | (~ ((a_member_of@((sK45@SV3)@SV1))@SV1)))) | (~ (((a_member_of@((sK45@SV3)@SV1))@SV3) | ((a_member_of@((sK45@SV3)@SV1))@SV1)))))=$true) | (((eq@SV1)@SV3)=$true))),inference(extcnf_or_pos,[status(thm)],[829])). thf(832,plain,(![SV4:$i,SV2:$i]: (((~ ((eq@SV2)@SV4))=$true) | ((~ ((~ (![SY287:$i]: ((~ ((a_member_of@SY287)@SV4)) | ((a_member_of@SY287)@SV2)))) | (~ (![SY288:$i]: ((~ ((a_member_of@SY288)@SV2)) | ((a_member_of@SY288)@SV4))))))=$true))),inference(extcnf_or_pos,[status(thm)],[830])). thf(833,plain,(![SV1:$i,SV3:$i]: ((((~ ((~ ((a_member_of@((sK45@SV3)@SV1))@SV3)) | (~ ((a_member_of@((sK45@SV3)@SV1))@SV1)))) | (~ (((a_member_of@((sK45@SV3)@SV1))@SV3) | ((a_member_of@((sK45@SV3)@SV1))@SV1))))=$false) | (((eq@SV1)@SV3)=$true))),inference(extcnf_not_pos,[status(thm)],[831])). thf(834,plain,(![SV4:$i,SV2:$i]: ((((eq@SV2)@SV4)=$false) | ((~ ((~ (![SY287:$i]: ((~ ((a_member_of@SY287)@SV4)) | ((a_member_of@SY287)@SV2)))) | (~ (![SY288:$i]: ((~ ((a_member_of@SY288)@SV2)) | ((a_member_of@SY288)@SV4))))))=$true))),inference(extcnf_not_pos,[status(thm)],[832])). thf(835,plain,(![SV1:$i,SV3:$i]: (((~ ((~ ((a_member_of@((sK45@SV3)@SV1))@SV3)) | (~ ((a_member_of@((sK45@SV3)@SV1))@SV1))))=$false) | (((eq@SV1)@SV3)=$true))),inference(extcnf_or_neg,[status(thm)],[833])). thf(836,plain,(![SV1:$i,SV3:$i]: (((~ (((a_member_of@((sK45@SV3)@SV1))@SV3) | ((a_member_of@((sK45@SV3)@SV1))@SV1)))=$false) | (((eq@SV1)@SV3)=$true))),inference(extcnf_or_neg,[status(thm)],[833])). thf(837,plain,(![SV2:$i,SV4:$i]: ((((~ (![SY287:$i]: ((~ ((a_member_of@SY287)@SV4)) | ((a_member_of@SY287)@SV2)))) | (~ (![SY288:$i]: ((~ ((a_member_of@SY288)@SV2)) | ((a_member_of@SY288)@SV4)))))=$false) | (((eq@SV2)@SV4)=$false))),inference(extcnf_not_pos,[status(thm)],[834])). thf(838,plain,(![SV1:$i,SV3:$i]: ((((~ ((a_member_of@((sK45@SV3)@SV1))@SV3)) | (~ ((a_member_of@((sK45@SV3)@SV1))@SV1)))=$true) | (((eq@SV1)@SV3)=$true))),inference(extcnf_not_neg,[status(thm)],[835])). thf(839,plain,(![SV1:$i,SV3:$i]: (((((a_member_of@((sK45@SV3)@SV1))@SV3) | ((a_member_of@((sK45@SV3)@SV1))@SV1))=$true) | (((eq@SV1)@SV3)=$true))),inference(extcnf_not_neg,[status(thm)],[836])). thf(840,plain,(![SV2:$i,SV4:$i]: (((~ (![SY287:$i]: ((~ ((a_member_of@SY287)@SV4)) | ((a_member_of@SY287)@SV2))))=$false) | (((eq@SV2)@SV4)=$false))),inference(extcnf_or_neg,[status(thm)],[837])). thf(841,plain,(![SV4:$i,SV2:$i]: (((~ (![SY288:$i]: ((~ ((a_member_of@SY288)@SV2)) | ((a_member_of@SY288)@SV4))))=$false) | (((eq@SV2)@SV4)=$false))),inference(extcnf_or_neg,[status(thm)],[837])). thf(842,plain,(![SV1:$i,SV3:$i]: (((~ ((a_member_of@((sK45@SV3)@SV1))@SV3))=$true) | ((~ ((a_member_of@((sK45@SV3)@SV1))@SV1))=$true) | (((eq@SV1)@SV3)=$true))),inference(extcnf_or_pos,[status(thm)],[838])). thf(843,plain,(![SV1:$i,SV3:$i]: ((((a_member_of@((sK45@SV3)@SV1))@SV3)=$true) | (((a_member_of@((sK45@SV3)@SV1))@SV1)=$true) | (((eq@SV1)@SV3)=$true))),inference(extcnf_or_pos,[status(thm)],[839])). thf(844,plain,(![SV2:$i,SV4:$i]: (((![SY287:$i]: ((~ ((a_member_of@SY287)@SV4)) | ((a_member_of@SY287)@SV2)))=$true) | (((eq@SV2)@SV4)=$false))),inference(extcnf_not_neg,[status(thm)],[840])). thf(845,plain,(![SV4:$i,SV2:$i]: (((![SY288:$i]: ((~ ((a_member_of@SY288)@SV2)) | ((a_member_of@SY288)@SV4)))=$true) | (((eq@SV2)@SV4)=$false))),inference(extcnf_not_neg,[status(thm)],[841])). thf(846,plain,(![SV1:$i,SV3:$i]: ((((a_member_of@((sK45@SV3)@SV1))@SV1)=$false) | ((~ ((a_member_of@((sK45@SV3)@SV1))@SV3))=$true) | (((eq@SV1)@SV3)=$true))),inference(extcnf_not_pos,[status(thm)],[842])). thf(847,plain,(![SV2:$i,SV4:$i,SV5:$i]: ((((~ ((a_member_of@SV5)@SV4)) | ((a_member_of@SV5)@SV2))=$true) | (((eq@SV2)@SV4)=$false))),inference(extcnf_forall_pos,[status(thm)],[844])). thf(848,plain,(![SV4:$i,SV2:$i,SV6:$i]: ((((~ ((a_member_of@SV6)@SV2)) | ((a_member_of@SV6)@SV4))=$true) | (((eq@SV2)@SV4)=$false))),inference(extcnf_forall_pos,[status(thm)],[845])). thf(849,plain,(![SV1:$i,SV3:$i]: ((((a_member_of@((sK45@SV3)@SV1))@SV3)=$false) | (((a_member_of@((sK45@SV3)@SV1))@SV1)=$false) | (((eq@SV1)@SV3)=$true))),inference(extcnf_not_pos,[status(thm)],[846])). thf(850,plain,(![SV2:$i,SV4:$i,SV5:$i]: (((~ ((a_member_of@SV5)@SV4))=$true) | (((a_member_of@SV5)@SV2)=$true) | (((eq@SV2)@SV4)=$false))),inference(extcnf_or_pos,[status(thm)],[847])). thf(851,plain,(![SV4:$i,SV2:$i,SV6:$i]: (((~ ((a_member_of@SV6)@SV2))=$true) | (((a_member_of@SV6)@SV4)=$true) | (((eq@SV2)@SV4)=$false))),inference(extcnf_or_pos,[status(thm)],[848])). thf(852,plain,(![SV2:$i,SV4:$i,SV5:$i]: ((((a_member_of@SV5)@SV4)=$false) | (((a_member_of@SV5)@SV2)=$true) | (((eq@SV2)@SV4)=$false))),inference(extcnf_not_pos,[status(thm)],[850])). thf(853,plain,(![SV4:$i,SV2:$i,SV6:$i]: ((((a_member_of@SV6)@SV2)=$false) | (((a_member_of@SV6)@SV4)=$true) | (((eq@SV2)@SV4)=$false))),inference(extcnf_not_pos,[status(thm)],[851])). thf(854,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK43,i)),ft(i,o)),ti(sK44,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_824) 2 : :![X1]:![X2]:(lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))|(~(lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X2,i)),ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X2,i)),o)))|~(lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X2,i)),ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X1,i)),o))))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_849) 3 : :~(lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(sK43,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_828) 4 : :![X3]:![X4]:![X5]:(~(lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X4,i)),o)))|(~(lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X4,i)),o)))|lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X3,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_852) 5 : :![X4]:![X3]:![X6]:(~(lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X4,i)),o)))|(lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X6,i)),ft(i,o)),ti(X4,i)),o))|~(lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X6,i)),ft(i,o)),ti(X3,i)),o))))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_853) 6 : :![X1]:![X2]:(lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))|(lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X2,i)),ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X2,i)),o))|lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X2,i)),ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X1,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_843) 7 : :![X1]:![X2]:(lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))|(~lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X2,i)),ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X2,i)),o))|~lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X2,i)),ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X1,i)),o)))) : fof_simplification(2) 8 : :~lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(sK43,i)),o)) : fof_simplification(3) 9 : :![X3]:![X4]:![X5]:(~lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X4,i)),o))|(~lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X4,i)),o))|lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(X3,i)),o)))) : fof_simplification(4) 10 : :![X4]:![X3]:![X6]:(~lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X4,i)),o))|(lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X6,i)),ft(i,o)),ti(X4,i)),o))|~lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X6,i)),ft(i,o)),ti(X3,i)),o)))) : fof_simplification(5) # Garbage collection reclaimed 24 unused term cells. 11 : :[++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK43,i)),ft(i,o)),ti(sK44,i)),o))] : split_conjunct(1) 12 : :![X3]:![X4]:(lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X4,i)),o))|(~lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X4,i)),ft(i,i)),ti(X3,i)),i)),ft(i,o)),ti(X4,i)),o))|~lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X4,i)),ft(i,i)),ti(X3,i)),i)),ft(i,o)),ti(X3,i)),o)))) : variable_rename(7) 13 : :[++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X1,i)),ft(i,i)),ti(X2,i)),i)),ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X1,i)),ft(i,i)),ti(X2,i)),i)),ft(i,o)),ti(X1,i)),o))] : split_conjunct(12) 14 : :[--lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(sK43,i)),o))] : split_conjunct(8) 15 : :![X6]:![X7]:![X8]:(~lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X6,i)),ft(i,o)),ti(X7,i)),o))|(~lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X8,i)),ft(i,o)),ti(X7,i)),o))|lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X8,i)),ft(i,o)),ti(X6,i)),o)))) : variable_rename(9) 16 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X3,i)),o)),--lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X3,i)),o))] : split_conjunct(15) # Garbage collection reclaimed 66 unused term cells. 17 : :![X7]:![X8]:![X9]:(~lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X8,i)),ft(i,o)),ti(X7,i)),o))|(lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X9,i)),ft(i,o)),ti(X7,i)),o))|~lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X9,i)),ft(i,o)),ti(X8,i)),o)))) : variable_rename(10) 18 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X3,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X3,i)),o))] : split_conjunct(17) 19 : :![X3]:![X4]:(lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X4,i)),o))|(lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X4,i)),ft(i,i)),ti(X3,i)),i)),ft(i,o)),ti(X4,i)),o))|lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X4,i)),ft(i,i)),ti(X3,i)),i)),ft(i,o)),ti(X3,i)),o)))) : variable_rename(6) 20 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X1,i)),ft(i,i)),ti(X2,i)),i)),ft(i,o)),ti(X2,i)),o)),++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X1,i)),ft(i,i)),ti(X2,i)),i)),ft(i,o)),ti(X1,i)),o)),++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X1,i)),o))] : split_conjunct(19) # Garbage collection reclaimed 90 unused term cells. # Auto-Ordering is analysing problem. # Problem is type GUNFGFFMF22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type GUNFGFFMF22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.007 s # Presaturation interreduction done 21 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK44,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK43,i)),o))] : spm(18,11) 22 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK43,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK44,i)),o))] : spm(16,11) 23 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X3,i)),ft(i,i)),ti(X3,i)),i)),ft(i,o)),ti(X3,i)),o)),++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X3,i)),o))] : ef(20) 24 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X4,i)),ft(i,i)),ti(X4,i)),i)),ft(i,o)),ti(X4,i)),o)),++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X4,i)),ft(i,o)),ti(X4,i)),o))] : ef(20) 25 : :[++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X2,i)),ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X2,i)),ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X2,i)),o))] : spm(13,20) 26 : :[++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X1,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X1,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK43,i)),o))] : spm(13,21) 27 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X1,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK43,i)),o)),++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X1,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(X1,i)),o)),++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(X1,i)),o))] : spm(22,20) 28 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK44,i)),ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(sK43,i)),o)),++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK44,i)),ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X1,i)),o)),++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK44,i)),o))] : spm(22,20) 29 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK43,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK43,i)),o))] : spm(22,21) 30 : :[++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X1,i)),ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X1,i)),o))] : spm(13,23) 31 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK44,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK43,i)),o)),++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(sK44,i)),o))] : spm(22,23) 32 : :[++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X1,i)),o))] : csr(30,23) 33 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : spm(16,32) 34 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X2,i)),o))] : spm(18,32) 35 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X1,i)),ft(i,i)),ti(X1,i)),i)),ft(i,o)),ti(X1,i)),o)),++$true] : rw(23,32) 36 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK43,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK43,i)),o)),++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(sK43,i)),o))] : ef(27) 37 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK43,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK43,i)),o)),++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(sK43,i)),o))] : ef(27) 38 : :[++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(sK44,i)),o)),++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK44,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK43,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK44,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK44,i)),o))] : spm(13,27) 39 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK44,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK43,i)),o)),++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(sK44,i)),o))] : spm(22,27) 40 : :[++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(X1,i)),o)),++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X1,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(X1,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(X1,i)),o))] : spm(26,27) 41 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK43,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK43,i)),o))] : sr(36,14) 42 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK43,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK43,i)),o))] : sr(37,14) 43 : :[++$true,++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK44,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK43,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK44,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK44,i)),o))] : rw(38,32) 44 : :[++lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK44,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK43,i)),o)),++$true] : rw(39,32) 45 : :[++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(sK43,i)),o)),--lit(ti(at(ti(at(ti(a_member_of,ft(i,ft(i,o))),ti(at(ti(at(ti(sK45,ft(i,ft(i,i))),ti(sK43,i)),ft(i,i)),ti(sK44,i)),i)),ft(i,o)),ti(sK43,i)),o))] : spm(26,41) 46 : :[++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(sK43,i)),o)),--$true] : rw(45,41) 47 : :[++lit(ti(at(ti(at(ti(eq,ft(i,ft(i,o))),ti(sK44,i)),ft(i,o)),ti(sK43,i)),o))] : cn(46) 48 : :[] : sr(47,14) 49 : :[] : 48 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 6 # Removed by relevancy pruning : 0 # Initial clauses : 6 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 6 # Processed clauses : 20 # ...of these trivial : 0 # ...subsumed : 1 # ...remaining for further processing : 19 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 1 # Generated clauses : 19 # ...of the previous two non-trivial : 11 # Contextual simplify-reflections : 1 # Paramodulations : 15 # Factorizations : 4 # Equation resolutions : 0 # Current number of processed clauses : 12 # Positive orientable unit clauses : 3 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 8 # Current number of unprocessed clauses: 2 # ...number of literals in the above : 4 # Clause-clause subsumption calls (NU) : 13 # Rec. Clause-clause subsumption calls : 11 # Unit Clause-clause subsumption calls : 2 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 34 # Indexed BW rewrite successes : 1 # Unification attempts : 112 # Unification successes : 42 # Backwards rewriting index : 33 leaves, 3.36+/-4.892 terms/leaf # Paramod-from index : 1 leaves, 8.00+/-0.000 terms/leaf # Paramod-into index : 32 leaves, 2.78+/-3.209 terms/leaf # ------------------------------------------------- # User time : 0.007 s # System time : 0.000 s # Total time : 0.007 s # Maximum resident set size: 2692 pages ),[status(thm)],[824,843,853,852,828,849])). thf(855,plain,((((p1@sK46) & (![Z:$i]: (~ (p1@Z))))=$true)),inference(copy,[status(thm)],[124])). thf(856,plain,(((~ ((~ (p1@sK46)) | (~ (![SX0:$i]: (~ (p1@SX0))))))=$true)),inference(unfold_def,[status(thm)],[855])). thf(857,plain,((((~ (p1@sK46)) | (~ (![SX0:$i]: (~ (p1@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[856])). thf(858,plain,(((~ (p1@sK46))=$false)),inference(extcnf_or_neg,[status(thm)],[857])). thf(859,plain,(((~ (![SX0:$i]: (~ (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[857])). thf(860,plain,(((p1@sK46)=$true)),inference(extcnf_not_neg,[status(thm)],[858])). thf(861,plain,(((![SX0:$i]: (~ (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[859])). thf(862,plain,(![SV1:$i]: (((~ (p1@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[861])). thf(863,plain,(![SV1:$i]: (((p1@SV1)=$false))),inference(extcnf_not_pos,[status(thm)],[862])). thf(864,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(p1,ft(i,o)),ti(sK46,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_860) 2 : :![X1]:~(lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_863) 3 : :![X1]:~lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : fof_simplification(2) # Garbage collection reclaimed 3 unused term cells. 4 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(sK46,i)),o))] : split_conjunct(1) 5 : :![X2]:~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(3) 6 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(5) # Garbage collection reclaimed 9 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 7 : :[] : sr(4,6) # SZS intermediate status Theorem # SZS answers Tuple [|_] 8 : :[] : eval_answer_literal(7) # Presaturation interreduction done 9 : :[] : 8 : 'proof' # Proof found! # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 2 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 0 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 10 leaves, 1.00+/-0.000 terms/leaf # Paramod-from index : 0 leaves, 0.00+/-0.000 terms/leaf # Paramod-into index : 9 leaves, 1.00+/-0.000 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2412 pages ),[status(thm)],[860,863])). thf(865,plain,((((![X:$i]: (p1@X)) & ((~ (p1@sK48)) | (~ (p1@sK47))))=$true)),inference(copy,[status(thm)],[125])). thf(866,plain,(((~ ((~ (![SX0:$i]: (p1@SX0))) | (~ ((~ (p1@sK48)) | (~ (p1@sK47))))))=$true)),inference(unfold_def,[status(thm)],[865])). thf(867,plain,((((~ (![SX0:$i]: (p1@SX0))) | (~ ((~ (p1@sK48)) | (~ (p1@sK47)))))=$false)),inference(extcnf_not_pos,[status(thm)],[866])). thf(868,plain,(((~ (![SX0:$i]: (p1@SX0)))=$false)),inference(extcnf_or_neg,[status(thm)],[867])). thf(869,plain,(((~ ((~ (p1@sK48)) | (~ (p1@sK47))))=$false)),inference(extcnf_or_neg,[status(thm)],[867])). thf(870,plain,(((![SX0:$i]: (p1@SX0))=$true)),inference(extcnf_not_neg,[status(thm)],[868])). thf(871,plain,((((~ (p1@sK48)) | (~ (p1@sK47)))=$true)),inference(extcnf_not_neg,[status(thm)],[869])). thf(872,plain,(![SV1:$i]: (((p1@SV1)=$true))),inference(extcnf_forall_pos,[status(thm)],[870])). thf(873,plain,(((~ (p1@sK48))=$true) | ((~ (p1@sK47))=$true)),inference(extcnf_or_pos,[status(thm)],[871])). thf(874,plain,(((p1@sK48)=$false) | ((~ (p1@sK47))=$true)),inference(extcnf_not_pos,[status(thm)],[873])). thf(875,plain,(((p1@sK47)=$false) | ((p1@sK48)=$false)),inference(extcnf_not_pos,[status(thm)],[874])). thf(876,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_872) 2 : :(~(lit(ti(at(ti(p1,ft(i,o)),ti(sK47,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(sK48,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_875) 3 : :(~lit(ti(at(ti(p1,ft(i,o)),ti(sK47,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(sK48,i)),o))) : fof_simplification(2) # Garbage collection reclaimed 5 unused term cells. 4 : :![X2]:lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(1) 5 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(4) 6 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(sK48,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(sK47,i)),o))] : split_conjunct(3) # Garbage collection reclaimed 11 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UHNFGFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UHNFGFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 7 : :[--$true,--lit(ti(at(ti(p1,ft(i,o)),ti(sK48,i)),o))] : rw(6,5) 8 : :[--$true,--$true] : rw(7,5) 9 : :[] : cn(8) # SZS intermediate status Theorem # SZS answers Tuple [|_] 10 : :[] : eval_answer_literal(9) # Presaturation interreduction done 11 : :[] : 10 : 'proof' # Proof found! # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 2 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 1 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 10 leaves, 1.00+/-0.000 terms/leaf # Paramod-from index : 1 leaves, 1.00+/-0.000 terms/leaf # Paramod-into index : 9 leaves, 1.00+/-0.000 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2432 pages ),[status(thm)],[872,875])). thf(877,plain,((((![X:$i]: (p1@X)) & ((~ (p1@sK50)) | (~ (p1@sK49))))=$true)),inference(copy,[status(thm)],[126])). thf(878,plain,(((~ ((~ (![SX0:$i]: (p1@SX0))) | (~ ((~ (p1@sK50)) | (~ (p1@sK49))))))=$true)),inference(unfold_def,[status(thm)],[877])). thf(879,plain,((((~ (![SX0:$i]: (p1@SX0))) | (~ ((~ (p1@sK50)) | (~ (p1@sK49)))))=$false)),inference(extcnf_not_pos,[status(thm)],[878])). thf(880,plain,(((~ (![SX0:$i]: (p1@SX0)))=$false)),inference(extcnf_or_neg,[status(thm)],[879])). thf(881,plain,(((~ ((~ (p1@sK50)) | (~ (p1@sK49))))=$false)),inference(extcnf_or_neg,[status(thm)],[879])). thf(882,plain,(((![SX0:$i]: (p1@SX0))=$true)),inference(extcnf_not_neg,[status(thm)],[880])). thf(883,plain,((((~ (p1@sK50)) | (~ (p1@sK49)))=$true)),inference(extcnf_not_neg,[status(thm)],[881])). thf(884,plain,(![SV1:$i]: (((p1@SV1)=$true))),inference(extcnf_forall_pos,[status(thm)],[882])). thf(885,plain,(((~ (p1@sK50))=$true) | ((~ (p1@sK49))=$true)),inference(extcnf_or_pos,[status(thm)],[883])). thf(886,plain,(((p1@sK50)=$false) | ((~ (p1@sK49))=$true)),inference(extcnf_not_pos,[status(thm)],[885])). thf(887,plain,(((p1@sK49)=$false) | ((p1@sK50)=$false)),inference(extcnf_not_pos,[status(thm)],[886])). thf(888,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_884) 2 : :(~(lit(ti(at(ti(p1,ft(i,o)),ti(sK49,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(sK50,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_887) 3 : :(~lit(ti(at(ti(p1,ft(i,o)),ti(sK49,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(sK50,i)),o))) : fof_simplification(2) # Garbage collection reclaimed 5 unused term cells. 4 : :![X2]:lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(1) 5 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(4) 6 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(sK50,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(sK49,i)),o))] : split_conjunct(3) # Garbage collection reclaimed 11 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UHNFGFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UHNFGFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.007 s 7 : :[--$true,--lit(ti(at(ti(p1,ft(i,o)),ti(sK50,i)),o))] : rw(6,5) 8 : :[--$true,--$true] : rw(7,5) 9 : :[] : cn(8) # SZS intermediate status Theorem # SZS answers Tuple [|_] 10 : :[] : eval_answer_literal(9) # Presaturation interreduction done 11 : :[] : 10 : 'proof' # Proof found! # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 2 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 1 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 10 leaves, 1.00+/-0.000 terms/leaf # Paramod-from index : 1 leaves, 1.00+/-0.000 terms/leaf # Paramod-into index : 9 leaves, 1.00+/-0.000 terms/leaf # ------------------------------------------------- # User time : 0.007 s # System time : 0.000 s # Total time : 0.007 s # Maximum resident set size: 2428 pages ),[status(thm)],[884,887])). thf(889,plain,(((((![X:$i]: (b@X)) & (a1@sK51)) & (![X:$i]: ((~ (a1@X)) | (~ (b@X)))))=$true)),inference(copy,[status(thm)],[127])). thf(890,plain,(((~ ((~ (~ ((~ (![SX0:$i]: (b@SX0))) | (~ (a1@sK51))))) | (~ (![SX0:$i]: ((~ (a1@SX0)) | (~ (b@SX0)))))))=$true)),inference(unfold_def,[status(thm)],[889])). thf(891,plain,((((~ (~ ((~ (![SX0:$i]: (b@SX0))) | (~ (a1@sK51))))) | (~ (![SX0:$i]: ((~ (a1@SX0)) | (~ (b@SX0))))))=$false)),inference(extcnf_not_pos,[status(thm)],[890])). thf(892,plain,(((~ (~ ((~ (![SX0:$i]: (b@SX0))) | (~ (a1@sK51)))))=$false)),inference(extcnf_or_neg,[status(thm)],[891])). thf(893,plain,(((~ (![SX0:$i]: ((~ (a1@SX0)) | (~ (b@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[891])). thf(894,plain,(((~ ((~ (![SX0:$i]: (b@SX0))) | (~ (a1@sK51))))=$true)),inference(extcnf_not_neg,[status(thm)],[892])). thf(895,plain,(((![SX0:$i]: ((~ (a1@SX0)) | (~ (b@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[893])). thf(896,plain,((((~ (![SX0:$i]: (b@SX0))) | (~ (a1@sK51)))=$false)),inference(extcnf_not_pos,[status(thm)],[894])). thf(897,plain,(![SV1:$i]: ((((~ (a1@SV1)) | (~ (b@SV1)))=$true))),inference(extcnf_forall_pos,[status(thm)],[895])). thf(898,plain,(((~ (![SX0:$i]: (b@SX0)))=$false)),inference(extcnf_or_neg,[status(thm)],[896])). thf(899,plain,(((~ (a1@sK51))=$false)),inference(extcnf_or_neg,[status(thm)],[896])). thf(900,plain,(![SV1:$i]: (((~ (a1@SV1))=$true) | ((~ (b@SV1))=$true))),inference(extcnf_or_pos,[status(thm)],[897])). thf(901,plain,(((![SX0:$i]: (b@SX0))=$true)),inference(extcnf_not_neg,[status(thm)],[898])). thf(902,plain,(((a1@sK51)=$true)),inference(extcnf_not_neg,[status(thm)],[899])). thf(903,plain,(![SV1:$i]: (((a1@SV1)=$false) | ((~ (b@SV1))=$true))),inference(extcnf_not_pos,[status(thm)],[900])). thf(904,plain,(![SV2:$i]: (((b@SV2)=$true))),inference(extcnf_forall_pos,[status(thm)],[901])). thf(905,plain,(![SV1:$i]: (((b@SV1)=$false) | ((a1@SV1)=$false))),inference(extcnf_not_pos,[status(thm)],[903])). thf(906,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(a1,ft(i,o)),ti(sK51,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_902) 2 : :![X1]:lit(ti(at(ti(b,ft(i,o)),ti(X1,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_904) 3 : :![X2]:(~(lit(ti(at(ti(b,ft(i,o)),ti(X2,i)),o)))|~(lit(ti(at(ti(a1,ft(i,o)),ti(X2,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_905) 4 : :![X2]:(~lit(ti(at(ti(b,ft(i,o)),ti(X2,i)),o))|~lit(ti(at(ti(a1,ft(i,o)),ti(X2,i)),o))) : fof_simplification(3) # Garbage collection reclaimed 6 unused term cells. 5 : :[++lit(ti(at(ti(a1,ft(i,o)),ti(sK51,i)),o))] : split_conjunct(1) 6 : :![X2]:lit(ti(at(ti(b,ft(i,o)),ti(X2,i)),o)) : variable_rename(2) 7 : :[++lit(ti(at(ti(b,ft(i,o)),ti(X1,i)),o))] : split_conjunct(6) 8 : :![X3]:(~lit(ti(at(ti(b,ft(i,o)),ti(X3,i)),o))|~lit(ti(at(ti(a1,ft(i,o)),ti(X3,i)),o))) : variable_rename(4) 9 : :[--lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(b,ft(i,o)),ti(X1,i)),o))] : split_conjunct(8) # Garbage collection reclaimed 27 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UHNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UHNFNFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 10 : :[--lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o)),--$true] : rw(9,7) 11 : :[--lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o))] : cn(10) 12 : :[] : sr(5,11) # Presaturation interreduction done 13 : :[] : 12 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 3 # Removed by relevancy pruning : 0 # Initial clauses : 3 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 3 # Processed clauses : 3 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 3 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 1 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 2 # Positive orientable unit clauses : 1 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 1 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 13 leaves, 1.15+/-0.361 terms/leaf # Paramod-from index : 1 leaves, 1.00+/-0.000 terms/leaf # Paramod-into index : 12 leaves, 1.17+/-0.373 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2448 pages ),[status(thm)],[902,905,904])). thf(907,plain,((((![SY227:$i]: ((~ ((a@SY227)@sK52)) | (~ ((a@SY227)@SY227)))) & (![SY228:$i]: (((a@SY228)@SY228) | ((a@SY228)@sK52))))=$true)),inference(copy,[status(thm)],[128])). thf(908,plain,(((~ ((~ (![SX0:$i]: ((~ ((a@SX0)@sK52)) | (~ ((a@SX0)@SX0))))) | (~ (![SX0:$i]: (((a@SX0)@SX0) | ((a@SX0)@sK52))))))=$true)),inference(unfold_def,[status(thm)],[907])). thf(909,plain,((((~ (![SX0:$i]: ((~ ((a@SX0)@sK52)) | (~ ((a@SX0)@SX0))))) | (~ (![SX0:$i]: (((a@SX0)@SX0) | ((a@SX0)@sK52)))))=$false)),inference(extcnf_not_pos,[status(thm)],[908])). thf(910,plain,(((~ (![SX0:$i]: ((~ ((a@SX0)@sK52)) | (~ ((a@SX0)@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[909])). thf(911,plain,(((~ (![SX0:$i]: (((a@SX0)@SX0) | ((a@SX0)@sK52))))=$false)),inference(extcnf_or_neg,[status(thm)],[909])). thf(912,plain,(((![SX0:$i]: ((~ ((a@SX0)@sK52)) | (~ ((a@SX0)@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[910])). thf(913,plain,(((![SX0:$i]: (((a@SX0)@SX0) | ((a@SX0)@sK52)))=$true)),inference(extcnf_not_neg,[status(thm)],[911])). thf(914,plain,(![SV1:$i]: ((((~ ((a@SV1)@sK52)) | (~ ((a@SV1)@SV1)))=$true))),inference(extcnf_forall_pos,[status(thm)],[912])). thf(915,plain,(![SV2:$i]: (((((a@SV2)@SV2) | ((a@SV2)@sK52))=$true))),inference(extcnf_forall_pos,[status(thm)],[913])). thf(916,plain,(![SV1:$i]: (((~ ((a@SV1)@sK52))=$true) | ((~ ((a@SV1)@SV1))=$true))),inference(extcnf_or_pos,[status(thm)],[914])). thf(917,plain,(![SV2:$i]: ((((a@SV2)@SV2)=$true) | (((a@SV2)@sK52)=$true))),inference(extcnf_or_pos,[status(thm)],[915])). thf(918,plain,(![SV1:$i]: ((((a@SV1)@SV1)=$false) | ((~ ((a@SV1)@sK52))=$true))),inference(extcnf_not_pos,[status(thm)],[916])). thf(919,plain,(![SV1:$i]: ((((a@SV1)@sK52)=$false) | (((a@SV1)@SV1)=$false))),inference(extcnf_not_pos,[status(thm)],[918])). thf(920,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:(lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK52,i)),o))|lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_917) 2 : :![X2]:(~(lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(sK52,i)),o)))|~(lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X2,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_919) 3 : :![X2]:(~lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(sK52,i)),o))|~lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X2,i)),o))) : fof_simplification(2) # Garbage collection reclaimed 6 unused term cells. 4 : :![X2]:(lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(sK52,i)),o))|lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X2,i)),ft(i,o)),ti(X2,i)),o))) : variable_rename(1) 5 : :[++lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X1,i)),o)),++lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK52,i)),o))] : split_conjunct(4) 6 : :![X3]:(~lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(sK52,i)),o))|~lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X3,i)),ft(i,o)),ti(X3,i)),o))) : variable_rename(3) 7 : :[--lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(sK52,i)),o))] : split_conjunct(6) # Garbage collection reclaimed 34 unused term cells. # Auto-Ordering is analysing problem. # Problem is type GHNFNFFSF22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type GHNFNFFSF22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.007 s # Presaturation interreduction done 8 : :[++lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(sK52,i)),ft(i,o)),ti(sK52,i)),o))] : ef(5) 9 : :[++lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(sK52,i)),ft(i,o)),ti(sK52,i)),o))] : ef(5) 10 : :[++lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(X1,i)),o))] : spm(7,5) 11 : :[--lit(ti(at(ti(at(ti(a,ft(i,ft(i,o))),ti(sK52,i)),ft(i,o)),ti(sK52,i)),o))] : spm(7,8) 12 : :[--$true] : rw(11,8) 13 : :[] : cn(12) 14 : :[] : 13 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 5 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 5 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 4 # ...of the previous two non-trivial : 2 # Contextual simplify-reflections : 0 # Paramodulations : 2 # Factorizations : 2 # Equation resolutions : 0 # Current number of processed clauses : 3 # Positive orientable unit clauses : 1 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 2 # Current number of unprocessed clauses: 1 # ...number of literals in the above : 1 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 2 # Indexed BW rewrite successes : 0 # Unification attempts : 14 # Unification successes : 11 # Backwards rewriting index : 17 leaves, 1.35+/-0.681 terms/leaf # Paramod-from index : 1 leaves, 3.00+/-0.000 terms/leaf # Paramod-into index : 16 leaves, 1.38+/-0.696 terms/leaf # ------------------------------------------------- # User time : 0.007 s # System time : 0.000 s # Total time : 0.007 s # Maximum resident set size: 2536 pages ),[status(thm)],[917,919])). thf(921,plain,((((![X:$i]: ((~ (a1@X)) | (b@X))) & ((a1@sK53) & (![X:$i]: (~ (b@X)))))=$true)),inference(copy,[status(thm)],[129])). thf(922,plain,(((~ ((~ (![SX0:$i]: ((~ (a1@SX0)) | (b@SX0)))) | (~ (~ ((~ (a1@sK53)) | (~ (![SX0:$i]: (~ (b@SX0)))))))))=$true)),inference(unfold_def,[status(thm)],[921])). thf(923,plain,((((~ (![SX0:$i]: ((~ (a1@SX0)) | (b@SX0)))) | (~ (~ ((~ (a1@sK53)) | (~ (![SX0:$i]: (~ (b@SX0))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[922])). thf(924,plain,(((~ (![SX0:$i]: ((~ (a1@SX0)) | (b@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[923])). thf(925,plain,(((~ (~ ((~ (a1@sK53)) | (~ (![SX0:$i]: (~ (b@SX0)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[923])). thf(926,plain,(((![SX0:$i]: ((~ (a1@SX0)) | (b@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[924])). thf(927,plain,(((~ ((~ (a1@sK53)) | (~ (![SX0:$i]: (~ (b@SX0))))))=$true)),inference(extcnf_not_neg,[status(thm)],[925])). thf(928,plain,(![SV1:$i]: ((((~ (a1@SV1)) | (b@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[926])). thf(929,plain,((((~ (a1@sK53)) | (~ (![SX0:$i]: (~ (b@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[927])). thf(930,plain,(![SV1:$i]: (((~ (a1@SV1))=$true) | ((b@SV1)=$true))),inference(extcnf_or_pos,[status(thm)],[928])). thf(931,plain,(((~ (a1@sK53))=$false)),inference(extcnf_or_neg,[status(thm)],[929])). thf(932,plain,(((~ (![SX0:$i]: (~ (b@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[929])). thf(933,plain,(![SV1:$i]: (((a1@SV1)=$false) | ((b@SV1)=$true))),inference(extcnf_not_pos,[status(thm)],[930])). thf(934,plain,(((a1@sK53)=$true)),inference(extcnf_not_neg,[status(thm)],[931])). thf(935,plain,(((![SX0:$i]: (~ (b@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[932])). thf(936,plain,(![SV2:$i]: (((~ (b@SV2))=$true))),inference(extcnf_forall_pos,[status(thm)],[935])). thf(937,plain,(![SV2:$i]: (((b@SV2)=$false))),inference(extcnf_not_pos,[status(thm)],[936])). thf(938,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :lit(ti(at(ti(a1,ft(i,o)),ti(sK53,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_934) 2 : :![X1]:~(lit(ti(at(ti(b,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_937) 3 : :![X2]:(lit(ti(at(ti(b,ft(i,o)),ti(X2,i)),o))|~(lit(ti(at(ti(a1,ft(i,o)),ti(X2,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_933) 4 : :![X1]:~lit(ti(at(ti(b,ft(i,o)),ti(X1,i)),o)) : fof_simplification(2) 5 : :![X2]:(lit(ti(at(ti(b,ft(i,o)),ti(X2,i)),o))|~lit(ti(at(ti(a1,ft(i,o)),ti(X2,i)),o))) : fof_simplification(3) # Garbage collection reclaimed 7 unused term cells. 6 : :[++lit(ti(at(ti(a1,ft(i,o)),ti(sK53,i)),o))] : split_conjunct(1) 7 : :![X2]:~lit(ti(at(ti(b,ft(i,o)),ti(X2,i)),o)) : variable_rename(4) 8 : :[--lit(ti(at(ti(b,ft(i,o)),ti(X1,i)),o))] : split_conjunct(7) 9 : :![X3]:(lit(ti(at(ti(b,ft(i,o)),ti(X3,i)),o))|~lit(ti(at(ti(a1,ft(i,o)),ti(X3,i)),o))) : variable_rename(5) 10 : :[++lit(ti(at(ti(b,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(9) # Garbage collection reclaimed 27 unused term cells. # Auto-Ordering is analysing problem. # Problem is type HUNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type HUNFNFFSF22MM # Auto-Mode selected heuristic H_____102_C18_F1_PI_AE_Q4_CS_SP_S1S # and selection function SelectComplexAHP. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 11 : :[--lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o))] : sr(10,8) 12 : :[] : sr(6,11) 13 : :[] : 12 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 3 # Removed by relevancy pruning : 0 # Initial clauses : 3 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 3 # Processed clauses : 3 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 3 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 1 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 2 # Positive orientable unit clauses : 0 # Positive unorientable unit clauses: 0 # Negative unit clauses : 2 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 1 # Indexed BW rewrite successes : 0 # Unification attempts : 4 # Unification successes : 1 # Backwards rewriting index : 13 leaves, 1.15+/-0.361 terms/leaf # Paramod-from index : 0 leaves, 0.00+/-0.000 terms/leaf # Paramod-into index : 12 leaves, 1.17+/-0.373 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2432 pages ),[status(thm)],[934,933,937])). thf(939,plain,((((![X:$i]: ((~ (p1@X)) | (q1@X))) & ((![X:$i]: (p1@X)) & (~ (q1@sK54))))=$true)),inference(copy,[status(thm)],[130])). thf(940,plain,(((~ ((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))) | (~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (~ (q1@sK54))))))))=$true)),inference(unfold_def,[status(thm)],[939])). thf(941,plain,((((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))) | (~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (~ (q1@sK54)))))))=$false)),inference(extcnf_not_pos,[status(thm)],[940])). thf(942,plain,(((~ (![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[941])). thf(943,plain,(((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (~ (q1@sK54))))))=$false)),inference(extcnf_or_neg,[status(thm)],[941])). thf(944,plain,(((![SX0:$i]: ((~ (p1@SX0)) | (q1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[942])). thf(945,plain,(((~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (~ (q1@sK54)))))=$true)),inference(extcnf_not_neg,[status(thm)],[943])). thf(946,plain,(![SV1:$i]: ((((~ (p1@SV1)) | (q1@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[944])). thf(947,plain,((((~ (![SX0:$i]: (p1@SX0))) | (~ (~ (q1@sK54))))=$false)),inference(extcnf_not_pos,[status(thm)],[945])). thf(948,plain,(![SV1:$i]: (((~ (p1@SV1))=$true) | ((q1@SV1)=$true))),inference(extcnf_or_pos,[status(thm)],[946])). thf(949,plain,(((~ (![SX0:$i]: (p1@SX0)))=$false)),inference(extcnf_or_neg,[status(thm)],[947])). thf(950,plain,(((~ (~ (q1@sK54)))=$false)),inference(extcnf_or_neg,[status(thm)],[947])). thf(951,plain,(![SV1:$i]: (((p1@SV1)=$false) | ((q1@SV1)=$true))),inference(extcnf_not_pos,[status(thm)],[948])). thf(952,plain,(((![SX0:$i]: (p1@SX0))=$true)),inference(extcnf_not_neg,[status(thm)],[949])). thf(953,plain,(((~ (q1@sK54))=$true)),inference(extcnf_not_neg,[status(thm)],[950])). thf(954,plain,(![SV2:$i]: (((p1@SV2)=$true))),inference(extcnf_forall_pos,[status(thm)],[952])). thf(955,plain,(((q1@sK54)=$false)),inference(extcnf_not_pos,[status(thm)],[953])). thf(956,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:(lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_951) 2 : :![X2]:lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_954) 3 : :~(lit(ti(at(ti(q1,ft(i,o)),ti(sK54,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_955) 4 : :![X1]:(lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))) : fof_simplification(1) 5 : :~lit(ti(at(ti(q1,ft(i,o)),ti(sK54,i)),o)) : fof_simplification(3) # Garbage collection reclaimed 6 unused term cells. 6 : :![X2]:(lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : variable_rename(4) 7 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(6) 8 : :![X3]:lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o)) : variable_rename(2) 9 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(8) 10 : :[--lit(ti(at(ti(q1,ft(i,o)),ti(sK54,i)),o))] : split_conjunct(5) # Garbage collection reclaimed 24 unused term cells. # Auto-Ordering is analysing problem. # Problem is type HUNFGFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type HUNFGFFSF22MM # Auto-Mode selected heuristic H_____102_C18_F1_PI_AE_Q4_CS_SP_S1S # and selection function SelectComplexAHP. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 11 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--$true] : rw(7,9) 12 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : cn(11) 13 : :[--$true] : rw(10,12) 14 : :[] : cn(13) 15 : :[] : 14 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 3 # Removed by relevancy pruning : 0 # Initial clauses : 3 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 3 # Processed clauses : 3 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 3 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 1 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 2 # Positive orientable unit clauses : 2 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 3 # Indexed BW rewrite successes : 1 # Unification attempts : 5 # Unification successes : 2 # Backwards rewriting index : 13 leaves, 1.15+/-0.361 terms/leaf # Paramod-from index : 1 leaves, 2.00+/-0.000 terms/leaf # Paramod-into index : 12 leaves, 1.17+/-0.373 terms/leaf # ------------------------------------------------- # User time : 0.000 s # System time : 0.003 s # Total time : 0.003 s # Maximum resident set size: 2428 pages ),[status(thm)],[951,955,954])). thf(957,plain,((((![X:$i]: (p1@X)) & (![Y:$i]: (~ (p1@Y))))=$true)),inference(copy,[status(thm)],[131])). thf(958,plain,(((~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (~ (p1@SX0))))))=$true)),inference(unfold_def,[status(thm)],[957])). thf(959,plain,((((~ (![SX0:$i]: (p1@SX0))) | (~ (![SX0:$i]: (~ (p1@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[958])). thf(960,plain,(((~ (![SX0:$i]: (p1@SX0)))=$false)),inference(extcnf_or_neg,[status(thm)],[959])). thf(961,plain,(((~ (![SX0:$i]: (~ (p1@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[959])). thf(962,plain,(((![SX0:$i]: (p1@SX0))=$true)),inference(extcnf_not_neg,[status(thm)],[960])). thf(963,plain,(((![SX0:$i]: (~ (p1@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[961])). thf(964,plain,(![SV1:$i]: (((p1@SV1)=$true))),inference(extcnf_forall_pos,[status(thm)],[962])). thf(965,plain,(![SV2:$i]: (((~ (p1@SV2))=$true))),inference(extcnf_forall_pos,[status(thm)],[963])). thf(966,plain,(![SV2:$i]: (((p1@SV2)=$false))),inference(extcnf_not_pos,[status(thm)],[965])). thf(967,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_964) 2 : :![X2]:~(lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_966) 3 : :![X2]:~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : fof_simplification(2) # Garbage collection reclaimed 3 unused term cells. 4 : :![X2]:lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(1) 5 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(4) 6 : :![X3]:~lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o)) : variable_rename(3) 7 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(6) # Garbage collection reclaimed 16 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 8 : :[--$true] : rw(7,5) 9 : :[] : cn(8) # SZS intermediate status Theorem # SZS answers Tuple [|_] 10 : :[] : eval_answer_literal(9) # Presaturation interreduction done 11 : :[] : 10 : 'proof' # Proof found! # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 2 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 1 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 10 leaves, 1.00+/-0.000 terms/leaf # Paramod-from index : 1 leaves, 1.00+/-0.000 terms/leaf # Paramod-into index : 9 leaves, 1.00+/-0.000 terms/leaf # ------------------------------------------------- # User time : 0.000 s # System time : 0.003 s # Total time : 0.003 s # Maximum resident set size: 2420 pages ),[status(thm)],[964,966])). thf(968,plain,((((p1@sK55) & ((a0 | (![X:$i]: (~ (p1@X)))) & (((~ ($true)) | (~ ($true))) | (![X:$i]: (~ (p1@X))))))=$true)),inference(copy,[status(thm)],[132])). thf(969,plain,(((~ ((~ (p1@sK55)) | (~ (~ ((~ (a0 | (![SX0:$i]: (~ (p1@SX0))))) | (~ (((~ ($true)) | (~ ($true))) | (![SX0:$i]: (~ (p1@SX0))))))))))=$true)),inference(unfold_def,[status(thm)],[968])). thf(970,plain,((((~ (p1@sK55)) | (~ (~ ((~ (a0 | (![SX0:$i]: (~ (p1@SX0))))) | (~ (((~ ($true)) | (~ ($true))) | (![SX0:$i]: (~ (p1@SX0)))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[969])). thf(971,plain,(((~ (p1@sK55))=$false)),inference(extcnf_or_neg,[status(thm)],[970])). thf(972,plain,(((~ (~ ((~ (a0 | (![SX0:$i]: (~ (p1@SX0))))) | (~ (((~ ($true)) | (~ ($true))) | (![SX0:$i]: (~ (p1@SX0))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[970])). thf(973,plain,(((p1@sK55)=$true)),inference(extcnf_not_neg,[status(thm)],[971])). thf(974,plain,(((~ ((~ (a0 | (![SX0:$i]: (~ (p1@SX0))))) | (~ (((~ ($true)) | (~ ($true))) | (![SX0:$i]: (~ (p1@SX0)))))))=$true)),inference(extcnf_not_neg,[status(thm)],[972])). thf(975,plain,((((~ (a0 | (![SX0:$i]: (~ (p1@SX0))))) | (~ (((~ ($true)) | (~ ($true))) | (![SX0:$i]: (~ (p1@SX0))))))=$false)),inference(extcnf_not_pos,[status(thm)],[974])). thf(977,plain,(((~ (((~ ($true)) | (~ ($true))) | (![SX0:$i]: (~ (p1@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[975])). thf(979,plain,(((((~ ($true)) | (~ ($true))) | (![SX0:$i]: (~ (p1@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[977])). thf(981,plain,((((~ ($true)) | (~ ($true)))=$true) | ((![SX0:$i]: (~ (p1@SX0)))=$true)),inference(extcnf_or_pos,[status(thm)],[979])). thf(983,plain,(![SV2:$i]: (((~ (p1@SV2))=$true) | (((~ ($true)) | (~ ($true)))=$true))),inference(extcnf_forall_pos,[status(thm)],[981])). thf(985,plain,(![SV2:$i]: (((p1@SV2)=$false) | (((~ ($true)) | (~ ($true)))=$true))),inference(extcnf_not_pos,[status(thm)],[983])). thf(986,plain,(![SV2:$i]: (((~ ($true))=$true) | ((~ ($true))=$true) | ((p1@SV2)=$false))),inference(extcnf_or_pos,[status(thm)],[985])). thf(987,plain,(![SV2:$i]: ((($true)=$false) | ((p1@SV2)=$false) | ((~ ($true))=$true))),inference(extcnf_not_pos,[status(thm)],[986])). thf(988,plain,(![SV2:$i]: ((($true)=$false) | (($true)=$false) | ((p1@SV2)=$false))),inference(extcnf_not_pos,[status(thm)],[987])). thf(990,plain,(![SV2:$i]: (((p1@SV2)=$false))),inference(sim,[status(thm)],[988])). thf(991,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:~(lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_990) 2 : :![X1]:~(lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_989) 3 : :![X2]:(lit(ti(a0,o))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_984) 4 : :lit(ti(at(ti(p1,ft(i,o)),ti(sK55,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_973) 5 : :![X1]:(~(lit(ti(true,o)))|(~(lit(ti(true,o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_988) 6 : :![X1]:~lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : fof_simplification(1) 7 : :![X1]:~lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : fof_simplification(2) 8 : :![X2]:(lit(ti(a0,o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : fof_simplification(3) 9 : :![X1]:(~lit(ti(true,o))|(~lit(ti(true,o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)))) : fof_simplification(5) # Garbage collection reclaimed 12 unused term cells. 10 : :![X2]:~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(6) 11 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(10) 12 : :![X2]:~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(7) 13 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(12) 14 : :![X3]:(lit(ti(a0,o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : variable_rename(8) 15 : :[++lit(ti(a0,o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(14) 16 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(sK55,i)),o))] : split_conjunct(4) 17 : :![X2]:(~lit(ti(true,o))|(~lit(ti(true,o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)))) : variable_rename(9) 18 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(true,o)),--lit(ti(true,o))] : split_conjunct(17) # Garbage collection reclaimed 26 unused term cells. # Auto-Ordering is analysing problem. # Problem is type HHNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type HHNFNFFSF22MM # Auto-Mode selected heuristic H_____102_C18_F1_PI_AE_Q4_CS_SP_S1S # and selection function SelectComplexAHP. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.007 s 19 : :[] : sr(16,11) # SZS intermediate status Theorem # SZS answers Tuple [|_] 20 : :[] : eval_answer_literal(19) 21 : :[] : 20 : 'proof' # Proof found! # Parsed axioms : 5 # Removed by relevancy pruning : 0 # Initial clauses : 5 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 5 # Processed clauses : 4 # ...of these trivial : 0 # ...subsumed : 2 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 0 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 1 # ...number of literals in the above : 2 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 1 # Unification successes : 0 # Backwards rewriting index : 10 leaves, 1.00+/-0.000 terms/leaf # Paramod-from index : 0 leaves, 0.00+/-0.000 terms/leaf # Paramod-into index : 9 leaves, 1.00+/-0.000 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.003 s # Total time : 0.007 s # Maximum resident set size: 2412 pages ),[status(thm)],[990,973])). thf(992,plain,(((((![X:$i]: (p1@X)) & (q1@sK57)) & ((~ (p1@sK56)) & (![Z:$i]: (~ (r1@Z)))))=$true)),inference(copy,[status(thm)],[133])). thf(993,plain,(((~ ((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (q1@sK57))))) | (~ (~ ((~ (~ (p1@sK56))) | (~ (![SX0:$i]: (~ (r1@SX0)))))))))=$true)),inference(unfold_def,[status(thm)],[992])). thf(994,plain,((((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (q1@sK57))))) | (~ (~ ((~ (~ (p1@sK56))) | (~ (![SX0:$i]: (~ (r1@SX0))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[993])). thf(995,plain,(((~ (~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (q1@sK57)))))=$false)),inference(extcnf_or_neg,[status(thm)],[994])). thf(996,plain,(((~ (~ ((~ (~ (p1@sK56))) | (~ (![SX0:$i]: (~ (r1@SX0)))))))=$false)),inference(extcnf_or_neg,[status(thm)],[994])). thf(997,plain,(((~ ((~ (![SX0:$i]: (p1@SX0))) | (~ (q1@sK57))))=$true)),inference(extcnf_not_neg,[status(thm)],[995])). thf(998,plain,(((~ ((~ (~ (p1@sK56))) | (~ (![SX0:$i]: (~ (r1@SX0))))))=$true)),inference(extcnf_not_neg,[status(thm)],[996])). thf(999,plain,((((~ (![SX0:$i]: (p1@SX0))) | (~ (q1@sK57)))=$false)),inference(extcnf_not_pos,[status(thm)],[997])). thf(1000,plain,((((~ (~ (p1@sK56))) | (~ (![SX0:$i]: (~ (r1@SX0)))))=$false)),inference(extcnf_not_pos,[status(thm)],[998])). thf(1001,plain,(((~ (![SX0:$i]: (p1@SX0)))=$false)),inference(extcnf_or_neg,[status(thm)],[999])). thf(1003,plain,(((~ (~ (p1@sK56)))=$false)),inference(extcnf_or_neg,[status(thm)],[1000])). thf(1005,plain,(((![SX0:$i]: (p1@SX0))=$true)),inference(extcnf_not_neg,[status(thm)],[1001])). thf(1007,plain,(((~ (p1@sK56))=$true)),inference(extcnf_not_neg,[status(thm)],[1003])). thf(1009,plain,(![SV1:$i]: (((p1@SV1)=$true))),inference(extcnf_forall_pos,[status(thm)],[1005])). thf(1010,plain,(((p1@sK56)=$false)),inference(extcnf_not_pos,[status(thm)],[1007])). thf(1013,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:~(lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1012) 2 : :lit(ti(at(ti(q1,ft(i,o)),ti(sK57,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1006) 3 : :~(lit(ti(at(ti(p1,ft(i,o)),ti(sK56,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1010) 4 : :![X2]:lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1009) 5 : :![X1]:~lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o)) : fof_simplification(1) 6 : :~lit(ti(at(ti(p1,ft(i,o)),ti(sK56,i)),o)) : fof_simplification(3) # Garbage collection reclaimed 5 unused term cells. 7 : :![X2]:~lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o)) : variable_rename(5) 8 : :[--lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(7) 9 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(sK57,i)),o))] : split_conjunct(2) 10 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(sK56,i)),o))] : split_conjunct(6) 11 : :![X3]:lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o)) : variable_rename(4) 12 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(11) # Garbage collection reclaimed 21 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UUNFNFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 13 : :[--$true] : rw(10,12) 14 : :[] : cn(13) # SZS intermediate status Theorem # SZS answers Tuple [|_] 15 : :[] : eval_answer_literal(14) # Presaturation interreduction done 16 : :[] : 15 : 'proof' # Proof found! # Parsed axioms : 4 # Removed by relevancy pruning : 0 # Initial clauses : 4 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 4 # Processed clauses : 4 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 3 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 3 # Positive orientable unit clauses : 2 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 2 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 18 leaves, 1.22+/-0.629 terms/leaf # Paramod-from index : 1 leaves, 2.00+/-0.000 terms/leaf # Paramod-into index : 17 leaves, 1.24+/-0.644 terms/leaf # ------------------------------------------------- # User time : 0.000 s # System time : 0.003 s # Total time : 0.003 s # Maximum resident set size: 2444 pages ),[status(thm)],[1010,1009])). thf(1014,plain,((((![X:$i]: (p1@X)) & ((~ (p1@sK59)) | (~ (p1@sK58))))=$true)),inference(copy,[status(thm)],[134])). thf(1015,plain,(((~ ((~ (![SX0:$i]: (p1@SX0))) | (~ ((~ (p1@sK59)) | (~ (p1@sK58))))))=$true)),inference(unfold_def,[status(thm)],[1014])). thf(1016,plain,((((~ (![SX0:$i]: (p1@SX0))) | (~ ((~ (p1@sK59)) | (~ (p1@sK58)))))=$false)),inference(extcnf_not_pos,[status(thm)],[1015])). thf(1017,plain,(((~ (![SX0:$i]: (p1@SX0)))=$false)),inference(extcnf_or_neg,[status(thm)],[1016])). thf(1018,plain,(((~ ((~ (p1@sK59)) | (~ (p1@sK58))))=$false)),inference(extcnf_or_neg,[status(thm)],[1016])). thf(1019,plain,(((![SX0:$i]: (p1@SX0))=$true)),inference(extcnf_not_neg,[status(thm)],[1017])). thf(1020,plain,((((~ (p1@sK59)) | (~ (p1@sK58)))=$true)),inference(extcnf_not_neg,[status(thm)],[1018])). thf(1021,plain,(![SV1:$i]: (((p1@SV1)=$true))),inference(extcnf_forall_pos,[status(thm)],[1019])). thf(1022,plain,(((~ (p1@sK59))=$true) | ((~ (p1@sK58))=$true)),inference(extcnf_or_pos,[status(thm)],[1020])). thf(1023,plain,(((p1@sK59)=$false) | ((~ (p1@sK58))=$true)),inference(extcnf_not_pos,[status(thm)],[1022])). thf(1024,plain,(((p1@sK58)=$false) | ((p1@sK59)=$false)),inference(extcnf_not_pos,[status(thm)],[1023])). thf(1025,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :(~(lit(ti(at(ti(p1,ft(i,o)),ti(sK58,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(sK59,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1024) 2 : :![X1]:lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1021) 3 : :(~lit(ti(at(ti(p1,ft(i,o)),ti(sK58,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(sK59,i)),o))) : fof_simplification(1) # Garbage collection reclaimed 5 unused term cells. 4 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(sK59,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(sK58,i)),o))] : split_conjunct(3) 5 : :![X2]:lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)) : variable_rename(2) 6 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(5) # Garbage collection reclaimed 11 unused term cells. # Auto-Ordering is analysing problem. # Problem is type UHNFGFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type UHNFGFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 7 : :[--$true,--lit(ti(at(ti(p1,ft(i,o)),ti(sK59,i)),o))] : rw(4,6) 8 : :[--$true,--$true] : rw(7,6) 9 : :[] : cn(8) # SZS intermediate status Theorem # SZS answers Tuple [|_] 10 : :[] : eval_answer_literal(9) # Presaturation interreduction done 11 : :[] : 10 : 'proof' # Proof found! # Parsed axioms : 2 # Removed by relevancy pruning : 0 # Initial clauses : 2 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 2 # Processed clauses : 2 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 1 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 0 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 0 # Paramodulations : 0 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 1 # Positive orientable unit clauses : 1 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 0 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 0 # Rec. Clause-clause subsumption calls : 0 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 0 # Unification successes : 0 # Backwards rewriting index : 10 leaves, 1.00+/-0.000 terms/leaf # Paramod-from index : 1 leaves, 1.00+/-0.000 terms/leaf # Paramod-into index : 9 leaves, 1.00+/-0.000 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2432 pages ),[status(thm)],[1024,1021])). thf(1026,plain,(((![SY229:$i,SY230:$i,SY231:$i]: ((((((e@sK60) & (p1@sK60)) & ((~ (e@SY229)) | ((g@SY229) | ((s@SY229)@(f@SY229))))) & ((~ (e@SY230)) | ((c@(f@SY230)) | (g@SY230)))) & (![SY232:$i]: ((~ ((s@sK60)@SY232)) | (p1@SY232)))) & (((~ (g@SY231)) | (~ (p1@SY231))) & (![X4:$i]: ((~ (c@X4)) | (~ (p1@X4)))))))=$true)),inference(copy,[status(thm)],[135])). thf(1027,plain,(((![SX0:$i,SX1:$i,SX2:$i]: (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SX0)) | ((g@SX0) | ((s@SX0)@(f@SX0)))))))) | (~ ((~ (e@SX1)) | ((c@(f@SX1)) | (g@SX1))))))) | (~ (![SX3:$i]: ((~ ((s@sK60)@SX3)) | (p1@SX3))))))) | (~ (~ ((~ ((~ (g@SX2)) | (~ (p1@SX2)))) | (~ (![SX3:$i]: ((~ (c@SX3)) | (~ (p1@SX3)))))))))))=$true)),inference(unfold_def,[status(thm)],[1026])). thf(1028,plain,(![SV1:$i]: (((![SY289:$i,SY290:$i]: (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1)))))))) | (~ ((~ (e@SY289)) | ((c@(f@SY289)) | (g@SY289))))))) | (~ (![SX3:$i]: ((~ ((s@sK60)@SX3)) | (p1@SX3))))))) | (~ (~ ((~ ((~ (g@SY290)) | (~ (p1@SY290)))) | (~ (![SX3:$i]: ((~ (c@SX3)) | (~ (p1@SX3)))))))))))=$true))),inference(extcnf_forall_pos,[status(thm)],[1027])). thf(1029,plain,(![SV2:$i,SV1:$i]: (((![SY293:$i]: (~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1)))))))) | (~ ((~ (e@SV2)) | ((c@(f@SV2)) | (g@SV2))))))) | (~ (![SX3:$i]: ((~ ((s@sK60)@SX3)) | (p1@SX3))))))) | (~ (~ ((~ ((~ (g@SY293)) | (~ (p1@SY293)))) | (~ (![SX3:$i]: ((~ (c@SX3)) | (~ (p1@SX3)))))))))))=$true))),inference(extcnf_forall_pos,[status(thm)],[1028])). thf(1030,plain,(![SV3:$i,SV2:$i,SV1:$i]: (((~ ((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1)))))))) | (~ ((~ (e@SV2)) | ((c@(f@SV2)) | (g@SV2))))))) | (~ (![SX3:$i]: ((~ ((s@sK60)@SX3)) | (p1@SX3))))))) | (~ (~ ((~ ((~ (g@SV3)) | (~ (p1@SV3)))) | (~ (![SX3:$i]: ((~ (c@SX3)) | (~ (p1@SX3))))))))))=$true))),inference(extcnf_forall_pos,[status(thm)],[1029])). thf(1031,plain,(![SV3:$i,SV2:$i,SV1:$i]: ((((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1)))))))) | (~ ((~ (e@SV2)) | ((c@(f@SV2)) | (g@SV2))))))) | (~ (![SX3:$i]: ((~ ((s@sK60)@SX3)) | (p1@SX3))))))) | (~ (~ ((~ ((~ (g@SV3)) | (~ (p1@SV3)))) | (~ (![SX3:$i]: ((~ (c@SX3)) | (~ (p1@SX3)))))))))=$false))),inference(extcnf_not_pos,[status(thm)],[1030])). thf(1032,plain,(![SV2:$i,SV1:$i]: (((~ (~ ((~ (~ ((~ (~ ((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1)))))))) | (~ ((~ (e@SV2)) | ((c@(f@SV2)) | (g@SV2))))))) | (~ (![SX3:$i]: ((~ ((s@sK60)@SX3)) | (p1@SX3)))))))=$false))),inference(extcnf_or_neg,[status(thm)],[1031])). thf(1033,plain,(![SV3:$i]: (((~ (~ ((~ ((~ (g@SV3)) | (~ (p1@SV3)))) | (~ (![SX3:$i]: ((~ (c@SX3)) | (~ (p1@SX3))))))))=$false))),inference(extcnf_or_neg,[status(thm)],[1031])). thf(1034,plain,(![SV2:$i,SV1:$i]: (((~ ((~ (~ ((~ (~ ((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1)))))))) | (~ ((~ (e@SV2)) | ((c@(f@SV2)) | (g@SV2))))))) | (~ (![SX3:$i]: ((~ ((s@sK60)@SX3)) | (p1@SX3))))))=$true))),inference(extcnf_not_neg,[status(thm)],[1032])). thf(1035,plain,(![SV3:$i]: (((~ ((~ ((~ (g@SV3)) | (~ (p1@SV3)))) | (~ (![SX3:$i]: ((~ (c@SX3)) | (~ (p1@SX3)))))))=$true))),inference(extcnf_not_neg,[status(thm)],[1033])). thf(1036,plain,(![SV2:$i,SV1:$i]: ((((~ (~ ((~ (~ ((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1)))))))) | (~ ((~ (e@SV2)) | ((c@(f@SV2)) | (g@SV2))))))) | (~ (![SX3:$i]: ((~ ((s@sK60)@SX3)) | (p1@SX3)))))=$false))),inference(extcnf_not_pos,[status(thm)],[1034])). thf(1037,plain,(![SV3:$i]: ((((~ ((~ (g@SV3)) | (~ (p1@SV3)))) | (~ (![SX3:$i]: ((~ (c@SX3)) | (~ (p1@SX3))))))=$false))),inference(extcnf_not_pos,[status(thm)],[1035])). thf(1038,plain,(![SV2:$i,SV1:$i]: (((~ (~ ((~ (~ ((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1)))))))) | (~ ((~ (e@SV2)) | ((c@(f@SV2)) | (g@SV2)))))))=$false))),inference(extcnf_or_neg,[status(thm)],[1036])). thf(1039,plain,(((~ (![SX3:$i]: ((~ ((s@sK60)@SX3)) | (p1@SX3))))=$false)),inference(extcnf_or_neg,[status(thm)],[1036])). thf(1040,plain,(![SV3:$i]: (((~ ((~ (g@SV3)) | (~ (p1@SV3))))=$false))),inference(extcnf_or_neg,[status(thm)],[1037])). thf(1041,plain,(((~ (![SX3:$i]: ((~ (c@SX3)) | (~ (p1@SX3)))))=$false)),inference(extcnf_or_neg,[status(thm)],[1037])). thf(1042,plain,(![SV2:$i,SV1:$i]: (((~ ((~ (~ ((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1)))))))) | (~ ((~ (e@SV2)) | ((c@(f@SV2)) | (g@SV2))))))=$true))),inference(extcnf_not_neg,[status(thm)],[1038])). thf(1043,plain,(((![SX3:$i]: ((~ ((s@sK60)@SX3)) | (p1@SX3)))=$true)),inference(extcnf_not_neg,[status(thm)],[1039])). thf(1044,plain,(![SV3:$i]: ((((~ (g@SV3)) | (~ (p1@SV3)))=$true))),inference(extcnf_not_neg,[status(thm)],[1040])). thf(1045,plain,(((![SX3:$i]: ((~ (c@SX3)) | (~ (p1@SX3))))=$true)),inference(extcnf_not_neg,[status(thm)],[1041])). thf(1046,plain,(![SV2:$i,SV1:$i]: ((((~ (~ ((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1)))))))) | (~ ((~ (e@SV2)) | ((c@(f@SV2)) | (g@SV2)))))=$false))),inference(extcnf_not_pos,[status(thm)],[1042])). thf(1047,plain,(![SV4:$i]: ((((~ ((s@sK60)@SV4)) | (p1@SV4))=$true))),inference(extcnf_forall_pos,[status(thm)],[1043])). thf(1048,plain,(![SV3:$i]: (((~ (g@SV3))=$true) | ((~ (p1@SV3))=$true))),inference(extcnf_or_pos,[status(thm)],[1044])). thf(1049,plain,(![SV5:$i]: ((((~ (c@SV5)) | (~ (p1@SV5)))=$true))),inference(extcnf_forall_pos,[status(thm)],[1045])). thf(1050,plain,(![SV1:$i]: (((~ (~ ((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1))))))))=$false))),inference(extcnf_or_neg,[status(thm)],[1046])). thf(1051,plain,(![SV2:$i]: (((~ ((~ (e@SV2)) | ((c@(f@SV2)) | (g@SV2))))=$false))),inference(extcnf_or_neg,[status(thm)],[1046])). thf(1052,plain,(![SV4:$i]: (((~ ((s@sK60)@SV4))=$true) | ((p1@SV4)=$true))),inference(extcnf_or_pos,[status(thm)],[1047])). thf(1053,plain,(![SV3:$i]: (((g@SV3)=$false) | ((~ (p1@SV3))=$true))),inference(extcnf_not_pos,[status(thm)],[1048])). thf(1054,plain,(![SV5:$i]: (((~ (c@SV5))=$true) | ((~ (p1@SV5))=$true))),inference(extcnf_or_pos,[status(thm)],[1049])). thf(1055,plain,(![SV1:$i]: (((~ ((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1)))))))=$true))),inference(extcnf_not_neg,[status(thm)],[1050])). thf(1056,plain,(![SV2:$i]: ((((~ (e@SV2)) | ((c@(f@SV2)) | (g@SV2)))=$true))),inference(extcnf_not_neg,[status(thm)],[1051])). thf(1057,plain,(![SV4:$i]: ((((s@sK60)@SV4)=$false) | ((p1@SV4)=$true))),inference(extcnf_not_pos,[status(thm)],[1052])). thf(1058,plain,(![SV3:$i]: (((p1@SV3)=$false) | ((g@SV3)=$false))),inference(extcnf_not_pos,[status(thm)],[1053])). thf(1059,plain,(![SV5:$i]: (((c@SV5)=$false) | ((~ (p1@SV5))=$true))),inference(extcnf_not_pos,[status(thm)],[1054])). thf(1060,plain,(![SV1:$i]: ((((~ (~ ((~ (e@sK60)) | (~ (p1@sK60))))) | (~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1))))))=$false))),inference(extcnf_not_pos,[status(thm)],[1055])). thf(1061,plain,(![SV2:$i]: (((~ (e@SV2))=$true) | (((c@(f@SV2)) | (g@SV2))=$true))),inference(extcnf_or_pos,[status(thm)],[1056])). thf(1062,plain,(![SV5:$i]: (((p1@SV5)=$false) | ((c@SV5)=$false))),inference(extcnf_not_pos,[status(thm)],[1059])). thf(1063,plain,(((~ (~ ((~ (e@sK60)) | (~ (p1@sK60)))))=$false)),inference(extcnf_or_neg,[status(thm)],[1060])). thf(1064,plain,(![SV1:$i]: (((~ ((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1)))))=$false))),inference(extcnf_or_neg,[status(thm)],[1060])). thf(1065,plain,(![SV2:$i]: (((e@SV2)=$false) | (((c@(f@SV2)) | (g@SV2))=$true))),inference(extcnf_not_pos,[status(thm)],[1061])). thf(1066,plain,(((~ ((~ (e@sK60)) | (~ (p1@sK60))))=$true)),inference(extcnf_not_neg,[status(thm)],[1063])). thf(1067,plain,(![SV1:$i]: ((((~ (e@SV1)) | ((g@SV1) | ((s@SV1)@(f@SV1))))=$true))),inference(extcnf_not_neg,[status(thm)],[1064])). thf(1068,plain,(![SV2:$i]: (((c@(f@SV2))=$true) | ((g@SV2)=$true) | ((e@SV2)=$false))),inference(extcnf_or_pos,[status(thm)],[1065])). thf(1069,plain,((((~ (e@sK60)) | (~ (p1@sK60)))=$false)),inference(extcnf_not_pos,[status(thm)],[1066])). thf(1070,plain,(![SV1:$i]: (((~ (e@SV1))=$true) | (((g@SV1) | ((s@SV1)@(f@SV1)))=$true))),inference(extcnf_or_pos,[status(thm)],[1067])). thf(1071,plain,(((~ (e@sK60))=$false)),inference(extcnf_or_neg,[status(thm)],[1069])). thf(1072,plain,(((~ (p1@sK60))=$false)),inference(extcnf_or_neg,[status(thm)],[1069])). thf(1073,plain,(![SV1:$i]: (((e@SV1)=$false) | (((g@SV1) | ((s@SV1)@(f@SV1)))=$true))),inference(extcnf_not_pos,[status(thm)],[1070])). thf(1074,plain,(((e@sK60)=$true)),inference(extcnf_not_neg,[status(thm)],[1071])). thf(1075,plain,(((p1@sK60)=$true)),inference(extcnf_not_neg,[status(thm)],[1072])). thf(1076,plain,(![SV1:$i]: (((g@SV1)=$true) | (((s@SV1)@(f@SV1))=$true) | ((e@SV1)=$false))),inference(extcnf_or_pos,[status(thm)],[1073])). thf(1077,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:(lit(ti(at(ti(g,ft(i,o)),ti(X1,i)),o))|(~(lit(ti(at(ti(e,ft(i,o)),ti(X1,i)),o)))|lit(ti(at(ti(c,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1068) 2 : :![X2]:(~(lit(ti(at(ti(at(ti(s,ft(i,ft(i,o))),ti(sK60,i)),ft(i,o)),ti(X2,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1057) 3 : :![X3]:(~(lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o)))|~(lit(ti(at(ti(g,ft(i,o)),ti(X3,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1058) 4 : :![X4]:(~(lit(ti(at(ti(p1,ft(i,o)),ti(X4,i)),o)))|~(lit(ti(at(ti(c,ft(i,o)),ti(X4,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1062) 5 : :lit(ti(at(ti(e,ft(i,o)),ti(sK60,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1074) 6 : :lit(ti(at(ti(p1,ft(i,o)),ti(sK60,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1075) 7 : :![X5]:(lit(ti(at(ti(at(ti(s,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X5,i)),i)),o))|(lit(ti(at(ti(g,ft(i,o)),ti(X5,i)),o))|~(lit(ti(at(ti(e,ft(i,o)),ti(X5,i)),o))))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1076) 8 : :![X1]:(lit(ti(at(ti(g,ft(i,o)),ti(X1,i)),o))|(~lit(ti(at(ti(e,ft(i,o)),ti(X1,i)),o))|lit(ti(at(ti(c,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)))) : fof_simplification(1) 9 : :![X2]:(~lit(ti(at(ti(at(ti(s,ft(i,ft(i,o))),ti(sK60,i)),ft(i,o)),ti(X2,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))) : fof_simplification(2) 10 : :![X3]:(~lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))|~lit(ti(at(ti(g,ft(i,o)),ti(X3,i)),o))) : fof_simplification(3) 11 : :![X4]:(~lit(ti(at(ti(p1,ft(i,o)),ti(X4,i)),o))|~lit(ti(at(ti(c,ft(i,o)),ti(X4,i)),o))) : fof_simplification(4) 12 : :![X5]:(lit(ti(at(ti(at(ti(s,ft(i,ft(i,o))),ti(X5,i)),ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X5,i)),i)),o))|(lit(ti(at(ti(g,ft(i,o)),ti(X5,i)),o))|~lit(ti(at(ti(e,ft(i,o)),ti(X5,i)),o)))) : fof_simplification(7) # Garbage collection reclaimed 26 unused term cells. 13 : :![X2]:(lit(ti(at(ti(g,ft(i,o)),ti(X2,i)),o))|(~lit(ti(at(ti(e,ft(i,o)),ti(X2,i)),o))|lit(ti(at(ti(c,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X2,i)),i)),o)))) : variable_rename(8) 14 : :[++lit(ti(at(ti(c,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)),++lit(ti(at(ti(g,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(e,ft(i,o)),ti(X1,i)),o))] : split_conjunct(13) 15 : :![X3]:(~lit(ti(at(ti(at(ti(s,ft(i,ft(i,o))),ti(sK60,i)),ft(i,o)),ti(X3,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(X3,i)),o))) : variable_rename(9) 16 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(at(ti(s,ft(i,ft(i,o))),ti(sK60,i)),ft(i,o)),ti(X1,i)),o))] : split_conjunct(15) 17 : :![X4]:(~lit(ti(at(ti(p1,ft(i,o)),ti(X4,i)),o))|~lit(ti(at(ti(g,ft(i,o)),ti(X4,i)),o))) : variable_rename(10) 18 : :[--lit(ti(at(ti(g,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(17) 19 : :![X5]:(~lit(ti(at(ti(p1,ft(i,o)),ti(X5,i)),o))|~lit(ti(at(ti(c,ft(i,o)),ti(X5,i)),o))) : variable_rename(11) 20 : :[--lit(ti(at(ti(c,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(19) 21 : :[++lit(ti(at(ti(e,ft(i,o)),ti(sK60,i)),o))] : split_conjunct(5) 22 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(sK60,i)),o))] : split_conjunct(6) 23 : :![X6]:(lit(ti(at(ti(at(ti(s,ft(i,ft(i,o))),ti(X6,i)),ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X6,i)),i)),o))|(lit(ti(at(ti(g,ft(i,o)),ti(X6,i)),o))|~lit(ti(at(ti(e,ft(i,o)),ti(X6,i)),o)))) : variable_rename(12) 24 : :[++lit(ti(at(ti(g,ft(i,o)),ti(X1,i)),o)),++lit(ti(at(ti(at(ti(s,ft(i,ft(i,o))),ti(X1,i)),ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)),--lit(ti(at(ti(e,ft(i,o)),ti(X1,i)),o))] : split_conjunct(23) # Garbage collection reclaimed 121 unused term cells. # Auto-Ordering is analysing problem. # Problem is type GHNFNFFMF22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type GHNFNFFMF22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.007 s # Presaturation interreduction done 25 : :[++lit(ti(at(ti(g,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)),--lit(ti(at(ti(e,ft(i,o)),ti(X1,i)),o))] : spm(20,14) 26 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(sK60,i)),i)),o)),++lit(ti(at(ti(g,ft(i,o)),ti(sK60,i)),o)),--lit(ti(at(ti(e,ft(i,o)),ti(sK60,i)),o))] : spm(16,24) 27 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(sK60,i)),i)),o)),++lit(ti(at(ti(g,ft(i,o)),ti(sK60,i)),o)),--$true] : rw(26,21) 28 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(sK60,i)),i)),o)),++lit(ti(at(ti(g,ft(i,o)),ti(sK60,i)),o))] : cn(27) 29 : :[++lit(ti(at(ti(g,ft(i,o)),ti(sK60,i)),o)),--lit(ti(at(ti(e,ft(i,o)),ti(sK60,i)),o))] : spm(25,28) 30 : :[++lit(ti(at(ti(g,ft(i,o)),ti(sK60,i)),o)),--$true] : rw(29,21) 31 : :[++lit(ti(at(ti(g,ft(i,o)),ti(sK60,i)),o))] : cn(30) 32 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(sK60,i)),o))] : spm(18,31) 33 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(sK60,i)),i)),o)),++$true] : rw(28,31) 34 : :[--$true] : rw(32,22) 35 : :[] : cn(34) 36 : :[] : 35 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 7 # Removed by relevancy pruning : 0 # Initial clauses : 7 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 7 # Processed clauses : 17 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 17 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 1 # Generated clauses : 4 # ...of the previous two non-trivial : 3 # Contextual simplify-reflections : 0 # Paramodulations : 4 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 9 # Positive orientable unit clauses : 3 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 6 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 1 # Rec. Clause-clause subsumption calls : 1 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 14 # Indexed BW rewrite successes : 1 # Unification attempts : 54 # Unification successes : 10 # Backwards rewriting index : 39 leaves, 1.54+/-2.205 terms/leaf # Paramod-from index : 1 leaves, 5.00+/-0.000 terms/leaf # Paramod-into index : 36 leaves, 1.47+/-1.833 terms/leaf # ------------------------------------------------- # User time : 0.007 s # System time : 0.000 s # Total time : 0.007 s # Maximum resident set size: 2612 pages ),[status(thm)],[1068,1076,1075,1074,1062,1058,1057])). thf(1078,plain,((((((a1@sK61) & (~ (b@sK61))) & (![X:$i]: ((~ (a1@X)) | ((b@X) | (c@X))))) & (![X:$i]: ((~ (a1@X)) | (~ (c@X)))))=$true)),inference(copy,[status(thm)],[136])). thf(1079,plain,(((~ ((~ (~ ((~ (~ ((~ (a1@sK61)) | (~ (~ (b@sK61)))))) | (~ (![SX0:$i]: ((~ (a1@SX0)) | ((b@SX0) | (c@SX0)))))))) | (~ (![SX0:$i]: ((~ (a1@SX0)) | (~ (c@SX0)))))))=$true)),inference(unfold_def,[status(thm)],[1078])). thf(1080,plain,((((~ (~ ((~ (~ ((~ (a1@sK61)) | (~ (~ (b@sK61)))))) | (~ (![SX0:$i]: ((~ (a1@SX0)) | ((b@SX0) | (c@SX0)))))))) | (~ (![SX0:$i]: ((~ (a1@SX0)) | (~ (c@SX0))))))=$false)),inference(extcnf_not_pos,[status(thm)],[1079])). thf(1081,plain,(((~ (~ ((~ (~ ((~ (a1@sK61)) | (~ (~ (b@sK61)))))) | (~ (![SX0:$i]: ((~ (a1@SX0)) | ((b@SX0) | (c@SX0))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[1080])). thf(1082,plain,(((~ (![SX0:$i]: ((~ (a1@SX0)) | (~ (c@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[1080])). thf(1083,plain,(((~ ((~ (~ ((~ (a1@sK61)) | (~ (~ (b@sK61)))))) | (~ (![SX0:$i]: ((~ (a1@SX0)) | ((b@SX0) | (c@SX0)))))))=$true)),inference(extcnf_not_neg,[status(thm)],[1081])). thf(1084,plain,(((![SX0:$i]: ((~ (a1@SX0)) | (~ (c@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[1082])). thf(1085,plain,((((~ (~ ((~ (a1@sK61)) | (~ (~ (b@sK61)))))) | (~ (![SX0:$i]: ((~ (a1@SX0)) | ((b@SX0) | (c@SX0))))))=$false)),inference(extcnf_not_pos,[status(thm)],[1083])). thf(1086,plain,(![SV1:$i]: ((((~ (a1@SV1)) | (~ (c@SV1)))=$true))),inference(extcnf_forall_pos,[status(thm)],[1084])). thf(1087,plain,(((~ (~ ((~ (a1@sK61)) | (~ (~ (b@sK61))))))=$false)),inference(extcnf_or_neg,[status(thm)],[1085])). thf(1088,plain,(((~ (![SX0:$i]: ((~ (a1@SX0)) | ((b@SX0) | (c@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[1085])). thf(1089,plain,(![SV1:$i]: (((~ (a1@SV1))=$true) | ((~ (c@SV1))=$true))),inference(extcnf_or_pos,[status(thm)],[1086])). thf(1090,plain,(((~ ((~ (a1@sK61)) | (~ (~ (b@sK61)))))=$true)),inference(extcnf_not_neg,[status(thm)],[1087])). thf(1091,plain,(((![SX0:$i]: ((~ (a1@SX0)) | ((b@SX0) | (c@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[1088])). thf(1092,plain,(![SV1:$i]: (((a1@SV1)=$false) | ((~ (c@SV1))=$true))),inference(extcnf_not_pos,[status(thm)],[1089])). thf(1093,plain,((((~ (a1@sK61)) | (~ (~ (b@sK61))))=$false)),inference(extcnf_not_pos,[status(thm)],[1090])). thf(1094,plain,(![SV2:$i]: ((((~ (a1@SV2)) | ((b@SV2) | (c@SV2)))=$true))),inference(extcnf_forall_pos,[status(thm)],[1091])). thf(1095,plain,(![SV1:$i]: (((c@SV1)=$false) | ((a1@SV1)=$false))),inference(extcnf_not_pos,[status(thm)],[1092])). thf(1096,plain,(((~ (a1@sK61))=$false)),inference(extcnf_or_neg,[status(thm)],[1093])). thf(1097,plain,(((~ (~ (b@sK61)))=$false)),inference(extcnf_or_neg,[status(thm)],[1093])). thf(1098,plain,(![SV2:$i]: (((~ (a1@SV2))=$true) | (((b@SV2) | (c@SV2))=$true))),inference(extcnf_or_pos,[status(thm)],[1094])). thf(1099,plain,(((a1@sK61)=$true)),inference(extcnf_not_neg,[status(thm)],[1096])). thf(1100,plain,(((~ (b@sK61))=$true)),inference(extcnf_not_neg,[status(thm)],[1097])). thf(1101,plain,(![SV2:$i]: (((a1@SV2)=$false) | (((b@SV2) | (c@SV2))=$true))),inference(extcnf_not_pos,[status(thm)],[1098])). thf(1102,plain,(((b@sK61)=$false)),inference(extcnf_not_pos,[status(thm)],[1100])). thf(1103,plain,(![SV2:$i]: (((b@SV2)=$true) | ((c@SV2)=$true) | ((a1@SV2)=$false))),inference(extcnf_or_pos,[status(thm)],[1101])). thf(1104,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :~(lit(ti(at(ti(b,ft(i,o)),ti(sK61,i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1102) 2 : :![X1]:(lit(ti(at(ti(c,ft(i,o)),ti(X1,i)),o))|(lit(ti(at(ti(b,ft(i,o)),ti(X1,i)),o))|~(lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o))))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1103) 3 : :![X2]:(~(lit(ti(at(ti(c,ft(i,o)),ti(X2,i)),o)))|~(lit(ti(at(ti(a1,ft(i,o)),ti(X2,i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1095) 4 : :lit(ti(at(ti(a1,ft(i,o)),ti(sK61,i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1099) 5 : :~lit(ti(at(ti(b,ft(i,o)),ti(sK61,i)),o)) : fof_simplification(1) 6 : :![X1]:(lit(ti(at(ti(c,ft(i,o)),ti(X1,i)),o))|(lit(ti(at(ti(b,ft(i,o)),ti(X1,i)),o))|~lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o)))) : fof_simplification(2) 7 : :![X2]:(~lit(ti(at(ti(c,ft(i,o)),ti(X2,i)),o))|~lit(ti(at(ti(a1,ft(i,o)),ti(X2,i)),o))) : fof_simplification(3) # Garbage collection reclaimed 13 unused term cells. 8 : :[--lit(ti(at(ti(b,ft(i,o)),ti(sK61,i)),o))] : split_conjunct(5) 9 : :![X2]:(lit(ti(at(ti(c,ft(i,o)),ti(X2,i)),o))|(lit(ti(at(ti(b,ft(i,o)),ti(X2,i)),o))|~lit(ti(at(ti(a1,ft(i,o)),ti(X2,i)),o)))) : variable_rename(6) 10 : :[++lit(ti(at(ti(b,ft(i,o)),ti(X1,i)),o)),++lit(ti(at(ti(c,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(9) 11 : :![X3]:(~lit(ti(at(ti(c,ft(i,o)),ti(X3,i)),o))|~lit(ti(at(ti(a1,ft(i,o)),ti(X3,i)),o))) : variable_rename(7) 12 : :[--lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(c,ft(i,o)),ti(X1,i)),o))] : split_conjunct(11) 13 : :[++lit(ti(at(ti(a1,ft(i,o)),ti(sK61,i)),o))] : split_conjunct(4) # Garbage collection reclaimed 38 unused term cells. # Auto-Ordering is analysing problem. # Problem is type GHNFNFFSF22MM # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type GHNFNFFSF22MM # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.007 s 14 : :[++lit(ti(at(ti(b,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(a1,ft(i,o)),ti(X1,i)),o))] : csr(10,12) # Presaturation interreduction done 15 : :[--lit(ti(at(ti(a1,ft(i,o)),ti(sK61,i)),o))] : spm(8,14) 16 : :[--$true] : rw(15,13) 17 : :[] : cn(16) 18 : :[] : 17 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 4 # Removed by relevancy pruning : 0 # Initial clauses : 4 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 4 # Processed clauses : 7 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 7 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 0 # Backward-rewritten : 0 # Generated clauses : 1 # ...of the previous two non-trivial : 0 # Contextual simplify-reflections : 1 # Paramodulations : 1 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 3 # Positive orientable unit clauses : 1 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 1 # Current number of unprocessed clauses: 1 # ...number of literals in the above : 2 # Clause-clause subsumption calls (NU) : 1 # Rec. Clause-clause subsumption calls : 1 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 0 # Indexed BW rewrite successes : 0 # Unification attempts : 6 # Unification successes : 3 # Backwards rewriting index : 17 leaves, 1.35+/-0.967 terms/leaf # Paramod-from index : 1 leaves, 2.00+/-0.000 terms/leaf # Paramod-into index : 15 leaves, 1.27+/-0.680 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.003 s # Total time : 0.007 s # Maximum resident set size: 2536 pages ),[status(thm)],[1102,1099,1095,1103])). thf(1105,plain,((((q1@(f@sK62)) & (((![Y:$i]: (p1@(f@Y))) | (![X:$i]: (~ (q1@X)))) & ((![X:$i]: (((![Y:$i]: (r1@Y)) | (~ (p1@X))) | (~ (q1@X)))) & (![SY244:$i]: ((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SY244))) | (~ (q1@SY244)))))))=$true)),inference(copy,[status(thm)],[137])). thf(1106,plain,(((~ ((~ (q1@(f@sK62))) | (~ (~ ((~ ((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SX0))) | (~ (q1@SX0)))))))))))))=$true)),inference(unfold_def,[status(thm)],[1105])). thf(1107,plain,((((~ (q1@(f@sK62))) | (~ (~ ((~ ((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SX0))) | (~ (q1@SX0))))))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[1106])). thf(1108,plain,(((~ (q1@(f@sK62)))=$false)),inference(extcnf_or_neg,[status(thm)],[1107])). thf(1109,plain,(((~ (~ ((~ ((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SX0))) | (~ (q1@SX0)))))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[1107])). thf(1110,plain,(((q1@(f@sK62))=$true)),inference(extcnf_not_neg,[status(thm)],[1108])). thf(1111,plain,(((~ ((~ ((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SX0))) | (~ (q1@SX0))))))))))=$true)),inference(extcnf_not_neg,[status(thm)],[1109])). thf(1112,plain,((((~ ((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SX0))) | (~ (q1@SX0)))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[1111])). thf(1113,plain,(((~ ((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[1112])). thf(1114,plain,(((~ (~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SX0))) | (~ (q1@SX0))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[1112])). thf(1115,plain,((((![SX0:$i]: (p1@(f@SX0))) | (![SX0:$i]: (~ (q1@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[1113])). thf(1116,plain,(((~ ((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SX0))) | (~ (q1@SX0)))))))=$true)),inference(extcnf_not_neg,[status(thm)],[1114])). thf(1117,plain,(((![SX0:$i]: (p1@(f@SX0)))=$true) | ((![SX0:$i]: (~ (q1@SX0)))=$true)),inference(extcnf_or_pos,[status(thm)],[1115])). thf(1118,plain,((((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: ((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SX0))) | (~ (q1@SX0))))))=$false)),inference(extcnf_not_pos,[status(thm)],[1116])). thf(1119,plain,(![SV1:$i]: (((p1@(f@SV1))=$true) | ((![SX0:$i]: (~ (q1@SX0)))=$true))),inference(extcnf_forall_pos,[status(thm)],[1117])). thf(1120,plain,(((~ (![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[1118])). thf(1121,plain,(((~ (![SX0:$i]: ((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SX0))) | (~ (q1@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[1118])). thf(1122,plain,(![SV1:$i,SV2:$i]: (((~ (q1@SV2))=$true) | ((p1@(f@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[1119])). thf(1123,plain,(((![SX0:$i]: (((![SX1:$i]: (r1@SX1)) | (~ (p1@SX0))) | (~ (q1@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[1120])). thf(1124,plain,(((![SX0:$i]: ((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SX0))) | (~ (q1@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[1121])). thf(1125,plain,(![SV1:$i,SV2:$i]: (((q1@SV2)=$false) | ((p1@(f@SV1))=$true))),inference(extcnf_not_pos,[status(thm)],[1122])). thf(1126,plain,(![SV3:$i]: (((((![SX1:$i]: (r1@SX1)) | (~ (p1@SV3))) | (~ (q1@SV3)))=$true))),inference(extcnf_forall_pos,[status(thm)],[1123])). thf(1127,plain,(![SV4:$i]: ((((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SV4))) | (~ (q1@SV4)))=$true))),inference(extcnf_forall_pos,[status(thm)],[1124])). thf(1128,plain,(![SV3:$i]: ((((![SX1:$i]: (r1@SX1)) | (~ (p1@SV3)))=$true) | ((~ (q1@SV3))=$true))),inference(extcnf_or_pos,[status(thm)],[1126])). thf(1129,plain,(![SV4:$i]: (((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SV4)))=$true) | ((~ (q1@SV4))=$true))),inference(extcnf_or_pos,[status(thm)],[1127])). thf(1130,plain,(![SV3:$i]: (((q1@SV3)=$false) | (((![SX1:$i]: (r1@SX1)) | (~ (p1@SV3)))=$true))),inference(extcnf_not_pos,[status(thm)],[1128])). thf(1131,plain,(![SV4:$i]: (((q1@SV4)=$false) | ((((~ (r1@sK62)) | (~ (r1@sK63))) | (~ (p1@SV4)))=$true))),inference(extcnf_not_pos,[status(thm)],[1129])). thf(1132,plain,(![SV3:$i]: (((![SX1:$i]: (r1@SX1))=$true) | ((~ (p1@SV3))=$true) | ((q1@SV3)=$false))),inference(extcnf_or_pos,[status(thm)],[1130])). thf(1133,plain,(![SV4:$i]: ((((~ (r1@sK62)) | (~ (r1@sK63)))=$true) | ((~ (p1@SV4))=$true) | ((q1@SV4)=$false))),inference(extcnf_or_pos,[status(thm)],[1131])). thf(1134,plain,(![SV3:$i,SV5:$i]: (((r1@SV5)=$true) | ((q1@SV3)=$false) | ((~ (p1@SV3))=$true))),inference(extcnf_forall_pos,[status(thm)],[1132])). thf(1135,plain,(![SV4:$i]: (((p1@SV4)=$false) | ((q1@SV4)=$false) | (((~ (r1@sK62)) | (~ (r1@sK63)))=$true))),inference(extcnf_not_pos,[status(thm)],[1133])). thf(1136,plain,(![SV5:$i,SV3:$i]: (((p1@SV3)=$false) | ((r1@SV5)=$true) | ((q1@SV3)=$false))),inference(extcnf_not_pos,[status(thm)],[1134])). thf(1137,plain,(![SV4:$i]: (((~ (r1@sK62))=$true) | ((~ (r1@sK63))=$true) | ((q1@SV4)=$false) | ((p1@SV4)=$false))),inference(extcnf_or_pos,[status(thm)],[1135])). thf(1138,plain,(![SV4:$i]: (((r1@sK62)=$false) | ((q1@SV4)=$false) | ((p1@SV4)=$false) | ((~ (r1@sK63))=$true))),inference(extcnf_not_pos,[status(thm)],[1137])). thf(1139,plain,(![SV4:$i]: (((r1@sK63)=$false) | ((r1@sK62)=$false) | ((q1@SV4)=$false) | ((p1@SV4)=$false))),inference(extcnf_not_pos,[status(thm)],[1138])). thf(1140,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:![X2]:(lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))|(~(lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1136) 2 : :![X3]:![X4]:(~(lit(ti(at(ti(q1,ft(i,o)),ti(X4,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X3,i)),i)),o))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1125) 3 : :![X5]:(~(lit(ti(at(ti(r1,ft(i,o)),ti(sK63,i)),o)))|(~(lit(ti(at(ti(r1,ft(i,o)),ti(sK62,i)),o)))|(~(lit(ti(at(ti(q1,ft(i,o)),ti(X5,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X5,i)),o)))))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1139) 4 : :lit(ti(at(ti(q1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(sK62,i)),i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1110) 5 : :![X1]:![X2]:(lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o)))) : fof_simplification(1) 6 : :![X3]:![X4]:(~lit(ti(at(ti(q1,ft(i,o)),ti(X4,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X3,i)),i)),o))) : fof_simplification(2) 7 : :![X5]:(~lit(ti(at(ti(r1,ft(i,o)),ti(sK63,i)),o))|(~lit(ti(at(ti(r1,ft(i,o)),ti(sK62,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X5,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X5,i)),o))))) : fof_simplification(3) # Garbage collection reclaimed 25 unused term cells. 8 : :![X3]:![X4]:(lit(ti(at(ti(r1,ft(i,o)),ti(X3,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X4,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X4,i)),o)))) : variable_rename(5) 9 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(8) 10 : :![X5]:![X6]:(~lit(ti(at(ti(q1,ft(i,o)),ti(X6,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X5,i)),i)),o))) : variable_rename(6) 11 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))] : split_conjunct(10) 12 : :![X6]:(~lit(ti(at(ti(r1,ft(i,o)),ti(sK63,i)),o))|(~lit(ti(at(ti(r1,ft(i,o)),ti(sK62,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X6,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X6,i)),o))))) : variable_rename(7) 13 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(sK62,i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(sK63,i)),o))] : split_conjunct(12) 14 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(sK62,i)),i)),o))] : split_conjunct(4) # Garbage collection reclaimed 78 unused term cells. # Auto-Ordering is analysing problem. # Problem is type HHNFNFFSF22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type HHNFNFFSF22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 15 : :[--lit(ti(at(ti(r1,ft(i,o)),ti(sK63,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : csr(13,9) 16 : :[--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : csr(15,9) # Presaturation interreduction done 17 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o))] : spm(11,14) 18 : :[--lit(ti(at(ti(q1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o))] : spm(16,17) 19 : :[++$true,--lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))] : rw(11,17) 20 : :[] : sr(14,18) 21 : :[] : 20 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 4 # Removed by relevancy pruning : 0 # Initial clauses : 4 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 4 # Processed clauses : 9 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 9 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 1 # Backward-rewritten : 1 # Generated clauses : 3 # ...of the previous two non-trivial : 2 # Contextual simplify-reflections : 2 # Paramodulations : 2 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 3 # Positive orientable unit clauses : 1 # Positive unorientable unit clauses: 0 # Negative unit clauses : 1 # Non-unit-clauses : 1 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 3 # Rec. Clause-clause subsumption calls : 3 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 5 # Indexed BW rewrite successes : 1 # Unification attempts : 10 # Unification successes : 4 # Backwards rewriting index : 20 leaves, 1.30+/-0.900 terms/leaf # Paramod-from index : 1 leaves, 1.00+/-0.000 terms/leaf # Paramod-into index : 18 leaves, 1.22+/-0.629 terms/leaf # ------------------------------------------------- # User time : 0.003 s # System time : 0.000 s # Total time : 0.003 s # Maximum resident set size: 2564 pages ),[status(thm)],[1136,1110,1139,1125])). thf(1141,plain,((((![Z:$i]: (q1@(f@Z))) & ((((![Y:$i]: ((p1@(f@Y)) | (r1@Y))) | (![X:$i]: (~ (q1@X)))) & (((![Y:$i]: (p1@(f@Y))) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (![X:$i]: (~ (q1@X))))) & ((![X:$i]: (((~ (p1@X)) | (![Y:$i]: (r1@Y))) | (~ (q1@X)))) & (![SY259:$i]: (((~ (p1@SY259)) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (~ (q1@SY259)))))))=$true)),inference(copy,[status(thm)],[138])). thf(1142,plain,(((~ ((~ (![SX0:$i]: (q1@(f@SX0)))) | (~ (~ ((~ (~ ((~ ((![SX0:$i]: ((p1@(f@SX0)) | (r1@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (((![SX0:$i]: (p1@(f@SX0))) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (![SX0:$i]: (~ (q1@SX0)))))))) | (~ (~ ((~ (![SX0:$i]: (((~ (p1@SX0)) | (![SX1:$i]: (r1@SX1))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: (((~ (p1@SX0)) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (~ (q1@SX0)))))))))))))=$true)),inference(unfold_def,[status(thm)],[1141])). thf(1143,plain,((((~ (![SX0:$i]: (q1@(f@SX0)))) | (~ (~ ((~ (~ ((~ ((![SX0:$i]: ((p1@(f@SX0)) | (r1@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (((![SX0:$i]: (p1@(f@SX0))) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (![SX0:$i]: (~ (q1@SX0)))))))) | (~ (~ ((~ (![SX0:$i]: (((~ (p1@SX0)) | (![SX1:$i]: (r1@SX1))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: (((~ (p1@SX0)) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (~ (q1@SX0))))))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[1142])). thf(1144,plain,(((~ (![SX0:$i]: (q1@(f@SX0))))=$false)),inference(extcnf_or_neg,[status(thm)],[1143])). thf(1145,plain,(((~ (~ ((~ (~ ((~ ((![SX0:$i]: ((p1@(f@SX0)) | (r1@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (((![SX0:$i]: (p1@(f@SX0))) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (![SX0:$i]: (~ (q1@SX0)))))))) | (~ (~ ((~ (![SX0:$i]: (((~ (p1@SX0)) | (![SX1:$i]: (r1@SX1))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: (((~ (p1@SX0)) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (~ (q1@SX0)))))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[1143])). thf(1146,plain,(((![SX0:$i]: (q1@(f@SX0)))=$true)),inference(extcnf_not_neg,[status(thm)],[1144])). thf(1147,plain,(((~ ((~ (~ ((~ ((![SX0:$i]: ((p1@(f@SX0)) | (r1@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (((![SX0:$i]: (p1@(f@SX0))) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (![SX0:$i]: (~ (q1@SX0)))))))) | (~ (~ ((~ (![SX0:$i]: (((~ (p1@SX0)) | (![SX1:$i]: (r1@SX1))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: (((~ (p1@SX0)) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (~ (q1@SX0))))))))))=$true)),inference(extcnf_not_neg,[status(thm)],[1145])). thf(1148,plain,(![SV1:$i]: (((q1@(f@SV1))=$true))),inference(extcnf_forall_pos,[status(thm)],[1146])). thf(1149,plain,((((~ (~ ((~ ((![SX0:$i]: ((p1@(f@SX0)) | (r1@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (((![SX0:$i]: (p1@(f@SX0))) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (![SX0:$i]: (~ (q1@SX0)))))))) | (~ (~ ((~ (![SX0:$i]: (((~ (p1@SX0)) | (![SX1:$i]: (r1@SX1))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: (((~ (p1@SX0)) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (~ (q1@SX0)))))))))=$false)),inference(extcnf_not_pos,[status(thm)],[1147])). thf(1150,plain,(((~ (~ ((~ ((![SX0:$i]: ((p1@(f@SX0)) | (r1@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (((![SX0:$i]: (p1@(f@SX0))) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (![SX0:$i]: (~ (q1@SX0))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[1149])). thf(1151,plain,(((~ (~ ((~ (![SX0:$i]: (((~ (p1@SX0)) | (![SX1:$i]: (r1@SX1))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: (((~ (p1@SX0)) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (~ (q1@SX0))))))))=$false)),inference(extcnf_or_neg,[status(thm)],[1149])). thf(1152,plain,(((~ ((~ ((![SX0:$i]: ((p1@(f@SX0)) | (r1@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (((![SX0:$i]: (p1@(f@SX0))) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (![SX0:$i]: (~ (q1@SX0)))))))=$true)),inference(extcnf_not_neg,[status(thm)],[1150])). thf(1153,plain,(((~ ((~ (![SX0:$i]: (((~ (p1@SX0)) | (![SX1:$i]: (r1@SX1))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: (((~ (p1@SX0)) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (~ (q1@SX0)))))))=$true)),inference(extcnf_not_neg,[status(thm)],[1151])). thf(1154,plain,((((~ ((![SX0:$i]: ((p1@(f@SX0)) | (r1@SX0))) | (![SX0:$i]: (~ (q1@SX0))))) | (~ (((![SX0:$i]: (p1@(f@SX0))) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (![SX0:$i]: (~ (q1@SX0))))))=$false)),inference(extcnf_not_pos,[status(thm)],[1152])). thf(1155,plain,((((~ (![SX0:$i]: (((~ (p1@SX0)) | (![SX1:$i]: (r1@SX1))) | (~ (q1@SX0))))) | (~ (![SX0:$i]: (((~ (p1@SX0)) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (~ (q1@SX0))))))=$false)),inference(extcnf_not_pos,[status(thm)],[1153])). thf(1156,plain,(((~ ((![SX0:$i]: ((p1@(f@SX0)) | (r1@SX0))) | (![SX0:$i]: (~ (q1@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[1154])). thf(1157,plain,(((~ (((![SX0:$i]: (p1@(f@SX0))) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (![SX0:$i]: (~ (q1@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[1154])). thf(1158,plain,(((~ (![SX0:$i]: (((~ (p1@SX0)) | (![SX1:$i]: (r1@SX1))) | (~ (q1@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[1155])). thf(1159,plain,(((~ (![SX0:$i]: (((~ (p1@SX0)) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (~ (q1@SX0)))))=$false)),inference(extcnf_or_neg,[status(thm)],[1155])). thf(1160,plain,((((![SX0:$i]: ((p1@(f@SX0)) | (r1@SX0))) | (![SX0:$i]: (~ (q1@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[1156])). thf(1161,plain,(((((![SX0:$i]: (p1@(f@SX0))) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (![SX0:$i]: (~ (q1@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[1157])). thf(1162,plain,(((![SX0:$i]: (((~ (p1@SX0)) | (![SX1:$i]: (r1@SX1))) | (~ (q1@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[1158])). thf(1163,plain,(((![SX0:$i]: (((~ (p1@SX0)) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (~ (q1@SX0))))=$true)),inference(extcnf_not_neg,[status(thm)],[1159])). thf(1164,plain,(((![SX0:$i]: ((p1@(f@SX0)) | (r1@SX0)))=$true) | ((![SX0:$i]: (~ (q1@SX0)))=$true)),inference(extcnf_or_pos,[status(thm)],[1160])). thf(1165,plain,((((![SX0:$i]: (p1@(f@SX0))) | ((~ (r1@sK65)) | (~ (r1@sK64))))=$true) | ((![SX0:$i]: (~ (q1@SX0)))=$true)),inference(extcnf_or_pos,[status(thm)],[1161])). thf(1166,plain,(![SV2:$i]: (((((~ (p1@SV2)) | (![SX1:$i]: (r1@SX1))) | (~ (q1@SV2)))=$true))),inference(extcnf_forall_pos,[status(thm)],[1162])). thf(1167,plain,(![SV3:$i]: (((((~ (p1@SV3)) | ((~ (r1@sK65)) | (~ (r1@sK64)))) | (~ (q1@SV3)))=$true))),inference(extcnf_forall_pos,[status(thm)],[1163])). thf(1168,plain,(![SV4:$i]: ((((p1@(f@SV4)) | (r1@SV4))=$true) | ((![SX0:$i]: (~ (q1@SX0)))=$true))),inference(extcnf_forall_pos,[status(thm)],[1164])). thf(1169,plain,(![SV5:$i]: (((~ (q1@SV5))=$true) | (((![SX0:$i]: (p1@(f@SX0))) | ((~ (r1@sK65)) | (~ (r1@sK64))))=$true))),inference(extcnf_forall_pos,[status(thm)],[1165])). thf(1170,plain,(![SV2:$i]: ((((~ (p1@SV2)) | (![SX1:$i]: (r1@SX1)))=$true) | ((~ (q1@SV2))=$true))),inference(extcnf_or_pos,[status(thm)],[1166])). thf(1171,plain,(![SV3:$i]: ((((~ (p1@SV3)) | ((~ (r1@sK65)) | (~ (r1@sK64))))=$true) | ((~ (q1@SV3))=$true))),inference(extcnf_or_pos,[status(thm)],[1167])). thf(1172,plain,(![SV4:$i]: (((p1@(f@SV4))=$true) | ((r1@SV4)=$true) | ((![SX0:$i]: (~ (q1@SX0)))=$true))),inference(extcnf_or_pos,[status(thm)],[1168])). thf(1173,plain,(![SV5:$i]: (((q1@SV5)=$false) | (((![SX0:$i]: (p1@(f@SX0))) | ((~ (r1@sK65)) | (~ (r1@sK64))))=$true))),inference(extcnf_not_pos,[status(thm)],[1169])). thf(1174,plain,(![SV2:$i]: (((q1@SV2)=$false) | (((~ (p1@SV2)) | (![SX1:$i]: (r1@SX1)))=$true))),inference(extcnf_not_pos,[status(thm)],[1170])). thf(1175,plain,(![SV3:$i]: (((q1@SV3)=$false) | (((~ (p1@SV3)) | ((~ (r1@sK65)) | (~ (r1@sK64))))=$true))),inference(extcnf_not_pos,[status(thm)],[1171])). thf(1176,plain,(![SV4:$i,SV6:$i]: (((~ (q1@SV6))=$true) | ((r1@SV4)=$true) | ((p1@(f@SV4))=$true))),inference(extcnf_forall_pos,[status(thm)],[1172])). thf(1177,plain,(![SV5:$i]: (((![SX0:$i]: (p1@(f@SX0)))=$true) | (((~ (r1@sK65)) | (~ (r1@sK64)))=$true) | ((q1@SV5)=$false))),inference(extcnf_or_pos,[status(thm)],[1173])). thf(1178,plain,(![SV2:$i]: (((~ (p1@SV2))=$true) | ((![SX1:$i]: (r1@SX1))=$true) | ((q1@SV2)=$false))),inference(extcnf_or_pos,[status(thm)],[1174])). thf(1179,plain,(![SV3:$i]: (((~ (p1@SV3))=$true) | (((~ (r1@sK65)) | (~ (r1@sK64)))=$true) | ((q1@SV3)=$false))),inference(extcnf_or_pos,[status(thm)],[1175])). thf(1180,plain,(![SV4:$i,SV6:$i]: (((q1@SV6)=$false) | ((r1@SV4)=$true) | ((p1@(f@SV4))=$true))),inference(extcnf_not_pos,[status(thm)],[1176])). thf(1181,plain,(![SV5:$i,SV7:$i]: (((p1@(f@SV7))=$true) | ((q1@SV5)=$false) | (((~ (r1@sK65)) | (~ (r1@sK64)))=$true))),inference(extcnf_forall_pos,[status(thm)],[1177])). thf(1182,plain,(![SV2:$i,SV8:$i]: (((r1@SV8)=$true) | ((q1@SV2)=$false) | ((~ (p1@SV2))=$true))),inference(extcnf_forall_pos,[status(thm)],[1178])). thf(1183,plain,(![SV3:$i]: (((p1@SV3)=$false) | ((q1@SV3)=$false) | (((~ (r1@sK65)) | (~ (r1@sK64)))=$true))),inference(extcnf_not_pos,[status(thm)],[1179])). thf(1184,plain,(![SV7:$i,SV5:$i]: (((~ (r1@sK65))=$true) | ((~ (r1@sK64))=$true) | ((q1@SV5)=$false) | ((p1@(f@SV7))=$true))),inference(extcnf_or_pos,[status(thm)],[1181])). thf(1185,plain,(![SV8:$i,SV2:$i]: (((p1@SV2)=$false) | ((r1@SV8)=$true) | ((q1@SV2)=$false))),inference(extcnf_not_pos,[status(thm)],[1182])). thf(1186,plain,(![SV3:$i]: (((~ (r1@sK65))=$true) | ((~ (r1@sK64))=$true) | ((q1@SV3)=$false) | ((p1@SV3)=$false))),inference(extcnf_or_pos,[status(thm)],[1183])). thf(1187,plain,(![SV7:$i,SV5:$i]: (((r1@sK65)=$false) | ((q1@SV5)=$false) | ((p1@(f@SV7))=$true) | ((~ (r1@sK64))=$true))),inference(extcnf_not_pos,[status(thm)],[1184])). thf(1188,plain,(![SV3:$i]: (((r1@sK64)=$false) | ((q1@SV3)=$false) | ((p1@SV3)=$false) | ((~ (r1@sK65))=$true))),inference(extcnf_not_pos,[status(thm)],[1186])). thf(1189,plain,(![SV7:$i,SV5:$i]: (((r1@sK64)=$false) | ((r1@sK65)=$false) | ((q1@SV5)=$false) | ((p1@(f@SV7))=$true))),inference(extcnf_not_pos,[status(thm)],[1187])). thf(1190,plain,(![SV3:$i]: (((r1@sK65)=$false) | ((r1@sK64)=$false) | ((q1@SV3)=$false) | ((p1@SV3)=$false))),inference(extcnf_not_pos,[status(thm)],[1188])). thf(1191,plain,((($false)=$true)),inference(fo_atp_e_( 1 : :![X1]:(~(lit(ti(at(ti(r1,ft(i,o)),ti(sK65,i)),o)))|(~(lit(ti(at(ti(r1,ft(i,o)),ti(sK64,i)),o)))|(~(lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)))))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1190) 2 : :![X2]:![X3]:(~(lit(ti(at(ti(r1,ft(i,o)),ti(sK64,i)),o)))|(~(lit(ti(at(ti(r1,ft(i,o)),ti(sK65,i)),o)))|(~(lit(ti(at(ti(q1,ft(i,o)),ti(X3,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X2,i)),i)),o))))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1189) 3 : :![X4]:![X5]:(lit(ti(at(ti(r1,ft(i,o)),ti(X4,i)),o))|(~(lit(ti(at(ti(q1,ft(i,o)),ti(X5,i)),o)))|lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X4,i)),i)),o)))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1180) 4 : :![X6]:lit(ti(at(ti(q1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X6,i)),i)),o)) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1148) 5 : :![X7]:![X8]:(lit(ti(at(ti(r1,ft(i,o)),ti(X7,i)),o))|(~(lit(ti(at(ti(q1,ft(i,o)),ti(X8,i)),o)))|~(lit(ti(at(ti(p1,ft(i,o)),ti(X8,i)),o))))) : initial("/tmp/FNE063.p.atp_in", leo_II_clause_1185) 6 : :![X1]:(~lit(ti(at(ti(r1,ft(i,o)),ti(sK65,i)),o))|(~lit(ti(at(ti(r1,ft(i,o)),ti(sK64,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))))) : fof_simplification(1) 7 : :![X2]:![X3]:(~lit(ti(at(ti(r1,ft(i,o)),ti(sK64,i)),o))|(~lit(ti(at(ti(r1,ft(i,o)),ti(sK65,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X3,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X2,i)),i)),o))))) : fof_simplification(2) 8 : :![X4]:![X5]:(lit(ti(at(ti(r1,ft(i,o)),ti(X4,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X5,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X4,i)),i)),o)))) : fof_simplification(3) 9 : :![X7]:![X8]:(lit(ti(at(ti(r1,ft(i,o)),ti(X7,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X8,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X8,i)),o)))) : fof_simplification(5) # Garbage collection reclaimed 33 unused term cells. 10 : :![X2]:(~lit(ti(at(ti(r1,ft(i,o)),ti(sK65,i)),o))|(~lit(ti(at(ti(r1,ft(i,o)),ti(sK64,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X2,i)),o))))) : variable_rename(6) 11 : :[--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(sK64,i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(sK65,i)),o))] : split_conjunct(10) 12 : :![X4]:![X5]:(~lit(ti(at(ti(r1,ft(i,o)),ti(sK64,i)),o))|(~lit(ti(at(ti(r1,ft(i,o)),ti(sK65,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X5,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X4,i)),i)),o))))) : variable_rename(7) 13 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(sK65,i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(sK64,i)),o))] : split_conjunct(12) 14 : :![X6]:![X7]:(lit(ti(at(ti(r1,ft(i,o)),ti(X6,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X7,i)),o))|lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X6,i)),i)),o)))) : variable_rename(8) 15 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)),++lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))] : split_conjunct(14) 16 : :![X7]:lit(ti(at(ti(q1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X7,i)),i)),o)) : variable_rename(4) 17 : :[++lit(ti(at(ti(q1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o))] : split_conjunct(16) 18 : :![X9]:![X10]:(lit(ti(at(ti(r1,ft(i,o)),ti(X9,i)),o))|(~lit(ti(at(ti(q1,ft(i,o)),ti(X10,i)),o))|~lit(ti(at(ti(p1,ft(i,o)),ti(X10,i)),o)))) : variable_rename(9) 19 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(X2,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o))] : split_conjunct(18) # Garbage collection reclaimed 124 unused term cells. # Auto-Ordering is analysing problem. # Problem is type GHNFNFFMF22MD # Auto-mode selected ordering type KBO6 # Auto-mode selected ordering precedence scheme # Auto-mode selected weight ordering scheme # # Auto-Heuristic is analysing problem. # Problem is type GHNFNFFMF22MD # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y # and selection function SelectMaxLComplexAvoidPosPred. # # No equality, disabling AC handling. # # Initializing proof state # Preprocessing time : 0.003 s 20 : :[--lit(ti(at(ti(r1,ft(i,o)),ti(sK65,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : csr(11,19) 21 : :[--lit(ti(at(ti(q1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(p1,ft(i,o)),ti(X1,i)),o))] : csr(20,19) # Presaturation interreduction done 22 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)),++lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))] : spm(15,17) 23 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(sK65,i)),o)),--lit(ti(at(ti(r1,ft(i,o)),ti(sK64,i)),o))] : spm(13,17) 24 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o))] : spm(21,22) 25 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o)),--$true] : rw(24,17) 26 : :[++lit(ti(at(ti(r1,ft(i,o)),ti(X1,i)),o))] : cn(25) 27 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)),++$true] : rw(22,26) 28 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)),--$true,--lit(ti(at(ti(r1,ft(i,o)),ti(sK64,i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))] : rw(13,26) 29 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)),--$true,--$true,--lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))] : rw(28,26) 30 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o)),--lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))] : cn(29) 31 : :[++lit(ti(at(ti(p1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o))] : spm(30,17) 32 : :[--lit(ti(at(ti(q1,ft(i,o)),ti(at(ti(f,ft(i,i)),ti(X1,i)),i)),o))] : spm(21,31) 33 : :[++$true,--lit(ti(at(ti(q1,ft(i,o)),ti(X2,i)),o))] : rw(30,31) 34 : :[--$true] : rw(32,17) 35 : :[] : cn(34) 36 : :[] : 35 : 'proof' # Proof found! # SZS intermediate status Unsatisfiable # Parsed axioms : 5 # Removed by relevancy pruning : 0 # Initial clauses : 5 # Removed in clause preprocessing : 0 # Initial clauses in saturation : 5 # Processed clauses : 13 # ...of these trivial : 0 # ...subsumed : 0 # ...remaining for further processing : 13 # Other redundant clauses eliminated : 0 # Clauses deleted for lack of memory : 0 # Backward-subsumed : 2 # Backward-rewritten : 3 # Generated clauses : 5 # ...of the previous two non-trivial : 5 # Contextual simplify-reflections : 2 # Paramodulations : 5 # Factorizations : 0 # Equation resolutions : 0 # Current number of processed clauses : 4 # Positive orientable unit clauses : 3 # Positive unorientable unit clauses: 0 # Negative unit clauses : 0 # Non-unit-clauses : 1 # Current number of unprocessed clauses: 0 # ...number of literals in the above : 0 # Clause-clause subsumption calls (NU) : 12 # Rec. Clause-clause subsumption calls : 12 # Unit Clause-clause subsumption calls : 0 # Rewrite failures with RHS unbound : 0 # Indexed BW rewrite attempts : 14 # Indexed BW rewrite successes : 4 # Unification attempts : 23 # Unification successes : 9 # Backwards rewriting index : 23 leaves, 1.35+/-1.127 terms/leaf # Paramod-from index : 1 leaves, 3.00+/-0.000 terms/leaf # Paramod-into index : 21 leaves, 1.29+/-0.881 terms/leaf # ------------------------------------------------- # User time : 0.007 s # System time : 0.000 s # Total time : 0.007 s # Maximum resident set size: 2592 pages ),[status(thm)],[1190,1185,1148,1180,1189])). thf(1192,plain,($false),inference(solved_all_splits,[solved_all_splits(join,[])],[1191,175,215,237,253,293,330,367,385,402,413,424,434,444,493,503,521,531,542,566,592,624,678,700,722,725,736,746,771,808,854,864,876,888,906,920,938,956,967,991,1013,1025,1077,1104,1140])). % SZS output end CNFRefutation %**** End of derivation protocol **** %**** no. of clauses in derivation: 1075 **** WATCH: 5.83 CPU 7.08 WC FINAL WATCH: 5.83 CPU 7.08 WC