%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL046-1 : TPTP v9.3.1. Released v1.0.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:05 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 : LCL046-1 : TPTP v9.3.1. Released v1.0.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:35:42 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 ~is_a_theorem(implies(a,a))). % 0.03/0.31 cnf(c1, plain, % 0.03/0.31 ~is_a_theorem(implies(a,a)), % 0.03/0.31 inference(start, [], [c0])). % 0.03/0.31 % 0.03/0.31 cnf(c2, axiom, % 0.03/0.31 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))). % 0.03/0.31 cnf(a0, assumption, % 0.03/0.31 implies(a,a) = 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 ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,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 is_a_theorem(implies(implies(not(X2),X2),X2))). % 0.03/0.31 cnf(a1, assumption, % 0.03/0.31 X1 = implies(implies(not(X2),X2),X2)). % 0.03/0.31 cnf(c6, plain, % 0.03/0.31 ~is_a_theorem(implies(X1,X0)), % 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, axiom, % 0.03/0.31 is_a_theorem(X3) | ~is_a_theorem(X4) | ~is_a_theorem(implies(X4,X3))). % 0.03/0.31 cnf(a2, assumption, % 0.03/0.31 implies(X1,X0) = X3). % 0.03/0.31 cnf(c9, plain, % 0.03/0.31 $false, % 0.03/0.31 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.03/0.31 cnf(c10, plain, % 0.03/0.31 ~is_a_theorem(X4) | ~is_a_theorem(implies(X4,X3)), % 0.03/0.31 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.03/0.31 % 0.03/0.31 cnf(c11, axiom, % 0.03/0.31 is_a_theorem(implies(X5,implies(not(X5),X6)))). % 0.03/0.31 cnf(a3, assumption, % 0.03/0.31 X4 = implies(X5,implies(not(X5),X6))). % 0.03/0.31 cnf(c12, plain, % 0.03/0.31 ~is_a_theorem(implies(X4,X3)), % 0.03/0.31 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.03/0.31 cnf(c13, plain, % 0.03/0.31 $false, % 0.03/0.31 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.03/0.31 % 0.03/0.31 cnf(c14, axiom, % 0.03/0.31 is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9))))). % 0.03/0.31 cnf(a4, assumption, % 0.03/0.31 implies(X4,X3) = implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))). % 0.03/0.31 cnf(c15, plain, % 0.03/0.31 $false, % 0.03/0.31 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])). % 0.03/0.31 cnf(c16, plain, % 0.03/0.31 $false, % 0.03/0.31 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])). % 0.03/0.31 % 0.03/0.31 cnf(c17, plain, % 0.03/0.31 $false, % 0.03/0.31 inference(constraint_solving, [ % 0.03/0.31 bind(X0, implies(a,a)), % 0.03/0.31 bind(X1, implies(implies(not(X2),X2),X2)), % 0.03/0.31 bind(X2, a), % 0.03/0.31 bind(X3, implies(X1,X0)), % 0.03/0.31 bind(X4, implies(X5,implies(not(X5),X6))), % 0.03/0.31 bind(X5, a), % 0.03/0.31 bind(X6, a), % 0.03/0.31 bind(X7, a), % 0.03/0.31 bind(X8, implies(not(X5),X6)), % 0.03/0.31 bind(X9, a) % 0.03/0.31 ], % 0.03/0.31 [a0, a1, a2, a3, a4])). % 0.03/0.31 % 0.03/0.31 % SZS output end IncompleteProof %------------------------------------------------------------------------------