%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL193-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 0.09s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL193-3 : TPTP v9.3.1. Released v2.3.0. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.09/0.37 % Computer : n001.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 : Sat Sep 5 18:53:17 UTC 2026 % 0.09/0.37 % CPUTime : % 0.09/0.39 % SZS status Unsatisfiable % 0.09/0.39 % SZS output begin IncompleteProof % 0.09/0.39 cnf(c0, axiom, % 0.09/0.39 ~theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p))))). % 0.09/0.39 cnf(c1, plain, % 0.09/0.39 ~theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))), % 0.09/0.39 inference(start, [], [c0])). % 0.09/0.39 % 0.09/0.39 cnf(c2, axiom, % 0.09/0.39 ~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)). % 0.09/0.39 cnf(a0, assumption, % 0.09/0.39 or(not(or(not(q),r)),or(not(or(p,q)),or(r,p))) = X1). % 0.09/0.39 cnf(c3, plain, % 0.09/0.39 $false, % 0.09/0.39 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.39 cnf(c4, plain, % 0.09/0.40 ~theorem(X0) | ~theorem(or(not(X0),X1)), % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.40 % 0.09/0.40 cnf(c5, axiom, % 0.09/0.40 ~axiom(X2) | theorem(X2)). % 0.09/0.40 cnf(a1, assumption, % 0.09/0.40 X0 = X2). % 0.09/0.40 cnf(c6, plain, % 0.09/0.40 ~theorem(or(not(X0),X1)), % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.09/0.40 cnf(c7, plain, % 0.09/0.40 ~axiom(X2), % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.09/0.40 % 0.09/0.40 cnf(c8, axiom, % 0.09/0.40 axiom(or(not(or(not(X3),X4)),or(not(or(X5,X3)),or(X5,X4))))). % 0.09/0.40 cnf(a2, assumption, % 0.09/0.40 X2 = or(not(or(not(X3),X4)),or(not(or(X5,X3)),or(X5,X4)))). % 0.09/0.40 cnf(c9, plain, % 0.09/0.40 $false, % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.09/0.40 cnf(c10, plain, % 0.09/0.40 $false, % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.09/0.40 % 0.09/0.40 cnf(c11, axiom, % 0.09/0.40 ~theorem(X6) | ~theorem(or(not(X6),X7)) | theorem(X7)). % 0.09/0.40 cnf(a3, assumption, % 0.09/0.40 or(not(X0),X1) = X7). % 0.09/0.40 cnf(c12, plain, % 0.09/0.40 $false, % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])). % 0.09/0.40 cnf(c13, plain, % 0.09/0.40 ~theorem(X6) | ~theorem(or(not(X6),X7)), % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])). % 0.09/0.40 % 0.09/0.40 cnf(c14, axiom, % 0.09/0.40 ~theorem(X8) | ~theorem(or(not(X8),X9)) | theorem(X9)). % 0.09/0.40 cnf(a4, assumption, % 0.09/0.40 X6 = X9). % 0.09/0.40 cnf(c15, plain, % 0.09/0.40 ~theorem(or(not(X6),X7)), % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.09/0.40 cnf(c16, plain, % 0.09/0.40 ~theorem(X8) | ~theorem(or(not(X8),X9)), % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.09/0.40 % 0.09/0.40 cnf(c17, axiom, % 0.09/0.40 ~axiom(X10) | theorem(X10)). % 0.09/0.40 cnf(a5, assumption, % 0.09/0.40 X8 = X10). % 0.09/0.40 cnf(c18, plain, % 0.09/0.40 ~theorem(or(not(X8),X9)), % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.09/0.40 cnf(c19, plain, % 0.09/0.40 ~axiom(X10), % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.09/0.40 % 0.09/0.40 cnf(c20, axiom, % 0.09/0.40 axiom(or(not(or(X11,X12)),or(X12,X11)))). % 0.09/0.40 cnf(a6, assumption, % 0.09/0.40 X10 = or(not(or(X11,X12)),or(X12,X11))). % 0.09/0.40 cnf(c21, plain, % 0.09/0.40 $false, % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 0.09/0.40 cnf(c22, plain, % 0.09/0.40 $false, % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 0.09/0.40 % 0.09/0.40 cnf(c23, axiom, % 0.09/0.40 ~axiom(X13) | theorem(X13)). % 0.09/0.40 cnf(a7, assumption, % 0.09/0.40 or(not(X8),X9) = X13). % 0.09/0.40 cnf(c24, plain, % 0.09/0.40 $false, % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])). % 0.09/0.40 cnf(c25, plain, % 0.09/0.40 ~axiom(X13), % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])). % 0.09/0.40 % 0.09/0.40 cnf(c26, axiom, % 0.09/0.40 axiom(or(not(or(not(X14),X15)),or(not(or(X16,X14)),or(X16,X15))))). % 0.09/0.40 cnf(a8, assumption, % 0.09/0.40 X13 = or(not(or(not(X14),X15)),or(not(or(X16,X14)),or(X16,X15)))). % 0.09/0.40 cnf(c27, plain, % 0.09/0.40 $false, % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])). % 0.09/0.40 cnf(c28, plain, % 0.09/0.40 $false, % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])). % 0.09/0.40 % 0.09/0.40 cnf(c29, axiom, % 0.09/0.40 ~axiom(X17) | theorem(X17)). % 0.09/0.40 cnf(a9, assumption, % 0.09/0.40 or(not(X6),X7) = X17). % 0.09/0.40 cnf(c30, plain, % 0.09/0.40 $false, % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a9])], [c15, c29])). % 0.09/0.40 cnf(c31, plain, % 0.09/0.40 ~axiom(X17), % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a9])], [c15, c29])). % 0.09/0.40 % 0.09/0.40 cnf(c32, axiom, % 0.09/0.40 axiom(or(not(or(not(X18),X19)),or(not(or(X20,X18)),or(X20,X19))))). % 0.09/0.40 cnf(a10, assumption, % 0.09/0.40 X17 = or(not(or(not(X18),X19)),or(not(or(X20,X18)),or(X20,X19)))). % 0.09/0.40 cnf(c33, plain, % 0.09/0.40 $false, % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a10])], [c31, c32])). % 0.09/0.40 cnf(c34, plain, % 0.09/0.40 $false, % 0.09/0.40 inference(strict_predicate_extension, [assumptions([a10])], [c31, c32])). % 0.09/0.40 % 0.09/0.40 cnf(c35, plain, % 0.09/0.40 $false, % 0.09/0.40 inference(constraint_solving, [ % 0.09/0.40 bind(X0, or(not(or(not(X3),X4)),or(not(or(X5,X3)),or(X5,X4)))), % 0.09/0.40 bind(X1, or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))), % 0.09/0.40 bind(X2, or(not(or(not(X3),X4)),or(not(or(X5,X3)),or(X5,X4)))), % 0.09/0.40 bind(X3, q), % 0.09/0.40 bind(X4, r), % 0.09/0.40 bind(X5, p), % 0.09/0.40 bind(X6, or(not(or(X16,X14)),or(X16,X15))), % 0.09/0.40 bind(X7, or(not(X0),X1)), % 0.09/0.40 bind(X8, or(not(or(X11,X12)),or(X12,X11))), % 0.09/0.40 bind(X9, or(not(or(X16,X14)),or(X16,X15))), % 0.09/0.40 bind(X10, or(not(or(X11,X12)),or(X12,X11))), % 0.09/0.40 bind(X11, p), % 0.09/0.40 bind(X12, r), % 0.09/0.40 bind(X13, or(not(X8),X9)), % 0.09/0.40 bind(X14, or(X11,X12)), % 0.09/0.40 bind(X15, or(X12,X11)), % 0.09/0.40 bind(X16, not(or(X5,X3))), % 0.09/0.40 bind(X17, or(not(X6),X7)), % 0.09/0.40 bind(X18, or(X16,X14)), % 0.09/0.40 bind(X19, or(X16,X15)), % 0.09/0.40 bind(X20, not(or(not(X3),X4))) % 0.09/0.40 ], % 0.09/0.40 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 0.09/0.40 % 0.09/0.40 % SZS output end IncompleteProof %------------------------------------------------------------------------------