%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL355-1 : TPTP v9.3.1. Released v2.3.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:33 PM UTC 2026 % Result : Unsatisfiable 0.02s 0.30s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.01 % Problem : LCL355-1 : TPTP v9.3.1. Released v2.3.0. % 0.00/0.02 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.02/0.29 % Computer : n012.cluster.edu % 0.02/0.29 % Model : x86_64 x86_64 % 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.02/0.29 % Memory : 8046.5625MB % 0.02/0.29 % OS : Linux 6.8.0-71-generic % 0.02/0.29 % CPULimit : 300 % 0.02/0.29 % WCLimit : 300 % 0.02/0.29 % DateTime : Fri Sep 4 16:59:57 UTC 2026 % 0.02/0.29 % CPUTime : % 0.02/0.30 % SZS status Unsatisfiable % 0.02/0.30 % SZS output begin IncompleteProof % 0.02/0.30 cnf(c0, axiom, % 0.02/0.30 ~is_a_theorem(implies(implies(implies(implies(x,y),implies(z,y)),u),implies(implies(z,x),u)))). % 0.02/0.30 cnf(c1, plain, % 0.02/0.30 ~is_a_theorem(implies(implies(implies(implies(x,y),implies(z,y)),u),implies(implies(z,x),u))), % 0.02/0.30 inference(start, [], [c0])). % 0.02/0.30 % 0.02/0.30 cnf(c2, axiom, % 0.02/0.30 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))). % 0.02/0.30 cnf(a0, assumption, % 0.02/0.30 implies(implies(implies(implies(x,y),implies(z,y)),u),implies(implies(z,x),u)) = X0). % 0.02/0.30 cnf(c3, plain, % 0.02/0.30 $false, % 0.02/0.30 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.02/0.30 cnf(c4, plain, % 0.02/0.30 ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)), % 0.02/0.30 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.02/0.30 % 0.02/0.30 cnf(c5, axiom, % 0.02/0.30 is_a_theorem(implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4))))). % 0.02/0.30 cnf(a1, assumption, % 0.02/0.30 X1 = implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4)))). % 0.02/0.30 cnf(c6, plain, % 0.02/0.30 ~is_a_theorem(implies(X1,X0)), % 0.02/0.30 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.02/0.30 cnf(c7, plain, % 0.02/0.30 $false, % 0.02/0.30 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.02/0.30 % 0.02/0.30 cnf(c8, axiom, % 0.02/0.30 is_a_theorem(implies(implies(X5,X6),implies(implies(X6,X7),implies(X5,X7))))). % 0.02/0.30 cnf(a2, assumption, % 0.02/0.30 implies(X1,X0) = implies(implies(X5,X6),implies(implies(X6,X7),implies(X5,X7)))). % 0.02/0.30 cnf(c9, plain, % 0.02/0.30 $false, % 0.02/0.30 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.02/0.30 cnf(c10, plain, % 0.02/0.30 $false, % 0.02/0.30 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.02/0.30 % 0.02/0.30 cnf(c11, plain, % 0.02/0.30 $false, % 0.02/0.30 inference(constraint_solving, [ % 0.02/0.30 bind(X0, implies(implies(implies(implies(x,y),implies(z,y)),u),implies(implies(z,x),u))), % 0.02/0.30 bind(X1, implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4)))), % 0.02/0.30 bind(X2, z), % 0.02/0.30 bind(X3, x), % 0.02/0.30 bind(X4, y), % 0.02/0.30 bind(X5, implies(X2,X3)), % 0.02/0.30 bind(X6, implies(implies(X3,X4),implies(X2,X4))), % 0.02/0.30 bind(X7, u) % 0.02/0.30 ], % 0.02/0.30 [a0, a1, a2])). % 0.02/0.30 % 0.02/0.30 % SZS output end IncompleteProof %------------------------------------------------------------------------------