%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL469+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 : n014.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:46 PM UTC 2026 % Result : Theorem 0.15s 0.42s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL469+1 : TPTP v9.3.1. Bugfixed v9.2.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 : n014.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 : Fri Sep 4 18:43:42 UTC 2026 % 0.10/0.37 % CPUTime : % 0.15/0.42 % SZS status Theorem % 0.15/0.42 % SZS output begin IncompleteProof % 0.15/0.42 cnf(c0, axiom, % 0.15/0.42 ~or_1). % 0.15/0.42 cnf(c1, plain, % 0.15/0.42 ~or_1, % 0.15/0.42 inference(start, [], [c0])). % 0.15/0.42 % 0.15/0.42 cnf(c2, axiom, % 0.15/0.42 or_1 | ~is_a_theorem(implies(sK19,or(sK19,sK20)))). % 0.15/0.42 cnf(c3, plain, % 0.15/0.42 $false, % 0.15/0.42 inference(strict_predicate_extension, [], [c1, c2])). % 0.15/0.42 cnf(c4, plain, % 0.15/0.42 ~is_a_theorem(implies(sK19,or(sK19,sK20))), % 0.15/0.42 inference(strict_predicate_extension, [], [c1, c2])). % 0.15/0.42 % 0.15/0.42 cnf(c5, axiom, % 0.15/0.42 or(X0,X1) = not(and(not(X0),not(X1))) | ~op_or). % 0.15/0.42 cnf(a0, assumption, % 0.15/0.42 or(sK19,sK20) = or(X0,X1)). % 0.15/0.42 cnf(c6, plain, % 0.15/0.42 $false, % 0.15/0.42 inference(strict_function_extension, [assumptions([a0])], [c4, c5])). % 0.15/0.42 cnf(c7, plain, % 0.15/0.42 ~op_or, % 0.15/0.42 inference(strict_function_extension, [assumptions([a0])], [c4, c5])). % 0.15/0.42 cnf(c8, plain, % 0.15/0.42 X2 != not(and(not(X0),not(X1))) | ~is_a_theorem(implies(sK19,X2)), % 0.15/0.42 inference(strict_function_extension, [assumptions([a0])], [c4, c5])). % 0.15/0.42 % 0.15/0.42 cnf(c9, axiom, % 0.15/0.42 implies(X3,X4) = not(and(X3,not(X4))) | ~op_implies_and). % 0.15/0.42 cnf(a1, assumption, % 0.15/0.42 not(and(not(X0),not(X1))) = not(and(X3,not(X4)))). % 0.15/0.42 cnf(c10, plain, % 0.15/0.42 ~is_a_theorem(implies(sK19,X2)), % 0.15/0.42 inference(strict_function_extension, [assumptions([a1])], [c8, c9])). % 0.15/0.42 cnf(c11, plain, % 0.15/0.42 ~op_implies_and, % 0.15/0.42 inference(strict_function_extension, [assumptions([a1])], [c8, c9])). % 0.15/0.42 cnf(c12, plain, % 0.15/0.42 X5 != implies(X3,X4) | X2 != X5, % 0.15/0.42 inference(strict_function_extension, [assumptions([a1])], [c8, c9])). % 0.15/0.42 % 0.15/0.42 cnf(a2, assumption, % 0.15/0.42 X5 = implies(X3,X4)). % 0.15/0.42 cnf(c13, plain, % 0.15/0.42 X2 != X5, % 0.15/0.42 inference(reflexivity, [assumptions([a2])], [c12])). % 0.15/0.42 % 0.15/0.42 cnf(a3, assumption, % 0.15/0.42 X2 = X5). % 0.15/0.42 cnf(c14, plain, % 0.15/0.42 $false, % 0.15/0.42 inference(reflexivity, [assumptions([a3])], [c13])). % 0.15/0.42 % 0.15/0.42 cnf(c15, axiom, % 0.15/0.42 op_implies_and). % 0.15/0.42 cnf(c16, plain, % 0.15/0.42 $false, % 0.15/0.42 inference(strict_predicate_extension, [], [c11, c15])). % 0.15/0.42 cnf(c17, plain, % 0.15/0.42 $false, % 0.15/0.42 inference(strict_predicate_extension, [], [c11, c15])). % 0.15/0.42 % 0.15/0.42 cnf(c18, axiom, % 0.15/0.42 is_a_theorem(implies(X6,implies(not(X6),X7))) | ~cn2). % 0.15/0.42 cnf(a4, assumption, % 0.15/0.42 implies(sK19,X2) = implies(X6,implies(not(X6),X7))). % 0.15/0.42 cnf(c19, plain, % 0.15/0.42 $false, % 0.15/0.42 inference(strict_predicate_extension, [assumptions([a4])], [c10, c18])). % 0.15/0.42 cnf(c20, plain, % 0.15/0.42 ~cn2, % 0.15/0.42 inference(strict_predicate_extension, [assumptions([a4])], [c10, c18])). % 0.15/0.42 % 0.15/0.42 cnf(c21, axiom, % 0.15/0.42 cn2). % 0.15/0.42 cnf(c22, plain, % 0.15/0.42 $false, % 0.15/0.42 inference(strict_predicate_extension, [], [c20, c21])). % 0.15/0.42 cnf(c23, plain, % 0.15/0.42 $false, % 0.15/0.42 inference(strict_predicate_extension, [], [c20, c21])). % 0.15/0.42 % 0.15/0.42 cnf(c24, axiom, % 0.15/0.42 op_or). % 0.15/0.42 cnf(c25, plain, % 0.15/0.42 $false, % 0.15/0.42 inference(strict_predicate_extension, [], [c7, c24])). % 0.15/0.42 cnf(c26, plain, % 0.15/0.42 $false, % 0.15/0.42 inference(strict_predicate_extension, [], [c7, c24])). % 0.15/0.42 % 0.15/0.42 cnf(c27, plain, % 0.15/0.42 $false, % 0.15/0.42 inference(constraint_solving, [ % 0.15/0.42 bind(X0, sK19), % 0.15/0.42 bind(X1, sK20), % 0.15/0.42 bind(X2, implies(X3,X4)), % 0.15/0.42 bind(X3, not(X0)), % 0.15/0.42 bind(X4, sK20), % 0.15/0.42 bind(X5, implies(X3,X4)), % 0.15/0.42 bind(X6, sK19), % 0.15/0.42 bind(X7, sK20) % 0.15/0.42 ], % 0.15/0.42 [a0, a1, a2, a3, a4])). % 0.15/0.42 % 0.15/0.42 % SZS output end IncompleteProof %------------------------------------------------------------------------------