%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL044-1 : TPTP v9.3.1. 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 : n020.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:04 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 : LCL044-1 : TPTP v9.3.1. Released v1.0.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.37 % Computer : n020.cluster.edu % 0.09/0.37 % Model : x86_64 x86_64 % 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.37 % Memory : 8046.5625MB % 0.09/0.37 % OS : Linux 6.8.0-71-generic % 0.09/0.37 % CPULimit : 300 % 0.09/0.37 % WCLimit : 300 % 0.09/0.37 % DateTime : Sat Sep 5 05:23:12 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(a,not(not(a))))). % 0.09/0.38 cnf(c1, plain, % 0.09/0.38 ~is_a_theorem(implies(a,not(not(a)))), % 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(a,not(not(a))) = 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(implies(X2,implies(X3,X2)))). % 0.09/0.38 cnf(a1, assumption, % 0.09/0.38 X1 = implies(X2,implies(X3,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 $false, % 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(X4) | ~is_a_theorem(X5) | ~is_a_theorem(implies(X5,X4))). % 0.09/0.38 cnf(a2, assumption, % 0.09/0.38 implies(X1,X0) = X4). % 0.09/0.38 cnf(c9, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.09/0.38 cnf(c10, plain, % 0.09/0.38 ~is_a_theorem(X5) | ~is_a_theorem(implies(X5,X4)), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.09/0.38 % 0.09/0.38 cnf(c11, axiom, % 0.09/0.38 is_a_theorem(X6) | ~is_a_theorem(X7) | ~is_a_theorem(implies(X7,X6))). % 0.09/0.38 cnf(a3, assumption, % 0.09/0.38 X5 = X6). % 0.09/0.38 cnf(c12, plain, % 0.09/0.38 ~is_a_theorem(implies(X5,X4)), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.09/0.38 cnf(c13, plain, % 0.09/0.38 ~is_a_theorem(X7) | ~is_a_theorem(implies(X7,X6)), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.09/0.38 % 0.09/0.38 cnf(c14, axiom, % 0.09/0.38 is_a_theorem(implies(X8,implies(not(X8),X9)))). % 0.09/0.38 cnf(a4, assumption, % 0.09/0.38 X7 = implies(X8,implies(not(X8),X9))). % 0.09/0.38 cnf(c15, plain, % 0.09/0.38 ~is_a_theorem(implies(X7,X6)), % 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(X10,implies(X11,X12)),implies(X11,implies(X10,X12))))). % 0.09/0.38 cnf(a5, assumption, % 0.09/0.38 implies(X7,X6) = implies(implies(X10,implies(X11,X12)),implies(X11,implies(X10,X12)))). % 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(implies(X13,X14),implies(implies(not(X13),X14),X14)))). % 0.09/0.38 cnf(a6, assumption, % 0.09/0.38 implies(X5,X4) = implies(implies(X13,X14),implies(implies(not(X13),X14),X14))). % 0.09/0.38 cnf(c21, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a6])], [c12, c20])). % 0.09/0.38 cnf(c22, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a6])], [c12, 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(a,not(not(a)))), % 0.09/0.38 bind(X1, implies(X2,implies(X3,X2))), % 0.09/0.38 bind(X2, not(X13)), % 0.09/0.38 bind(X3, a), % 0.09/0.38 bind(X4, implies(X1,X0)), % 0.09/0.38 bind(X5, implies(X11,implies(X10,X12))), % 0.09/0.38 bind(X6, implies(X11,implies(X10,X12))), % 0.09/0.38 bind(X7, implies(X8,implies(not(X8),X9))), % 0.09/0.38 bind(X8, a), % 0.09/0.38 bind(X9, not(X13)), % 0.09/0.38 bind(X10, a), % 0.09/0.38 bind(X11, not(X8)), % 0.09/0.38 bind(X12, not(X13)), % 0.09/0.38 bind(X13, not(X8)), % 0.09/0.38 bind(X14, implies(X10,X12)) % 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 %------------------------------------------------------------------------------