%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SYN248-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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:23 PM UTC 2026
% Result : Unsatisfiable 9.52s 1.59s
% Output : Proof 9.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN248-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.21 % Computer : n017.cluster.edu
% 0.06/0.21 % Model : x86_64 x86_64
% 0.06/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.21 % Memory : 8046.5625MB
% 0.06/0.21 % OS : Linux 6.8.0-71-generic
% 0.06/0.21 % CPULimit : 300
% 0.06/0.21 % WCLimit : 300
% 0.06/0.21 % DateTime : Mon Sep 28 15:34:37 UTC 2026
% 0.06/0.21 % CPUTime :
% 0.06/0.21 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.52/1.59 Command-line arguments: --no-flatten-goal
% 9.52/1.59
% 9.52/1.59 % SZS status Unsatisfiable
% 9.52/1.59
% 9.52/1.59 % SZS output start Proof
% 9.52/1.59 Axiom 1 (axiom_26): n0(d, c) = true.
% 9.52/1.59 Axiom 2 (axiom_37): n0(b, a) = true.
% 9.52/1.59 Axiom 3 (axiom_17): q0(X, d) = true.
% 9.52/1.59 Axiom 4 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 9.52/1.59 Axiom 5 (rule_001): ifeq(n0(X, Y), true, k1(Y), true) = true.
% 9.52/1.59 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.
% 9.52/1.59
% 9.52/1.59 Goal 1 (prove_this): m1(d, c, c) = true.
% 9.52/1.59 Proof:
% 9.52/1.59 m1(d, c, c)
% 9.52/1.59 = { by axiom 4 (ifeq_axiom) R->L }
% 9.52/1.59 ifeq(true, true, m1(d, c, c), true)
% 9.52/1.59 = { by axiom 5 (rule_001) R->L }
% 9.52/1.59 ifeq(ifeq(n0(d, c), true, k1(c), true), true, m1(d, c, c), true)
% 9.52/1.59 = { by axiom 1 (axiom_26) }
% 9.52/1.59 ifeq(ifeq(true, true, k1(c), true), true, m1(d, c, c), true)
% 9.52/1.59 = { by axiom 4 (ifeq_axiom) }
% 9.52/1.59 ifeq(k1(c), true, m1(d, c, c), true)
% 9.52/1.59 = { by axiom 4 (ifeq_axiom) R->L }
% 9.52/1.59 ifeq(k1(c), true, ifeq(true, true, m1(d, c, c), true), true)
% 9.52/1.59 = { by axiom 4 (ifeq_axiom) R->L }
% 9.52/1.59 ifeq(true, true, ifeq(k1(c), true, ifeq(true, true, m1(d, c, c), true), true), true)
% 9.52/1.59 = { by axiom 5 (rule_001) R->L }
% 9.52/1.59 ifeq(ifeq(n0(b, a), true, k1(a), true), true, ifeq(k1(c), true, ifeq(true, true, m1(d, c, c), true), true), true)
% 9.52/1.59 = { by axiom 2 (axiom_37) }
% 9.52/1.59 ifeq(ifeq(true, true, k1(a), true), true, ifeq(k1(c), true, ifeq(true, true, m1(d, c, c), true), true), true)
% 9.52/1.59 = { by axiom 4 (ifeq_axiom) }
% 9.52/1.59 ifeq(k1(a), true, ifeq(k1(c), true, ifeq(true, true, m1(d, c, c), true), true), true)
% 9.52/1.59 = { by axiom 3 (axiom_17) R->L }
% 9.52/1.59 ifeq(k1(a), true, ifeq(k1(c), true, ifeq(q0(d, d), true, m1(d, c, c), true), true), true)
% 9.52/1.59 = { by axiom 6 (rule_034) }
% 9.52/1.59 true
% 9.52/1.59 % SZS output end Proof
% 9.52/1.59
% 9.52/1.59 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------