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