%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL174-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.13s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL174-3 : TPTP v9.3.1. Released v2.3.0. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.09/0.36 % Computer : n007.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Sat Sep 5 11:31:39 UTC 2026 % 0.09/0.36 % CPUTime : % 0.13/0.37 % SZS status Unsatisfiable % 0.13/0.37 % SZS output begin IncompleteProof % 0.13/0.37 cnf(c0, axiom, % 0.13/0.37 ~theorem(or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r))))). % 0.13/0.37 cnf(c1, plain, % 0.13/0.37 ~theorem(or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r)))), % 0.13/0.37 inference(start, [], [c0])). % 0.13/0.37 % 0.13/0.37 cnf(c2, axiom, % 0.13/0.37 ~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)). % 0.13/0.37 cnf(a0, assumption, % 0.13/0.37 or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r))) = X1). % 0.13/0.37 cnf(c3, plain, % 0.13/0.37 $false, % 0.13/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.37 cnf(c4, plain, % 0.13/0.37 ~theorem(X0) | ~theorem(or(not(X0),X1)), % 0.13/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.37 % 0.13/0.37 cnf(c5, axiom, % 0.13/0.37 ~axiom(X2) | theorem(X2)). % 0.13/0.37 cnf(a1, assumption, % 0.13/0.37 X0 = X2). % 0.13/0.37 cnf(c6, plain, % 0.13/0.37 ~theorem(or(not(X0),X1)), % 0.13/0.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.37 cnf(c7, plain, % 0.13/0.37 ~axiom(X2), % 0.13/0.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.37 % 0.13/0.37 cnf(c8, axiom, % 0.13/0.37 axiom(or(not(or(not(X3),X4)),or(not(or(X5,X3)),or(X5,X4))))). % 0.13/0.37 cnf(a2, assumption, % 0.13/0.37 X2 = or(not(or(not(X3),X4)),or(not(or(X5,X3)),or(X5,X4)))). % 0.13/0.37 cnf(c9, plain, % 0.13/0.37 $false, % 0.13/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.13/0.37 cnf(c10, plain, % 0.13/0.37 $false, % 0.13/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.13/0.37 % 0.13/0.37 cnf(c11, axiom, % 0.13/0.37 ~axiom(X6) | theorem(X6)). % 0.13/0.37 cnf(a3, assumption, % 0.13/0.37 or(not(X0),X1) = X6). % 0.13/0.37 cnf(c12, plain, % 0.13/0.37 $false, % 0.13/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])). % 0.13/0.37 cnf(c13, plain, % 0.13/0.37 ~axiom(X6), % 0.13/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])). % 0.13/0.37 % 0.13/0.37 cnf(c14, axiom, % 0.13/0.37 axiom(or(not(or(X7,or(X8,X9))),or(X8,or(X7,X9))))). % 0.13/0.37 cnf(a4, assumption, % 0.13/0.37 X6 = or(not(or(X7,or(X8,X9))),or(X8,or(X7,X9)))). % 0.13/0.37 cnf(c15, plain, % 0.13/0.37 $false, % 0.13/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.13/0.37 cnf(c16, plain, % 0.13/0.37 $false, % 0.13/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])). % 0.13/0.37 % 0.13/0.37 cnf(c17, plain, % 0.13/0.37 $false, % 0.13/0.37 inference(constraint_solving, [ % 0.13/0.37 bind(X0, or(not(or(not(X3),X4)),or(not(or(X5,X3)),or(X5,X4)))), % 0.13/0.37 bind(X1, or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r)))), % 0.13/0.37 bind(X2, or(not(or(not(X3),X4)),or(not(or(X5,X3)),or(X5,X4)))), % 0.13/0.37 bind(X3, q), % 0.13/0.37 bind(X4, r), % 0.13/0.37 bind(X5, not(p)), % 0.13/0.37 bind(X6, or(not(X0),X1)), % 0.13/0.37 bind(X7, not(or(not(X3),X4))), % 0.13/0.37 bind(X8, not(or(X5,X3))), % 0.13/0.37 bind(X9, or(X5,X4)) % 0.13/0.37 ], % 0.13/0.37 [a0, a1, a2, a3, a4])). % 0.13/0.37 % 0.13/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------