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

% Computer : n020.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 : Mon Jul 18 20:41:33 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(29,axiom,
    doDivides0(xu,xa),
    file('RNG125+4.p',unknown),
    [] ).

cnf(30,axiom,
    doDivides0(xu,xb),
    file('RNG125+4.p',unknown),
    [] ).

cnf(59,axiom,
    ( ~ doDivides0(xu,xa)
    | skC0 ),
    file('RNG125+4.p',unknown),
    [] ).

cnf(68,axiom,
    ( ~ doDivides0(xu,xb)
    | ~ skC0 ),
    file('RNG125+4.p',unknown),
    [] ).

cnf(169,plain,
    skC0,
    inference(mrr,[status(thm)],[59,29]),
    [iquote('0:MRR:59.0,29.0')] ).

cnf(171,plain,
    $false,
    inference(mrr,[status(thm)],[68,30,169]),
    [iquote('0:MRR:68.0,68.1,30.0,169.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : RNG125+4 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n020.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon May 30 14:50:09 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.44/0.62  
% 0.44/0.62  SPASS V 3.9 
% 0.44/0.62  SPASS beiseite: Proof found.
% 0.44/0.62  % SZS status Theorem
% 0.44/0.62  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.44/0.62  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 64 clauses.
% 0.44/0.62  SPASS allocated 100284 KBytes.
% 0.44/0.62  SPASS spent	0:00:00.27 on the problem.
% 0.44/0.62  		0:00:00.04 for the input.
% 0.44/0.62  		0:00:00.21 for the FLOTTER CNF translation.
% 0.44/0.62  		0:00:00.00 for inferences.
% 0.44/0.62  		0:00:00.00 for the backtracking.
% 0.44/0.62  		0:00:00.00 for the reduction.
% 0.44/0.62  
% 0.44/0.62  
% 0.44/0.62  Here is a proof with depth 0, length 6 :
% 0.44/0.62  % SZS output start Refutation
% See solution above
% 0.44/0.62  Formulae used in the proof : m__2479 m__2612 m__2383
% 0.44/0.62  
%------------------------------------------------------------------------------