%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL076-3 : 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 : n002.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:07 PM UTC 2026 % Result : Unsatisfiable 0.15s 0.49s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL076-3 : 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 : n002.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 : Fri Sep 4 23:10:20 UTC 2026 % 0.09/0.37 % CPUTime : % 0.15/0.49 % SZS status Unsatisfiable % 0.15/0.49 % SZS output begin IncompleteProof % 0.15/0.49 cnf(c0, axiom, % 0.15/0.49 ~is_a_theorem(implies(a,not(not(a))))). % 0.15/0.49 cnf(c1, plain, % 0.15/0.49 ~is_a_theorem(implies(a,not(not(a)))), % 0.15/0.49 inference(start, [], [c0])). % 0.15/0.49 % 0.15/0.49 cnf(c2, axiom, % 0.15/0.49 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))). % 0.15/0.49 cnf(a0, assumption, % 0.15/0.49 implies(a,not(not(a))) = X0). % 0.15/0.49 cnf(c3, plain, % 0.15/0.49 $false, % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.15/0.49 cnf(c4, plain, % 0.15/0.49 ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)), % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.15/0.49 % 0.15/0.49 cnf(c5, axiom, % 0.15/0.49 is_a_theorem(implies(X2,implies(X3,X2)))). % 0.15/0.49 cnf(a1, assumption, % 0.15/0.49 X1 = implies(X2,implies(X3,X2))). % 0.15/0.49 cnf(c6, plain, % 0.15/0.49 ~is_a_theorem(implies(X1,X0)), % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.15/0.49 cnf(c7, plain, % 0.15/0.49 $false, % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.15/0.49 % 0.15/0.49 cnf(c8, axiom, % 0.15/0.49 is_a_theorem(implies(X4,X5)) | ~is_a_theorem(implies(X6,X5)) | ~is_a_theorem(implies(X4,X6))). % 0.15/0.49 cnf(a2, assumption, % 0.15/0.49 implies(X1,X0) = implies(X4,X5)). % 0.15/0.49 cnf(c9, plain, % 0.15/0.49 $false, % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.15/0.49 cnf(c10, plain, % 0.15/0.49 ~is_a_theorem(implies(X6,X5)) | ~is_a_theorem(implies(X4,X6)), % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.15/0.49 % 0.15/0.49 cnf(c11, axiom, % 0.15/0.49 is_a_theorem(implies(implies(not(X7),not(X8)),implies(X8,X7)))). % 0.15/0.49 cnf(a3, assumption, % 0.15/0.49 implies(X6,X5) = implies(implies(not(X7),not(X8)),implies(X8,X7))). % 0.15/0.49 cnf(c12, plain, % 0.15/0.49 ~is_a_theorem(implies(X4,X6)), % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.15/0.49 cnf(c13, plain, % 0.15/0.49 $false, % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.15/0.49 % 0.15/0.49 cnf(c14, axiom, % 0.15/0.49 is_a_theorem(X9) | ~is_a_theorem(X10) | ~is_a_theorem(implies(X10,X9))). % 0.15/0.49 cnf(a4, assumption, % 0.15/0.49 implies(X4,X6) = X9). % 0.15/0.49 cnf(c15, plain, % 0.15/0.49 $false, % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])). % 0.15/0.49 cnf(c16, plain, % 0.15/0.49 ~is_a_theorem(X10) | ~is_a_theorem(implies(X10,X9)), % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])). % 0.15/0.49 % 0.15/0.49 cnf(c17, axiom, % 0.15/0.49 is_a_theorem(implies(X11,X12)) | ~is_a_theorem(implies(X13,X12)) | ~is_a_theorem(implies(X11,X13))). % 0.15/0.49 cnf(a5, assumption, % 0.15/0.49 X10 = implies(X11,X12)). % 0.15/0.49 cnf(c18, plain, % 0.15/0.49 ~is_a_theorem(implies(X10,X9)), % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.15/0.49 cnf(c19, plain, % 0.15/0.49 ~is_a_theorem(implies(X13,X12)) | ~is_a_theorem(implies(X11,X13)), % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.15/0.49 % 0.15/0.49 cnf(c20, axiom, % 0.15/0.49 is_a_theorem(implies(implies(not(X14),not(X15)),implies(X15,X14)))). % 0.15/0.49 cnf(a6, assumption, % 0.15/0.49 implies(X13,X12) = implies(implies(not(X14),not(X15)),implies(X15,X14))). % 0.15/0.49 cnf(c21, plain, % 0.15/0.49 ~is_a_theorem(implies(X11,X13)), % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 0.15/0.49 cnf(c22, plain, % 0.15/0.49 $false, % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 0.15/0.49 % 0.15/0.49 cnf(c23, axiom, % 0.15/0.49 is_a_theorem(implies(X16,X17)) | ~is_a_theorem(implies(X18,X17)) | ~is_a_theorem(implies(X16,X18))). % 0.15/0.49 cnf(a7, assumption, % 0.15/0.49 implies(X11,X13) = implies(X16,X17)). % 0.15/0.49 cnf(c24, plain, % 0.15/0.49 $false, % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a7])], [c21, c23])). % 0.15/0.49 cnf(c25, plain, % 0.15/0.49 ~is_a_theorem(implies(X18,X17)) | ~is_a_theorem(implies(X16,X18)), % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a7])], [c21, c23])). % 0.15/0.49 % 0.15/0.49 cnf(c26, axiom, % 0.15/0.49 is_a_theorem(implies(implies(not(X19),not(X20)),implies(X20,X19)))). % 0.15/0.49 cnf(a8, assumption, % 0.15/0.49 implies(X18,X17) = implies(implies(not(X19),not(X20)),implies(X20,X19))). % 0.15/0.49 cnf(c27, plain, % 0.15/0.49 ~is_a_theorem(implies(X16,X18)), % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])). % 0.15/0.49 cnf(c28, plain, % 0.15/0.49 $false, % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])). % 0.15/0.49 % 0.15/0.49 cnf(c29, axiom, % 0.15/0.49 is_a_theorem(implies(X21,implies(X22,X21)))). % 0.15/0.49 cnf(a9, assumption, % 0.15/0.49 implies(X16,X18) = implies(X21,implies(X22,X21))). % 0.15/0.49 cnf(c30, plain, % 0.15/0.49 $false, % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a9])], [c27, c29])). % 0.15/0.49 cnf(c31, plain, % 0.15/0.49 $false, % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a9])], [c27, c29])). % 0.15/0.49 % 0.15/0.49 cnf(c32, axiom, % 0.15/0.49 is_a_theorem(implies(implies(X23,implies(X24,X25)),implies(implies(X23,X24),implies(X23,X25))))). % 0.15/0.49 cnf(a10, assumption, % 0.15/0.49 implies(X10,X9) = implies(implies(X23,implies(X24,X25)),implies(implies(X23,X24),implies(X23,X25)))). % 0.15/0.49 cnf(c33, plain, % 0.15/0.49 $false, % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a10])], [c18, c32])). % 0.15/0.49 cnf(c34, plain, % 0.15/0.49 $false, % 0.15/0.49 inference(strict_predicate_extension, [assumptions([a10])], [c18, c32])). % 0.15/0.49 % 0.15/0.49 cnf(c35, plain, % 0.15/0.49 $false, % 0.15/0.49 inference(constraint_solving, [ % 0.15/0.49 bind(X0, implies(a,not(not(a)))), % 0.15/0.49 bind(X1, implies(X2,implies(X3,X2))), % 0.15/0.49 bind(X2, not(X20)), % 0.15/0.49 bind(X3, X3), % 0.15/0.49 bind(X4, implies(X2,implies(X3,X2))), % 0.15/0.49 bind(X5, implies(a,not(not(a)))), % 0.15/0.49 bind(X6, implies(not(X7),not(X8))), % 0.15/0.49 bind(X7, not(not(a))), % 0.15/0.49 bind(X8, a), % 0.15/0.49 bind(X9, implies(X4,X6)), % 0.15/0.49 bind(X10, implies(X11,X12)), % 0.15/0.49 bind(X11, not(X20)), % 0.15/0.49 bind(X12, implies(X15,X14)), % 0.15/0.49 bind(X13, implies(not(X14),not(X15))), % 0.15/0.49 bind(X14, not(a)), % 0.15/0.49 bind(X15, implies(X3,X2)), % 0.15/0.49 bind(X16, not(X20)), % 0.15/0.49 bind(X17, implies(not(X14),not(X15))), % 0.15/0.49 bind(X18, implies(not(X19),not(X20))), % 0.15/0.49 bind(X19, not(X15)), % 0.15/0.49 bind(X20, not(X14)), % 0.15/0.49 bind(X21, not(X20)), % 0.15/0.49 bind(X22, not(X19)), % 0.15/0.49 bind(X23, not(X20)), % 0.15/0.49 bind(X24, implies(X3,X2)), % 0.15/0.49 bind(X25, not(a)) % 0.15/0.49 ], % 0.15/0.49 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 0.15/0.49 % 0.15/0.49 % SZS output end IncompleteProof %------------------------------------------------------------------------------