%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET024-6 : TPTP v8.1.0. Bugfixed v2.1.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n013.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:42:36 EDT 2022 % Result : Unsatisfiable 0.12s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SET024-6 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n013.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 : Sun Jul 10 15:09:14 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % SZS status Unsatisfiable % 0.12/0.34 % SZS output begin IncompleteProof % 0.12/0.34 cnf(c0, axiom, % 0.12/0.34 ~member(x,unordered_pair(x,x))). % 0.12/0.34 cnf(c1, plain, % 0.12/0.34 ~member(x,unordered_pair(x,x)), % 0.12/0.34 inference(start, [], [c0])). % 0.12/0.34 % 0.12/0.34 cnf(c2, axiom, % 0.12/0.34 member(X0,unordered_pair(X0,X1)) | ~member(X0,universal_class)). % 0.12/0.34 cnf(a0, assumption, % 0.12/0.34 x = X0). % 0.12/0.34 cnf(a1, assumption, % 0.12/0.34 unordered_pair(x,x) = unordered_pair(X0,X1)). % 0.12/0.34 cnf(c3, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.34 cnf(c4, plain, % 0.12/0.34 ~member(X0,universal_class), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.34 % 0.12/0.34 cnf(c5, axiom, % 0.12/0.34 member(x,universal_class)). % 0.12/0.34 cnf(a2, assumption, % 0.12/0.34 X0 = x). % 0.12/0.34 cnf(a3, assumption, % 0.12/0.34 universal_class = universal_class). % 0.12/0.34 cnf(c6, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.34 cnf(c7, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.34 % 0.12/0.34 cnf(c8, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(constraint_solving, [ % 0.12/0.34 bind(X0, x), % 0.12/0.34 bind(X1, x) % 0.12/0.34 ], % 0.12/0.34 [a0, a1, a2, a3])). % 0.12/0.34 % 0.12/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------