%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : COL052-2 : 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 : n025.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:22:18 EDT 2023

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

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

tff(decl_23,type,
    response: ( $i * $i ) > $i ).

tff(decl_24,type,
    agreeable: $i > $o ).

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

tff(decl_26,type,
    compatible: $i > $i ).

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

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

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

cnf(composer_exists,axiom,
    response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',composer_exists) ).

cnf(c_composes_a_with_b,hypothesis,
    c = compose(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_composes_a_with_b) ).

cnf(agreeable1,axiom,
    ( response(X1,common_bird(X2)) = response(X2,common_bird(X2))
    | ~ agreeable(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',agreeable1) ).

cnf(c_is_agreeable,hypothesis,
    agreeable(c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_agreeable) ).

cnf(agreeable2,axiom,
    ( agreeable(X1)
    | response(X1,X2) != response(compatible(X1),X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',agreeable2) ).

cnf(prove_a_is_agreeable,negated_conjecture,
    ~ agreeable(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_is_agreeable) ).

cnf(c_0_6,axiom,
    response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
    composer_exists ).

cnf(c_0_7,hypothesis,
    c = compose(a,b),
    c_composes_a_with_b ).

cnf(c_0_8,axiom,
    ( response(X1,common_bird(X2)) = response(X2,common_bird(X2))
    | ~ agreeable(X1) ),
    agreeable1 ).

cnf(c_0_9,hypothesis,
    response(a,response(b,X1)) = response(c,X1),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,plain,
    ( response(X1,common_bird(X1)) = response(X2,response(X3,common_bird(X1)))
    | ~ agreeable(compose(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

cnf(c_0_11,hypothesis,
    agreeable(c),
    c_is_agreeable ).

cnf(c_0_12,axiom,
    ( agreeable(X1)
    | response(X1,X2) != response(compatible(X1),X2) ),
    agreeable2 ).

cnf(c_0_13,plain,
    ( response(X1,common_bird(compose(X2,X3))) = response(X2,response(X3,common_bird(compose(X2,X3))))
    | ~ agreeable(X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

cnf(c_0_14,hypothesis,
    response(X1,common_bird(X1)) = response(c,common_bird(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_7]),c_0_11])]) ).

cnf(c_0_15,plain,
    ( agreeable(X1)
    | response(X2,common_bird(compose(compatible(X1),X3))) != response(X1,response(X3,common_bird(compose(compatible(X1),X3))))
    | ~ agreeable(X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    ~ agreeable(a),
    prove_a_is_agreeable ).

cnf(c_0_17,hypothesis,
    ( response(X1,common_bird(X2)) = response(c,common_bird(X2))
    | ~ agreeable(X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_14]) ).

cnf(c_0_18,hypothesis,
    ~ agreeable(X1),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_9]),c_0_16]),c_0_17]) ).

cnf(c_0_19,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_11,c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : COL052-2 : 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 : n025.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 05:31:23 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.54  start to proof: theBenchmark
% 0.20/0.57  % Version  : CSE_E---1.5
% 0.20/0.57  % Problem  : theBenchmark.p
% 0.20/0.57  % Proof found
% 0.20/0.57  % SZS status Theorem for theBenchmark.p
% 0.20/0.57  % SZS output start Proof
% See solution above
% 0.20/0.57  % Total time : 0.010000 s
% 0.20/0.57  % SZS output end Proof
% 0.20/0.57  % Total time : 0.013000 s
%------------------------------------------------------------------------------