%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV488+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n019.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  : 600s
% DateTime : Wed Jul 20 21:43:18 EDT 2022

% Result   : Theorem 0.19s 0.45s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   10 (   6 unt;   0 nHn;  10 RR)
%            Number of literals    :   21 (   0 equ;  12 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    int_leq(int_one,skc1),
    file('SWV488+3.p',unknown),
    [] ).

cnf(2,axiom,
    int_leq(skc1,skc1),
    file('SWV488+3.p',unknown),
    [] ).

cnf(3,axiom,
    int_leq(skc1,n),
    file('SWV488+3.p',unknown),
    [] ).

cnf(6,axiom,
    ~ equal(real_one,real_zero),
    file('SWV488+3.p',unknown),
    [] ).

cnf(7,axiom,
    equal(a(skc1,skc1),real_zero),
    file('SWV488+3.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ int_leq(u,v)
    | ~ int_leq(v,n)
    | ~ int_leq(int_one,v)
    | ~ int_leq(int_one,u)
    | equal(a(u,u),real_one) ),
    file('SWV488+3.p',unknown),
    [] ).

cnf(34,plain,
    ( ~ int_leq(int_one,skc1)
    | ~ int_leq(skc1,n)
    | ~ int_leq(int_one,skc1)
    | equal(a(skc1,skc1),real_one) ),
    inference(res,[status(thm),theory(equality)],[2,21]),
    [iquote('0:Res:2.0,21.1')] ).

cnf(56,plain,
    ( ~ int_leq(skc1,n)
    | ~ int_leq(int_one,skc1)
    | equal(a(skc1,skc1),real_one) ),
    inference(obv,[status(thm),theory(equality)],[34]),
    [iquote('0:Obv:34.0')] ).

cnf(57,plain,
    ( ~ int_leq(skc1,n)
    | ~ int_leq(int_one,skc1)
    | equal(real_one,real_zero) ),
    inference(rew,[status(thm),theory(equality)],[7,56]),
    [iquote('0:Rew:7.0,56.2')] ).

cnf(58,plain,
    $false,
    inference(mrr,[status(thm)],[57,3,1,6]),
    [iquote('0:MRR:57.0,57.1,57.2,3.0,1.0,6.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWV488+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n019.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun 16 00:39:39 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  
% 0.19/0.45  SPASS V 3.9 
% 0.19/0.45  SPASS beiseite: Proof found.
% 0.19/0.45  % SZS status Theorem
% 0.19/0.45  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.45  SPASS derived 29 clauses, backtracked 0 clauses, performed 0 splits and kept 31 clauses.
% 0.19/0.45  SPASS allocated 85340 KBytes.
% 0.19/0.45  SPASS spent	0:00:00.10 on the problem.
% 0.19/0.45  		0:00:00.03 for the input.
% 0.19/0.45  		0:00:00.05 for the FLOTTER CNF translation.
% 0.19/0.45  		0:00:00.00 for inferences.
% 0.19/0.45  		0:00:00.00 for the backtracking.
% 0.19/0.45  		0:00:00.00 for the reduction.
% 0.19/0.45  
% 0.19/0.45  
% 0.19/0.45  Here is a proof with depth 1, length 10 :
% 0.19/0.45  % SZS output start Refutation
% See solution above
% 0.19/0.45  Formulae used in the proof : uti real_constants qii
% 0.19/0.45  
%------------------------------------------------------------------------------