%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : CAT011-4 : 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 : n010.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:08 EDT 2023

% Result   : Unsatisfiable 0.19s 0.62s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   24 (  12 unt;   6 typ;   0 def)
%            Number of atoms       :   24 (  12 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   14 (   8   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   5   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   12 (   0 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,
    a: $i ).

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

cnf(compose_codomain,axiom,
    compose(codomain(X1),X1) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/CAT004-0.ax',compose_codomain) ).

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

cnf(domain_has_elements,axiom,
    ( there_exists(X1)
    | ~ there_exists(domain(X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT004-0.ax',domain_has_elements) ).

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

cnf(prove_domain_is_idempotent,negated_conjecture,
    domain(domain(a)) != domain(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_is_idempotent) ).

cnf(c_0_6,axiom,
    ( domain(X1) = codomain(X2)
    | ~ there_exists(compose(X1,X2)) ),
    domain_codomain_composition1 ).

cnf(c_0_7,axiom,
    compose(codomain(X1),X1) = X1,
    compose_codomain ).

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

cnf(c_0_9,axiom,
    ( there_exists(X1)
    | ~ there_exists(domain(X1)) ),
    domain_has_elements ).

cnf(c_0_10,hypothesis,
    there_exists(domain(a)),
    assume_domain_exists ).

cnf(c_0_11,plain,
    ( domain(codomain(X1)) = codomain(X1)
    | ~ there_exists(X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_12,plain,
    ( codomain(domain(X1)) = domain(X1)
    | ~ there_exists(X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

cnf(c_0_13,hypothesis,
    there_exists(a),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,hypothesis,
    domain(codomain(domain(a))) = codomain(domain(a)),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_15,hypothesis,
    codomain(domain(a)) = domain(a),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    domain(domain(a)) != domain(a),
    prove_domain_is_idempotent ).

cnf(c_0_17,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : CAT011-4 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n010.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sun Aug 27 00:05:49 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.60  start to proof: theBenchmark
% 0.19/0.62  % Version  : CSE_E---1.5
% 0.19/0.62  % Problem  : theBenchmark.p
% 0.19/0.62  % Proof found
% 0.19/0.62  % SZS status Theorem for theBenchmark.p
% 0.19/0.62  % SZS output start Proof
% See solution above
% 0.19/0.62  % Total time : 0.005000 s
% 0.19/0.62  % SZS output end Proof
% 0.19/0.62  % Total time : 0.008000 s
%------------------------------------------------------------------------------