%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL170-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 : n012.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:14 PM UTC 2026 % Result : Unsatisfiable 0.03s 0.31s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.01 % Problem : LCL170-3 : TPTP v9.3.1. Released v2.3.0. % 0.00/0.02 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.03/0.30 % Computer : n012.cluster.edu % 0.03/0.30 % Model : x86_64 x86_64 % 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.03/0.30 % Memory : 8046.5625MB % 0.03/0.30 % OS : Linux 6.8.0-71-generic % 0.03/0.30 % CPULimit : 300 % 0.03/0.30 % WCLimit : 300 % 0.03/0.30 % DateTime : Sat Sep 5 22:54:57 UTC 2026 % 0.03/0.30 % CPUTime : % 0.03/0.31 % SZS status Unsatisfiable % 0.03/0.31 % SZS output begin IncompleteProof % 0.03/0.31 cnf(c0, axiom, % 0.03/0.31 ~theorem(or(not(q),or(not(p),q)))). % 0.03/0.31 cnf(c1, plain, % 0.03/0.31 ~theorem(or(not(q),or(not(p),q))), % 0.03/0.31 inference(start, [], [c0])). % 0.03/0.31 % 0.03/0.31 cnf(c2, axiom, % 0.03/0.31 ~axiom(X0) | theorem(X0)). % 0.03/0.31 cnf(a0, assumption, % 0.03/0.31 or(not(q),or(not(p),q)) = X0). % 0.03/0.31 cnf(c3, plain, % 0.03/0.31 $false, % 0.03/0.31 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.03/0.31 cnf(c4, plain, % 0.03/0.31 ~axiom(X0), % 0.03/0.31 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.03/0.31 % 0.03/0.31 cnf(c5, axiom, % 0.03/0.31 axiom(or(not(X1),or(X2,X1)))). % 0.03/0.31 cnf(a1, assumption, % 0.03/0.31 X0 = or(not(X1),or(X2,X1))). % 0.03/0.31 cnf(c6, plain, % 0.03/0.31 $false, % 0.03/0.31 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.03/0.31 cnf(c7, plain, % 0.03/0.31 $false, % 0.03/0.31 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.03/0.31 % 0.03/0.31 cnf(c8, plain, % 0.03/0.31 $false, % 0.03/0.31 inference(constraint_solving, [ % 0.03/0.31 bind(X0, or(not(q),or(not(p),q))), % 0.03/0.31 bind(X1, q), % 0.03/0.31 bind(X2, not(p)) % 0.03/0.31 ], % 0.03/0.31 [a0, a1])). % 0.03/0.31 % 0.03/0.31 % SZS output end IncompleteProof %------------------------------------------------------------------------------