%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL077-2 : 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 : n010.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.10s 0.42s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL077-2 : TPTP v9.3.1. Released v1.0.0. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.10/0.37 % Computer : n010.cluster.edu % 0.10/0.37 % Model : x86_64 x86_64 % 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.37 % Memory : 8046.5625MB % 0.10/0.37 % OS : Linux 6.8.0-71-generic % 0.10/0.37 % CPULimit : 300 % 0.10/0.37 % WCLimit : 300 % 0.10/0.37 % DateTime : Sat Sep 5 05:42:38 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.42 % SZS status Unsatisfiable % 0.10/0.42 % SZS output begin IncompleteProof % 0.10/0.42 cnf(c0, axiom, % 0.10/0.42 ~is_a_theorem(implies(not(not(a)),a))). % 0.10/0.42 cnf(c1, plain, % 0.10/0.42 ~is_a_theorem(implies(not(not(a)),a)), % 0.10/0.42 inference(start, [], [c0])). % 0.10/0.42 % 0.10/0.42 cnf(c2, axiom, % 0.10/0.42 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))). % 0.10/0.42 cnf(a0, assumption, % 0.10/0.42 implies(not(not(a)),a) = X0). % 0.10/0.42 cnf(c3, plain, % 0.10/0.42 $false, % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.42 cnf(c4, plain, % 0.10/0.42 ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)), % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.42 % 0.10/0.42 cnf(c5, axiom, % 0.10/0.42 is_a_theorem(implies(X2,implies(X3,X2)))). % 0.10/0.42 cnf(a1, assumption, % 0.10/0.42 X1 = implies(X2,implies(X3,X2))). % 0.10/0.42 cnf(c6, plain, % 0.10/0.42 ~is_a_theorem(implies(X1,X0)), % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.10/0.42 cnf(c7, plain, % 0.10/0.42 $false, % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.10/0.42 % 0.10/0.42 cnf(c8, axiom, % 0.10/0.42 is_a_theorem(X4) | ~is_a_theorem(X5) | ~is_a_theorem(implies(X5,X4))). % 0.10/0.42 cnf(a2, assumption, % 0.10/0.42 implies(X1,X0) = X4). % 0.10/0.42 cnf(c9, plain, % 0.10/0.42 $false, % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.10/0.42 cnf(c10, plain, % 0.10/0.42 ~is_a_theorem(X5) | ~is_a_theorem(implies(X5,X4)), % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.10/0.42 % 0.10/0.42 cnf(c11, axiom, % 0.10/0.42 is_a_theorem(implies(X6,X7)) | ~is_a_theorem(implies(X8,X7)) | ~is_a_theorem(implies(X6,X8))). % 0.10/0.42 cnf(a3, assumption, % 0.10/0.42 X5 = implies(X6,X7)). % 0.10/0.42 cnf(c12, plain, % 0.10/0.42 ~is_a_theorem(implies(X5,X4)), % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.10/0.42 cnf(c13, plain, % 0.10/0.42 ~is_a_theorem(implies(X8,X7)) | ~is_a_theorem(implies(X6,X8)), % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.10/0.42 % 0.10/0.42 cnf(c14, axiom, % 0.10/0.42 is_a_theorem(implies(implies(not(X9),not(X10)),implies(X10,X9)))). % 0.10/0.42 cnf(a4, assumption, % 0.10/0.42 implies(X8,X7) = implies(implies(not(X9),not(X10)),implies(X10,X9))). % 0.10/0.42 cnf(c15, plain, % 0.10/0.42 ~is_a_theorem(implies(X6,X8)), % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.10/0.42 cnf(c16, plain, % 0.10/0.42 $false, % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.10/0.42 % 0.10/0.42 cnf(c17, axiom, % 0.10/0.42 is_a_theorem(implies(X11,X12)) | ~is_a_theorem(implies(X13,X12)) | ~is_a_theorem(implies(X11,X13))). % 0.10/0.42 cnf(a5, assumption, % 0.10/0.42 implies(X6,X8) = implies(X11,X12)). % 0.10/0.42 cnf(c18, plain, % 0.10/0.42 $false, % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])). % 0.10/0.42 cnf(c19, plain, % 0.10/0.42 ~is_a_theorem(implies(X13,X12)) | ~is_a_theorem(implies(X11,X13)), % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])). % 0.10/0.42 % 0.10/0.42 cnf(c20, axiom, % 0.10/0.42 is_a_theorem(implies(implies(not(X14),not(X15)),implies(X15,X14)))). % 0.10/0.42 cnf(a6, assumption, % 0.10/0.42 implies(X13,X12) = implies(implies(not(X14),not(X15)),implies(X15,X14))). % 0.10/0.42 cnf(c21, plain, % 0.10/0.42 ~is_a_theorem(implies(X11,X13)), % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 0.10/0.42 cnf(c22, plain, % 0.10/0.42 $false, % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 0.10/0.42 % 0.10/0.42 cnf(c23, axiom, % 0.10/0.42 is_a_theorem(implies(X16,implies(X17,X16)))). % 0.10/0.42 cnf(a7, assumption, % 0.10/0.42 implies(X11,X13) = implies(X16,implies(X17,X16))). % 0.10/0.42 cnf(c24, plain, % 0.10/0.42 $false, % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a7])], [c21, c23])). % 0.10/0.42 cnf(c25, plain, % 0.10/0.42 $false, % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a7])], [c21, c23])). % 0.10/0.42 % 0.10/0.42 cnf(c26, axiom, % 0.10/0.42 is_a_theorem(implies(implies(X18,implies(X19,X20)),implies(implies(X18,X19),implies(X18,X20))))). % 0.10/0.42 cnf(a8, assumption, % 0.10/0.42 implies(X5,X4) = implies(implies(X18,implies(X19,X20)),implies(implies(X18,X19),implies(X18,X20)))). % 0.10/0.42 cnf(c27, plain, % 0.10/0.42 $false, % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a8])], [c12, c26])). % 0.10/0.42 cnf(c28, plain, % 0.10/0.42 $false, % 0.10/0.42 inference(strict_predicate_extension, [assumptions([a8])], [c12, c26])). % 0.10/0.42 % 0.10/0.42 cnf(c29, plain, % 0.10/0.42 $false, % 0.10/0.42 inference(constraint_solving, [ % 0.10/0.42 bind(X0, implies(not(not(a)),a)), % 0.10/0.42 bind(X1, implies(X2,implies(X3,X2))), % 0.10/0.42 bind(X2, not(X15)), % 0.10/0.42 bind(X3, X3), % 0.10/0.42 bind(X4, implies(X1,X0)), % 0.10/0.42 bind(X5, implies(X6,X7)), % 0.10/0.42 bind(X6, not(X15)), % 0.10/0.42 bind(X7, implies(X10,X9)), % 0.10/0.42 bind(X8, implies(not(X9),not(X10))), % 0.10/0.42 bind(X9, a), % 0.10/0.42 bind(X10, implies(X3,X2)), % 0.10/0.42 bind(X11, not(X15)), % 0.10/0.42 bind(X12, implies(not(X9),not(X10))), % 0.10/0.42 bind(X13, implies(not(X14),not(X15))), % 0.10/0.42 bind(X14, not(X10)), % 0.10/0.42 bind(X15, not(X9)), % 0.10/0.42 bind(X16, not(X15)), % 0.10/0.42 bind(X17, not(X14)), % 0.10/0.42 bind(X18, not(X15)), % 0.10/0.42 bind(X19, implies(X3,X2)), % 0.10/0.42 bind(X20, a) % 0.10/0.42 ], % 0.10/0.42 [a0, a1, a2, a3, a4, a5, a6, a7, a8])). % 0.10/0.42 % 0.10/0.42 % SZS output end IncompleteProof %------------------------------------------------------------------------------