%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL130-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 : n004.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:11 PM UTC 2026 % Result : Unsatisfiable 2.16s 0.67s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL130-1 : 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.35 % Computer : n004.cluster.edu % 0.10/0.35 % Model : x86_64 x86_64 % 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.35 % Memory : 8046.5625MB % 0.10/0.35 % 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 17:59:29 UTC 2026 % 0.13/0.36 % CPUTime : % 2.16/0.67 % SZS status Unsatisfiable % 2.16/0.67 % SZS output begin IncompleteProof % 2.16/0.67 cnf(c0, axiom, % 2.16/0.67 ~is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))). % 2.16/0.67 cnf(c1, plain, % 2.16/0.67 ~is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))), % 2.16/0.67 inference(start, [], [c0])). % 2.16/0.67 % 2.16/0.67 cnf(c2, axiom, % 2.16/0.67 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0))). % 2.16/0.67 cnf(a0, assumption, % 2.16/0.67 equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))) = X0). % 2.16/0.67 cnf(c3, plain, % 2.16/0.67 $false, % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 2.16/0.67 cnf(c4, plain, % 2.16/0.67 ~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0)), % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 2.16/0.67 % 2.16/0.67 cnf(c5, axiom, % 2.16/0.67 is_a_theorem(X2) | ~is_a_theorem(X3) | ~is_a_theorem(equivalent(X3,X2))). % 2.16/0.67 cnf(a1, assumption, % 2.16/0.67 X1 = X2). % 2.16/0.67 cnf(c6, plain, % 2.16/0.67 ~is_a_theorem(equivalent(X1,X0)), % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 2.16/0.67 cnf(c7, plain, % 2.16/0.67 ~is_a_theorem(X3) | ~is_a_theorem(equivalent(X3,X2)), % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 2.16/0.67 % 2.16/0.67 cnf(c8, axiom, % 2.16/0.67 is_a_theorem(equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(equivalent(X5,X7),equivalent(X6,X7)))),X4))). % 2.16/0.67 cnf(a2, assumption, % 2.16/0.67 X3 = equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(equivalent(X5,X7),equivalent(X6,X7)))),X4)). % 2.16/0.67 cnf(c9, plain, % 2.16/0.67 ~is_a_theorem(equivalent(X3,X2)), % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 2.16/0.67 cnf(c10, plain, % 2.16/0.67 $false, % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 2.16/0.67 % 2.16/0.67 cnf(c11, axiom, % 2.16/0.67 is_a_theorem(X8) | ~is_a_theorem(X9) | ~is_a_theorem(equivalent(X9,X8))). % 2.16/0.67 cnf(a3, assumption, % 2.16/0.67 equivalent(X3,X2) = X8). % 2.16/0.67 cnf(c12, plain, % 2.16/0.67 $false, % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])). % 2.16/0.67 cnf(c13, plain, % 2.16/0.67 ~is_a_theorem(X9) | ~is_a_theorem(equivalent(X9,X8)), % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])). % 2.16/0.67 % 2.16/0.67 cnf(c14, plain, % 2.16/0.67 is_a_theorem(X3)). % 2.16/0.67 cnf(a4, assumption, % 2.16/0.67 X9 = X3). % 2.16/0.67 cnf(c15, plain, % 2.16/0.67 ~is_a_theorem(equivalent(X9,X8)), % 2.16/0.67 inference(predicate_reduction, [assumptions([a4])], [c13, c14])). % 2.16/0.67 % 2.16/0.67 cnf(c16, axiom, % 2.16/0.67 is_a_theorem(X10) | ~is_a_theorem(X11) | ~is_a_theorem(equivalent(X11,X10))). % 2.16/0.67 cnf(a5, assumption, % 2.16/0.67 equivalent(X9,X8) = X10). % 2.16/0.67 cnf(c17, plain, % 2.16/0.67 $false, % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a5])], [c15, c16])). % 2.16/0.67 cnf(c18, plain, % 2.16/0.67 ~is_a_theorem(X11) | ~is_a_theorem(equivalent(X11,X10)), % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a5])], [c15, c16])). % 2.16/0.67 % 2.16/0.67 cnf(c19, axiom, % 2.16/0.67 is_a_theorem(X12) | ~is_a_theorem(X13) | ~is_a_theorem(equivalent(X13,X12))). % 2.16/0.67 cnf(a6, assumption, % 2.16/0.67 X11 = X12). % 2.16/0.67 cnf(c20, plain, % 2.16/0.67 ~is_a_theorem(equivalent(X11,X10)), % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a6])], [c18, c19])). % 2.16/0.67 cnf(c21, plain, % 2.16/0.67 ~is_a_theorem(X13) | ~is_a_theorem(equivalent(X13,X12)), % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a6])], [c18, c19])). % 2.16/0.67 % 2.16/0.67 cnf(c22, axiom, % 2.16/0.67 is_a_theorem(X14) | ~is_a_theorem(X15) | ~is_a_theorem(equivalent(X15,X14))). % 2.16/0.67 cnf(a7, assumption, % 2.16/0.67 X13 = X14). % 2.16/0.67 cnf(c23, plain, % 2.16/0.67 ~is_a_theorem(equivalent(X13,X12)), % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a7])], [c21, c22])). % 2.16/0.67 cnf(c24, plain, % 2.16/0.67 ~is_a_theorem(X15) | ~is_a_theorem(equivalent(X15,X14)), % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a7])], [c21, c22])). % 2.16/0.67 % 2.16/0.67 cnf(c25, axiom, % 2.16/0.67 is_a_theorem(equivalent(equivalent(X16,equivalent(equivalent(X17,X18),equivalent(equivalent(X17,X19),equivalent(X18,X19)))),X16))). % 2.16/0.67 cnf(a8, assumption, % 2.16/0.67 X15 = equivalent(equivalent(X16,equivalent(equivalent(X17,X18),equivalent(equivalent(X17,X19),equivalent(X18,X19)))),X16)). % 2.16/0.67 cnf(c26, plain, % 2.16/0.67 ~is_a_theorem(equivalent(X15,X14)), % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a8])], [c24, c25])). % 2.16/0.67 cnf(c27, plain, % 2.16/0.67 $false, % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a8])], [c24, c25])). % 2.16/0.67 % 2.16/0.67 cnf(c28, axiom, % 2.16/0.67 is_a_theorem(equivalent(equivalent(X20,equivalent(equivalent(X21,X22),equivalent(equivalent(X21,X23),equivalent(X22,X23)))),X20))). % 2.16/0.67 cnf(a9, assumption, % 2.16/0.67 equivalent(X15,X14) = equivalent(equivalent(X20,equivalent(equivalent(X21,X22),equivalent(equivalent(X21,X23),equivalent(X22,X23)))),X20)). % 2.16/0.67 cnf(c29, plain, % 2.16/0.67 $false, % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a9])], [c26, c28])). % 2.16/0.67 cnf(c30, plain, % 2.16/0.67 $false, % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a9])], [c26, c28])). % 2.16/0.67 % 2.16/0.67 cnf(c31, plain, % 2.16/0.67 is_a_theorem(X15)). % 2.16/0.67 cnf(a10, assumption, % 2.16/0.67 equivalent(X13,X12) = X15). % 2.16/0.67 cnf(c32, plain, % 2.16/0.67 $false, % 2.16/0.67 inference(predicate_reduction, [assumptions([a10])], [c23, c31])). % 2.16/0.67 % 2.16/0.67 cnf(c33, plain, % 2.16/0.67 is_a_theorem(X13)). % 2.16/0.67 cnf(a11, assumption, % 2.16/0.67 equivalent(X11,X10) = X13). % 2.16/0.67 cnf(c34, plain, % 2.16/0.67 $false, % 2.16/0.67 inference(predicate_reduction, [assumptions([a11])], [c20, c33])). % 2.16/0.67 % 2.16/0.67 cnf(c35, axiom, % 2.16/0.67 is_a_theorem(X24) | ~is_a_theorem(X25) | ~is_a_theorem(equivalent(X25,X24))). % 2.16/0.67 cnf(a12, assumption, % 2.16/0.67 equivalent(X1,X0) = X24). % 2.16/0.67 cnf(c36, plain, % 2.16/0.67 $false, % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a12])], [c6, c35])). % 2.16/0.67 cnf(c37, plain, % 2.16/0.67 ~is_a_theorem(X25) | ~is_a_theorem(equivalent(X25,X24)), % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a12])], [c6, c35])). % 2.16/0.67 % 2.16/0.67 cnf(c38, axiom, % 2.16/0.67 is_a_theorem(equivalent(equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29)))),X26))). % 2.16/0.67 cnf(a13, assumption, % 2.16/0.67 X25 = equivalent(equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29)))),X26)). % 2.16/0.67 cnf(c39, plain, % 2.16/0.67 ~is_a_theorem(equivalent(X25,X24)), % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a13])], [c37, c38])). % 2.16/0.67 cnf(c40, plain, % 2.16/0.67 $false, % 2.16/0.67 inference(strict_predicate_extension, [assumptions([a13])], [c37, c38])). % 2.16/0.67 % 2.16/0.67 cnf(c41, plain, % 2.16/0.67 is_a_theorem(X11)). % 2.16/0.67 cnf(a14, assumption, % 2.16/0.67 equivalent(X25,X24) = X11). % 2.16/0.67 cnf(c42, plain, % 2.16/0.67 $false, % 2.16/0.67 inference(predicate_reduction, [assumptions([a14])], [c39, c41])). % 2.16/0.67 % 2.16/0.67 cnf(c43, plain, % 2.16/0.67 $false, % 2.16/0.67 inference(constraint_solving, [ % 2.16/0.67 bind(X0, equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))), % 2.16/0.67 bind(X1, equivalent(X18,X19)), % 2.16/0.67 bind(X2, equivalent(X18,X19)), % 2.16/0.67 bind(X3, equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(equivalent(X5,X7),equivalent(X6,X7)))),X4)), % 2.16/0.67 bind(X4, equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29))))), % 2.16/0.67 bind(X5, X5), % 2.16/0.67 bind(X6, X6), % 2.16/0.67 bind(X7, X7), % 2.16/0.67 bind(X8, equivalent(X3,X2)), % 2.16/0.67 bind(X9, equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(equivalent(X5,X7),equivalent(X6,X7)))),X4)), % 2.16/0.67 bind(X10, equivalent(X9,X8)), % 2.16/0.67 bind(X11, equivalent(equivalent(X21,X22),equivalent(equivalent(X21,X23),equivalent(X22,X23)))), % 2.16/0.67 bind(X12, equivalent(equivalent(X21,X22),equivalent(equivalent(X21,X23),equivalent(X22,X23)))), % 2.16/0.67 bind(X13, equivalent(X16,equivalent(equivalent(X17,X18),equivalent(equivalent(X17,X19),equivalent(X18,X19))))), % 2.16/0.67 bind(X14, equivalent(X16,equivalent(equivalent(X17,X18),equivalent(equivalent(X17,X19),equivalent(X18,X19))))), % 2.16/0.67 bind(X15, equivalent(equivalent(X16,equivalent(equivalent(X17,X18),equivalent(equivalent(X17,X19),equivalent(X18,X19)))),X16)), % 2.16/0.67 bind(X16, equivalent(equivalent(X21,X22),equivalent(equivalent(X21,X23),equivalent(X22,X23)))), % 2.16/0.67 bind(X17, equivalent(X4,equivalent(equivalent(X5,X6),equivalent(equivalent(X5,X7),equivalent(X6,X7))))), % 2.16/0.67 bind(X18, equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29))))), % 2.16/0.67 bind(X19, equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29))))), % 2.16/0.67 bind(X20, equivalent(X16,equivalent(equivalent(X17,X18),equivalent(equivalent(X17,X19),equivalent(X18,X19))))), % 2.16/0.67 bind(X21, equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29))))), % 2.16/0.67 bind(X22, a), % 2.16/0.67 bind(X23, equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29))))), % 2.16/0.67 bind(X24, equivalent(X1,X0)), % 2.16/0.67 bind(X25, equivalent(equivalent(X26,equivalent(equivalent(X27,X28),equivalent(equivalent(X27,X29),equivalent(X28,X29)))),X26)), % 2.16/0.67 bind(X26, a), % 2.16/0.67 bind(X27, b), % 2.16/0.67 bind(X28, c), % 2.16/0.67 bind(X29, e) % 2.16/0.67 ], % 2.16/0.67 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])). % 2.16/0.67 % 2.16/0.67 % SZS output end IncompleteProof %------------------------------------------------------------------------------