%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL212-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 : n016.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:20 PM UTC 2026 % Result : Unsatisfiable 0.12s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL212-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.07/0.34 % Computer : n016.cluster.edu % 0.07/0.34 % Model : x86_64 x86_64 % 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.34 % Memory : 8046.5625MB % 0.07/0.34 % OS : Linux 6.8.0-71-generic % 0.07/0.35 % CPULimit : 300 % 0.07/0.35 % WCLimit : 300 % 0.07/0.35 % DateTime : Sat Sep 5 20:20:00 UTC 2026 % 0.07/0.35 % CPUTime : % 0.12/0.36 % SZS status Unsatisfiable % 0.12/0.36 % SZS output begin IncompleteProof % 0.12/0.36 cnf(c0, axiom, % 0.12/0.36 ~theorem(or(not(not(p)),or(not(q),or(not(or(not(p),q)),q))))). % 0.12/0.36 cnf(c1, plain, % 0.12/0.36 ~theorem(or(not(not(p)),or(not(q),or(not(or(not(p),q)),q)))), % 0.12/0.36 inference(start, [], [c0])). % 0.12/0.36 % 0.12/0.36 cnf(c2, axiom, % 0.12/0.36 ~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)). % 0.12/0.36 cnf(a0, assumption, % 0.12/0.36 or(not(not(p)),or(not(q),or(not(or(not(p),q)),q))) = X1). % 0.12/0.36 cnf(c3, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.36 cnf(c4, plain, % 0.12/0.36 ~theorem(X0) | ~theorem(or(not(X0),X1)), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.36 % 0.12/0.36 cnf(c5, axiom, % 0.12/0.36 ~axiom(X2) | theorem(X2)). % 0.12/0.36 cnf(a1, assumption, % 0.12/0.36 X0 = X2). % 0.12/0.36 cnf(c6, plain, % 0.12/0.36 ~theorem(or(not(X0),X1)), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.12/0.36 cnf(c7, plain, % 0.12/0.36 ~axiom(X2), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.12/0.36 % 0.12/0.36 cnf(c8, axiom, % 0.12/0.36 axiom(or(not(X3),or(X4,X3)))). % 0.12/0.36 cnf(a2, assumption, % 0.12/0.36 X2 = or(not(X3),or(X4,X3))). % 0.12/0.36 cnf(c9, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.12/0.36 cnf(c10, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.12/0.36 % 0.12/0.36 cnf(c11, axiom, % 0.12/0.36 ~axiom(X5) | theorem(X5)). % 0.12/0.36 cnf(a3, assumption, % 0.12/0.36 or(not(X0),X1) = X5). % 0.12/0.36 cnf(c12, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])). % 0.12/0.36 cnf(c13, plain, % 0.12/0.36 ~axiom(X5), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])). % 0.12/0.36 % 0.12/0.36 cnf(c14, axiom, % 0.12/0.36 axiom(or(not(X6),or(X7,X6)))). % 0.12/0.36 cnf(a4, assumption, % 0.12/0.36 X5 = or(not(X6),or(X7,X6))). % 0.12/0.36 cnf(c15, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.12/0.36 cnf(c16, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.12/0.36 % 0.12/0.36 cnf(c17, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(constraint_solving, [ % 0.12/0.36 bind(X0, or(not(X3),or(X4,X3))), % 0.12/0.36 bind(X1, or(not(not(p)),or(not(q),or(not(or(not(p),q)),q)))), % 0.12/0.36 bind(X2, or(not(X3),or(X4,X3))), % 0.12/0.36 bind(X3, q), % 0.12/0.36 bind(X4, not(or(not(p),q))), % 0.12/0.36 bind(X5, or(not(X0),X1)), % 0.12/0.36 bind(X6, or(not(X3),or(X4,X3))), % 0.12/0.36 bind(X7, not(not(p))) % 0.12/0.36 ], % 0.12/0.36 [a0, a1, a2, a3, a4])). % 0.12/0.36 % 0.12/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------