%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : LCL893+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n026.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:50:44 AM UTC 2026
% Result : Theorem 0.17s 0.46s
% Output : Proof 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL893+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n026.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 17:08:11 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.46 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-regeneralise
% 0.17/0.46
% 0.17/0.46 % SZS status Theorem
% 0.17/0.46
% 0.17/0.46 % SZS output start Proof
% 0.17/0.46 Axiom 1 (goals_15): h(x17) = x17.
% 0.17/0.46 Axiom 2 (sos_05): X >= X = true.
% 0.17/0.46 Axiom 3 (sos_09): X >= 0 = true.
% 0.17/0.46 Axiom 4 (sos_02): X + Y = Y + X.
% 0.17/0.46 Axiom 5 (sos_03): X + 0 = X.
% 0.17/0.46 Axiom 6 (sos_14): h(X) = h(X) ==> X.
% 0.17/0.46 Axiom 7 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.17/0.46 Axiom 8 (ifeq_axiom): ifeq2(X, X, Y, Z) = Y.
% 0.17/0.46 Axiom 9 (sos_08_1): ifeq((X + Y) >= Z, true, Y >= (X ==> Z), true) = true.
% 0.17/0.46 Axiom 10 (sos_07): ifeq2(X >= Y, true, ifeq2(Y >= X, true, Y, X), X) = X.
% 0.17/0.46
% 0.17/0.46 Goal 1 (goals_15_1): x17 = 0.
% 0.17/0.46 Proof:
% 0.17/0.46 x17
% 0.17/0.46 = { by axiom 1 (goals_15) R->L }
% 0.17/0.46 h(x17)
% 0.17/0.46 = { by axiom 6 (sos_14) }
% 0.17/0.46 h(x17) ==> x17
% 0.17/0.46 = { by axiom 1 (goals_15) }
% 0.17/0.46 x17 ==> x17
% 0.17/0.46 = { by axiom 5 (sos_03) R->L }
% 0.17/0.46 x17 ==> (x17 + 0)
% 0.17/0.46 = { by axiom 4 (sos_02) }
% 0.17/0.46 x17 ==> (0 + x17)
% 0.17/0.46 = { by axiom 10 (sos_07) R->L }
% 0.17/0.46 ifeq2((x17 ==> (0 + x17)) >= 0, true, ifeq2(0 >= (x17 ==> (0 + x17)), true, 0, x17 ==> (0 + x17)), x17 ==> (0 + x17))
% 0.17/0.46 = { by axiom 3 (sos_09) }
% 0.17/0.46 ifeq2(true, true, ifeq2(0 >= (x17 ==> (0 + x17)), true, 0, x17 ==> (0 + x17)), x17 ==> (0 + x17))
% 0.17/0.46 = { by axiom 8 (ifeq_axiom) }
% 0.17/0.46 ifeq2(0 >= (x17 ==> (0 + x17)), true, 0, x17 ==> (0 + x17))
% 0.17/0.46 = { by axiom 4 (sos_02) R->L }
% 0.17/0.46 ifeq2(0 >= (x17 ==> (x17 + 0)), true, 0, x17 ==> (0 + x17))
% 0.17/0.46 = { by axiom 7 (ifeq_axiom) R->L }
% 0.17/0.46 ifeq2(ifeq(true, true, 0 >= (x17 ==> (x17 + 0)), true), true, 0, x17 ==> (0 + x17))
% 0.17/0.46 = { by axiom 2 (sos_05) R->L }
% 0.17/0.46 ifeq2(ifeq((x17 + 0) >= (x17 + 0), true, 0 >= (x17 ==> (x17 + 0)), true), true, 0, x17 ==> (0 + x17))
% 0.17/0.46 = { by axiom 9 (sos_08_1) }
% 0.17/0.46 ifeq2(true, true, 0, x17 ==> (0 + x17))
% 0.17/0.46 = { by axiom 8 (ifeq_axiom) }
% 0.17/0.46 0
% 0.17/0.46 % SZS output end Proof
% 0.17/0.46
% 0.17/0.46 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------