%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL185-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 : n031.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:16 PM UTC 2026 % Result : Unsatisfiable 0.10s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL185-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.10/0.37 % Computer : n031.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 : Sat Sep 5 17:10:25 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.38 % SZS status Unsatisfiable % 0.10/0.38 % SZS output begin IncompleteProof % 0.10/0.38 cnf(c0, axiom, % 0.10/0.38 ~theorem(or(not(p),or(p,q)))). % 0.10/0.38 cnf(c1, plain, % 0.10/0.38 ~theorem(or(not(p),or(p,q))), % 0.10/0.38 inference(start, [], [c0])). % 0.10/0.38 % 0.10/0.38 cnf(c2, axiom, % 0.10/0.38 ~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)). % 0.10/0.38 cnf(a0, assumption, % 0.10/0.38 or(not(p),or(p,q)) = X1). % 0.10/0.38 cnf(c3, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.38 cnf(c4, plain, % 0.10/0.38 ~theorem(X0) | ~theorem(or(not(X0),X1)), % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.38 % 0.10/0.38 cnf(c5, axiom, % 0.10/0.38 ~axiom(X2) | theorem(X2)). % 0.10/0.38 cnf(a1, assumption, % 0.10/0.38 X0 = X2). % 0.10/0.38 cnf(c6, plain, % 0.10/0.38 ~theorem(or(not(X0),X1)), % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.10/0.38 cnf(c7, plain, % 0.10/0.38 ~axiom(X2), % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.10/0.38 % 0.10/0.38 cnf(c8, axiom, % 0.10/0.38 axiom(or(not(X3),or(X4,X3)))). % 0.10/0.38 cnf(a2, assumption, % 0.10/0.38 X2 = or(not(X3),or(X4,X3))). % 0.10/0.38 cnf(c9, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.10/0.38 cnf(c10, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.10/0.38 % 0.10/0.38 cnf(c11, axiom, % 0.10/0.38 ~theorem(X5) | ~theorem(or(not(X5),X6)) | theorem(X6)). % 0.10/0.38 cnf(a3, assumption, % 0.10/0.38 or(not(X0),X1) = X6). % 0.10/0.38 cnf(c12, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])). % 0.10/0.38 cnf(c13, plain, % 0.10/0.38 ~theorem(X5) | ~theorem(or(not(X5),X6)), % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])). % 0.10/0.38 % 0.10/0.38 cnf(c14, axiom, % 0.10/0.38 ~axiom(X7) | theorem(X7)). % 0.10/0.38 cnf(a4, assumption, % 0.10/0.38 X5 = X7). % 0.10/0.38 cnf(c15, plain, % 0.10/0.38 ~theorem(or(not(X5),X6)), % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.10/0.38 cnf(c16, plain, % 0.10/0.38 ~axiom(X7), % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.10/0.38 % 0.10/0.38 cnf(c17, axiom, % 0.10/0.38 axiom(or(not(or(X8,X9)),or(X9,X8)))). % 0.10/0.38 cnf(a5, assumption, % 0.10/0.38 X7 = or(not(or(X8,X9)),or(X9,X8))). % 0.10/0.38 cnf(c18, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.10/0.38 cnf(c19, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.10/0.38 % 0.10/0.38 cnf(c20, axiom, % 0.10/0.38 ~axiom(X10) | theorem(X10)). % 0.10/0.38 cnf(a6, assumption, % 0.10/0.38 or(not(X5),X6) = X10). % 0.10/0.38 cnf(c21, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a6])], [c15, c20])). % 0.10/0.38 cnf(c22, plain, % 0.10/0.38 ~axiom(X10), % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a6])], [c15, c20])). % 0.10/0.38 % 0.10/0.38 cnf(c23, axiom, % 0.10/0.38 axiom(or(not(or(not(X11),X12)),or(not(or(X13,X11)),or(X13,X12))))). % 0.10/0.38 cnf(a7, assumption, % 0.10/0.38 X10 = or(not(or(not(X11),X12)),or(not(or(X13,X11)),or(X13,X12)))). % 0.10/0.38 cnf(c24, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a7])], [c22, c23])). % 0.10/0.38 cnf(c25, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a7])], [c22, c23])). % 0.10/0.38 % 0.10/0.38 cnf(c26, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(constraint_solving, [ % 0.10/0.38 bind(X0, or(not(X3),or(X4,X3))), % 0.10/0.38 bind(X1, or(not(p),or(p,q))), % 0.10/0.38 bind(X2, or(not(X3),or(X4,X3))), % 0.10/0.38 bind(X3, p), % 0.10/0.38 bind(X4, q), % 0.10/0.38 bind(X5, or(not(or(X8,X9)),or(X9,X8))), % 0.10/0.38 bind(X6, or(not(X0),X1)), % 0.10/0.38 bind(X7, or(not(or(X8,X9)),or(X9,X8))), % 0.10/0.38 bind(X8, q), % 0.10/0.38 bind(X9, p), % 0.10/0.38 bind(X10, or(not(X5),X6)), % 0.10/0.38 bind(X11, or(X8,X9)), % 0.10/0.38 bind(X12, or(X9,X8)), % 0.10/0.38 bind(X13, not(X3)) % 0.10/0.38 ], % 0.10/0.38 [a0, a1, a2, a3, a4, a5, a6, a7])). % 0.10/0.38 % 0.10/0.38 % SZS output end IncompleteProof %------------------------------------------------------------------------------