%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL173-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 : n007.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.11s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL173-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.08/0.35 % Computer : n007.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Sat Sep 5 03:31:24 UTC 2026 % 0.08/0.35 % CPUTime : % 0.11/0.36 % SZS status Unsatisfiable % 0.11/0.36 % SZS output begin IncompleteProof % 0.11/0.36 cnf(c0, axiom, % 0.11/0.36 ~theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r))))). % 0.11/0.36 cnf(c1, plain, % 0.11/0.36 ~theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))), % 0.11/0.36 inference(start, [], [c0])). % 0.11/0.36 % 0.11/0.36 cnf(c2, axiom, % 0.11/0.36 ~axiom(X0) | theorem(X0)). % 0.11/0.36 cnf(a0, assumption, % 0.11/0.36 or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r))) = X0). % 0.11/0.36 cnf(c3, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.11/0.36 cnf(c4, plain, % 0.11/0.36 ~axiom(X0), % 0.11/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.11/0.36 % 0.11/0.36 cnf(c5, axiom, % 0.11/0.36 axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))). % 0.11/0.36 cnf(a1, assumption, % 0.11/0.36 X0 = or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))). % 0.11/0.36 cnf(c6, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.11/0.36 cnf(c7, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.11/0.36 % 0.11/0.36 cnf(c8, plain, % 0.11/0.36 $false, % 0.11/0.36 inference(constraint_solving, [ % 0.11/0.36 bind(X0, or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))), % 0.11/0.36 bind(X1, q), % 0.11/0.36 bind(X2, r), % 0.11/0.36 bind(X3, not(p)) % 0.11/0.36 ], % 0.11/0.36 [a0, a1])). % 0.11/0.36 % 0.11/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------