%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : NUM025-1 : TPTP v8.1.2. Bugfixed v4.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 : Thu Aug 31 10:26:12 EDT 2023

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

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

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

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

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

tff(decl_26,type,
    multiply: ( $i * $i ) > $i ).

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

tff(decl_28,type,
    predecessor_of_1st_minus_2nd: ( $i * $i ) > $i ).

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

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

cnf(transitivity_of_less,axiom,
    ( less(X3,X2)
    | ~ less(X1,X2)
    | ~ less(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',transitivity_of_less) ).

cnf(prove_b_not_less_than_a,negated_conjecture,
    less(b,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_b_not_less_than_a) ).

cnf(a_less_than_b,hypothesis,
    less(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_less_than_b) ).

cnf(no_number_less_than_itself,axiom,
    ~ less(X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_number_less_than_itself) ).

cnf(c_0_4,axiom,
    ( less(X3,X2)
    | ~ less(X1,X2)
    | ~ less(X3,X1) ),
    transitivity_of_less ).

cnf(c_0_5,negated_conjecture,
    less(b,a),
    prove_b_not_less_than_a ).

cnf(c_0_6,negated_conjecture,
    ( less(b,X1)
    | ~ less(a,X1) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_7,hypothesis,
    less(a,b),
    a_less_than_b ).

cnf(c_0_8,axiom,
    ~ less(X1,X1),
    no_number_less_than_itself ).

cnf(c_0_9,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : NUM025-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n007.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri Aug 25 09:10:55 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.58  start to proof: theBenchmark
% 0.20/0.60  % 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.005000 s
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time : 0.008000 s
%------------------------------------------------------------------------------