%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CAT013-3 : 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 : n009.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:58 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.37s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 11 unt; 0 def)
% Number of atoms : 21 ( 8 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 10 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 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 : 10 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_domain_of_codomain_is_codomain,axiom,
domain(codomain(a)) != codomain(a),
file('theBenchmark.p',prove_domain_of_codomain_is_codomain) ).
cnf(c_7,plain,
domain(codomain(a)) != codomain(a),
inference(clausify,[status(thm)],[prove_domain_of_codomain_is_codomain]) ).
fof(assume_codomain_exists,axiom,
there_exists(codomain(a)),
file('theBenchmark.p',assume_codomain_exists) ).
cnf(c_8,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_15,plain,
compose(codomain(A),A) = A,
inference(clausify,[status(thm)],[compose_codomain]) ).
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_21,plain,
( domain(A) = codomain(B)
| ~ there_exists(compose(A,B)) ),
inference(clausify,[status(thm)],[domain_codomain_composition1]) ).
cnf(c_22,plain,
( codomain(B) = domain(A)
| ~ there_exists(compose(A,B)) ),
inference(copy,[status(thm)],[c_21]) ).
fof(codomain_has_elements,axiom,
! [VAR_0] :
( there_exists(VAR_0)
| ~ there_exists(codomain(VAR_0)) ),
file('theBenchmark.p',codomain_has_elements) ).
cnf(c_24,plain,
( there_exists(A)
| ~ there_exists(codomain(A)) ),
inference(clausify,[status(thm)],[codomain_has_elements]) ).
cnf(c_45,plain,
codomain(a) != domain(codomain(a)),
inference(copy,[status(thm)],[c_7]) ).
cnf(c_46,plain,
~ there_exists(compose(codomain(a),a)),
inference(resolve,[status(thm)],[c_22,c_45]) ).
cnf(c_37,plain,
~ there_exists(a),
inference(paramod,[status(thm)],[c_15,c_46]) ).
cnf(c_47,plain,
there_exists(a),
inference(resolve,[status(thm)],[c_24,c_8]) ).
cnf(c_44,plain,
$false,
inference(resolve,[status(thm)],[c_37,c_47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT013-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n009.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 26 22:49:46 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35 % Process 1317813 was started by sandbox2 on n009,
% 0.09/0.35 % Sat Sep 26 22:49:46 2026
% 0.09/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.36
% 0.09/0.36 % From the command line: assign(max_seconds, 300).
% 0.09/0.37
% 0.09/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.37
% 0.09/0.37 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.09/0.37 % Length of proof is 8.
% 0.09/0.37 % Level of proof is 3.
% 0.09/0.37 % Maximum clause weight is 9.000.
% 0.09/0.37 % Given clauses 14.
% 0.09/0.37
% 0.09/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------