%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN169-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 : n019.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:39 EDT 2022 % Result : Unsatisfiable 0.12s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.11 % Problem : SYN169-1 : TPTP v8.1.0. Released v1.1.0. % 0.04/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n019.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jul 12 08:51:08 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.35 % SZS status Unsatisfiable % 0.12/0.35 % SZS output begin IncompleteProof % 0.12/0.35 cnf(c0, axiom, % 0.12/0.35 ~p3(X0,d,X1)). % 0.12/0.35 cnf(c1, plain, % 0.12/0.35 ~p3(X0,d,X1), % 0.12/0.35 inference(start, [], [c0])). % 0.12/0.35 % 0.12/0.35 cnf(c2, axiom, % 0.12/0.35 ~n2(X2) | p3(X2,X2,X2)). % 0.12/0.35 cnf(a0, assumption, % 0.12/0.35 X0 = X2). % 0.12/0.35 cnf(a1, assumption, % 0.12/0.35 d = X2). % 0.12/0.35 cnf(a2, assumption, % 0.12/0.35 X1 = X2). % 0.12/0.35 cnf(c3, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.35 cnf(c4, plain, % 0.12/0.35 ~n2(X2), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.35 % 0.12/0.35 cnf(c5, axiom, % 0.12/0.35 ~p1(X3,X4,X5) | n2(X5)). % 0.12/0.35 cnf(a3, assumption, % 0.12/0.35 X2 = X5). % 0.12/0.35 cnf(c6, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c4, c5])). % 0.12/0.35 cnf(c7, plain, % 0.12/0.35 ~p1(X3,X4,X5), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c4, c5])). % 0.12/0.35 % 0.12/0.35 cnf(c8, axiom, % 0.12/0.35 ~q0(X6,X7) | p1(X7,X7,X7)). % 0.12/0.35 cnf(a4, assumption, % 0.12/0.35 X3 = X7). % 0.12/0.35 cnf(a5, assumption, % 0.12/0.35 X4 = X7). % 0.12/0.35 cnf(a6, assumption, % 0.12/0.35 X5 = X7). % 0.12/0.35 cnf(c9, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])). % 0.12/0.35 cnf(c10, plain, % 0.12/0.35 ~q0(X6,X7), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])). % 0.12/0.35 % 0.12/0.35 cnf(c11, axiom, % 0.12/0.35 q0(e,d)). % 0.12/0.35 cnf(a7, assumption, % 0.12/0.35 X6 = e). % 0.12/0.35 cnf(a8, assumption, % 0.12/0.35 X7 = d). % 0.12/0.35 cnf(c12, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])). % 0.12/0.35 cnf(c13, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])). % 0.12/0.35 % 0.12/0.35 cnf(c14, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(constraint_solving, [ % 0.12/0.35 bind(X0, d), % 0.12/0.35 bind(X1, d), % 0.12/0.35 bind(X2, d), % 0.12/0.35 bind(X3, d), % 0.12/0.35 bind(X4, d), % 0.12/0.35 bind(X5, d), % 0.12/0.35 bind(X6, e), % 0.12/0.35 bind(X7, d) % 0.12/0.35 ], % 0.12/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8])). % 0.12/0.35 % 0.12/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------