%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL527+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:49 PM UTC 2026 % Result : Theorem 53.33s 7.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL527+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.09/0.36 % Computer : n014.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Sun Sep 6 00:37:12 UTC 2026 % 0.09/0.36 % CPUTime : % 53.33/7.35 % SZS status Theorem % 53.33/7.35 % SZS output begin IncompleteProof % 53.33/7.35 cnf(c0, axiom, % 53.33/7.35 ~adjunction). % 53.33/7.35 cnf(c1, plain, % 53.33/7.35 ~adjunction, % 53.33/7.35 inference(start, [], [c0])). % 53.33/7.35 % 53.33/7.35 cnf(c2, axiom, % 53.33/7.35 adjunction | ~is_a_theorem(and(sK58,sK59))). % 53.33/7.35 cnf(c3, plain, % 53.33/7.35 $false, % 53.33/7.35 inference(strict_predicate_extension, [], [c1, c2])). % 53.33/7.35 cnf(c4, plain, % 53.33/7.35 ~is_a_theorem(and(sK58,sK59)), % 53.33/7.35 inference(strict_predicate_extension, [], [c1, c2])). % 53.33/7.35 % 53.33/7.35 cnf(c5, axiom, % 53.33/7.35 is_a_theorem(X0) | ~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens). % 53.33/7.35 cnf(a0, assumption, % 53.33/7.35 and(sK58,sK59) = X0). % 53.33/7.35 cnf(c6, plain, % 53.33/7.35 $false, % 53.33/7.35 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])). % 53.33/7.35 cnf(c7, plain, % 53.33/7.35 ~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens, % 53.33/7.35 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])). % 53.33/7.35 % 53.33/7.35 cnf(c8, axiom, % 53.33/7.35 is_a_theorem(X2) | ~is_a_theorem(implies(X3,X2)) | ~is_a_theorem(X3) | ~modus_ponens). % 53.33/7.35 cnf(a1, assumption, % 53.33/7.35 implies(X1,X0) = X2). % 53.33/7.35 cnf(c9, plain, % 53.33/7.35 ~is_a_theorem(X1) | ~modus_ponens, % 53.33/7.35 inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])). % 53.33/7.35 cnf(c10, plain, % 53.33/7.35 ~is_a_theorem(implies(X3,X2)) | ~is_a_theorem(X3) | ~modus_ponens, % 53.33/7.35 inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])). % 53.33/7.35 % 53.33/7.35 cnf(c11, axiom, % 53.33/7.35 is_a_theorem(implies(X4,implies(X5,and(X4,X5)))) | ~and_3). % 53.33/7.35 cnf(a2, assumption, % 53.33/7.35 implies(X3,X2) = implies(X4,implies(X5,and(X4,X5)))). % 53.33/7.35 cnf(c12, plain, % 53.33/7.35 ~is_a_theorem(X3) | ~modus_ponens, % 53.33/7.35 inference(strict_predicate_extension, [assumptions([a2])], [c10, c11])). % 53.33/7.35 cnf(c13, plain, % 53.33/7.35 ~and_3, % 53.33/7.35 inference(strict_predicate_extension, [assumptions([a2])], [c10, c11])). % 53.33/7.35 % 53.33/7.35 cnf(c14, axiom, % 53.33/7.35 and_3). % 53.33/7.35 cnf(c15, plain, % 53.33/7.35 $false, % 53.33/7.35 inference(strict_predicate_extension, [], [c13, c14])). % 53.33/7.35 cnf(c16, plain, % 53.33/7.35 $false, % 53.33/7.35 inference(strict_predicate_extension, [], [c13, c14])). % 53.33/7.35 % 53.33/7.35 cnf(c17, axiom, % 53.33/7.35 adjunction | is_a_theorem(sK58)). % 53.33/7.35 cnf(a3, assumption, % 53.33/7.35 X3 = sK58). % 53.33/7.35 cnf(c18, plain, % 53.33/7.35 ~modus_ponens, % 53.33/7.35 inference(strict_predicate_extension, [assumptions([a3])], [c12, c17])). % 53.33/7.35 cnf(c19, plain, % 53.33/7.35 adjunction, % 53.33/7.35 inference(strict_predicate_extension, [assumptions([a3])], [c12, c17])). % 53.33/7.35 % 53.33/7.35 cnf(c20, plain, % 53.33/7.35 ~adjunction). % 53.33/7.35 cnf(c21, plain, % 53.33/7.35 $false, % 53.33/7.35 inference(predicate_reduction, [], [c19, c20])). % 53.33/7.35 % 53.33/7.35 cnf(c22, axiom, % 53.33/7.35 modus_ponens). % 53.33/7.35 cnf(c23, plain, % 53.33/7.35 $false, % 53.33/7.35 inference(strict_predicate_extension, [], [c18, c22])). % 53.33/7.35 cnf(c24, plain, % 53.33/7.35 $false, % 53.33/7.35 inference(strict_predicate_extension, [], [c18, c22])). % 53.33/7.35 % 53.33/7.35 cnf(c25, axiom, % 53.33/7.35 adjunction | is_a_theorem(sK59)). % 53.33/7.35 cnf(a4, assumption, % 53.33/7.35 X1 = sK59). % 53.33/7.35 cnf(c26, plain, % 53.33/7.35 ~modus_ponens, % 53.33/7.35 inference(strict_predicate_extension, [assumptions([a4])], [c9, c25])). % 53.33/7.35 cnf(c27, plain, % 53.33/7.35 adjunction, % 53.33/7.35 inference(strict_predicate_extension, [assumptions([a4])], [c9, c25])). % 53.33/7.35 % 53.33/7.35 cnf(c28, plain, % 53.33/7.35 ~adjunction). % 53.33/7.35 cnf(c29, plain, % 53.33/7.35 $false, % 53.33/7.35 inference(predicate_reduction, [], [c27, c28])). % 53.33/7.35 % 53.33/7.35 cnf(c30, plain, % 53.33/7.35 modus_ponens). % 53.33/7.35 cnf(c31, plain, % 53.33/7.35 $false, % 53.33/7.35 inference(predicate_reduction, [], [c26, c30])). % 53.33/7.35 % 53.33/7.35 cnf(c32, plain, % 53.33/7.35 $false, % 53.33/7.35 inference(constraint_solving, [ % 53.33/7.35 bind(X0, and(sK58,sK59)), % 53.33/7.35 bind(X1, sK59), % 53.33/7.35 bind(X2, implies(X1,X0)), % 53.33/7.35 bind(X3, sK58), % 53.33/7.35 bind(X4, sK58), % 53.33/7.35 bind(X5, sK59) % 53.33/7.35 ], % 53.33/7.35 [a0, a1, a2, a3, a4])). % 53.33/7.35 % 53.33/7.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------