%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CAT006-3 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n011.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.26s 1.73s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 13 unt; 0 nHn; 19 RR)
% Number of literals : 29 ( 11 equ; 11 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(dx_equals_x,hypothesis,
( compose(d,X1) = X1
| ~ there_exists(compose(d,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dx_equals_x) ).
cnf(da_exists,hypothesis,
there_exists(compose(d,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',da_exists) ).
cnf(domain_codomain_composition1,axiom,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',domain_codomain_composition1) ).
cnf(compose_domain,axiom,
compose(X1,domain(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',compose_domain) ).
cnf(composition_implies_codomain,axiom,
( there_exists(codomain(X1))
| ~ there_exists(compose(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',composition_implies_codomain) ).
cnf(prove_codomain_of_a_is_d,negated_conjecture,
codomain(a) != d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_a_is_d) ).
cnf(codomain_has_elements,axiom,
( there_exists(X1)
| ~ there_exists(codomain(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',codomain_has_elements) ).
cnf(c_0_7,hypothesis,
( compose(d,X1) = X1
| ~ there_exists(compose(d,X1)) ),
dx_equals_x ).
cnf(c_0_8,hypothesis,
there_exists(compose(d,a)),
da_exists ).
cnf(c_0_9,hypothesis,
compose(d,a) = a,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
domain_codomain_composition1 ).
cnf(c_0_11,hypothesis,
there_exists(a),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
compose(X1,domain(X1)) = X1,
compose_domain ).
cnf(c_0_13,hypothesis,
domain(d) = codomain(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11])]) ).
cnf(c_0_14,axiom,
( there_exists(codomain(X1))
| ~ there_exists(compose(X1,X2)) ),
composition_implies_codomain ).
cnf(c_0_15,hypothesis,
compose(d,codomain(a)) = d,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
codomain(a) != d,
prove_codomain_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(codomain(d)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_9]),c_0_11])]) ).
cnf(c_0_19,hypothesis,
~ there_exists(d),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_16]) ).
cnf(c_0_20,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CAT006-3 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.34 % Computer : n011.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue May 5 10:46:32 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.26/1.73 % Version : CSE_E---1.7
% 1.26/1.73 % Problem : theBenchmark.p
% 1.26/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.73 % SZS output start CNFRefutation
% See solution above
% 1.26/1.73 % Total time : 1.374s
%------------------------------------------------------------------------------