%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : CAT017-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n019.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 : Wed Aug 30 18:14:12 EDT 2023

% Result   : Unsatisfiable 0.21s 0.57s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   17 (   7 unt;   7 typ;   0 def)
%            Number of atoms       :   13 (   2 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    8 (   5   ~;   3   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   6   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :    7 (   2 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    equivalent: ( $i * $i ) > $o ).

tff(decl_23,type,
    there_exists: $i > $o ).

tff(decl_24,type,
    domain: $i > $i ).

tff(decl_25,type,
    codomain: $i > $i ).

tff(decl_26,type,
    compose: ( $i * $i ) > $i ).

tff(decl_27,type,
    f1: ( $i * $i ) > $i ).

tff(decl_28,type,
    a: $i ).

cnf(composition_implies_codomain,axiom,
    ( there_exists(codomain(X1))
    | ~ there_exists(compose(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',composition_implies_codomain) ).

cnf(compose_domain,axiom,
    compose(X1,domain(X1)) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',compose_domain) ).

cnf(prove_codomain_of_a_exists,negated_conjecture,
    ~ there_exists(codomain(a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_codomain_of_a_exists) ).

cnf(assume_a_exists,hypothesis,
    there_exists(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assume_a_exists) ).

cnf(c_0_4,axiom,
    ( there_exists(codomain(X1))
    | ~ there_exists(compose(X1,X2)) ),
    composition_implies_codomain ).

cnf(c_0_5,axiom,
    compose(X1,domain(X1)) = X1,
    compose_domain ).

cnf(c_0_6,negated_conjecture,
    ~ there_exists(codomain(a)),
    prove_codomain_of_a_exists ).

cnf(c_0_7,plain,
    ( there_exists(codomain(X1))
    | ~ there_exists(X1) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,hypothesis,
    there_exists(a),
    assume_a_exists ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : CAT017-3 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n019.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun Aug 27 00:36:13 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.56  start to proof: theBenchmark
% 0.21/0.57  % Version  : CSE_E---1.5
% 0.21/0.57  % Problem  : theBenchmark.p
% 0.21/0.57  % Proof found
% 0.21/0.57  % SZS status Theorem for theBenchmark.p
% 0.21/0.57  % SZS output start Proof
% See solution above
% 0.21/0.57  % Total time : 0.004000 s
% 0.21/0.57  % SZS output end Proof
% 0.21/0.57  % Total time : 0.007000 s
%------------------------------------------------------------------------------