%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN009-4 : TPTP v8.1.2. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n017.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 : Fri Sep  1 01:48:36 EDT 2023

% Result   : Unsatisfiable 0.20s 0.59s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   26 (   6 unt;   9 typ;   0 def)
%            Number of atoms       :   44 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   57 (  30   ~;  27   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   16 (   6   >;  10   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   33 (   0 sgn;   0   !;   0   ?;   0   :)

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

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

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

tff(decl_25,type,
    r: ( $i * $i * $i ) > $o ).

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

tff(decl_27,type,
    s: $i > $o ).

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

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

tff(decl_30,type,
    n: ( $i * $i * $i ) > $o ).

cnf(clause_3,negated_conjecture,
    ( ~ r(X1,X2,X3)
    | ~ m(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).

cnf(clause_8,negated_conjecture,
    ( p(X1,X2,X3)
    | q(X1,X2,X3)
    | r(X1,X2,X3)
    | ~ s(X1)
    | ~ s(X2)
    | ~ s(X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).

cnf(clause_1,negated_conjecture,
    ( ~ p(X1,X2,X3)
    | ~ m(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

cnf(clause_2,negated_conjecture,
    ( ~ q(X1,X2,X3)
    | ~ m(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).

cnf(clause_7,negated_conjecture,
    ~ n(c,c,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).

cnf(clause_9,negated_conjecture,
    ( m(X1,X2,X3)
    | n(X1,X2,X3)
    | ~ s(X1)
    | ~ s(X2)
    | ~ s(X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).

cnf(clause_6,negated_conjecture,
    s(c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).

cnf(c_0_7,negated_conjecture,
    ( ~ r(X1,X2,X3)
    | ~ m(X1,X2,X3) ),
    clause_3 ).

cnf(c_0_8,negated_conjecture,
    ( p(X1,X2,X3)
    | q(X1,X2,X3)
    | r(X1,X2,X3)
    | ~ s(X1)
    | ~ s(X2)
    | ~ s(X3) ),
    clause_8 ).

cnf(c_0_9,negated_conjecture,
    ( ~ p(X1,X2,X3)
    | ~ m(X1,X2,X3) ),
    clause_1 ).

cnf(c_0_10,negated_conjecture,
    ( ~ q(X1,X2,X3)
    | ~ m(X1,X2,X3) ),
    clause_2 ).

cnf(c_0_11,negated_conjecture,
    ~ n(c,c,c),
    clause_7 ).

cnf(c_0_12,negated_conjecture,
    ( m(X1,X2,X3)
    | n(X1,X2,X3)
    | ~ s(X1)
    | ~ s(X2)
    | ~ s(X3) ),
    clause_9 ).

cnf(c_0_13,negated_conjecture,
    s(c),
    clause_6 ).

cnf(c_0_14,negated_conjecture,
    ( ~ s(X1)
    | ~ s(X2)
    | ~ s(X3)
    | ~ m(X3,X2,X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    m(c,c,c),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN009-4 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n017.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sat Aug 26 21:18:11 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.20/0.58  start to proof: theBenchmark
% 0.20/0.59  % Version  : CSE_E---1.5
% 0.20/0.59  % Problem  : theBenchmark.p
% 0.20/0.59  % Proof found
% 0.20/0.59  % SZS status Theorem for theBenchmark.p
% 0.20/0.59  % SZS output start Proof
% See solution above
% 0.20/0.59  % Total time : 0.004000 s
% 0.20/0.59  % SZS output end Proof
% 0.20/0.59  % Total time : 0.007000 s
%------------------------------------------------------------------------------