%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SYN217-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n010.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:20 PM UTC 2026
% Result : Unsatisfiable 3.61s 0.78s
% Output : Proof 3.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN217-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.17 % Computer : n010.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Mon Sep 28 15:39:02 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.61/0.78 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 3.61/0.78
% 3.61/0.78 % SZS status Unsatisfiable
% 3.61/0.78
% 3.61/0.78 % SZS output start Proof
% 3.61/0.78 Axiom 1 (axiom_5): s0(b) = true.
% 3.61/0.78 Axiom 2 (axiom_32): k0(b) = true.
% 3.61/0.78 Axiom 3 (axiom_14): p0(b, X) = true.
% 3.61/0.78 Axiom 4 (axiom_30): n0(e, e) = true.
% 3.61/0.78 Axiom 5 (axiom_31): m0(b, b, e) = true.
% 3.61/0.78 Axiom 6 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 3.61/0.78 Axiom 7 (rule_011): ifeq(k0(X), true, ifeq(n0(Y, Y), true, m1(X, X, Y), true), true) = true.
% 3.61/0.78 Axiom 8 (rule_029): ifeq(p0(X, Y), true, ifeq(s0(X), true, m1(X, Y, X), true), true) = true.
% 3.61/0.78 Axiom 9 (rule_016): ifeq(m1(X, Y, Z), true, ifeq(m1(X, Z, W), true, m1(W, Z, Z), true), true) = true.
% 3.61/0.78 Axiom 10 (rule_134): ifeq(m1(X, Y, Y), true, ifeq(p0(Y, Z), true, ifeq(m0(Y, Z, X), true, l2(Z, Z), true), true), true) = true.
% 3.61/0.78
% 3.61/0.78 Goal 1 (prove_this): l2(b, b) = true.
% 3.61/0.78 Proof:
% 3.61/0.78 l2(b, b)
% 3.61/0.78 = { by axiom 6 (ifeq_axiom) R->L }
% 3.61/0.78 ifeq(true, true, l2(b, b), true)
% 3.61/0.78 = { by axiom 9 (rule_016) R->L }
% 3.61/0.78 ifeq(ifeq(m1(b, X, b), true, ifeq(m1(b, b, e), true, m1(e, b, b), true), true), true, l2(b, b), true)
% 3.61/0.78 = { by axiom 6 (ifeq_axiom) R->L }
% 3.61/0.78 ifeq(ifeq(m1(b, X, b), true, ifeq(ifeq(true, true, m1(b, b, e), true), true, m1(e, b, b), true), true), true, l2(b, b), true)
% 3.61/0.79 = { by axiom 2 (axiom_32) R->L }
% 3.61/0.79 ifeq(ifeq(m1(b, X, b), true, ifeq(ifeq(k0(b), true, m1(b, b, e), true), true, m1(e, b, b), true), true), true, l2(b, b), true)
% 3.61/0.79 = { by axiom 6 (ifeq_axiom) R->L }
% 3.61/0.79 ifeq(ifeq(m1(b, X, b), true, ifeq(ifeq(k0(b), true, ifeq(true, true, m1(b, b, e), true), true), true, m1(e, b, b), true), true), true, l2(b, b), true)
% 3.61/0.79 = { by axiom 4 (axiom_30) R->L }
% 3.61/0.79 ifeq(ifeq(m1(b, X, b), true, ifeq(ifeq(k0(b), true, ifeq(n0(e, e), true, m1(b, b, e), true), true), true, m1(e, b, b), true), true), true, l2(b, b), true)
% 3.61/0.79 = { by axiom 7 (rule_011) }
% 3.61/0.79 ifeq(ifeq(m1(b, X, b), true, ifeq(true, true, m1(e, b, b), true), true), true, l2(b, b), true)
% 3.61/0.79 = { by axiom 6 (ifeq_axiom) R->L }
% 3.61/0.79 ifeq(ifeq(ifeq(true, true, m1(b, X, b), true), true, ifeq(true, true, m1(e, b, b), true), true), true, l2(b, b), true)
% 3.61/0.79 = { by axiom 6 (ifeq_axiom) R->L }
% 3.61/0.79 ifeq(ifeq(ifeq(true, true, ifeq(true, true, m1(b, X, b), true), true), true, ifeq(true, true, m1(e, b, b), true), true), true, l2(b, b), true)
% 3.61/0.79 = { by axiom 3 (axiom_14) R->L }
% 3.61/0.79 ifeq(ifeq(ifeq(p0(b, X), true, ifeq(true, true, m1(b, X, b), true), true), true, ifeq(true, true, m1(e, b, b), true), true), true, l2(b, b), true)
% 3.61/0.79 = { by axiom 1 (axiom_5) R->L }
% 3.61/0.79 ifeq(ifeq(ifeq(p0(b, X), true, ifeq(s0(b), true, m1(b, X, b), true), true), true, ifeq(true, true, m1(e, b, b), true), true), true, l2(b, b), true)
% 3.61/0.79 = { by axiom 8 (rule_029) }
% 3.61/0.79 ifeq(ifeq(true, true, ifeq(true, true, m1(e, b, b), true), true), true, l2(b, b), true)
% 3.61/0.79 = { by axiom 6 (ifeq_axiom) }
% 3.61/0.79 ifeq(ifeq(true, true, m1(e, b, b), true), true, l2(b, b), true)
% 3.61/0.79 = { by axiom 6 (ifeq_axiom) }
% 3.61/0.79 ifeq(m1(e, b, b), true, l2(b, b), true)
% 3.61/0.79 = { by axiom 6 (ifeq_axiom) R->L }
% 3.61/0.79 ifeq(m1(e, b, b), true, ifeq(true, true, l2(b, b), true), true)
% 3.61/0.79 = { by axiom 6 (ifeq_axiom) R->L }
% 3.61/0.79 ifeq(m1(e, b, b), true, ifeq(true, true, ifeq(true, true, l2(b, b), true), true), true)
% 3.61/0.79 = { by axiom 3 (axiom_14) R->L }
% 3.61/0.79 ifeq(m1(e, b, b), true, ifeq(p0(b, b), true, ifeq(true, true, l2(b, b), true), true), true)
% 3.61/0.79 = { by axiom 5 (axiom_31) R->L }
% 3.61/0.79 ifeq(m1(e, b, b), true, ifeq(p0(b, b), true, ifeq(m0(b, b, e), true, l2(b, b), true), true), true)
% 3.61/0.79 = { by axiom 10 (rule_134) }
% 3.61/0.79 true
% 3.61/0.79 % SZS output end Proof
% 3.61/0.79
% 3.61/0.79 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------