%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SYN147-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n019.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:11 PM UTC 2026
% Result : Unsatisfiable 4.47s 0.87s
% Output : Proof 4.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN147-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.17 % Computer : n019.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Mon Sep 28 15:37:03 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.47/0.87 Command-line arguments: --flatten --complete-subsets
% 4.47/0.87
% 4.47/0.87 % SZS status Unsatisfiable
% 4.47/0.87
% 4.47/0.87 % SZS output start Proof
% 4.47/0.87 Axiom 1 (axiom_13): r0(e) = true.
% 4.47/0.87 Axiom 2 (axiom_1): s0(d) = true.
% 4.47/0.87 Axiom 3 (axiom_17): q0(X, d) = true.
% 4.47/0.87 Axiom 4 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 4.47/0.87 Axiom 5 (rule_045): ifeq(q0(d, d), true, n1(d, d, d), true) = true.
% 4.47/0.87
% 4.47/0.87 Lemma 6: s0(d) = r0(e).
% 4.47/0.87 Proof:
% 4.47/0.87 s0(d)
% 4.47/0.87 = { by axiom 2 (axiom_1) }
% 4.47/0.87 true
% 4.47/0.87 = { by axiom 1 (axiom_13) R->L }
% 4.47/0.87 r0(e)
% 4.47/0.87
% 4.47/0.87 Goal 1 (prove_this): n1(X, d, X) = true.
% 4.47/0.87 The goal is true when:
% 4.47/0.87 X = d
% 4.47/0.87
% 4.47/0.87 Proof:
% 4.47/0.87 n1(d, d, d)
% 4.47/0.87 = { by axiom 4 (ifeq_axiom) R->L }
% 4.47/0.87 ifeq(s0(d), s0(d), n1(d, d, d), s0(d))
% 4.47/0.87 = { by lemma 6 }
% 4.47/0.87 ifeq(s0(d), r0(e), n1(d, d, d), s0(d))
% 4.47/0.87 = { by lemma 6 }
% 4.47/0.87 ifeq(s0(d), r0(e), n1(d, d, d), r0(e))
% 4.47/0.87 = { by axiom 1 (axiom_13) }
% 4.47/0.87 ifeq(s0(d), true, n1(d, d, d), r0(e))
% 4.47/0.87 = { by axiom 1 (axiom_13) }
% 4.47/0.87 ifeq(s0(d), true, n1(d, d, d), true)
% 4.47/0.87 = { by lemma 6 }
% 4.47/0.87 ifeq(r0(e), true, n1(d, d, d), true)
% 4.47/0.87 = { by axiom 1 (axiom_13) }
% 4.47/0.87 ifeq(true, true, n1(d, d, d), true)
% 4.47/0.87 = { by axiom 3 (axiom_17) R->L }
% 4.47/0.87 ifeq(q0(d, d), true, n1(d, d, d), true)
% 4.47/0.87 = { by axiom 5 (rule_045) }
% 4.47/0.87 true
% 4.47/0.87 = { by axiom 1 (axiom_13) R->L }
% 4.47/0.87 r0(e)
% 4.47/0.87 = { by lemma 6 R->L }
% 4.47/0.87 s0(d)
% 4.47/0.87 = { by lemma 6 }
% 4.47/0.87 r0(e)
% 4.47/0.87 = { by axiom 1 (axiom_13) }
% 4.47/0.87 true
% 4.47/0.87 % SZS output end Proof
% 4.47/0.87
% 4.47/0.87 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------