%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET016-1 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n012.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:23 EDT 2022 % Result : Unsatisfiable 17.32s 2.58s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SET016-1 : TPTP v8.1.0. Released v1.0.0. % 0.06/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n012.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sun Jul 10 16:43:28 EDT 2022 % 0.13/0.34 % CPUTime : % 17.32/2.58 % SZS status Unsatisfiable % 17.32/2.58 % SZS output begin IncompleteProof % 17.32/2.58 cnf(c0, axiom, % 17.32/2.58 m1 != m2). % 17.32/2.58 cnf(c1, plain, % 17.32/2.58 m1 != m2, % 17.32/2.58 inference(start, [], [c0])). % 17.32/2.58 % 17.32/2.58 cnf(c2, axiom, % 17.32/2.58 X0 = X1 | ~member(X0,singleton_set(X1))). % 17.32/2.58 cnf(a0, assumption, % 17.32/2.58 m2 = X1). % 17.32/2.58 cnf(c3, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 17.32/2.58 cnf(c4, plain, % 17.32/2.58 ~member(X0,singleton_set(X1)), % 17.32/2.58 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 17.32/2.58 cnf(c5, plain, % 17.32/2.58 X0 != X2 | m1 != X2, % 17.32/2.58 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 17.32/2.58 % 17.32/2.58 cnf(a1, assumption, % 17.32/2.58 X0 = X2). % 17.32/2.58 cnf(c6, plain, % 17.32/2.58 m1 != X2, % 17.32/2.58 inference(reflexivity, [assumptions([a1])], [c5])). % 17.32/2.58 % 17.32/2.58 cnf(a2, assumption, % 17.32/2.58 m1 = X2). % 17.32/2.58 cnf(c7, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(reflexivity, [assumptions([a2])], [c6])). % 17.32/2.58 % 17.32/2.58 cnf(c8, axiom, % 17.32/2.58 X3 = X4 | X3 = X5 | ~member(X3,unordered_pair(X5,X4))). % 17.32/2.58 cnf(a3, assumption, % 17.32/2.58 singleton_set(X1) = X5). % 17.32/2.58 cnf(c9, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(variable_extension, [assumptions([a3])], [c4, c8])). % 17.32/2.58 cnf(c10, plain, % 17.32/2.58 X3 = X4 | ~member(X3,unordered_pair(X5,X4)), % 17.32/2.58 inference(variable_extension, [assumptions([a3])], [c4, c8])). % 17.32/2.58 cnf(c11, plain, % 17.32/2.58 X3 != X6 | ~member(X0,X6), % 17.32/2.58 inference(variable_extension, [assumptions([a3])], [c4, c8])). % 17.32/2.58 % 17.32/2.58 cnf(a4, assumption, % 17.32/2.58 X3 = X6). % 17.32/2.58 cnf(c12, plain, % 17.32/2.58 ~member(X0,X6), % 17.32/2.58 inference(reflexivity, [assumptions([a4])], [c11])). % 17.32/2.58 % 17.32/2.58 cnf(c13, axiom, % 17.32/2.58 member(X7,singleton_set(X7))). % 17.32/2.58 cnf(a5, assumption, % 17.32/2.58 X0 = X7). % 17.32/2.58 cnf(a6, assumption, % 17.32/2.58 X6 = singleton_set(X7)). % 17.32/2.58 cnf(c14, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(strict_predicate_extension, [assumptions([a5, a6])], [c12, c13])). % 17.32/2.58 cnf(c15, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(strict_predicate_extension, [assumptions([a5, a6])], [c12, c13])). % 17.32/2.58 % 17.32/2.58 cnf(c16, axiom, % 17.32/2.58 member(X8,unordered_pair(X8,X9))). % 17.32/2.58 cnf(a7, assumption, % 17.32/2.58 unordered_pair(X8,X9) = X4). % 17.32/2.58 cnf(c17, plain, % 17.32/2.58 ~member(X3,unordered_pair(X5,X4)), % 17.32/2.58 inference(strict_subterm_extension, [assumptions([a7])], [c10, c16])). % 17.32/2.58 cnf(c18, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(strict_subterm_extension, [assumptions([a7])], [c10, c16])). % 17.32/2.58 cnf(c19, plain, % 17.32/2.58 member(X8,X3), % 17.32/2.58 inference(strict_subterm_extension, [assumptions([a7])], [c10, c16])). % 17.32/2.58 % 17.32/2.58 cnf(c20, axiom, % 17.32/2.58 X10 = X11 | ~member(X10,singleton_set(X11))). % 17.32/2.58 cnf(a8, assumption, % 17.32/2.58 X8 = X10). % 17.32/2.58 cnf(a9, assumption, % 17.32/2.58 X3 = singleton_set(X11)). % 17.32/2.58 cnf(c21, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(strict_predicate_extension, [assumptions([a8, a9])], [c19, c20])). % 17.32/2.58 cnf(c22, plain, % 17.32/2.58 X10 = X11, % 17.32/2.58 inference(strict_predicate_extension, [assumptions([a8, a9])], [c19, c20])). % 17.32/2.58 % 17.32/2.58 cnf(c23, axiom, % 17.32/2.58 m1 != m2). % 17.32/2.58 cnf(a10, assumption, % 17.32/2.58 m2 = X10). % 17.32/2.58 cnf(c24, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(strict_subterm_extension, [assumptions([a10])], [c22, c23])). % 17.32/2.58 cnf(c25, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(strict_subterm_extension, [assumptions([a10])], [c22, c23])). % 17.32/2.58 cnf(c26, plain, % 17.32/2.58 m1 != X11, % 17.32/2.58 inference(strict_subterm_extension, [assumptions([a10])], [c22, c23])). % 17.32/2.58 % 17.32/2.58 cnf(a11, assumption, % 17.32/2.58 m1 = X11). % 17.32/2.58 cnf(c27, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(reflexivity, [assumptions([a11])], [c26])). % 17.32/2.58 % 17.32/2.58 cnf(c28, axiom, % 17.32/2.58 unordered_pair(singleton_set(m1),unordered_pair(m1,r1)) = unordered_pair(singleton_set(m2),unordered_pair(m2,r2))). % 17.32/2.58 cnf(a12, assumption, % 17.32/2.58 unordered_pair(X5,X4) = unordered_pair(singleton_set(m2),unordered_pair(m2,r2))). % 17.32/2.58 cnf(c29, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(strict_function_extension, [assumptions([a12])], [c17, c28])). % 17.32/2.58 cnf(c30, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(strict_function_extension, [assumptions([a12])], [c17, c28])). % 17.32/2.58 cnf(c31, plain, % 17.32/2.58 X12 != unordered_pair(singleton_set(m1),unordered_pair(m1,r1)) | ~member(X3,X12), % 17.32/2.58 inference(strict_function_extension, [assumptions([a12])], [c17, c28])). % 17.32/2.58 % 17.32/2.58 cnf(a13, assumption, % 17.32/2.58 X12 = unordered_pair(singleton_set(m1),unordered_pair(m1,r1))). % 17.32/2.58 cnf(c32, plain, % 17.32/2.58 ~member(X3,X12), % 17.32/2.58 inference(reflexivity, [assumptions([a13])], [c31])). % 17.32/2.58 % 17.32/2.58 cnf(c33, axiom, % 17.32/2.58 member(X13,unordered_pair(X13,X14))). % 17.32/2.58 cnf(a14, assumption, % 17.32/2.58 X3 = X13). % 17.32/2.58 cnf(a15, assumption, % 17.32/2.58 X12 = unordered_pair(X13,X14)). % 17.32/2.58 cnf(c34, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(strict_predicate_extension, [assumptions([a14, a15])], [c32, c33])). % 17.32/2.58 cnf(c35, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(strict_predicate_extension, [assumptions([a14, a15])], [c32, c33])). % 17.32/2.58 % 17.32/2.58 cnf(c36, plain, % 17.32/2.58 $false, % 17.32/2.58 inference(constraint_solving, [ % 17.32/2.58 bind(X0, m1), % 17.32/2.58 bind(X1, m2), % 17.32/2.58 bind(X2, m1), % 17.32/2.58 bind(X3, singleton_set(X7)), % 17.32/2.58 bind(X4, unordered_pair(X8,X9)), % 17.32/2.58 bind(X5, singleton_set(X1)), % 17.32/2.58 bind(X6, singleton_set(X7)), % 17.32/2.58 bind(X7, m1), % 17.32/2.58 bind(X8, m2), % 17.32/2.58 bind(X9, r2), % 17.32/2.58 bind(X10, m2), % 17.32/2.58 bind(X11, m1), % 17.32/2.58 bind(X12, unordered_pair(singleton_set(m1),unordered_pair(m1,r1))), % 17.32/2.58 bind(X13, singleton_set(X7)), % 17.32/2.58 bind(X14, unordered_pair(m1,r1)) % 17.32/2.58 ], % 17.32/2.58 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 17.32/2.58 % 17.32/2.58 % SZS output end IncompleteProof %------------------------------------------------------------------------------