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

% Computer : n007.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:13 EDT 2023

% Result   : Unsatisfiable 0.20s 0.60s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   37 (  18 unt;   8 typ;   0 def)
%            Number of atoms       :   42 (  15 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   28 (  15   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    3 (   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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   27 (   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,
    a: $i ).

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

tff(decl_29,type,
    c: $i ).

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

cnf(assume_bc_exists,hypothesis,
    there_exists(compose(b,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_bc_exists) ).

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

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

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

cnf(associativity_of_compose,axiom,
    compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',associativity_of_compose) ).

cnf(assume_ab_exists,hypothesis,
    there_exists(compose(a,b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_ab_exists) ).

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

cnf(prove_a_bc_exists,negated_conjecture,
    ~ there_exists(compose(a,compose(b,c))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_bc_exists) ).

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

cnf(c_0_10,hypothesis,
    there_exists(compose(b,c)),
    assume_bc_exists ).

cnf(c_0_11,axiom,
    ( there_exists(domain(X1))
    | ~ there_exists(compose(X1,X2)) ),
    composition_implies_domain ).

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

cnf(c_0_13,hypothesis,
    domain(b) = codomain(c),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

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

cnf(c_0_15,hypothesis,
    there_exists(domain(b)),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_16,axiom,
    compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
    associativity_of_compose ).

cnf(c_0_17,hypothesis,
    compose(b,codomain(c)) = b,
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,hypothesis,
    there_exists(b),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,plain,
    ( codomain(X1) = domain(compose(X2,X3))
    | ~ there_exists(compose(X2,compose(X3,X1))) ),
    inference(spm,[status(thm)],[c_0_9,c_0_16]) ).

cnf(c_0_20,hypothesis,
    codomain(codomain(c)) = codomain(c),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_17]),c_0_13]),c_0_18])]) ).

cnf(c_0_21,hypothesis,
    ( domain(compose(X1,b)) = codomain(c)
    | ~ there_exists(compose(X1,b)) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_20]) ).

cnf(c_0_22,hypothesis,
    there_exists(compose(a,b)),
    assume_ab_exists ).

cnf(c_0_23,axiom,
    ( there_exists(compose(X1,X2))
    | ~ there_exists(domain(X1))
    | domain(X1) != codomain(X2) ),
    domain_codomain_composition2 ).

cnf(c_0_24,hypothesis,
    domain(compose(a,b)) = codomain(c),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_25,hypothesis,
    there_exists(codomain(c)),
    inference(rw,[status(thm)],[c_0_15,c_0_13]) ).

cnf(c_0_26,hypothesis,
    ( there_exists(compose(a,compose(b,X1)))
    | codomain(X1) != codomain(c) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_16]),c_0_25])]) ).

cnf(c_0_27,negated_conjecture,
    ~ there_exists(compose(a,compose(b,c))),
    prove_a_bc_exists ).

cnf(c_0_28,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_26]),c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : CAT018-4 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n007.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:01:42 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 0.20/0.59  % Version  : CSE_E---1.5
% 0.20/0.60  % Problem  : theBenchmark.p
% 0.20/0.60  % Proof found
% 0.20/0.60  % SZS status Theorem for theBenchmark.p
% 0.20/0.60  % SZS output start Proof
% See solution above
% 0.20/0.60  % Total time : 0.015000 s
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time : 0.018000 s
%------------------------------------------------------------------------------