%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL041-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 : n016.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.10s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL041-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.10/0.36 % Computer : n016.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Sat Sep 5 08:40:14 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.37 % SZS status Unsatisfiable % 0.10/0.37 % SZS output begin IncompleteProof % 0.10/0.37 cnf(c0, axiom, % 0.10/0.37 ~is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b)))). % 0.10/0.37 cnf(c1, plain, % 0.10/0.37 ~is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))), % 0.10/0.37 inference(start, [], [c0])). % 0.10/0.37 % 0.10/0.37 cnf(c2, axiom, % 0.10/0.37 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))). % 0.10/0.37 cnf(a0, assumption, % 0.10/0.37 implies(implies(a,implies(a,b)),implies(a,b)) = X0). % 0.10/0.37 cnf(c3, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.37 cnf(c4, plain, % 0.10/0.37 ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.37 % 0.10/0.37 cnf(c5, axiom, % 0.10/0.37 is_a_theorem(X2) | ~is_a_theorem(X3) | ~is_a_theorem(implies(X3,X2))). % 0.10/0.37 cnf(a1, assumption, % 0.10/0.37 X1 = X2). % 0.10/0.37 cnf(c6, plain, % 0.10/0.37 ~is_a_theorem(implies(X1,X0)), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.10/0.37 cnf(c7, plain, % 0.10/0.37 ~is_a_theorem(X3) | ~is_a_theorem(implies(X3,X2)), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.10/0.37 % 0.10/0.37 cnf(c8, axiom, % 0.10/0.37 is_a_theorem(implies(X4,implies(not(X4),X5)))). % 0.10/0.37 cnf(a2, assumption, % 0.10/0.37 X3 = implies(X4,implies(not(X4),X5))). % 0.10/0.37 cnf(c9, plain, % 0.10/0.37 ~is_a_theorem(implies(X3,X2)), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.10/0.37 cnf(c10, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.10/0.37 % 0.10/0.37 cnf(c11, axiom, % 0.10/0.37 is_a_theorem(implies(implies(X6,implies(X7,X8)),implies(X7,implies(X6,X8))))). % 0.10/0.37 cnf(a3, assumption, % 0.10/0.37 implies(X3,X2) = implies(implies(X6,implies(X7,X8)),implies(X7,implies(X6,X8)))). % 0.10/0.37 cnf(c12, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])). % 0.10/0.37 cnf(c13, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])). % 0.10/0.37 % 0.10/0.37 cnf(c14, axiom, % 0.10/0.37 is_a_theorem(X9) | ~is_a_theorem(X10) | ~is_a_theorem(implies(X10,X9))). % 0.10/0.37 cnf(a4, assumption, % 0.10/0.37 implies(X1,X0) = X9). % 0.10/0.37 cnf(c15, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c6, c14])). % 0.10/0.37 cnf(c16, plain, % 0.10/0.37 ~is_a_theorem(X10) | ~is_a_theorem(implies(X10,X9)), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c6, c14])). % 0.10/0.37 % 0.10/0.37 cnf(c17, axiom, % 0.10/0.37 is_a_theorem(implies(implies(X11,X12),implies(implies(not(X11),X12),X12)))). % 0.10/0.37 cnf(a5, assumption, % 0.10/0.37 X10 = implies(implies(X11,X12),implies(implies(not(X11),X12),X12))). % 0.10/0.37 cnf(c18, plain, % 0.10/0.37 ~is_a_theorem(implies(X10,X9)), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.10/0.37 cnf(c19, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.10/0.37 % 0.10/0.37 cnf(c20, axiom, % 0.10/0.37 is_a_theorem(implies(implies(X13,implies(X14,X15)),implies(X14,implies(X13,X15))))). % 0.10/0.37 cnf(a6, assumption, % 0.10/0.37 implies(X10,X9) = implies(implies(X13,implies(X14,X15)),implies(X14,implies(X13,X15)))). % 0.10/0.37 cnf(c21, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a6])], [c18, c20])). % 0.10/0.37 cnf(c22, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a6])], [c18, c20])). % 0.10/0.37 % 0.10/0.37 cnf(c23, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(constraint_solving, [ % 0.10/0.37 bind(X0, implies(implies(a,implies(a,b)),implies(a,b))), % 0.10/0.37 bind(X1, implies(X7,implies(X6,X8))), % 0.10/0.37 bind(X2, implies(X7,implies(X6,X8))), % 0.10/0.37 bind(X3, implies(X4,implies(not(X4),X5))), % 0.10/0.37 bind(X4, a), % 0.10/0.37 bind(X5, b), % 0.10/0.37 bind(X6, a), % 0.10/0.37 bind(X7, not(X4)), % 0.10/0.37 bind(X8, b), % 0.10/0.37 bind(X9, implies(X1,X0)), % 0.10/0.37 bind(X10, implies(implies(X11,X12),implies(implies(not(X11),X12),X12))), % 0.10/0.37 bind(X11, a), % 0.10/0.37 bind(X12, implies(X6,X8)), % 0.10/0.37 bind(X13, implies(X11,X12)), % 0.10/0.37 bind(X14, implies(not(X11),X12)), % 0.10/0.37 bind(X15, implies(X6,X8)) % 0.10/0.37 ], % 0.10/0.37 [a0, a1, a2, a3, a4, a5, a6])). % 0.10/0.37 % 0.10/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------