%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET108-7 : 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 : n004.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:54 EDT 2022 % Result : Unsatisfiable 1.77s 0.89s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SET108-7 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n004.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 : Sun Jul 10 14:20:37 EDT 2022 % 0.12/0.34 % CPUTime : % 1.77/0.89 % SZS status Unsatisfiable % 1.77/0.89 % SZS output begin IncompleteProof % 1.77/0.89 cnf(c0, axiom, % 1.77/0.89 member(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))),cross_product(universal_class,universal_class))). % 1.77/0.89 cnf(c1, plain, % 1.77/0.89 member(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))),cross_product(universal_class,universal_class)), % 1.77/0.89 inference(start, [], [c0])). % 1.77/0.89 % 1.77/0.89 cnf(c2, axiom, % 1.77/0.89 unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))) = X0 | ~member(X0,cross_product(X1,X2))). % 1.77/0.89 cnf(a0, assumption, % 1.77/0.89 unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))) = X0). % 1.77/0.89 cnf(a1, assumption, % 1.77/0.89 cross_product(universal_class,universal_class) = cross_product(X1,X2)). % 1.77/0.89 cnf(c3, plain, % 1.77/0.89 $false, % 1.77/0.89 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 1.77/0.89 cnf(c4, plain, % 1.77/0.89 unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))) = X0, % 1.77/0.89 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 1.77/0.89 % 1.77/0.89 cnf(c5, axiom, % 1.77/0.89 ~member(unordered_pair(unordered_pair(first(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z)))),first(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))))),unordered_pair(first(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z)))),unordered_pair(second(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z)))),second(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))))))),cross_product(universal_class,universal_class))). % 1.77/0.89 cnf(a2, assumption, % 1.77/0.89 unordered_pair(unordered_pair(first(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z)))),first(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))))),unordered_pair(first(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z)))),unordered_pair(second(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z)))),second(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))))))) = unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0))))). % 1.77/0.89 cnf(c6, plain, % 1.77/0.89 $false, % 1.77/0.89 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])). % 1.77/0.89 cnf(c7, plain, % 1.77/0.89 $false, % 1.77/0.89 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])). % 1.77/0.89 cnf(c8, plain, % 1.77/0.89 ~member(X0,cross_product(universal_class,universal_class)), % 1.77/0.89 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])). % 1.77/0.89 % 1.77/0.89 cnf(c9, plain, % 1.77/0.89 member(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))),cross_product(universal_class,universal_class))). % 1.77/0.89 cnf(a3, assumption, % 1.77/0.89 X0 = unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z)))). % 1.77/0.89 cnf(a4, assumption, % 1.77/0.89 cross_product(universal_class,universal_class) = cross_product(universal_class,universal_class)). % 1.77/0.89 cnf(c10, plain, % 1.77/0.89 $false, % 1.77/0.89 inference(predicate_reduction, [assumptions([a3, a4])], [c8, c9])). % 1.77/0.89 % 1.77/0.89 cnf(c11, plain, % 1.77/0.89 $false, % 1.77/0.89 inference(constraint_solving, [ % 1.77/0.89 bind(X0, unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z)))), % 1.77/0.89 bind(X1, universal_class), % 1.77/0.89 bind(X2, universal_class) % 1.77/0.89 ], % 1.77/0.89 [a0, a1, a2, a3, a4])). % 1.77/0.89 % 1.77/0.89 % SZS output end IncompleteProof %------------------------------------------------------------------------------