%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SYN230-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n007.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:21 PM UTC 2026
% Result : Unsatisfiable 3.74s 0.74s
% Output : Proof 3.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN230-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 : n007.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:36:55 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.74/0.74 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 3.74/0.74
% 3.74/0.74 % SZS status Unsatisfiable
% 3.74/0.74
% 3.74/0.74 % SZS output start Proof
% 3.74/0.74 Axiom 1 (axiom_24): l0(c) = true.
% 3.74/0.74 Axiom 2 (axiom_14): p0(b, X) = true.
% 3.74/0.74 Axiom 3 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 3.74/0.74 Axiom 4 (rule_020): ifeq(l0(c), true, m1(c, c, c), true) = true.
% 3.74/0.74 Axiom 5 (rule_085): ifeq(p0(X, Y), true, p1(Y, Y, Y), true) = true.
% 3.74/0.74 Axiom 6 (rule_150): ifeq(m1(X, X, Y), true, p2(Y, Y, Y), true) = true.
% 3.74/0.74 Axiom 7 (rule_216): ifeq(p2(X, Y, Z), true, ifeq(p1(Z, Z, X), true, l3(Z, Z), true), true) = true.
% 3.74/0.74
% 3.74/0.74 Goal 1 (prove_this): l3(c, c) = true.
% 3.74/0.74 Proof:
% 3.74/0.74 l3(c, c)
% 3.74/0.74 = { by axiom 3 (ifeq_axiom) R->L }
% 3.74/0.74 ifeq(true, true, l3(c, c), true)
% 3.74/0.74 = { by axiom 5 (rule_085) R->L }
% 3.74/0.74 ifeq(ifeq(p0(b, c), true, p1(c, c, c), true), true, l3(c, c), true)
% 3.74/0.74 = { by axiom 2 (axiom_14) }
% 3.74/0.74 ifeq(ifeq(true, true, p1(c, c, c), true), true, l3(c, c), true)
% 3.74/0.74 = { by axiom 3 (ifeq_axiom) }
% 3.74/0.74 ifeq(p1(c, c, c), true, l3(c, c), true)
% 3.74/0.74 = { by axiom 3 (ifeq_axiom) R->L }
% 3.74/0.74 ifeq(true, true, ifeq(p1(c, c, c), true, l3(c, c), true), true)
% 3.74/0.74 = { by axiom 6 (rule_150) R->L }
% 3.74/0.74 ifeq(ifeq(m1(c, c, c), true, p2(c, c, c), true), true, ifeq(p1(c, c, c), true, l3(c, c), true), true)
% 3.74/0.74 = { by axiom 3 (ifeq_axiom) R->L }
% 3.74/0.74 ifeq(ifeq(ifeq(true, true, m1(c, c, c), true), true, p2(c, c, c), true), true, ifeq(p1(c, c, c), true, l3(c, c), true), true)
% 3.74/0.74 = { by axiom 1 (axiom_24) R->L }
% 3.74/0.74 ifeq(ifeq(ifeq(l0(c), true, m1(c, c, c), true), true, p2(c, c, c), true), true, ifeq(p1(c, c, c), true, l3(c, c), true), true)
% 3.74/0.74 = { by axiom 4 (rule_020) }
% 3.74/0.74 ifeq(ifeq(true, true, p2(c, c, c), true), true, ifeq(p1(c, c, c), true, l3(c, c), true), true)
% 3.74/0.74 = { by axiom 3 (ifeq_axiom) }
% 3.74/0.74 ifeq(p2(c, c, c), true, ifeq(p1(c, c, c), true, l3(c, c), true), true)
% 3.74/0.74 = { by axiom 7 (rule_216) }
% 3.74/0.74 true
% 3.74/0.74 % SZS output end Proof
% 3.74/0.74
% 3.74/0.74 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------