%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL076-2 : TPTP v9.3.1. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n020.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:07 PM UTC 2026 % Result : Unsatisfiable 0.13s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL076-2 : TPTP v9.3.1. Released v1.0.0. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.09/0.35 % Computer : n020.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Fri Sep 4 19:42:57 UTC 2026 % 0.09/0.36 % CPUTime : % 0.13/0.36 % SZS status Unsatisfiable % 0.13/0.36 % SZS output begin IncompleteProof % 0.13/0.36 cnf(c0, axiom, % 0.13/0.36 ~is_a_theorem(implies(a,not(not(a))))). % 0.13/0.36 cnf(c1, plain, % 0.13/0.36 ~is_a_theorem(implies(a,not(not(a)))), % 0.13/0.36 inference(start, [], [c0])). % 0.13/0.36 % 0.13/0.36 cnf(c2, axiom, % 0.13/0.36 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))). % 0.13/0.36 cnf(a0, assumption, % 0.13/0.36 implies(a,not(not(a))) = X0). % 0.13/0.36 cnf(c3, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.36 cnf(c4, plain, % 0.13/0.36 ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.36 % 0.13/0.36 cnf(c5, axiom, % 0.13/0.36 is_a_theorem(implies(not(not(X2)),X2))). % 0.13/0.36 cnf(a1, assumption, % 0.13/0.36 X1 = implies(not(not(X2)),X2)). % 0.13/0.36 cnf(c6, plain, % 0.13/0.36 ~is_a_theorem(implies(X1,X0)), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.36 cnf(c7, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.36 % 0.13/0.36 cnf(c8, axiom, % 0.13/0.36 is_a_theorem(implies(implies(not(X3),not(X4)),implies(X4,X3)))). % 0.13/0.36 cnf(a2, assumption, % 0.13/0.36 implies(X1,X0) = implies(implies(not(X3),not(X4)),implies(X4,X3))). % 0.13/0.36 cnf(c9, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.13/0.36 cnf(c10, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.13/0.36 % 0.13/0.36 cnf(c11, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(constraint_solving, [ % 0.13/0.36 bind(X0, implies(a,not(not(a)))), % 0.13/0.36 bind(X1, implies(not(not(X2)),X2)), % 0.13/0.36 bind(X2, not(X4)), % 0.13/0.36 bind(X3, not(X2)), % 0.13/0.36 bind(X4, a) % 0.13/0.36 ], % 0.13/0.36 [a0, a1, a2])). % 0.13/0.36 % 0.13/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------