%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET108+1 : TPTP v8.1.0. Bugfixed v5.4.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n008.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Tue Jul 19 02:43:53 EDT 2022 % Result : Theorem 44.70s 6.01s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET108+1 : TPTP v8.1.0. Bugfixed v5.4.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n008.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jul 11 09:42:53 EDT 2022 % 0.12/0.33 % CPUTime : % 44.70/6.01 % SZS status Theorem % 44.70/6.01 % SZS output begin IncompleteProof % 44.70/6.01 cnf(c0, axiom, % 44.70/6.01 sP2(sK12)). % 44.70/6.01 cnf(c1, plain, % 44.70/6.01 sP2(sK12), % 44.70/6.01 inference(start, [], [c0])). % 44.70/6.01 % 44.70/6.01 cnf(c2, axiom, % 44.70/6.01 unordered_pair(unordered_pair(sK10(X0),sK10(X0)),unordered_pair(sK10(X0),unordered_pair(sK11(X0),sK11(X0)))) = X0 | ~sP2(X0)). % 44.70/6.01 cnf(a0, assumption, % 44.70/6.01 sK12 = X0). % 44.70/6.01 cnf(c3, plain, % 44.70/6.01 $false, % 44.70/6.01 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 44.70/6.01 cnf(c4, plain, % 44.70/6.01 unordered_pair(unordered_pair(sK10(X0),sK10(X0)),unordered_pair(sK10(X0),unordered_pair(sK11(X0),sK11(X0)))) = X0, % 44.70/6.01 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 44.70/6.01 % 44.70/6.01 cnf(c5, axiom, % 44.70/6.01 sK12 != unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) | ~member(X2,universal_class) | ~member(X1,universal_class)). % 44.70/6.01 cnf(a1, assumption, % 44.70/6.01 unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = unordered_pair(unordered_pair(sK10(X0),sK10(X0)),unordered_pair(sK10(X0),unordered_pair(sK11(X0),sK11(X0))))). % 44.70/6.01 cnf(c6, plain, % 44.70/6.01 $false, % 44.70/6.01 inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])). % 44.70/6.01 cnf(c7, plain, % 44.70/6.01 ~member(X2,universal_class) | ~member(X1,universal_class), % 44.70/6.01 inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])). % 44.70/6.01 cnf(c8, plain, % 44.70/6.01 sK12 != X0, % 44.70/6.01 inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])). % 44.70/6.01 % 44.70/6.01 cnf(a2, assumption, % 44.70/6.01 sK12 = X0). % 44.70/6.01 cnf(c9, plain, % 44.70/6.01 $false, % 44.70/6.01 inference(reflexivity, [assumptions([a2])], [c8])). % 44.70/6.01 % 44.70/6.01 cnf(c10, axiom, % 44.70/6.01 member(sK11(X3),universal_class) | ~sP2(X3)). % 44.70/6.01 cnf(a3, assumption, % 44.70/6.01 X2 = sK11(X3)). % 44.70/6.01 cnf(a4, assumption, % 44.70/6.01 universal_class = universal_class). % 44.70/6.01 cnf(c11, plain, % 44.70/6.01 ~member(X1,universal_class), % 44.70/6.01 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c10])). % 44.70/6.01 cnf(c12, plain, % 44.70/6.01 ~sP2(X3), % 44.70/6.01 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c10])). % 44.70/6.01 % 44.70/6.01 cnf(c13, plain, % 44.70/6.01 sP2(sK12)). % 44.70/6.01 cnf(a5, assumption, % 44.70/6.01 X3 = sK12). % 44.70/6.01 cnf(c14, plain, % 44.70/6.01 $false, % 44.70/6.01 inference(predicate_reduction, [assumptions([a5])], [c12, c13])). % 44.70/6.01 % 44.70/6.01 cnf(c15, axiom, % 44.70/6.01 member(sK10(X4),universal_class) | ~sP2(X4)). % 44.70/6.01 cnf(a6, assumption, % 44.70/6.01 X1 = sK10(X4)). % 44.70/6.01 cnf(a7, assumption, % 44.70/6.01 universal_class = universal_class). % 44.70/6.01 cnf(c16, plain, % 44.70/6.01 $false, % 44.70/6.01 inference(strict_predicate_extension, [assumptions([a6, a7])], [c11, c15])). % 44.70/6.01 cnf(c17, plain, % 44.70/6.01 ~sP2(X4), % 44.70/6.01 inference(strict_predicate_extension, [assumptions([a6, a7])], [c11, c15])). % 44.70/6.01 % 44.70/6.01 cnf(c18, plain, % 44.70/6.01 sP2(sK12)). % 44.70/6.01 cnf(a8, assumption, % 44.70/6.01 X4 = sK12). % 44.70/6.01 cnf(c19, plain, % 44.70/6.01 $false, % 44.70/6.01 inference(predicate_reduction, [assumptions([a8])], [c17, c18])). % 44.70/6.01 % 44.70/6.01 cnf(c20, plain, % 44.70/6.01 $false, % 44.70/6.01 inference(constraint_solving, [ % 44.70/6.01 bind(X0, sK12), % 44.70/6.01 bind(X1, sK10(X0)), % 44.70/6.01 bind(X2, sK11(X0)), % 44.70/6.01 bind(X3, sK12), % 44.70/6.01 bind(X4, sK12) % 44.70/6.01 ], % 44.70/6.01 [a0, a1, a2, a3, a4, a5, a6, a7, a8])). % 44.70/6.01 % 44.70/6.01 % SZS output end IncompleteProof %------------------------------------------------------------------------------