%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL483+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:47 PM UTC 2026 % Result : Theorem 9.34s 1.54s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.01 % Problem : LCL483+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.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 10:29:27 UTC 2026 % 0.03/0.30 % CPUTime : % 9.34/1.54 % SZS status Theorem % 9.34/1.54 % SZS output begin IncompleteProof % 9.34/1.54 cnf(c0, axiom, % 9.34/1.54 ~modus_tollens). % 9.34/1.54 cnf(c1, plain, % 9.34/1.54 ~modus_tollens, % 9.34/1.54 inference(start, [], [c0])). % 9.34/1.54 % 9.34/1.54 cnf(c2, axiom, % 9.34/1.54 modus_tollens | ~is_a_theorem(implies(implies(not(sK5),not(sK4)),implies(sK4,sK5)))). % 9.34/1.54 cnf(c3, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(strict_predicate_extension, [], [c1, c2])). % 9.34/1.54 cnf(c4, plain, % 9.34/1.54 ~is_a_theorem(implies(implies(not(sK5),not(sK4)),implies(sK4,sK5))), % 9.34/1.54 inference(strict_predicate_extension, [], [c1, c2])). % 9.34/1.54 % 9.34/1.54 cnf(c5, axiom, % 9.34/1.54 is_a_theorem(implies(or(X0,X1),or(X1,X0))) | ~r3). % 9.34/1.54 cnf(a0, assumption, % 9.34/1.54 X2 = implies(implies(not(sK5),not(sK4)),implies(sK4,sK5))). % 9.34/1.54 cnf(c6, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(lazy_predicate_extension, [assumptions([a0])], [c4, c5])). % 9.34/1.54 cnf(c7, plain, % 9.34/1.54 ~r3, % 9.34/1.54 inference(lazy_predicate_extension, [assumptions([a0])], [c4, c5])). % 9.34/1.54 cnf(c8, plain, % 9.34/1.54 implies(or(X0,X1),or(X1,X0)) != X2, % 9.34/1.54 inference(lazy_predicate_extension, [assumptions([a0])], [c4, c5])). % 9.34/1.54 % 9.34/1.54 cnf(c9, axiom, % 9.34/1.54 implies(X3,X4) = or(not(X3),X4) | ~op_implies_or). % 9.34/1.54 cnf(a1, assumption, % 9.34/1.54 or(X1,X0) = or(not(X3),X4)). % 9.34/1.54 cnf(c10, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(strict_function_extension, [assumptions([a1])], [c8, c9])). % 9.34/1.54 cnf(c11, plain, % 9.34/1.54 ~op_implies_or, % 9.34/1.54 inference(strict_function_extension, [assumptions([a1])], [c8, c9])). % 9.34/1.54 cnf(c12, plain, % 9.34/1.54 X5 != implies(X3,X4) | implies(or(X0,X1),X5) != X2, % 9.34/1.54 inference(strict_function_extension, [assumptions([a1])], [c8, c9])). % 9.34/1.54 % 9.34/1.54 cnf(a2, assumption, % 9.34/1.54 X5 = implies(X3,X4)). % 9.34/1.54 cnf(c13, plain, % 9.34/1.54 implies(or(X0,X1),X5) != X2, % 9.34/1.54 inference(reflexivity, [assumptions([a2])], [c12])). % 9.34/1.54 % 9.34/1.54 cnf(c14, axiom, % 9.34/1.54 or(X6,X7) = not(and(not(X6),not(X7))) | ~op_or). % 9.34/1.54 cnf(a3, assumption, % 9.34/1.54 or(X0,X1) = or(X6,X7)). % 9.34/1.54 cnf(c15, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(strict_function_extension, [assumptions([a3])], [c13, c14])). % 9.34/1.54 cnf(c16, plain, % 9.34/1.54 ~op_or, % 9.34/1.54 inference(strict_function_extension, [assumptions([a3])], [c13, c14])). % 9.34/1.54 cnf(c17, plain, % 9.34/1.54 X8 != not(and(not(X6),not(X7))) | implies(X8,X5) != X2, % 9.34/1.54 inference(strict_function_extension, [assumptions([a3])], [c13, c14])). % 9.34/1.54 % 9.34/1.54 cnf(c18, axiom, % 9.34/1.54 implies(X9,X10) = not(and(X9,not(X10))) | ~op_implies_and). % 9.34/1.54 cnf(a4, assumption, % 9.34/1.54 not(and(not(X6),not(X7))) = not(and(X9,not(X10)))). % 9.34/1.54 cnf(c19, plain, % 9.34/1.54 implies(X8,X5) != X2, % 9.34/1.54 inference(strict_function_extension, [assumptions([a4])], [c17, c18])). % 9.34/1.54 cnf(c20, plain, % 9.34/1.54 ~op_implies_and, % 9.34/1.54 inference(strict_function_extension, [assumptions([a4])], [c17, c18])). % 9.34/1.54 cnf(c21, plain, % 9.34/1.54 X11 != implies(X9,X10) | X8 != X11, % 9.34/1.54 inference(strict_function_extension, [assumptions([a4])], [c17, c18])). % 9.34/1.54 % 9.34/1.54 cnf(a5, assumption, % 9.34/1.54 X11 = implies(X9,X10)). % 9.34/1.54 cnf(c22, plain, % 9.34/1.54 X8 != X11, % 9.34/1.54 inference(reflexivity, [assumptions([a5])], [c21])). % 9.34/1.54 % 9.34/1.54 cnf(a6, assumption, % 9.34/1.54 X8 = X11). % 9.34/1.54 cnf(c23, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(reflexivity, [assumptions([a6])], [c22])). % 9.34/1.54 % 9.34/1.54 cnf(c24, axiom, % 9.34/1.54 op_implies_and). % 9.34/1.54 cnf(c25, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(strict_predicate_extension, [], [c20, c24])). % 9.34/1.54 cnf(c26, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(strict_predicate_extension, [], [c20, c24])). % 9.34/1.54 % 9.34/1.54 cnf(a7, assumption, % 9.34/1.54 implies(X8,X5) = X2). % 9.34/1.54 cnf(c27, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(reflexivity, [assumptions([a7])], [c19])). % 9.34/1.54 % 9.34/1.54 cnf(c28, axiom, % 9.34/1.54 op_or). % 9.34/1.54 cnf(c29, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(strict_predicate_extension, [], [c16, c28])). % 9.34/1.54 cnf(c30, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(strict_predicate_extension, [], [c16, c28])). % 9.34/1.54 % 9.34/1.54 cnf(c31, axiom, % 9.34/1.54 op_implies_or). % 9.34/1.54 cnf(c32, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(strict_predicate_extension, [], [c11, c31])). % 9.34/1.54 cnf(c33, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(strict_predicate_extension, [], [c11, c31])). % 9.34/1.54 % 9.34/1.54 cnf(c34, axiom, % 9.34/1.54 r3). % 9.34/1.54 cnf(c35, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(strict_predicate_extension, [], [c7, c34])). % 9.34/1.54 cnf(c36, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(strict_predicate_extension, [], [c7, c34])). % 9.34/1.54 % 9.34/1.54 cnf(c37, plain, % 9.34/1.54 $false, % 9.34/1.54 inference(constraint_solving, [ % 9.34/1.54 bind(X0, sK5), % 9.34/1.54 bind(X1, not(X3)), % 9.34/1.54 bind(X2, implies(implies(not(sK5),not(sK4)),implies(sK4,sK5))), % 9.34/1.54 bind(X3, sK4), % 9.34/1.54 bind(X4, sK5), % 9.34/1.54 bind(X5, implies(X3,X4)), % 9.34/1.54 bind(X6, sK5), % 9.34/1.54 bind(X7, not(X3)), % 9.34/1.54 bind(X8, implies(X9,X10)), % 9.34/1.54 bind(X9, not(X6)), % 9.34/1.54 bind(X10, not(X3)), % 9.34/1.54 bind(X11, implies(X9,X10)) % 9.34/1.54 ], % 9.34/1.54 [a0, a1, a2, a3, a4, a5, a6, a7])). % 9.34/1.54 % 9.34/1.54 % SZS output end IncompleteProof %------------------------------------------------------------------------------