%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL398-1 : TPTP v9.3.1. Released v2.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 : n007.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 12:28:38 PM UTC 2026 % Result : Unsatisfiable 0.09s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL398-1 : TPTP v9.3.1. Released v2.3.0. % 0.00/0.04 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.09/0.36 % Computer : n007.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Fri Sep 4 17:50:24 UTC 2026 % 0.09/0.37 % CPUTime : % 0.09/0.38 % SZS status Unsatisfiable % 0.09/0.38 % SZS output begin IncompleteProof % 0.09/0.38 cnf(c0, axiom, % 0.09/0.38 ~is_a_theorem(implies(not(implies(x,x)),y))). % 0.09/0.38 cnf(c1, plain, % 0.09/0.38 ~is_a_theorem(implies(not(implies(x,x)),y)), % 0.09/0.38 inference(start, [], [c0])). % 0.09/0.38 % 0.09/0.38 cnf(c2, axiom, % 0.09/0.38 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))). % 0.09/0.38 cnf(a0, assumption, % 0.09/0.38 implies(not(implies(x,x)),y) = X0). % 0.09/0.38 cnf(c3, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.38 cnf(c4, plain, % 0.09/0.38 ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.38 % 0.09/0.38 cnf(c5, axiom, % 0.09/0.38 is_a_theorem(X2) | ~is_a_theorem(X3) | ~is_a_theorem(implies(X3,X2))). % 0.09/0.38 cnf(a1, assumption, % 0.09/0.38 X1 = X2). % 0.09/0.38 cnf(c6, plain, % 0.09/0.38 ~is_a_theorem(implies(X1,X0)), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.09/0.38 cnf(c7, plain, % 0.09/0.38 ~is_a_theorem(X3) | ~is_a_theorem(implies(X3,X2)), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.09/0.38 % 0.09/0.38 cnf(c8, axiom, % 0.09/0.38 is_a_theorem(implies(implies(not(X4),X4),X4))). % 0.09/0.38 cnf(a2, assumption, % 0.09/0.38 X3 = implies(implies(not(X4),X4),X4)). % 0.09/0.38 cnf(c9, plain, % 0.09/0.38 ~is_a_theorem(implies(X3,X2)), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.09/0.38 cnf(c10, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.09/0.38 % 0.09/0.38 cnf(c11, axiom, % 0.09/0.38 is_a_theorem(X5) | ~is_a_theorem(X6) | ~is_a_theorem(implies(X6,X5))). % 0.09/0.38 cnf(a3, assumption, % 0.09/0.38 implies(X3,X2) = X5). % 0.09/0.38 cnf(c12, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])). % 0.09/0.38 cnf(c13, plain, % 0.09/0.38 ~is_a_theorem(X6) | ~is_a_theorem(implies(X6,X5)), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])). % 0.09/0.38 % 0.09/0.38 cnf(c14, axiom, % 0.09/0.38 is_a_theorem(implies(X7,implies(not(X7),X8)))). % 0.09/0.38 cnf(a4, assumption, % 0.09/0.38 X6 = implies(X7,implies(not(X7),X8))). % 0.09/0.38 cnf(c15, plain, % 0.09/0.38 ~is_a_theorem(implies(X6,X5)), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.09/0.38 cnf(c16, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.09/0.38 % 0.09/0.38 cnf(c17, axiom, % 0.09/0.38 is_a_theorem(implies(implies(X9,X10),implies(implies(X10,X11),implies(X9,X11))))). % 0.09/0.38 cnf(a5, assumption, % 0.09/0.38 implies(X6,X5) = implies(implies(X9,X10),implies(implies(X10,X11),implies(X9,X11)))). % 0.09/0.38 cnf(c18, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])). % 0.09/0.38 cnf(c19, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])). % 0.09/0.38 % 0.09/0.38 cnf(c20, axiom, % 0.09/0.38 is_a_theorem(implies(X12,implies(not(X12),X13)))). % 0.09/0.38 cnf(a6, assumption, % 0.09/0.38 implies(X1,X0) = implies(X12,implies(not(X12),X13))). % 0.09/0.38 cnf(c21, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a6])], [c6, c20])). % 0.09/0.38 cnf(c22, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a6])], [c6, c20])). % 0.09/0.38 % 0.09/0.38 cnf(c23, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(constraint_solving, [ % 0.09/0.38 bind(X0, implies(not(implies(x,x)),y)), % 0.09/0.38 bind(X1, implies(X9,X11)), % 0.09/0.38 bind(X2, implies(X9,X11)), % 0.09/0.38 bind(X3, implies(implies(not(X4),X4),X4)), % 0.09/0.38 bind(X4, x), % 0.09/0.38 bind(X5, implies(X3,X2)), % 0.09/0.38 bind(X6, implies(X7,implies(not(X7),X8))), % 0.09/0.38 bind(X7, x), % 0.09/0.38 bind(X8, x), % 0.09/0.38 bind(X9, x), % 0.09/0.38 bind(X10, implies(not(X7),X8)), % 0.09/0.38 bind(X11, x), % 0.09/0.38 bind(X12, implies(X9,X11)), % 0.09/0.38 bind(X13, y) % 0.09/0.38 ], % 0.09/0.38 [a0, a1, a2, a3, a4, a5, a6])). % 0.09/0.38 % 0.09/0.38 % SZS output end IncompleteProof %------------------------------------------------------------------------------