%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWV005-1 : 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 : n016.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 : Thu Aug 31 21:36:05 EDT 2023

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

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

tff(decl_23,type,
    predecessor: $i > $i ).

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

tff(decl_25,type,
    n: $i ).

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

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

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

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

tff(decl_30,type,
    a: $i > $i ).

cnf(clause_8,negated_conjecture,
    ( less_than(X1,l)
    | less_than(n,X1)
    | ~ less_than(one,l)
    | ~ less_than(a(X1),a(predecessor(l))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

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

cnf(clause_6,negated_conjecture,
    less_than(a(k),a(predecessor(l))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

cnf(clause_2,negated_conjecture,
    ~ less_than(k,l),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

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

cnf(c_0_5,negated_conjecture,
    ( less_than(X1,l)
    | less_than(n,X1)
    | ~ less_than(one,l)
    | ~ less_than(a(X1),a(predecessor(l))) ),
    clause_8 ).

cnf(c_0_6,negated_conjecture,
    less_than(one,l),
    clause_5 ).

cnf(c_0_7,negated_conjecture,
    ( less_than(n,X1)
    | less_than(X1,l)
    | ~ less_than(a(X1),a(predecessor(l))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]) ).

cnf(c_0_8,negated_conjecture,
    less_than(a(k),a(predecessor(l))),
    clause_6 ).

cnf(c_0_9,negated_conjecture,
    ~ less_than(k,l),
    clause_2 ).

cnf(c_0_10,negated_conjecture,
    ~ less_than(n,k),
    clause_1 ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SWV005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n016.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Aug 29 11:15:15 EDT 2023
% 0.13/0.33  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 0.54/0.57  % Version  : CSE_E---1.5
% 0.54/0.57  % Problem  : theBenchmark.p
% 0.54/0.57  % Proof found
% 0.54/0.57  % SZS status Theorem for theBenchmark.p
% 0.54/0.57  % SZS output start Proof
% See solution above
% 0.54/0.57  % Total time : 0.006000 s
% 0.54/0.57  % SZS output end Proof
% 0.54/0.57  % Total time : 0.009000 s
%------------------------------------------------------------------------------