%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL236-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 : n017.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:23 PM UTC 2026 % Result : Unsatisfiable 0.09s 0.45s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL236-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.43 % Computer : n017.cluster.edu % 0.09/0.43 % Model : x86_64 x86_64 % 0.09/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.43 % Memory : 8046.5625MB % 0.09/0.43 % OS : Linux 6.8.0-71-generic % 0.09/0.43 % CPULimit : 300 % 0.09/0.43 % WCLimit : 300 % 0.09/0.43 % DateTime : Sat Sep 5 10:19:06 UTC 2026 % 0.09/0.43 % CPUTime : % 0.09/0.45 % SZS status Unsatisfiable % 0.09/0.45 % SZS output begin IncompleteProof % 0.09/0.45 cnf(c0, axiom, % 0.09/0.45 ~theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q))))))). % 0.09/0.45 cnf(c1, plain, % 0.09/0.45 ~theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))), % 0.09/0.45 inference(start, [], [c0])). % 0.09/0.45 % 0.09/0.45 cnf(c2, axiom, % 0.09/0.45 ~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)). % 0.09/0.45 cnf(a0, assumption, % 0.09/0.45 or(not(or(not(p),not(q))),not(not(or(not(p),not(q))))) = X1). % 0.09/0.45 cnf(c3, plain, % 0.09/0.45 $false, % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.45 cnf(c4, plain, % 0.09/0.45 ~theorem(X0) | ~theorem(or(not(X0),X1)), % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.45 % 0.09/0.45 cnf(c5, axiom, % 0.09/0.45 ~theorem(X2) | ~theorem(or(not(X2),X3)) | theorem(X3)). % 0.09/0.45 cnf(a1, assumption, % 0.09/0.45 X0 = X3). % 0.09/0.45 cnf(c6, plain, % 0.09/0.45 ~theorem(or(not(X0),X1)), % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.09/0.45 cnf(c7, plain, % 0.09/0.45 ~theorem(X2) | ~theorem(or(not(X2),X3)), % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.09/0.45 % 0.09/0.45 cnf(c8, axiom, % 0.09/0.45 ~axiom(X4) | theorem(X4)). % 0.09/0.45 cnf(a2, assumption, % 0.09/0.45 X2 = X4). % 0.09/0.45 cnf(c9, plain, % 0.09/0.45 ~theorem(or(not(X2),X3)), % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.09/0.45 cnf(c10, plain, % 0.09/0.45 ~axiom(X4), % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.09/0.45 % 0.09/0.45 cnf(c11, axiom, % 0.09/0.45 axiom(or(not(or(X5,X6)),or(X6,X5)))). % 0.09/0.45 cnf(a3, assumption, % 0.09/0.45 X4 = or(not(or(X5,X6)),or(X6,X5))). % 0.09/0.45 cnf(c12, plain, % 0.09/0.45 $false, % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.09/0.45 cnf(c13, plain, % 0.09/0.45 $false, % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.09/0.45 % 0.09/0.45 cnf(c14, axiom, % 0.09/0.45 ~theorem(X7) | ~theorem(or(not(X7),X8)) | theorem(X8)). % 0.09/0.45 cnf(a4, assumption, % 0.09/0.45 or(not(X2),X3) = X8). % 0.09/0.45 cnf(c15, plain, % 0.09/0.45 $false, % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a4])], [c9, c14])). % 0.09/0.45 cnf(c16, plain, % 0.09/0.45 ~theorem(X7) | ~theorem(or(not(X7),X8)), % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a4])], [c9, c14])). % 0.09/0.45 % 0.09/0.45 cnf(c17, axiom, % 0.09/0.45 ~axiom(X9) | theorem(X9)). % 0.09/0.45 cnf(a5, assumption, % 0.09/0.45 X7 = X9). % 0.09/0.45 cnf(c18, plain, % 0.09/0.45 ~theorem(or(not(X7),X8)), % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.09/0.45 cnf(c19, plain, % 0.09/0.45 ~axiom(X9), % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.09/0.45 % 0.09/0.45 cnf(c20, axiom, % 0.09/0.45 axiom(or(not(X10),or(X11,X10)))). % 0.09/0.45 cnf(a6, assumption, % 0.09/0.45 X9 = or(not(X10),or(X11,X10))). % 0.09/0.45 cnf(c21, plain, % 0.09/0.45 $false, % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 0.09/0.45 cnf(c22, plain, % 0.09/0.45 $false, % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 0.09/0.45 % 0.09/0.45 cnf(c23, axiom, % 0.09/0.45 ~axiom(X12) | theorem(X12)). % 0.09/0.45 cnf(a7, assumption, % 0.09/0.45 or(not(X7),X8) = X12). % 0.09/0.45 cnf(c24, plain, % 0.09/0.45 $false, % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])). % 0.09/0.45 cnf(c25, plain, % 0.09/0.45 ~axiom(X12), % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])). % 0.09/0.45 % 0.09/0.45 cnf(c26, axiom, % 0.09/0.45 axiom(or(not(or(X13,or(X14,X15))),or(X14,or(X13,X15))))). % 0.09/0.45 cnf(a8, assumption, % 0.09/0.45 X12 = or(not(or(X13,or(X14,X15))),or(X14,or(X13,X15)))). % 0.09/0.45 cnf(c27, plain, % 0.09/0.45 $false, % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])). % 0.09/0.45 cnf(c28, plain, % 0.09/0.45 $false, % 0.09/0.45 inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])). % 0.09/0.45 % 0.09/0.45 cnf(c29, plain, % 0.09/0.45 theorem(X2)). % 0.09/0.45 cnf(a9, assumption, % 0.09/0.45 or(not(X0),X1) = X2). % 0.09/0.45 cnf(c30, plain, % 0.09/0.45 $false, % 0.09/0.45 inference(predicate_reduction, [assumptions([a9])], [c6, c29])). % 0.09/0.45 % 0.09/0.45 cnf(c31, plain, % 0.09/0.45 $false, % 0.09/0.45 inference(constraint_solving, [ % 0.09/0.45 bind(X0, or(X13,X15)), % 0.09/0.45 bind(X1, or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))), % 0.09/0.45 bind(X2, or(not(or(X5,X6)),or(X6,X5))), % 0.09/0.45 bind(X3, or(X13,X15)), % 0.09/0.45 bind(X4, or(not(or(X5,X6)),or(X6,X5))), % 0.09/0.45 bind(X5, not(X10)), % 0.09/0.45 bind(X6, not(or(not(p),not(q)))), % 0.09/0.45 bind(X7, or(not(X10),or(X11,X10))), % 0.09/0.45 bind(X8, or(not(X2),X3)), % 0.09/0.45 bind(X9, or(not(X10),or(X11,X10))), % 0.09/0.45 bind(X10, not(or(not(p),not(q)))), % 0.09/0.45 bind(X11, not(X2)), % 0.09/0.45 bind(X12, or(not(X7),X8)), % 0.09/0.45 bind(X13, not(X10)), % 0.09/0.45 bind(X14, not(X2)), % 0.09/0.45 bind(X15, not(or(not(p),not(q)))) % 0.09/0.45 ], % 0.09/0.45 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 0.09/0.45 % 0.09/0.45 % SZS output end IncompleteProof %------------------------------------------------------------------------------