%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET117-7 : TPTP v8.1.0. Bugfixed v7.3.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n028.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:44:00 EDT 2022 % Result : Unsatisfiable 1.51s 0.57s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.01/0.11 % Problem : SET117-7 : TPTP v8.1.0. Bugfixed v7.3.0. % 0.01/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.11/0.32 % Computer : n028.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 600 % 0.11/0.32 % DateTime : Mon Jul 11 06:19:58 EDT 2022 % 0.11/0.32 % CPUTime : % 1.51/0.57 % SZS status Unsatisfiable % 1.51/0.57 % SZS output begin IncompleteProof % 1.51/0.57 cnf(c0, axiom, % 1.51/0.57 x = unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x))))). % 1.51/0.57 cnf(c1, plain, % 1.51/0.57 x = unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x)))), % 1.51/0.57 inference(start, [], [c0])). % 1.51/0.57 % 1.51/0.57 cnf(c2, axiom, % 1.51/0.57 member(unordered_pair(X0,X1),universal_class)). % 1.51/0.57 cnf(a0, assumption, % 1.51/0.57 unordered_pair(X0,X1) = unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x))))). % 1.51/0.57 cnf(a1, assumption, % 1.51/0.57 x = X2). % 1.51/0.57 cnf(c3, plain, % 1.51/0.57 $false, % 1.51/0.57 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 1.51/0.57 cnf(c4, plain, % 1.51/0.57 $false, % 1.51/0.57 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 1.51/0.57 cnf(c5, plain, % 1.51/0.57 member(X2,universal_class), % 1.51/0.57 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 1.51/0.57 % 1.51/0.57 cnf(c6, axiom, % 1.51/0.57 ~member(x,universal_class)). % 1.51/0.57 cnf(a2, assumption, % 1.51/0.57 X2 = x). % 1.51/0.57 cnf(a3, assumption, % 1.51/0.57 universal_class = universal_class). % 1.51/0.57 cnf(c7, plain, % 1.51/0.57 $false, % 1.51/0.57 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 1.51/0.57 cnf(c8, plain, % 1.51/0.57 $false, % 1.51/0.57 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 1.51/0.57 % 1.51/0.57 cnf(c9, plain, % 1.51/0.57 $false, % 1.51/0.57 inference(constraint_solving, [ % 1.51/0.57 bind(X0, unordered_pair(first(x),first(x))), % 1.51/0.57 bind(X1, unordered_pair(first(x),unordered_pair(second(x),second(x)))), % 1.51/0.57 bind(X2, x) % 1.51/0.57 ], % 1.51/0.57 [a0, a1, a2, a3])). % 1.51/0.57 % 1.51/0.57 % SZS output end IncompleteProof %------------------------------------------------------------------------------