%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : CAT010-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n001.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 09:36:23 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.24s
% Output : Proof 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT010-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.16 % Computer : n001.cluster.edu
% 0.11/0.16 % Model : x86_64 x86_64
% 0.11/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.16 % Memory : 8046.5625MB
% 0.11/0.16 % OS : Linux 6.8.0-71-generic
% 0.11/0.16 % CPULimit : 300
% 0.11/0.16 % WCLimit : 300
% 0.11/0.16 % DateTime : Mon Sep 28 21:19:03 UTC 2026
% 0.11/0.17 % CPUTime :
% 0.11/0.17 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.24 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
% 0.11/0.24
% 0.11/0.24 % SZS status Unsatisfiable
% 0.11/0.24
% 0.11/0.24 % SZS output start Proof
% 0.11/0.24 Axiom 1 (ab_exists): there_exists(compose(a, b)) = true.
% 0.11/0.24 Axiom 2 (compose_codomain): compose(codomain(X), X) = X.
% 0.11/0.24 Axiom 3 (associativity_of_compose): compose(X, compose(Y, Z)) = compose(compose(X, Y), Z).
% 0.11/0.24 Axiom 4 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.11/0.24 Axiom 5 (ifeq_axiom): ifeq2(X, X, Y, Z) = Y.
% 0.11/0.24 Axiom 6 (domain_has_elements): ifeq(there_exists(domain(X)), true, there_exists(X), true) = true.
% 0.11/0.24 Axiom 7 (composition_implies_domain): ifeq(there_exists(compose(X, Y)), true, there_exists(domain(X)), true) = true.
% 0.11/0.24 Axiom 8 (domain_codomain_composition1): ifeq2(there_exists(compose(X, Y)), true, domain(X), codomain(Y)) = codomain(Y).
% 0.11/0.24
% 0.11/0.24 Lemma 9: compose(codomain(X), compose(X, Y)) = compose(X, Y).
% 0.11/0.24 Proof:
% 0.11/0.24 compose(codomain(X), compose(X, Y))
% 0.11/0.24 = { by axiom 3 (associativity_of_compose) }
% 0.11/0.24 compose(compose(codomain(X), X), Y)
% 0.11/0.24 = { by axiom 2 (compose_codomain) }
% 0.11/0.24 compose(X, Y)
% 0.11/0.24
% 0.11/0.24 Goal 1 (prove_codomain_of_ab_equals_codomain_of_a): codomain(compose(a, b)) = codomain(a).
% 0.11/0.24 Proof:
% 0.11/0.24 codomain(compose(a, b))
% 0.11/0.24 = { by axiom 8 (domain_codomain_composition1) R->L }
% 0.11/0.24 ifeq2(there_exists(compose(codomain(codomain(a)), compose(a, b))), true, domain(codomain(codomain(a))), codomain(compose(a, b)))
% 0.11/0.24 = { by lemma 9 R->L }
% 0.11/0.24 ifeq2(there_exists(compose(codomain(codomain(a)), compose(codomain(a), compose(a, b)))), true, domain(codomain(codomain(a))), codomain(compose(a, b)))
% 0.11/0.24 = { by lemma 9 }
% 0.11/0.24 ifeq2(there_exists(compose(codomain(a), compose(a, b))), true, domain(codomain(codomain(a))), codomain(compose(a, b)))
% 0.11/0.24 = { by lemma 9 }
% 0.11/0.24 ifeq2(there_exists(compose(a, b)), true, domain(codomain(codomain(a))), codomain(compose(a, b)))
% 0.11/0.24 = { by axiom 1 (ab_exists) }
% 0.11/0.24 ifeq2(true, true, domain(codomain(codomain(a))), codomain(compose(a, b)))
% 0.11/0.24 = { by axiom 5 (ifeq_axiom) }
% 0.11/0.24 domain(codomain(codomain(a)))
% 0.11/0.24 = { by axiom 5 (ifeq_axiom) R->L }
% 0.11/0.24 ifeq2(true, true, domain(codomain(codomain(a))), codomain(a))
% 0.11/0.24 = { by axiom 6 (domain_has_elements) R->L }
% 0.11/0.24 ifeq2(ifeq(there_exists(domain(a)), true, there_exists(a), true), true, domain(codomain(codomain(a))), codomain(a))
% 0.11/0.24 = { by axiom 4 (ifeq_axiom) R->L }
% 0.11/0.24 ifeq2(ifeq(ifeq(true, true, there_exists(domain(a)), true), true, there_exists(a), true), true, domain(codomain(codomain(a))), codomain(a))
% 0.11/0.24 = { by axiom 1 (ab_exists) R->L }
% 0.11/0.24 ifeq2(ifeq(ifeq(there_exists(compose(a, b)), true, there_exists(domain(a)), true), true, there_exists(a), true), true, domain(codomain(codomain(a))), codomain(a))
% 0.11/0.24 = { by axiom 7 (composition_implies_domain) }
% 0.11/0.24 ifeq2(ifeq(true, true, there_exists(a), true), true, domain(codomain(codomain(a))), codomain(a))
% 0.11/0.24 = { by axiom 4 (ifeq_axiom) }
% 0.11/0.24 ifeq2(there_exists(a), true, domain(codomain(codomain(a))), codomain(a))
% 0.11/0.24 = { by axiom 2 (compose_codomain) R->L }
% 0.11/0.24 ifeq2(there_exists(compose(codomain(a), a)), true, domain(codomain(codomain(a))), codomain(a))
% 0.11/0.24 = { by lemma 9 R->L }
% 0.11/0.24 ifeq2(there_exists(compose(codomain(codomain(a)), compose(codomain(a), a))), true, domain(codomain(codomain(a))), codomain(a))
% 0.11/0.24 = { by axiom 2 (compose_codomain) }
% 0.11/0.24 ifeq2(there_exists(compose(codomain(codomain(a)), a)), true, domain(codomain(codomain(a))), codomain(a))
% 0.11/0.24 = { by axiom 8 (domain_codomain_composition1) }
% 0.11/0.24 codomain(a)
% 0.11/0.24 % SZS output end Proof
% 0.11/0.24
% 0.11/0.24 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------