%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CAT014-2 : 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 : n018.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:42 PM UTC 2026
% Result : Unsatisfiable 1.26s 1.70s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 3 RR)
% Number of literals : 8 ( 7 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(codomain_of_domain_is_domain,axiom,
codomain(domain(X1)) = domain(X1),
file('/export/starexec/sandbox/benchmark/Axioms/CAT002-0.ax',codomain_of_domain_is_domain) ).
cnf(domain_of_codomain_is_codomain,axiom,
domain(codomain(X1)) = codomain(X1),
file('/export/starexec/sandbox/benchmark/Axioms/CAT002-0.ax',domain_of_codomain_is_codomain) ).
cnf(prove_codomain_is_idempotent,negated_conjecture,
codomain(codomain(a)) != codomain(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_codomain_is_idempotent) ).
cnf(c_0_3,axiom,
codomain(domain(X1)) = domain(X1),
codomain_of_domain_is_domain ).
cnf(c_0_4,axiom,
domain(codomain(X1)) = codomain(X1),
domain_of_codomain_is_codomain ).
cnf(c_0_5,negated_conjecture,
codomain(codomain(a)) != codomain(a),
prove_codomain_is_idempotent ).
cnf(c_0_6,plain,
codomain(codomain(X1)) = codomain(X1),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : CAT014-2 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.11 % 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.31 % Computer : n018.cluster.edu
% 0.15/0.31 % Model : x86_64 x86_64
% 0.15/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.31 % Memory : 8042.1875MB
% 0.15/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.31 % CPULimit : 300
% 0.15/0.31 % WCLimit : 300
% 0.15/0.31 % DateTime : Tue May 5 10:49:32 EDT 2026
% 0.15/0.31 % CPUTime :
% 0.15/0.32 % start to proof: theBenchmark
% 1.26/1.70 % Version : CSE_E---1.7
% 1.26/1.70 % Problem : theBenchmark.p
% 1.26/1.70 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.70 % SZS output start CNFRefutation
% See solution above
% 1.26/1.70 % Total time : 1.369s
%------------------------------------------------------------------------------