%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL219-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 : n028.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:21 PM UTC 2026 % Result : Unsatisfiable 126.41s 16.43s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL219-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.09/0.37 % Computer : n028.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 20:25:43 UTC 2026 % 0.09/0.37 % CPUTime : % 126.41/16.43 % SZS status Unsatisfiable % 126.41/16.43 % SZS output begin IncompleteProof % 126.41/16.43 cnf(c0, axiom, % 126.41/16.43 ~theorem(or(not(or(not(or(not(p),q)),q)),or(p,q)))). % 126.41/16.43 cnf(c1, plain, % 126.41/16.43 ~theorem(or(not(or(not(or(not(p),q)),q)),or(p,q))), % 126.41/16.43 inference(start, [], [c0])). % 126.41/16.43 % 126.41/16.43 cnf(c2, axiom, % 126.41/16.43 ~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)). % 126.41/16.43 cnf(a0, assumption, % 126.41/16.43 or(not(or(not(or(not(p),q)),q)),or(p,q)) = X1). % 126.41/16.43 cnf(c3, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 126.41/16.43 cnf(c4, plain, % 126.41/16.43 ~theorem(X0) | ~theorem(or(not(X0),X1)), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 126.41/16.43 % 126.41/16.43 cnf(c5, axiom, % 126.41/16.43 ~theorem(X2) | ~theorem(or(not(X2),X3)) | theorem(X3)). % 126.41/16.43 cnf(a1, assumption, % 126.41/16.43 X0 = X3). % 126.41/16.43 cnf(c6, plain, % 126.41/16.43 ~theorem(or(not(X0),X1)), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 126.41/16.43 cnf(c7, plain, % 126.41/16.43 ~theorem(X2) | ~theorem(or(not(X2),X3)), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 126.41/16.43 % 126.41/16.43 cnf(c8, axiom, % 126.41/16.43 ~theorem(X4) | ~theorem(or(not(X4),X5)) | theorem(X5)). % 126.41/16.43 cnf(a2, assumption, % 126.41/16.43 X2 = X5). % 126.41/16.43 cnf(c9, plain, % 126.41/16.43 ~theorem(or(not(X2),X3)), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 126.41/16.43 cnf(c10, plain, % 126.41/16.43 ~theorem(X4) | ~theorem(or(not(X4),X5)), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 126.41/16.43 % 126.41/16.43 cnf(c11, axiom, % 126.41/16.43 ~axiom(X6) | theorem(X6)). % 126.41/16.43 cnf(a3, assumption, % 126.41/16.43 X4 = X6). % 126.41/16.43 cnf(c12, plain, % 126.41/16.43 ~theorem(or(not(X4),X5)), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 126.41/16.43 cnf(c13, plain, % 126.41/16.43 ~axiom(X6), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 126.41/16.43 % 126.41/16.43 cnf(c14, axiom, % 126.41/16.43 axiom(or(not(X7),or(X8,X7)))). % 126.41/16.43 cnf(a4, assumption, % 126.41/16.43 X6 = or(not(X7),or(X8,X7))). % 126.41/16.43 cnf(c15, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 126.41/16.43 cnf(c16, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 126.41/16.43 % 126.41/16.43 cnf(c17, axiom, % 126.41/16.43 ~theorem(X9) | ~theorem(or(not(X9),X10)) | theorem(X10)). % 126.41/16.43 cnf(a5, assumption, % 126.41/16.43 or(not(X4),X5) = X10). % 126.41/16.43 cnf(c18, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a5])], [c12, c17])). % 126.41/16.43 cnf(c19, plain, % 126.41/16.43 ~theorem(X9) | ~theorem(or(not(X9),X10)), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a5])], [c12, c17])). % 126.41/16.43 % 126.41/16.43 cnf(c20, axiom, % 126.41/16.43 ~axiom(X11) | theorem(X11)). % 126.41/16.43 cnf(a6, assumption, % 126.41/16.43 X9 = X11). % 126.41/16.43 cnf(c21, plain, % 126.41/16.43 ~theorem(or(not(X9),X10)), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 126.41/16.43 cnf(c22, plain, % 126.41/16.43 ~axiom(X11), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 126.41/16.43 % 126.41/16.43 cnf(c23, axiom, % 126.41/16.43 axiom(or(not(or(X12,X13)),or(X13,X12)))). % 126.41/16.43 cnf(a7, assumption, % 126.41/16.43 X11 = or(not(or(X12,X13)),or(X13,X12))). % 126.41/16.43 cnf(c24, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a7])], [c22, c23])). % 126.41/16.43 cnf(c25, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a7])], [c22, c23])). % 126.41/16.43 % 126.41/16.43 cnf(c26, axiom, % 126.41/16.43 ~axiom(X14) | theorem(X14)). % 126.41/16.43 cnf(a8, assumption, % 126.41/16.43 or(not(X9),X10) = X14). % 126.41/16.43 cnf(c27, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a8])], [c21, c26])). % 126.41/16.43 cnf(c28, plain, % 126.41/16.43 ~axiom(X14), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a8])], [c21, c26])). % 126.41/16.43 % 126.41/16.43 cnf(c29, axiom, % 126.41/16.43 axiom(or(not(or(not(X15),X16)),or(not(or(X17,X15)),or(X17,X16))))). % 126.41/16.43 cnf(a9, assumption, % 126.41/16.43 X14 = or(not(or(not(X15),X16)),or(not(or(X17,X15)),or(X17,X16)))). % 126.41/16.43 cnf(c30, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a9])], [c28, c29])). % 126.41/16.43 cnf(c31, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a9])], [c28, c29])). % 126.41/16.43 % 126.41/16.43 cnf(c32, axiom, % 126.41/16.43 ~axiom(X18) | theorem(X18)). % 126.41/16.43 cnf(a10, assumption, % 126.41/16.43 or(not(X2),X3) = X18). % 126.41/16.43 cnf(c33, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a10])], [c9, c32])). % 126.41/16.43 cnf(c34, plain, % 126.41/16.43 ~axiom(X18), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a10])], [c9, c32])). % 126.41/16.43 % 126.41/16.43 cnf(c35, axiom, % 126.41/16.43 axiom(or(not(or(X19,or(X20,X21))),or(X20,or(X19,X21))))). % 126.41/16.43 cnf(a11, assumption, % 126.41/16.43 X18 = or(not(or(X19,or(X20,X21))),or(X20,or(X19,X21)))). % 126.41/16.43 cnf(c36, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])). % 126.41/16.43 cnf(c37, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])). % 126.41/16.43 % 126.41/16.43 cnf(c38, axiom, % 126.41/16.43 ~theorem(X22) | ~theorem(or(not(X22),X23)) | theorem(X23)). % 126.41/16.43 cnf(a12, assumption, % 126.41/16.43 or(not(X0),X1) = X23). % 126.41/16.43 cnf(c39, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a12])], [c6, c38])). % 126.41/16.43 cnf(c40, plain, % 126.41/16.43 ~theorem(X22) | ~theorem(or(not(X22),X23)), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a12])], [c6, c38])). % 126.41/16.43 % 126.41/16.43 cnf(c41, axiom, % 126.41/16.43 ~axiom(X24) | theorem(X24)). % 126.41/16.43 cnf(a13, assumption, % 126.41/16.43 X22 = X24). % 126.41/16.43 cnf(c42, plain, % 126.41/16.43 ~theorem(or(not(X22),X23)), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])). % 126.41/16.43 cnf(c43, plain, % 126.41/16.43 ~axiom(X24), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])). % 126.41/16.43 % 126.41/16.43 cnf(c44, axiom, % 126.41/16.43 axiom(or(not(or(not(X25),X26)),or(not(or(X27,X25)),or(X27,X26))))). % 126.41/16.43 cnf(a14, assumption, % 126.41/16.43 X24 = or(not(or(not(X25),X26)),or(not(or(X27,X25)),or(X27,X26)))). % 126.41/16.43 cnf(c45, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a14])], [c43, c44])). % 126.41/16.43 cnf(c46, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a14])], [c43, c44])). % 126.41/16.43 % 126.41/16.43 cnf(c47, axiom, % 126.41/16.43 ~axiom(X28) | theorem(X28)). % 126.41/16.43 cnf(a15, assumption, % 126.41/16.43 or(not(X22),X23) = X28). % 126.41/16.43 cnf(c48, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a15])], [c42, c47])). % 126.41/16.43 cnf(c49, plain, % 126.41/16.43 ~axiom(X28), % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a15])], [c42, c47])). % 126.41/16.43 % 126.41/16.43 cnf(c50, axiom, % 126.41/16.43 axiom(or(not(or(X29,or(X30,X31))),or(X30,or(X29,X31))))). % 126.41/16.43 cnf(a16, assumption, % 126.41/16.43 X28 = or(not(or(X29,or(X30,X31))),or(X30,or(X29,X31)))). % 126.41/16.43 cnf(c51, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a16])], [c49, c50])). % 126.41/16.43 cnf(c52, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(strict_predicate_extension, [assumptions([a16])], [c49, c50])). % 126.41/16.43 % 126.41/16.43 cnf(c53, plain, % 126.41/16.43 $false, % 126.41/16.43 inference(constraint_solving, [ % 126.41/16.43 bind(X0, or(X20,or(X19,X21))), % 126.41/16.43 bind(X1, or(not(or(not(or(not(p),q)),q)),or(p,q))), % 126.41/16.43 bind(X2, or(X17,X16)), % 126.41/16.43 bind(X3, or(X20,or(X19,X21))), % 126.41/16.43 bind(X4, or(not(X7),or(X8,X7))), % 126.41/16.43 bind(X5, or(X17,X16)), % 126.41/16.43 bind(X6, or(not(X7),or(X8,X7))), % 126.41/16.43 bind(X7, p), % 126.41/16.43 bind(X8, q), % 126.41/16.43 bind(X9, or(not(or(X12,X13)),or(X13,X12))), % 126.41/16.43 bind(X10, or(not(X4),X5)), % 126.41/16.43 bind(X11, or(not(or(X12,X13)),or(X13,X12))), % 126.41/16.43 bind(X12, q), % 126.41/16.43 bind(X13, p), % 126.41/16.43 bind(X14, or(not(X9),X10)), % 126.41/16.43 bind(X15, or(X12,X13)), % 126.41/16.43 bind(X16, or(X13,X12)), % 126.41/16.43 bind(X17, not(X7)), % 126.41/16.43 bind(X18, or(not(X2),X3)), % 126.41/16.43 bind(X19, not(X7)), % 126.41/16.43 bind(X20, p), % 126.41/16.43 bind(X21, q), % 126.41/16.43 bind(X22, or(not(or(not(X25),X26)),or(not(or(X27,X25)),or(X27,X26)))), % 126.41/16.43 bind(X23, or(not(X0),X1)), % 126.41/16.43 bind(X24, or(not(or(not(X25),X26)),or(not(or(X27,X25)),or(X27,X26)))), % 126.41/16.43 bind(X25, or(X19,X21)), % 126.41/16.43 bind(X26, q), % 126.41/16.43 bind(X27, p), % 126.41/16.43 bind(X28, or(not(X22),X23)), % 126.41/16.43 bind(X29, not(or(not(X25),X26))), % 126.41/16.43 bind(X30, not(or(X27,X25))), % 126.41/16.43 bind(X31, or(X27,X26)) % 126.41/16.43 ], % 126.41/16.43 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])). % 126.41/16.43 % 126.41/16.43 % SZS output end IncompleteProof %------------------------------------------------------------------------------