%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL272-3 : TPTP v9.3.1. Released v2.3.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n005.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:27 PM UTC 2026 % Result : Unsatisfiable 0.81s 0.52s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL272-3 : TPTP v9.3.1. Released v2.3.0. % 0.00/0.04 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.08/0.35 % Computer : n005.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Sat Sep 5 12:13:51 UTC 2026 % 0.08/0.35 % CPUTime : % 0.81/0.52 % SZS status Unsatisfiable % 0.81/0.52 % SZS output begin IncompleteProof % 0.81/0.52 cnf(c0, axiom, % 0.81/0.53 ~theorem(not(or(not(or(not(p),or(p,p))),not(or(not(or(p,p)),p)))))). % 0.81/0.53 cnf(c1, plain, % 0.81/0.53 ~theorem(not(or(not(or(not(p),or(p,p))),not(or(not(or(p,p)),p))))), % 0.81/0.53 inference(start, [], [c0])). % 0.81/0.53 % 0.81/0.53 cnf(c2, axiom, % 0.81/0.53 ~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)). % 0.81/0.53 cnf(a0, assumption, % 0.81/0.53 not(or(not(or(not(p),or(p,p))),not(or(not(or(p,p)),p)))) = X1). % 0.81/0.53 cnf(c3, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.81/0.53 cnf(c4, plain, % 0.81/0.53 ~theorem(X0) | ~theorem(or(not(X0),X1)), % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.81/0.53 % 0.81/0.53 cnf(c5, axiom, % 0.81/0.53 ~axiom(X2) | theorem(X2)). % 0.81/0.53 cnf(a1, assumption, % 0.81/0.53 X0 = X2). % 0.81/0.53 cnf(c6, plain, % 0.81/0.53 ~theorem(or(not(X0),X1)), % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.81/0.53 cnf(c7, plain, % 0.81/0.53 ~axiom(X2), % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.81/0.53 % 0.81/0.53 cnf(c8, axiom, % 0.81/0.53 axiom(or(not(X3),or(X4,X3)))). % 0.81/0.53 cnf(a2, assumption, % 0.81/0.53 X2 = or(not(X3),or(X4,X3))). % 0.81/0.53 cnf(c9, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.81/0.53 cnf(c10, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.81/0.53 % 0.81/0.53 cnf(c11, axiom, % 0.81/0.53 ~theorem(X5) | ~theorem(or(not(X5),X6)) | theorem(X6)). % 0.81/0.53 cnf(a3, assumption, % 0.81/0.53 or(not(X0),X1) = X6). % 0.81/0.53 cnf(c12, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])). % 0.81/0.53 cnf(c13, plain, % 0.81/0.53 ~theorem(X5) | ~theorem(or(not(X5),X6)), % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])). % 0.81/0.53 % 0.81/0.53 cnf(c14, axiom, % 0.81/0.53 ~theorem(X7) | ~theorem(or(not(X7),X8)) | theorem(X8)). % 0.81/0.53 cnf(a4, assumption, % 0.81/0.53 X5 = X8). % 0.81/0.53 cnf(c15, plain, % 0.81/0.53 ~theorem(or(not(X5),X6)), % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.81/0.53 cnf(c16, plain, % 0.81/0.53 ~theorem(X7) | ~theorem(or(not(X7),X8)), % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.81/0.53 % 0.81/0.53 cnf(c17, axiom, % 0.81/0.53 ~axiom(X9) | theorem(X9)). % 0.81/0.53 cnf(a5, assumption, % 0.81/0.53 X7 = X9). % 0.81/0.53 cnf(c18, plain, % 0.81/0.53 ~theorem(or(not(X7),X8)), % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.81/0.53 cnf(c19, plain, % 0.81/0.53 ~axiom(X9), % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.81/0.53 % 0.81/0.53 cnf(c20, axiom, % 0.81/0.53 axiom(or(not(or(X10,X10)),X10))). % 0.81/0.53 cnf(a6, assumption, % 0.81/0.53 X9 = or(not(or(X10,X10)),X10)). % 0.81/0.53 cnf(c21, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 0.81/0.53 cnf(c22, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 0.81/0.53 % 0.81/0.53 cnf(c23, axiom, % 0.81/0.53 ~theorem(X11) | ~theorem(or(not(X11),X12)) | theorem(X12)). % 0.81/0.53 cnf(a7, assumption, % 0.81/0.53 or(not(X7),X8) = X12). % 0.81/0.53 cnf(c24, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])). % 0.81/0.53 cnf(c25, plain, % 0.81/0.53 ~theorem(X11) | ~theorem(or(not(X11),X12)), % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])). % 0.81/0.53 % 0.81/0.53 cnf(c26, axiom, % 0.81/0.53 ~axiom(X13) | theorem(X13)). % 0.81/0.53 cnf(a8, assumption, % 0.81/0.53 X11 = X13). % 0.81/0.53 cnf(c27, plain, % 0.81/0.53 ~theorem(or(not(X11),X12)), % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])). % 0.81/0.53 cnf(c28, plain, % 0.81/0.53 ~axiom(X13), % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])). % 0.81/0.53 % 0.81/0.53 cnf(c29, axiom, % 0.81/0.53 axiom(or(not(or(X14,X15)),or(X15,X14)))). % 0.81/0.53 cnf(a9, assumption, % 0.81/0.53 X13 = or(not(or(X14,X15)),or(X15,X14))). % 0.81/0.53 cnf(c30, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a9])], [c28, c29])). % 0.81/0.53 cnf(c31, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a9])], [c28, c29])). % 0.81/0.53 % 0.81/0.53 cnf(c32, axiom, % 0.81/0.53 ~axiom(X16) | theorem(X16)). % 0.81/0.53 cnf(a10, assumption, % 0.81/0.53 or(not(X11),X12) = X16). % 0.81/0.53 cnf(c33, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a10])], [c27, c32])). % 0.81/0.53 cnf(c34, plain, % 0.81/0.53 ~axiom(X16), % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a10])], [c27, c32])). % 0.81/0.53 % 0.81/0.53 cnf(c35, axiom, % 0.81/0.53 axiom(or(not(or(X17,or(X18,X19))),or(X18,or(X17,X19))))). % 0.81/0.53 cnf(a11, assumption, % 0.81/0.53 X16 = or(not(or(X17,or(X18,X19))),or(X18,or(X17,X19)))). % 0.81/0.53 cnf(c36, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])). % 0.81/0.53 cnf(c37, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])). % 0.81/0.53 % 0.81/0.53 cnf(c38, axiom, % 0.81/0.53 ~axiom(X20) | theorem(X20)). % 0.81/0.53 cnf(a12, assumption, % 0.81/0.53 or(not(X5),X6) = X20). % 0.81/0.53 cnf(c39, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a12])], [c15, c38])). % 0.81/0.53 cnf(c40, plain, % 0.81/0.53 ~axiom(X20), % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a12])], [c15, c38])). % 0.81/0.53 % 0.81/0.53 cnf(c41, axiom, % 0.81/0.53 axiom(or(not(or(X21,X22)),or(X22,X21)))). % 0.81/0.53 cnf(a13, assumption, % 0.81/0.53 X20 = or(not(or(X21,X22)),or(X22,X21))). % 0.81/0.53 cnf(c42, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])). % 0.81/0.53 cnf(c43, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])). % 0.81/0.53 % 0.81/0.53 cnf(c44, plain, % 0.81/0.53 $false, % 0.81/0.53 inference(constraint_solving, [ % 0.81/0.53 bind(X0, or(not(X3),or(X4,X3))), % 0.81/0.53 bind(X1, not(or(not(or(not(p),or(p,p))),not(or(not(or(p,p)),p))))), % 0.81/0.53 bind(X2, or(not(X3),or(X4,X3))), % 0.81/0.53 bind(X3, p), % 0.81/0.53 bind(X4, p), % 0.81/0.53 bind(X5, or(X17,X19)), % 0.81/0.53 bind(X6, or(not(X0),X1)), % 0.81/0.53 bind(X7, or(not(or(X10,X10)),X10)), % 0.81/0.53 bind(X8, or(X17,X19)), % 0.81/0.53 bind(X9, or(not(or(X10,X10)),X10)), % 0.81/0.53 bind(X10, p), % 0.81/0.53 bind(X11, or(not(or(X14,X15)),or(X15,X14))), % 0.81/0.53 bind(X12, or(not(X7),X8)), % 0.81/0.53 bind(X13, or(not(or(X14,X15)),or(X15,X14))), % 0.81/0.53 bind(X14, not(X0)), % 0.81/0.53 bind(X15, not(X7)), % 0.81/0.53 bind(X16, or(not(X11),X12)), % 0.81/0.53 bind(X17, not(or(X14,X15))), % 0.81/0.53 bind(X18, not(X7)), % 0.81/0.53 bind(X19, not(X0)), % 0.81/0.53 bind(X20, or(not(X5),X6)), % 0.81/0.53 bind(X21, not(or(X14,X15))), % 0.81/0.53 bind(X22, not(X0)) % 0.81/0.53 ], % 0.81/0.53 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])). % 0.81/0.53 % 0.81/0.53 % SZS output end IncompleteProof %------------------------------------------------------------------------------