%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET113-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 : n021.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:57 EDT 2022 % Result : Unsatisfiable 0.12s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET113-7 : TPTP v8.1.0. Bugfixed v7.3.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n021.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jul 11 07:39:38 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 % SZS status Unsatisfiable % 0.12/0.37 % SZS output begin IncompleteProof % 0.12/0.37 cnf(c0, axiom, % 0.12/0.37 x != first(x)). % 0.12/0.37 cnf(c1, plain, % 0.12/0.37 x != first(x), % 0.12/0.37 inference(start, [], [c0])). % 0.12/0.37 % 0.12/0.37 cnf(c2, axiom, % 0.12/0.37 first(X0) = X0 | member(unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))),cross_product(universal_class,universal_class))). % 0.12/0.37 cnf(a0, assumption, % 0.12/0.37 first(x) = first(X0)). % 0.12/0.37 cnf(c3, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.37 cnf(c4, plain, % 0.12/0.37 member(unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))),cross_product(universal_class,universal_class)), % 0.12/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.37 cnf(c5, plain, % 0.12/0.37 X1 != X0 | x != X1, % 0.12/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.37 % 0.12/0.37 cnf(a1, assumption, % 0.12/0.37 X1 = X0). % 0.12/0.37 cnf(c6, plain, % 0.12/0.37 x != X1, % 0.12/0.37 inference(reflexivity, [assumptions([a1])], [c5])). % 0.12/0.37 % 0.12/0.37 cnf(a2, assumption, % 0.12/0.37 x = X1). % 0.12/0.37 cnf(c7, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(reflexivity, [assumptions([a2])], [c6])). % 0.12/0.37 % 0.12/0.37 cnf(c8, axiom, % 0.12/0.37 ~member(unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x)))),cross_product(universal_class,universal_class))). % 0.12/0.37 cnf(a3, assumption, % 0.12/0.37 unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))) = unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x))))). % 0.12/0.37 cnf(a4, assumption, % 0.12/0.37 cross_product(universal_class,universal_class) = cross_product(universal_class,universal_class)). % 0.12/0.37 cnf(c9, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])). % 0.12/0.37 cnf(c10, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])). % 0.12/0.37 % 0.12/0.37 cnf(c11, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(constraint_solving, [ % 0.12/0.37 bind(X0, x), % 0.12/0.37 bind(X1, x) % 0.12/0.37 ], % 0.12/0.37 [a0, a1, a2, a3, a4])). % 0.12/0.37 % 0.12/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------