%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CAT014-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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 : Sun Sep 27 06:55:59 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.40s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 14 unt; 0 def)
% Number of atoms : 30 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_codomain_is_idempotent,axiom,
codomain(codomain(a)) != codomain(a),
file('theBenchmark.p',prove_codomain_is_idempotent) ).
cnf(c_4,plain,
codomain(codomain(a)) != codomain(a),
inference(clausify,[status(thm)],[prove_codomain_is_idempotent]) ).
fof(assume_codomain_exists,axiom,
there_exists(codomain(a)),
file('theBenchmark.p',assume_codomain_exists) ).
cnf(c_5,plain,
there_exists(codomain(a)),
inference(clausify,[status(thm)],[assume_codomain_exists]) ).
fof(compose_codomain,axiom,
! [VAR_0] : compose(codomain(VAR_0),VAR_0) = VAR_0,
file('theBenchmark.p',compose_codomain) ).
cnf(c_6,plain,
compose(codomain(A),A) = A,
inference(clausify,[status(thm)],[compose_codomain]) ).
fof(compose_domain,axiom,
! [VAR_0] : compose(VAR_0,domain(VAR_0)) = VAR_0,
file('theBenchmark.p',compose_domain) ).
cnf(c_7,plain,
compose(A,domain(A)) = A,
inference(clausify,[status(thm)],[compose_domain]) ).
fof(domain_codomain_composition1,axiom,
! [VAR_0,VAR_1] :
( domain(VAR_0) = codomain(VAR_1)
| ~ there_exists(compose(VAR_0,VAR_1)) ),
file('theBenchmark.p',domain_codomain_composition1) ).
cnf(c_12,plain,
( domain(A) = codomain(B)
| ~ there_exists(compose(A,B)) ),
inference(clausify,[status(thm)],[domain_codomain_composition1]) ).
cnf(c_13,plain,
( codomain(B) = domain(A)
| ~ there_exists(compose(A,B)) ),
inference(copy,[status(thm)],[c_12]) ).
fof(codomain_has_elements,axiom,
! [VAR_0] :
( there_exists(VAR_0)
| ~ there_exists(codomain(VAR_0)) ),
file('theBenchmark.p',codomain_has_elements) ).
cnf(c_15,plain,
( there_exists(A)
| ~ there_exists(codomain(A)) ),
inference(clausify,[status(thm)],[codomain_has_elements]) ).
cnf(c_100,plain,
( codomain(A) = domain(codomain(A))
| ~ there_exists(A) ),
inference(paramod,[status(thm)],[c_6,c_13]) ).
cnf(c_20,plain,
( domain(codomain(A)) = codomain(A)
| ~ there_exists(A) ),
inference(copy,[status(thm)],[c_100]) ).
cnf(c_21,plain,
( codomain(domain(A)) = domain(A)
| ~ there_exists(A) ),
inference(paramod,[status(thm)],[c_7,c_13]) ).
cnf(c_26,plain,
there_exists(a),
inference(resolve,[status(thm)],[c_15,c_5]) ).
cnf(c_69,plain,
domain(codomain(a)) = codomain(a),
inference(resolve,[status(thm)],[c_20,c_26]) ).
cnf(c_101,plain,
codomain(domain(codomain(a))) = domain(codomain(a)),
inference(resolve,[status(thm)],[c_21,c_5]) ).
cnf(c_102,plain,
codomain(codomain(a)) = domain(codomain(a)),
inference(paramod,[status(thm)],[c_69,c_101]) ).
cnf(c_98,plain,
codomain(codomain(a)) = codomain(a),
inference(paramod,[status(thm)],[c_69,c_102]) ).
cnf(c_99,plain,
$false,
inference(resolve,[status(thm)],[c_98,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT014-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 22:49:46 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.38 % Process 1746079 was started by sandbox2 on n011,
% 0.10/0.38 % Sat Sep 26 22:49:46 2026
% 0.10/0.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 0.10/0.40
% 0.10/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.40
% 0.10/0.40 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.10/0.40 % Length of proof is 13.
% 0.10/0.40 % Level of proof is 5.
% 0.10/0.40 % Maximum clause weight is 9.000.
% 0.10/0.40 % Given clauses 31.
% 0.10/0.40
% 0.10/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------