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