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