%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : LCL076-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n015.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 : Tue Sep 29 11:48:58 AM UTC 2026
% Result : Unsatisfiable 0.21s 0.50s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL076-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 % Computer : n015.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8046.5625MB
% 0.14/0.38 % OS : Linux 6.8.0-71-generic
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Sun Sep 27 15:24:15 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.50 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 0.21/0.50
% 0.21/0.50 % SZS status Unsatisfiable
% 0.21/0.50
% 0.21/0.50 % SZS output start Proof
% 0.21/0.50 Axiom 1 (extra_lemma): is_a_theorem(implies(not(not(X)), X)) = true.
% 0.21/0.50 Axiom 2 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.21/0.50 Axiom 3 (cn_49): is_a_theorem(implies(implies(not(X), not(Y)), implies(Y, X))) = true.
% 0.21/0.50 Axiom 4 (condensed_detachment): ifeq(is_a_theorem(implies(X, Y)), true, ifeq(is_a_theorem(X), true, is_a_theorem(Y), true), true) = true.
% 0.21/0.50
% 0.21/0.50 Goal 1 (prove_cn_40): is_a_theorem(implies(a, not(not(a)))) = true.
% 0.21/0.50 Proof:
% 0.21/0.50 is_a_theorem(implies(a, not(not(a))))
% 0.21/0.50 = { by axiom 2 (ifeq_axiom) R->L }
% 0.21/0.50 ifeq(true, true, is_a_theorem(implies(a, not(not(a)))), true)
% 0.21/0.50 = { by axiom 1 (extra_lemma) R->L }
% 0.21/0.50 ifeq(is_a_theorem(implies(not(not(not(a))), not(a))), true, is_a_theorem(implies(a, not(not(a)))), true)
% 0.21/0.50 = { by axiom 2 (ifeq_axiom) R->L }
% 0.21/0.50 ifeq(true, true, ifeq(is_a_theorem(implies(not(not(not(a))), not(a))), true, is_a_theorem(implies(a, not(not(a)))), true), true)
% 0.21/0.50 = { by axiom 3 (cn_49) R->L }
% 0.21/0.50 ifeq(is_a_theorem(implies(implies(not(not(not(a))), not(a)), implies(a, not(not(a))))), true, ifeq(is_a_theorem(implies(not(not(not(a))), not(a))), true, is_a_theorem(implies(a, not(not(a)))), true), true)
% 0.21/0.50 = { by axiom 4 (condensed_detachment) }
% 0.21/0.50 true
% 0.21/0.50 % SZS output end Proof
% 0.21/0.50
% 0.21/0.50 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------