%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN124-1 : TPTP v8.1.0. Released v1.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 : n006.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 : Thu Jul 21 08:08:22 EDT 2022 % Result : Unsatisfiable 0.15s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.14 % Problem : SYN124-1 : TPTP v8.1.0. Released v1.1.0. % 0.13/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.15/0.36 % Computer : n006.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.37 % CPULimit : 300 % 0.15/0.37 % WCLimit : 600 % 0.15/0.37 % DateTime : Tue Jul 12 08:20:50 EDT 2022 % 0.15/0.37 % CPUTime : % 0.15/0.39 % SZS status Unsatisfiable % 0.15/0.39 % SZS output begin IncompleteProof % 0.15/0.39 cnf(c0, axiom, % 0.15/0.39 ~l3(a,a)). % 0.15/0.39 cnf(c1, plain, % 0.15/0.39 ~l3(a,a), % 0.15/0.39 inference(start, [], [c0])). % 0.15/0.39 % 0.15/0.39 cnf(c2, axiom, % 0.15/0.39 ~p2(X0,X1,X2) | ~p1(X2,X2,X0) | l3(X2,X2)). % 0.15/0.39 cnf(a0, assumption, % 0.15/0.39 a = X2). % 0.15/0.39 cnf(a1, assumption, % 0.15/0.39 a = X2). % 0.15/0.39 cnf(c3, plain, % 0.15/0.39 $false, % 0.15/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.15/0.39 cnf(c4, plain, % 0.15/0.39 ~p2(X0,X1,X2) | ~p1(X2,X2,X0), % 0.15/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.15/0.39 % 0.15/0.39 cnf(c5, axiom, % 0.15/0.39 ~m1(X3,X3,X4) | p2(X4,X4,X4)). % 0.15/0.39 cnf(a2, assumption, % 0.15/0.39 X0 = X4). % 0.15/0.39 cnf(a3, assumption, % 0.15/0.39 X1 = X4). % 0.15/0.39 cnf(a4, assumption, % 0.15/0.39 X2 = X4). % 0.15/0.39 cnf(c6, plain, % 0.15/0.39 ~p1(X2,X2,X0), % 0.15/0.39 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 0.15/0.39 cnf(c7, plain, % 0.15/0.39 ~m1(X3,X3,X4), % 0.15/0.39 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 0.15/0.39 % 0.15/0.39 cnf(c8, axiom, % 0.15/0.39 ~m0(X5,X6,X7) | m1(X7,X7,X7)). % 0.15/0.39 cnf(a5, assumption, % 0.15/0.39 X3 = X7). % 0.15/0.39 cnf(a6, assumption, % 0.15/0.39 X3 = X7). % 0.15/0.39 cnf(a7, assumption, % 0.15/0.39 X4 = X7). % 0.15/0.39 cnf(c9, plain, % 0.15/0.39 $false, % 0.15/0.39 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c7, c8])). % 0.15/0.39 cnf(c10, plain, % 0.15/0.39 ~m0(X5,X6,X7), % 0.15/0.39 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c7, c8])). % 0.15/0.39 % 0.15/0.39 cnf(c11, axiom, % 0.15/0.39 m0(e,d,a)). % 0.15/0.39 cnf(a8, assumption, % 0.15/0.39 X5 = e). % 0.15/0.39 cnf(a9, assumption, % 0.15/0.39 X6 = d). % 0.15/0.39 cnf(a10, assumption, % 0.15/0.39 X7 = a). % 0.15/0.39 cnf(c12, plain, % 0.15/0.39 $false, % 0.15/0.39 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c10, c11])). % 0.15/0.39 cnf(c13, plain, % 0.15/0.39 $false, % 0.15/0.39 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c10, c11])). % 0.15/0.39 % 0.15/0.39 cnf(c14, axiom, % 0.15/0.39 ~p0(b,a) | p1(a,a,a)). % 0.15/0.39 cnf(a11, assumption, % 0.15/0.39 X2 = a). % 0.15/0.39 cnf(a12, assumption, % 0.15/0.39 X2 = a). % 0.15/0.39 cnf(a13, assumption, % 0.15/0.39 X0 = a). % 0.15/0.39 cnf(c15, plain, % 0.15/0.39 $false, % 0.15/0.39 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c6, c14])). % 0.15/0.39 cnf(c16, plain, % 0.15/0.39 ~p0(b,a), % 0.15/0.39 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c6, c14])). % 0.15/0.39 % 0.15/0.39 cnf(c17, axiom, % 0.15/0.39 p0(b,X8)). % 0.15/0.39 cnf(a14, assumption, % 0.15/0.39 b = b). % 0.15/0.39 cnf(a15, assumption, % 0.15/0.39 a = X8). % 0.15/0.39 cnf(c18, plain, % 0.15/0.39 $false, % 0.15/0.39 inference(strict_predicate_extension, [assumptions([a14, a15])], [c16, c17])). % 0.15/0.39 cnf(c19, plain, % 0.15/0.39 $false, % 0.15/0.39 inference(strict_predicate_extension, [assumptions([a14, a15])], [c16, c17])). % 0.15/0.39 % 0.15/0.39 cnf(c20, plain, % 0.15/0.39 $false, % 0.15/0.39 inference(constraint_solving, [ % 0.15/0.39 bind(X0, a), % 0.15/0.39 bind(X1, a), % 0.15/0.39 bind(X2, a), % 0.15/0.39 bind(X3, a), % 0.15/0.39 bind(X4, a), % 0.15/0.39 bind(X5, e), % 0.15/0.39 bind(X6, d), % 0.15/0.39 bind(X7, a), % 0.15/0.39 bind(X8, a) % 0.15/0.39 ], % 0.15/0.39 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 0.15/0.39 % 0.15/0.39 % SZS output end IncompleteProof %------------------------------------------------------------------------------