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

% Computer : n012.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.19s 0.57s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   30 (   7 unt;   7 typ;   0 def)
%            Number of atoms       :   43 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   39 (  19   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   7 usr;   8 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    n: $o ).

tff(decl_23,type,
    t: $o ).

tff(decl_24,type,
    m: $o ).

tff(decl_25,type,
    q: $o ).

tff(decl_26,type,
    l: $o ).

tff(decl_27,type,
    p: $o ).

tff(decl_28,type,
    r: $o ).

cnf(clause_1,negated_conjecture,
    ( ~ n
    | ~ t ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

cnf(clause_8,negated_conjecture,
    t,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

cnf(clause_2,negated_conjecture,
    ( m
    | q
    | n ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

cnf(clause_4,negated_conjecture,
    ( l
    | ~ q ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

cnf(clause_3,negated_conjecture,
    ( l
    | ~ m ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

cnf(clause_6,negated_conjecture,
    ( r
    | p
    | n ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

cnf(clause_7,negated_conjecture,
    ( ~ r
    | ~ l ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).

cnf(clause_5,negated_conjecture,
    ( ~ l
    | ~ p ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

cnf(c_0_8,negated_conjecture,
    ( ~ n
    | ~ t ),
    clause_1 ).

cnf(c_0_9,negated_conjecture,
    t,
    clause_8 ).

cnf(c_0_10,negated_conjecture,
    ( m
    | q
    | n ),
    clause_2 ).

cnf(c_0_11,negated_conjecture,
    ~ n,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).

cnf(c_0_12,negated_conjecture,
    ( l
    | ~ q ),
    clause_4 ).

cnf(c_0_13,negated_conjecture,
    ( q
    | m ),
    inference(sr,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ( l
    | ~ m ),
    clause_3 ).

cnf(c_0_15,negated_conjecture,
    ( r
    | p
    | n ),
    clause_6 ).

cnf(c_0_16,negated_conjecture,
    ( ~ r
    | ~ l ),
    clause_7 ).

cnf(c_0_17,negated_conjecture,
    l,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ l
    | ~ p ),
    clause_5 ).

cnf(c_0_19,negated_conjecture,
    ( r
    | p ),
    inference(sr,[status(thm)],[c_0_15,c_0_11]) ).

cnf(c_0_20,negated_conjecture,
    ~ r,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).

cnf(c_0_21,negated_conjecture,
    ~ p,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_17])]) ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN011-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n012.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   : Sat Aug 26 19:37:55 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.55  start to proof: theBenchmark
% 0.19/0.57  % Version  : CSE_E---1.5
% 0.19/0.57  % Problem  : theBenchmark.p
% 0.19/0.57  % Proof found
% 0.19/0.57  % SZS status Theorem for theBenchmark.p
% 0.19/0.57  % SZS output start Proof
% See solution above
% 0.19/0.57  % Total time : 0.003000 s
% 0.19/0.57  % SZS output end Proof
% 0.19/0.57  % Total time : 0.006000 s
%------------------------------------------------------------------------------