%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL190-1 : TPTP v9.3.1. Released v1.1.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:17 PM UTC 2026 % Result : Unsatisfiable 0.10s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL190-1 : TPTP v9.3.1. Released v1.1.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 : n007.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 02:05:54 UTC 2026 % 0.10/0.38 % CPUTime : % 0.10/0.39 % SZS status Unsatisfiable % 0.10/0.39 % SZS output begin IncompleteProof % 0.10/0.39 cnf(c0, axiom, % 0.10/0.39 ~theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))). % 0.10/0.39 cnf(c1, plain, % 0.10/0.39 ~theorem(or(not(or(p,or(q,r))),or(p,or(r,q)))), % 0.10/0.39 inference(start, [], [c0])). % 0.10/0.39 % 0.10/0.39 cnf(c2, axiom, % 0.10/0.39 ~theorem(X0) | ~axiom(or(not(X0),X1)) | theorem(X1)). % 0.10/0.39 cnf(a0, assumption, % 0.10/0.39 or(not(or(p,or(q,r))),or(p,or(r,q))) = X1). % 0.10/0.39 cnf(c3, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.39 cnf(c4, plain, % 0.10/0.39 ~theorem(X0) | ~axiom(or(not(X0),X1)), % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.39 % 0.10/0.39 cnf(c5, axiom, % 0.10/0.39 ~axiom(X2) | theorem(X2)). % 0.10/0.39 cnf(a1, assumption, % 0.10/0.39 X0 = X2). % 0.10/0.39 cnf(c6, plain, % 0.10/0.39 ~axiom(or(not(X0),X1)), % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.10/0.39 cnf(c7, plain, % 0.10/0.39 ~axiom(X2), % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.10/0.39 % 0.10/0.39 cnf(c8, axiom, % 0.10/0.39 axiom(or(not(or(X3,X4)),or(X4,X3)))). % 0.10/0.39 cnf(a2, assumption, % 0.10/0.39 X2 = or(not(or(X3,X4)),or(X4,X3))). % 0.10/0.39 cnf(c9, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.10/0.39 cnf(c10, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.10/0.39 % 0.10/0.39 cnf(c11, axiom, % 0.10/0.39 axiom(or(not(or(not(X5),X6)),or(not(or(X7,X5)),or(X7,X6))))). % 0.10/0.39 cnf(a3, assumption, % 0.10/0.39 or(not(X0),X1) = or(not(or(not(X5),X6)),or(not(or(X7,X5)),or(X7,X6)))). % 0.10/0.39 cnf(c12, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])). % 0.10/0.39 cnf(c13, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])). % 0.10/0.39 % 0.10/0.39 cnf(c14, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(constraint_solving, [ % 0.10/0.39 bind(X0, or(not(or(X3,X4)),or(X4,X3))), % 0.10/0.39 bind(X1, or(not(or(p,or(q,r))),or(p,or(r,q)))), % 0.10/0.39 bind(X2, or(not(or(X3,X4)),or(X4,X3))), % 0.10/0.39 bind(X3, q), % 0.10/0.39 bind(X4, r), % 0.10/0.39 bind(X5, or(X3,X4)), % 0.10/0.39 bind(X6, or(X4,X3)), % 0.10/0.39 bind(X7, p) % 0.10/0.39 ], % 0.10/0.39 [a0, a1, a2, a3])). % 0.10/0.39 % 0.10/0.39 % SZS output end IncompleteProof %------------------------------------------------------------------------------