%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL452+1 : TPTP v9.3.1. Bugfixed v9.2.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:44 PM UTC 2026 % Result : Theorem 0.21s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.01 % Problem : LCL452+1 : TPTP v9.3.1. Bugfixed v9.2.0. % 0.00/0.02 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.05/0.30 % Computer : n012.cluster.edu % 0.05/0.30 % Model : x86_64 x86_64 % 0.05/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.05/0.30 % Memory : 8046.5625MB % 0.05/0.30 % OS : Linux 6.8.0-71-generic % 0.05/0.30 % CPULimit : 300 % 0.05/0.30 % WCLimit : 300 % 0.05/0.30 % DateTime : Sat Sep 5 01:03:57 UTC 2026 % 0.05/0.30 % CPUTime : % 0.21/0.35 % SZS status Theorem % 0.21/0.35 % SZS output begin IncompleteProof % 0.21/0.35 cnf(c0, axiom, % 0.21/0.35 ~cn2). % 0.21/0.35 cnf(c1, plain, % 0.21/0.35 ~cn2, % 0.21/0.35 inference(start, [], [c0])). % 0.21/0.35 % 0.21/0.35 cnf(c2, axiom, % 0.21/0.35 cn2 | ~is_a_theorem(implies(sK41,implies(not(sK41),sK42)))). % 0.21/0.35 cnf(c3, plain, % 0.21/0.35 $false, % 0.21/0.35 inference(strict_predicate_extension, [], [c1, c2])). % 0.21/0.35 cnf(c4, plain, % 0.21/0.35 ~is_a_theorem(implies(sK41,implies(not(sK41),sK42))), % 0.21/0.35 inference(strict_predicate_extension, [], [c1, c2])). % 0.21/0.35 % 0.21/0.35 cnf(c5, axiom, % 0.21/0.35 is_a_theorem(implies(X0,or(X0,X1))) | ~or_1). % 0.21/0.35 cnf(a0, assumption, % 0.21/0.35 X2 = implies(sK41,implies(not(sK41),sK42))). % 0.21/0.35 cnf(c6, plain, % 0.21/0.35 $false, % 0.21/0.35 inference(lazy_predicate_extension, [assumptions([a0])], [c4, c5])). % 0.21/0.35 cnf(c7, plain, % 0.21/0.35 ~or_1, % 0.21/0.35 inference(lazy_predicate_extension, [assumptions([a0])], [c4, c5])). % 0.21/0.35 cnf(c8, plain, % 0.21/0.35 implies(X0,or(X0,X1)) != X2, % 0.21/0.35 inference(lazy_predicate_extension, [assumptions([a0])], [c4, c5])). % 0.21/0.35 % 0.21/0.35 cnf(c9, axiom, % 0.21/0.35 or(X3,X4) = not(and(not(X3),not(X4))) | ~op_or). % 0.21/0.35 cnf(a1, assumption, % 0.21/0.35 or(X0,X1) = or(X3,X4)). % 0.21/0.35 cnf(c10, plain, % 0.21/0.35 $false, % 0.21/0.35 inference(strict_function_extension, [assumptions([a1])], [c8, c9])). % 0.21/0.35 cnf(c11, plain, % 0.21/0.35 ~op_or, % 0.21/0.35 inference(strict_function_extension, [assumptions([a1])], [c8, c9])). % 0.21/0.35 cnf(c12, plain, % 0.21/0.35 X5 != not(and(not(X3),not(X4))) | implies(X0,X5) != X2, % 0.21/0.35 inference(strict_function_extension, [assumptions([a1])], [c8, c9])). % 0.21/0.35 % 0.21/0.35 cnf(c13, axiom, % 0.21/0.35 implies(X6,X7) = not(and(X6,not(X7))) | ~op_implies_and). % 0.21/0.35 cnf(a2, assumption, % 0.21/0.35 not(and(not(X3),not(X4))) = not(and(X6,not(X7)))). % 0.21/0.35 cnf(c14, plain, % 0.21/0.35 implies(X0,X5) != X2, % 0.21/0.35 inference(strict_function_extension, [assumptions([a2])], [c12, c13])). % 0.21/0.35 cnf(c15, plain, % 0.21/0.35 ~op_implies_and, % 0.21/0.35 inference(strict_function_extension, [assumptions([a2])], [c12, c13])). % 0.21/0.35 cnf(c16, plain, % 0.21/0.35 X8 != implies(X6,X7) | X5 != X8, % 0.21/0.35 inference(strict_function_extension, [assumptions([a2])], [c12, c13])). % 0.21/0.35 % 0.21/0.35 cnf(a3, assumption, % 0.21/0.35 X8 = implies(X6,X7)). % 0.21/0.35 cnf(c17, plain, % 0.21/0.35 X5 != X8, % 0.21/0.35 inference(reflexivity, [assumptions([a3])], [c16])). % 0.21/0.35 % 0.21/0.35 cnf(a4, assumption, % 0.21/0.35 X5 = X8). % 0.21/0.35 cnf(c18, plain, % 0.21/0.35 $false, % 0.21/0.35 inference(reflexivity, [assumptions([a4])], [c17])). % 0.21/0.35 % 0.21/0.35 cnf(c19, axiom, % 0.21/0.35 op_implies_and). % 0.21/0.35 cnf(c20, plain, % 0.21/0.35 $false, % 0.21/0.35 inference(strict_predicate_extension, [], [c15, c19])). % 0.21/0.35 cnf(c21, plain, % 0.21/0.35 $false, % 0.21/0.35 inference(strict_predicate_extension, [], [c15, c19])). % 0.21/0.35 % 0.21/0.35 cnf(a5, assumption, % 0.21/0.35 implies(X0,X5) = X2). % 0.21/0.35 cnf(c22, plain, % 0.21/0.35 $false, % 0.21/0.35 inference(reflexivity, [assumptions([a5])], [c14])). % 0.21/0.35 % 0.21/0.35 cnf(c23, axiom, % 0.21/0.35 op_or). % 0.21/0.35 cnf(c24, plain, % 0.21/0.35 $false, % 0.21/0.35 inference(strict_predicate_extension, [], [c11, c23])). % 0.21/0.35 cnf(c25, plain, % 0.21/0.35 $false, % 0.21/0.35 inference(strict_predicate_extension, [], [c11, c23])). % 0.21/0.35 % 0.21/0.35 cnf(c26, axiom, % 0.21/0.35 or_1). % 0.21/0.35 cnf(c27, plain, % 0.21/0.35 $false, % 0.21/0.35 inference(strict_predicate_extension, [], [c7, c26])). % 0.21/0.35 cnf(c28, plain, % 0.21/0.35 $false, % 0.21/0.35 inference(strict_predicate_extension, [], [c7, c26])). % 0.21/0.35 % 0.21/0.35 cnf(c29, plain, % 0.21/0.35 $false, % 0.21/0.35 inference(constraint_solving, [ % 0.21/0.35 bind(X0, sK41), % 0.21/0.35 bind(X1, sK42), % 0.21/0.35 bind(X2, implies(sK41,implies(not(sK41),sK42))), % 0.21/0.35 bind(X3, sK41), % 0.21/0.35 bind(X4, sK42), % 0.21/0.35 bind(X5, implies(X6,X7)), % 0.21/0.35 bind(X6, not(X3)), % 0.21/0.35 bind(X7, sK42), % 0.21/0.35 bind(X8, implies(X6,X7)) % 0.21/0.35 ], % 0.21/0.35 [a0, a1, a2, a3, a4, a5])). % 0.21/0.35 % 0.21/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------