%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL451+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 : n002.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.10s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL451+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 : n002.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 20:42:50 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.39 % SZS status Theorem % 0.10/0.39 % SZS output begin IncompleteProof % 0.10/0.39 cnf(c0, axiom, % 0.10/0.39 ~cn1). % 0.10/0.39 cnf(c1, plain, % 0.10/0.39 ~cn1, % 0.10/0.39 inference(start, [], [c0])). % 0.10/0.39 % 0.10/0.39 cnf(c2, axiom, % 0.10/0.39 cn1 | ~is_a_theorem(implies(implies(sK38,sK39),implies(implies(sK39,sK40),implies(sK38,sK40))))). % 0.10/0.39 cnf(c3, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [], [c1, c2])). % 0.10/0.39 cnf(c4, plain, % 0.10/0.39 ~is_a_theorem(implies(implies(sK38,sK39),implies(implies(sK39,sK40),implies(sK38,sK40)))), % 0.10/0.39 inference(strict_predicate_extension, [], [c1, c2])). % 0.10/0.39 % 0.10/0.39 cnf(c5, axiom, % 0.10/0.39 is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) | ~implies_3). % 0.10/0.39 cnf(a0, assumption, % 0.10/0.39 implies(implies(sK38,sK39),implies(implies(sK39,sK40),implies(sK38,sK40))) = implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))). % 0.10/0.39 cnf(c6, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])). % 0.10/0.39 cnf(c7, plain, % 0.10/0.39 ~implies_3, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])). % 0.10/0.39 % 0.10/0.39 cnf(c8, axiom, % 0.10/0.39 implies_3). % 0.10/0.39 cnf(c9, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [], [c7, c8])). % 0.10/0.39 cnf(c10, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [], [c7, c8])). % 0.10/0.39 % 0.10/0.39 cnf(c11, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(constraint_solving, [ % 0.10/0.39 bind(X0, sK38), % 0.10/0.39 bind(X1, sK39), % 0.10/0.39 bind(X2, sK40) % 0.10/0.39 ], % 0.10/0.39 [a0])). % 0.10/0.39 % 0.10/0.39 % SZS output end IncompleteProof %------------------------------------------------------------------------------