%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SYN125-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n002.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 01:47:08 PM UTC 2026
% Result : Unsatisfiable 6.47s 1.13s
% Output : Proof 6.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN125-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.18 % Computer : n002.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Mon Sep 28 15:38:52 UTC 2026
% 0.06/0.19 % CPUTime :
% 0.06/0.19 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.47/1.13 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
% 6.47/1.13
% 6.47/1.13 % SZS status Unsatisfiable
% 6.47/1.13
% 6.47/1.13 % SZS output start Proof
% 6.47/1.13 Axiom 1 (axiom_13): r0(e) = true.
% 6.47/1.13 Axiom 2 (axiom_24): l0(c) = true.
% 6.47/1.13 Axiom 3 (axiom_28): k0(e) = true.
% 6.47/1.13 Axiom 4 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 6.47/1.13 Axiom 5 (rule_176): ifeq(m1(X, Y, X), true, p2(Y, X, Y), true) = true.
% 6.47/1.13 Axiom 6 (rule_021): ifeq(k0(X), true, ifeq(l0(Y), true, m1(Y, X, Y), true), true) = true.
% 6.47/1.13 Axiom 7 (rule_215): ifeq(p2(X, Y, X), true, ifeq(r0(X), true, l3(X, Y), true), true) = true.
% 6.47/1.13
% 6.47/1.13 Goal 1 (prove_this): l3(e, c) = true.
% 6.47/1.13 Proof:
% 6.47/1.13 l3(e, c)
% 6.47/1.13 = { by axiom 4 (ifeq_axiom) R->L }
% 6.47/1.13 ifeq(true, true, l3(e, c), true)
% 6.47/1.13 = { by axiom 1 (axiom_13) R->L }
% 6.47/1.13 ifeq(r0(e), true, l3(e, c), true)
% 6.47/1.13 = { by axiom 4 (ifeq_axiom) R->L }
% 6.47/1.13 ifeq(true, true, ifeq(r0(e), true, l3(e, c), true), true)
% 6.47/1.13 = { by axiom 5 (rule_176) R->L }
% 6.47/1.13 ifeq(ifeq(m1(c, e, c), true, p2(e, c, e), true), true, ifeq(r0(e), true, l3(e, c), true), true)
% 6.47/1.13 = { by axiom 4 (ifeq_axiom) R->L }
% 6.47/1.13 ifeq(ifeq(ifeq(true, true, m1(c, e, c), true), true, p2(e, c, e), true), true, ifeq(r0(e), true, l3(e, c), true), true)
% 6.47/1.13 = { by axiom 2 (axiom_24) R->L }
% 6.47/1.13 ifeq(ifeq(ifeq(l0(c), true, m1(c, e, c), true), true, p2(e, c, e), true), true, ifeq(r0(e), true, l3(e, c), true), true)
% 6.47/1.13 = { by axiom 4 (ifeq_axiom) R->L }
% 6.47/1.13 ifeq(ifeq(ifeq(true, true, ifeq(l0(c), true, m1(c, e, c), true), true), true, p2(e, c, e), true), true, ifeq(r0(e), true, l3(e, c), true), true)
% 6.47/1.13 = { by axiom 3 (axiom_28) R->L }
% 6.47/1.13 ifeq(ifeq(ifeq(k0(e), true, ifeq(l0(c), true, m1(c, e, c), true), true), true, p2(e, c, e), true), true, ifeq(r0(e), true, l3(e, c), true), true)
% 6.47/1.13 = { by axiom 6 (rule_021) }
% 6.47/1.13 ifeq(ifeq(true, true, p2(e, c, e), true), true, ifeq(r0(e), true, l3(e, c), true), true)
% 6.47/1.13 = { by axiom 4 (ifeq_axiom) }
% 6.47/1.13 ifeq(p2(e, c, e), true, ifeq(r0(e), true, l3(e, c), true), true)
% 6.47/1.13 = { by axiom 7 (rule_215) }
% 6.47/1.13 true
% 6.47/1.13 % SZS output end Proof
% 6.47/1.13
% 6.47/1.13 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------