%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SYN182-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:15 PM UTC 2026
% Result : Unsatisfiable 7.39s 1.31s
% Output : Proof 7.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN182-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.18 % Computer : n019.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Mon Sep 28 15:37:48 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.39/1.31 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 7.39/1.31
% 7.39/1.31 % SZS status Unsatisfiable
% 7.39/1.31
% 7.39/1.32 % SZS output start Proof
% 7.39/1.32 Axiom 1 (axiom_14): p0(b, X) = true.
% 7.39/1.32 Axiom 2 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 7.39/1.32 Axiom 3 (rule_324): ifeq(l4(X), true, q5(X, X), true) = true.
% 7.39/1.32 Axiom 4 (rule_244): ifeq(n2(X), true, p3(X, X, X), true) = true.
% 7.39/1.32 Axiom 5 (rule_137): ifeq(p1(X, Y, Z), true, n2(Z), true) = true.
% 7.39/1.32 Axiom 6 (rule_277): ifeq(p3(X, Y, Z), true, l4(Z), true) = true.
% 7.39/1.32 Axiom 7 (rule_085): ifeq(p0(X, Y), true, p1(Y, Y, Y), true) = true.
% 7.39/1.32
% 7.39/1.32 Goal 1 (prove_this): q5(X, c) = true.
% 7.39/1.32 The goal is true when:
% 7.39/1.32 X = c
% 7.39/1.32
% 7.39/1.32 Proof:
% 7.39/1.32 q5(c, c)
% 7.39/1.32 = { by axiom 2 (ifeq_axiom) R->L }
% 7.39/1.32 ifeq(true, true, q5(c, c), true)
% 7.39/1.32 = { by axiom 6 (rule_277) R->L }
% 7.39/1.32 ifeq(ifeq(p3(c, c, c), true, l4(c), true), true, q5(c, c), true)
% 7.39/1.32 = { by axiom 2 (ifeq_axiom) R->L }
% 7.39/1.32 ifeq(ifeq(ifeq(true, true, p3(c, c, c), true), true, l4(c), true), true, q5(c, c), true)
% 7.39/1.32 = { by axiom 5 (rule_137) R->L }
% 7.39/1.32 ifeq(ifeq(ifeq(ifeq(p1(c, c, c), true, n2(c), true), true, p3(c, c, c), true), true, l4(c), true), true, q5(c, c), true)
% 7.39/1.32 = { by axiom 2 (ifeq_axiom) R->L }
% 7.39/1.32 ifeq(ifeq(ifeq(ifeq(ifeq(true, true, p1(c, c, c), true), true, n2(c), true), true, p3(c, c, c), true), true, l4(c), true), true, q5(c, c), true)
% 7.39/1.32 = { by axiom 1 (axiom_14) R->L }
% 7.39/1.32 ifeq(ifeq(ifeq(ifeq(ifeq(p0(b, c), true, p1(c, c, c), true), true, n2(c), true), true, p3(c, c, c), true), true, l4(c), true), true, q5(c, c), true)
% 7.39/1.32 = { by axiom 7 (rule_085) }
% 7.39/1.32 ifeq(ifeq(ifeq(ifeq(true, true, n2(c), true), true, p3(c, c, c), true), true, l4(c), true), true, q5(c, c), true)
% 7.39/1.32 = { by axiom 2 (ifeq_axiom) }
% 7.39/1.32 ifeq(ifeq(ifeq(n2(c), true, p3(c, c, c), true), true, l4(c), true), true, q5(c, c), true)
% 7.39/1.32 = { by axiom 4 (rule_244) }
% 7.39/1.32 ifeq(ifeq(true, true, l4(c), true), true, q5(c, c), true)
% 7.39/1.32 = { by axiom 2 (ifeq_axiom) }
% 7.39/1.32 ifeq(l4(c), true, q5(c, c), true)
% 7.39/1.32 = { by axiom 3 (rule_324) }
% 7.39/1.32 true
% 7.39/1.32 % SZS output end Proof
% 7.39/1.32
% 7.39/1.32 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------