%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL193-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 : n026.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.13s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL193-1 : TPTP v9.3.1. Released v1.1.0. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.08/0.35 % Computer : n026.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 : Fri Sep 4 13:48:55 UTC 2026 % 0.08/0.35 % CPUTime : % 0.13/0.36 % SZS status Unsatisfiable % 0.13/0.36 % SZS output begin IncompleteProof % 0.13/0.36 cnf(c0, axiom, % 0.13/0.36 ~theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p))))). % 0.13/0.36 cnf(c1, plain, % 0.13/0.36 ~theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))), % 0.13/0.36 inference(start, [], [c0])). % 0.13/0.36 % 0.13/0.36 cnf(c2, axiom, % 0.13/0.36 ~theorem(or(not(X0),X1)) | ~axiom(or(not(X2),X0)) | theorem(or(not(X2),X1))). % 0.13/0.36 cnf(a0, assumption, % 0.13/0.36 or(not(or(not(q),r)),or(not(or(p,q)),or(r,p))) = or(not(X2),X1)). % 0.13/0.36 cnf(c3, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.36 cnf(c4, plain, % 0.13/0.36 ~theorem(or(not(X0),X1)) | ~axiom(or(not(X2),X0)), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.36 % 0.13/0.36 cnf(c5, axiom, % 0.13/0.36 ~theorem(X3) | ~axiom(or(not(X3),X4)) | theorem(X4)). % 0.13/0.36 cnf(a1, assumption, % 0.13/0.36 or(not(X0),X1) = X4). % 0.13/0.36 cnf(c6, plain, % 0.13/0.36 ~axiom(or(not(X2),X0)), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.36 cnf(c7, plain, % 0.13/0.36 ~theorem(X3) | ~axiom(or(not(X3),X4)), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.36 % 0.13/0.36 cnf(c8, axiom, % 0.13/0.36 ~axiom(X5) | theorem(X5)). % 0.13/0.36 cnf(a2, assumption, % 0.13/0.36 X3 = X5). % 0.13/0.36 cnf(c9, plain, % 0.13/0.36 ~axiom(or(not(X3),X4)), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.13/0.36 cnf(c10, plain, % 0.13/0.36 ~axiom(X5), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.13/0.36 % 0.13/0.36 cnf(c11, axiom, % 0.13/0.36 axiom(or(not(or(X6,X7)),or(X7,X6)))). % 0.13/0.36 cnf(a3, assumption, % 0.13/0.36 X5 = or(not(or(X6,X7)),or(X7,X6))). % 0.13/0.36 cnf(c12, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.13/0.36 cnf(c13, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.13/0.36 % 0.13/0.36 cnf(c14, axiom, % 0.13/0.36 axiom(or(not(or(not(X8),X9)),or(not(or(X10,X8)),or(X10,X9))))). % 0.13/0.36 cnf(a4, assumption, % 0.13/0.36 or(not(X3),X4) = or(not(or(not(X8),X9)),or(not(or(X10,X8)),or(X10,X9)))). % 0.13/0.36 cnf(c15, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c9, c14])). % 0.13/0.36 cnf(c16, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c9, c14])). % 0.13/0.36 % 0.13/0.36 cnf(c17, axiom, % 0.13/0.36 axiom(or(not(or(not(X11),X12)),or(not(or(X13,X11)),or(X13,X12))))). % 0.13/0.36 cnf(a5, assumption, % 0.13/0.36 or(not(X2),X0) = or(not(or(not(X11),X12)),or(not(or(X13,X11)),or(X13,X12)))). % 0.13/0.36 cnf(c18, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a5])], [c6, c17])). % 0.13/0.36 cnf(c19, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a5])], [c6, c17])). % 0.13/0.36 % 0.13/0.36 cnf(c20, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(constraint_solving, [ % 0.13/0.36 bind(X0, or(X10,X8)), % 0.13/0.36 bind(X1, or(not(or(p,q)),or(r,p))), % 0.13/0.36 bind(X2, or(not(q),r)), % 0.13/0.36 bind(X3, or(not(or(X6,X7)),or(X7,X6))), % 0.13/0.36 bind(X4, or(not(X0),X1)), % 0.13/0.36 bind(X5, or(not(or(X6,X7)),or(X7,X6))), % 0.13/0.36 bind(X6, p), % 0.13/0.36 bind(X7, r), % 0.13/0.36 bind(X8, or(X6,X7)), % 0.13/0.36 bind(X9, or(X7,X6)), % 0.13/0.36 bind(X10, not(or(p,q))), % 0.13/0.36 bind(X11, q), % 0.13/0.36 bind(X12, r), % 0.13/0.36 bind(X13, p) % 0.13/0.36 ], % 0.13/0.36 [a0, a1, a2, a3, a4, a5])). % 0.13/0.36 % 0.13/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------