%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SYN249-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.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:24 PM UTC 2026
% Result : Unsatisfiable 7.13s 1.18s
% Output : Proof 7.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN249-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.16 % Computer : n008.cluster.edu
% 0.08/0.16 % Model : x86_64 x86_64
% 0.08/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16 % Memory : 8046.5625MB
% 0.08/0.16 % OS : Linux 6.8.0-71-generic
% 0.08/0.16 % CPULimit : 300
% 0.08/0.16 % WCLimit : 300
% 0.08/0.16 % DateTime : Mon Sep 28 15:39:55 UTC 2026
% 0.08/0.16 % CPUTime :
% 0.08/0.16 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.13/1.18 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 7.13/1.18
% 7.13/1.18 % SZS status Unsatisfiable
% 7.13/1.18
% 7.13/1.18 % SZS output start Proof
% 7.13/1.18 Axiom 1 (axiom_17): q0(X, d) = true.
% 7.13/1.18 Axiom 2 (axiom_37): n0(b, a) = true.
% 7.13/1.18 Axiom 3 (axiom_30): n0(e, e) = true.
% 7.13/1.18 Axiom 4 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 7.13/1.18 Axiom 5 (rule_001): ifeq(n0(X, Y), true, k1(Y), true) = true.
% 7.13/1.18 Axiom 6 (rule_034): ifeq(k1(a), true, ifeq(k1(X), true, ifeq(q0(Y, Y), true, m1(Y, X, X), true), true), true) = true.
% 7.13/1.18
% 7.13/1.18 Goal 1 (prove_this): m1(d, e, e) = true.
% 7.13/1.18 Proof:
% 7.13/1.18 m1(d, e, e)
% 7.13/1.18 = { by axiom 4 (ifeq_axiom) R->L }
% 7.13/1.18 ifeq(true, true, m1(d, e, e), true)
% 7.13/1.18 = { by axiom 1 (axiom_17) R->L }
% 7.13/1.18 ifeq(q0(d, d), true, m1(d, e, e), true)
% 7.13/1.18 = { by axiom 4 (ifeq_axiom) R->L }
% 7.13/1.18 ifeq(true, true, ifeq(q0(d, d), true, m1(d, e, e), true), true)
% 7.13/1.18 = { by axiom 4 (ifeq_axiom) R->L }
% 7.13/1.18 ifeq(true, true, ifeq(true, true, ifeq(q0(d, d), true, m1(d, e, e), true), true), true)
% 7.13/1.19 = { by axiom 5 (rule_001) R->L }
% 7.13/1.19 ifeq(ifeq(n0(b, a), true, k1(a), true), true, ifeq(true, true, ifeq(q0(d, d), true, m1(d, e, e), true), true), true)
% 7.13/1.19 = { by axiom 2 (axiom_37) }
% 7.13/1.19 ifeq(ifeq(true, true, k1(a), true), true, ifeq(true, true, ifeq(q0(d, d), true, m1(d, e, e), true), true), true)
% 7.13/1.19 = { by axiom 4 (ifeq_axiom) }
% 7.13/1.19 ifeq(k1(a), true, ifeq(true, true, ifeq(q0(d, d), true, m1(d, e, e), true), true), true)
% 7.13/1.19 = { by axiom 5 (rule_001) R->L }
% 7.13/1.19 ifeq(k1(a), true, ifeq(ifeq(n0(e, e), true, k1(e), true), true, ifeq(q0(d, d), true, m1(d, e, e), true), true), true)
% 7.13/1.19 = { by axiom 3 (axiom_30) }
% 7.13/1.19 ifeq(k1(a), true, ifeq(ifeq(true, true, k1(e), true), true, ifeq(q0(d, d), true, m1(d, e, e), true), true), true)
% 7.13/1.19 = { by axiom 4 (ifeq_axiom) }
% 7.13/1.19 ifeq(k1(a), true, ifeq(k1(e), true, ifeq(q0(d, d), true, m1(d, e, e), true), true), true)
% 7.13/1.19 = { by axiom 6 (rule_034) }
% 7.13/1.19 true
% 7.13/1.19 % SZS output end Proof
% 7.13/1.19
% 7.13/1.19 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------