%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CAT005-3 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:11:39 PM UTC 2026
% Result : Unsatisfiable 1.23s 1.71s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 12 unt; 0 nHn; 19 RR)
% Number of literals : 30 ( 11 equ; 12 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(xd_equals_x,hypothesis,
( compose(X1,d) = X1
| ~ there_exists(compose(X1,d)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xd_equals_x) ).
cnf(ad_exists,hypothesis,
there_exists(compose(a,d)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ad_exists) ).
cnf(compose_codomain,axiom,
compose(codomain(X1),X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',compose_codomain) ).
cnf(domain_codomain_composition1,axiom,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',domain_codomain_composition1) ).
cnf(composition_implies_domain,axiom,
( there_exists(domain(X1))
| ~ there_exists(compose(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',composition_implies_domain) ).
cnf(prove_domain_of_a_is_d,negated_conjecture,
domain(a) != d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_of_a_is_d) ).
cnf(codomain_has_elements,axiom,
( there_exists(X1)
| ~ there_exists(codomain(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',codomain_has_elements) ).
cnf(c_0_7,hypothesis,
( compose(X1,d) = X1
| ~ there_exists(compose(X1,d)) ),
xd_equals_x ).
cnf(c_0_8,hypothesis,
there_exists(compose(a,d)),
ad_exists ).
cnf(c_0_9,hypothesis,
compose(a,d) = a,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
compose(codomain(X1),X1) = X1,
compose_codomain ).
cnf(c_0_11,axiom,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
domain_codomain_composition1 ).
cnf(c_0_12,hypothesis,
there_exists(a),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,axiom,
( there_exists(domain(X1))
| ~ there_exists(compose(X1,X2)) ),
composition_implies_domain ).
cnf(c_0_14,hypothesis,
( codomain(d) = d
| ~ there_exists(d) ),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_15,hypothesis,
codomain(d) = domain(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_12])]) ).
cnf(c_0_16,negated_conjecture,
domain(a) != d,
prove_domain_of_a_is_d ).
cnf(c_0_17,axiom,
( there_exists(X1)
| ~ there_exists(codomain(X1)) ),
codomain_has_elements ).
cnf(c_0_18,hypothesis,
there_exists(domain(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_9]),c_0_12])]) ).
cnf(c_0_19,hypothesis,
~ there_exists(d),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_18])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CAT005-3 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n001.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 10:47:33 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.23/1.71 % Version : CSE_E---1.7
% 1.23/1.71 % Problem : theBenchmark.p
% 1.23/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.71 % SZS output start CNFRefutation
% See solution above
% 1.23/1.71 % Total time : 1.373s
%------------------------------------------------------------------------------