%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL465+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 : n018.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.07s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL465+1 : TPTP v9.3.1. Bugfixed v9.2.0. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.07/0.35 % Computer : n018.cluster.edu % 0.07/0.35 % Model : x86_64 x86_64 % 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.35 % Memory : 8046.5625MB % 0.07/0.35 % OS : Linux 6.8.0-71-generic % 0.07/0.35 % CPULimit : 300 % 0.07/0.35 % WCLimit : 300 % 0.07/0.35 % DateTime : Fri Sep 4 21:22:18 UTC 2026 % 0.07/0.35 % CPUTime : % 0.07/0.36 % SZS status Theorem % 0.07/0.36 % SZS output begin IncompleteProof % 0.07/0.36 cnf(c0, axiom, % 0.07/0.36 ~implies_3). % 0.07/0.36 cnf(c1, plain, % 0.07/0.36 ~implies_3, % 0.07/0.36 inference(start, [], [c0])). % 0.07/0.36 % 0.07/0.36 cnf(c2, axiom, % 0.07/0.36 implies_3 | ~is_a_theorem(implies(implies(sK10,sK11),implies(implies(sK11,sK12),implies(sK10,sK12))))). % 0.07/0.36 cnf(c3, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [], [c1, c2])). % 0.07/0.36 cnf(c4, plain, % 0.07/0.36 ~is_a_theorem(implies(implies(sK10,sK11),implies(implies(sK11,sK12),implies(sK10,sK12)))), % 0.07/0.36 inference(strict_predicate_extension, [], [c1, c2])). % 0.07/0.36 % 0.07/0.36 cnf(c5, axiom, % 0.07/0.36 is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) | ~cn1). % 0.07/0.36 cnf(a0, assumption, % 0.07/0.36 implies(implies(sK10,sK11),implies(implies(sK11,sK12),implies(sK10,sK12))) = implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))). % 0.07/0.36 cnf(c6, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])). % 0.07/0.36 cnf(c7, plain, % 0.07/0.36 ~cn1, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])). % 0.07/0.36 % 0.07/0.36 cnf(c8, axiom, % 0.07/0.36 cn1). % 0.07/0.36 cnf(c9, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [], [c7, c8])). % 0.07/0.36 cnf(c10, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [], [c7, c8])). % 0.07/0.36 % 0.07/0.36 cnf(c11, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(constraint_solving, [ % 0.07/0.36 bind(X0, sK10), % 0.07/0.36 bind(X1, sK11), % 0.07/0.36 bind(X2, sK12) % 0.07/0.36 ], % 0.07/0.36 [a0])). % 0.07/0.36 % 0.07/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------