%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SYN263-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:25 PM UTC 2026
% Result : Unsatisfiable 6.10s 1.14s
% Output : Proof 6.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN263-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:42:56 UTC 2026
% 0.06/0.18 % CPUTime :
% 0.06/0.18 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.10/1.14 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-regeneralise
% 6.10/1.14
% 6.10/1.14 % SZS status Unsatisfiable
% 6.10/1.14
% 6.10/1.14 % SZS output start Proof
% 6.10/1.14 Axiom 1 (axiom_20): l0(a) = true.
% 6.10/1.14 Axiom 2 (axiom_12): m0(a, X, a) = true.
% 6.10/1.14 Axiom 3 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 6.10/1.14 Axiom 4 (rule_088): ifeq(l0(a), true, p1(a, a, a), true) = true.
% 6.10/1.14 Axiom 5 (rule_082): ifeq(p1(X, Y, Z), true, ifeq(m0(X, Y, Z), true, p1(Y, W, X), true), true) = true.
% 6.10/1.14
% 6.10/1.14 Goal 1 (prove_this): p1(d, d, a) = true.
% 6.10/1.14 Proof:
% 6.10/1.14 p1(d, d, a)
% 6.10/1.14 = { by axiom 3 (ifeq_axiom) R->L }
% 6.10/1.14 ifeq(true, true, p1(d, d, a), true)
% 6.10/1.14 = { by axiom 2 (axiom_12) R->L }
% 6.10/1.14 ifeq(m0(a, d, a), true, p1(d, d, a), true)
% 6.10/1.14 = { by axiom 3 (ifeq_axiom) R->L }
% 6.10/1.14 ifeq(true, true, ifeq(m0(a, d, a), true, p1(d, d, a), true), true)
% 6.10/1.14 = { by axiom 5 (rule_082) R->L }
% 6.10/1.14 ifeq(ifeq(p1(a, a, a), true, ifeq(m0(a, a, a), true, p1(a, d, a), true), true), true, ifeq(m0(a, d, a), true, p1(d, d, a), true), true)
% 6.10/1.14 = { by axiom 3 (ifeq_axiom) R->L }
% 6.10/1.14 ifeq(ifeq(ifeq(true, true, p1(a, a, a), true), true, ifeq(m0(a, a, a), true, p1(a, d, a), true), true), true, ifeq(m0(a, d, a), true, p1(d, d, a), true), true)
% 6.10/1.14 = { by axiom 1 (axiom_20) R->L }
% 6.10/1.14 ifeq(ifeq(ifeq(l0(a), true, p1(a, a, a), true), true, ifeq(m0(a, a, a), true, p1(a, d, a), true), true), true, ifeq(m0(a, d, a), true, p1(d, d, a), true), true)
% 6.10/1.14 = { by axiom 4 (rule_088) }
% 6.10/1.14 ifeq(ifeq(true, true, ifeq(m0(a, a, a), true, p1(a, d, a), true), true), true, ifeq(m0(a, d, a), true, p1(d, d, a), true), true)
% 6.10/1.14 = { by axiom 3 (ifeq_axiom) }
% 6.10/1.14 ifeq(ifeq(m0(a, a, a), true, p1(a, d, a), true), true, ifeq(m0(a, d, a), true, p1(d, d, a), true), true)
% 6.10/1.14 = { by axiom 2 (axiom_12) }
% 6.10/1.14 ifeq(ifeq(true, true, p1(a, d, a), true), true, ifeq(m0(a, d, a), true, p1(d, d, a), true), true)
% 6.10/1.14 = { by axiom 3 (ifeq_axiom) }
% 6.10/1.14 ifeq(p1(a, d, a), true, ifeq(m0(a, d, a), true, p1(d, d, a), true), true)
% 6.10/1.14 = { by axiom 5 (rule_082) }
% 6.10/1.14 true
% 6.10/1.14 % SZS output end Proof
% 6.10/1.14
% 6.10/1.14 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------