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