%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL459+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 : n016.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:45 PM UTC 2026 % Result : Theorem 0.12s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL459+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.12/0.36 % Computer : n016.cluster.edu % 0.12/0.36 % Model : x86_64 x86_64 % 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.36 % Memory : 8046.5625MB % 0.12/0.36 % OS : Linux 6.8.0-71-generic % 0.12/0.36 % CPULimit : 300 % 0.12/0.36 % WCLimit : 300 % 0.12/0.36 % DateTime : Fri Sep 4 14:34:13 UTC 2026 % 0.12/0.37 % CPUTime : % 0.12/0.38 % SZS status Theorem % 0.12/0.38 % SZS output begin IncompleteProof % 0.12/0.38 cnf(c0, axiom, % 0.12/0.38 ~kn1). % 0.12/0.38 cnf(c1, plain, % 0.12/0.38 ~kn1, % 0.12/0.38 inference(start, [], [c0])). % 0.12/0.38 % 0.12/0.38 cnf(c2, axiom, % 0.12/0.38 kn1 | ~is_a_theorem(implies(sK32,and(sK32,sK32)))). % 0.12/0.38 cnf(c3, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [], [c1, c2])). % 0.12/0.38 cnf(c4, plain, % 0.12/0.38 ~is_a_theorem(implies(sK32,and(sK32,sK32))), % 0.12/0.38 inference(strict_predicate_extension, [], [c1, c2])). % 0.12/0.38 % 0.12/0.38 cnf(c5, axiom, % 0.12/0.38 is_a_theorem(X0) | ~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens). % 0.12/0.38 cnf(a0, assumption, % 0.12/0.38 implies(sK32,and(sK32,sK32)) = X0). % 0.12/0.38 cnf(c6, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])). % 0.12/0.38 cnf(c7, plain, % 0.12/0.38 ~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])). % 0.12/0.38 % 0.12/0.38 cnf(c8, axiom, % 0.12/0.38 is_a_theorem(implies(implies(X2,implies(X2,X3)),implies(X2,X3))) | ~implies_2). % 0.12/0.38 cnf(a1, assumption, % 0.12/0.38 implies(X1,X0) = implies(implies(X2,implies(X2,X3)),implies(X2,X3))). % 0.12/0.38 cnf(c9, plain, % 0.12/0.38 ~is_a_theorem(X1) | ~modus_ponens, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])). % 0.12/0.38 cnf(c10, plain, % 0.12/0.38 ~implies_2, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])). % 0.12/0.38 % 0.12/0.38 cnf(c11, axiom, % 0.12/0.38 implies_2). % 0.12/0.38 cnf(c12, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [], [c10, c11])). % 0.12/0.38 cnf(c13, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [], [c10, c11])). % 0.12/0.38 % 0.12/0.38 cnf(c14, axiom, % 0.12/0.38 is_a_theorem(implies(X4,implies(X5,and(X4,X5)))) | ~and_3). % 0.12/0.38 cnf(a2, assumption, % 0.12/0.38 X1 = implies(X4,implies(X5,and(X4,X5)))). % 0.12/0.38 cnf(c15, plain, % 0.12/0.38 ~modus_ponens, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a2])], [c9, c14])). % 0.12/0.38 cnf(c16, plain, % 0.12/0.38 ~and_3, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a2])], [c9, c14])). % 0.12/0.38 % 0.12/0.38 cnf(c17, axiom, % 0.12/0.38 and_3). % 0.12/0.38 cnf(c18, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [], [c16, c17])). % 0.12/0.38 cnf(c19, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [], [c16, c17])). % 0.12/0.38 % 0.12/0.38 cnf(c20, axiom, % 0.12/0.38 modus_ponens). % 0.12/0.38 cnf(c21, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [], [c15, c20])). % 0.12/0.38 cnf(c22, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [], [c15, c20])). % 0.12/0.38 % 0.12/0.38 cnf(c23, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(constraint_solving, [ % 0.12/0.38 bind(X0, implies(sK32,and(sK32,sK32))), % 0.12/0.38 bind(X1, implies(X2,implies(X2,X3))), % 0.12/0.38 bind(X2, sK32), % 0.12/0.38 bind(X3, and(sK32,sK32)), % 0.12/0.38 bind(X4, sK32), % 0.12/0.38 bind(X5, sK32) % 0.12/0.38 ], % 0.12/0.38 [a0, a1, a2])). % 0.12/0.38 % 0.12/0.38 % SZS output end IncompleteProof %------------------------------------------------------------------------------