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

% Computer : n021.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.19s 0.54s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   18 (  10 unt;   0 nHn;  18 RR)
%            Number of literals    :   32 (   0 equ;  20 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    aElement0(xa),
    file('RNG125+1.p',unknown),
    [] ).

cnf(4,axiom,
    aElement0(xb),
    file('RNG125+1.p',unknown),
    [] ).

cnf(5,axiom,
    aIdeal0(xI),
    file('RNG125+1.p',unknown),
    [] ).

cnf(9,axiom,
    aElementOf0(xu,xI),
    file('RNG125+1.p',unknown),
    [] ).

cnf(10,axiom,
    doDivides0(xu,xa),
    file('RNG125+1.p',unknown),
    [] ).

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

cnf(25,axiom,
    ( ~ aIdeal0(u)
    | aSet0(u) ),
    file('RNG125+1.p',unknown),
    [] ).

cnf(39,axiom,
    ( ~ aDivisorOf0(xu,xb)
    | ~ aDivisorOf0(xu,xa) ),
    file('RNG125+1.p',unknown),
    [] ).

cnf(42,axiom,
    ( ~ aSet0(u)
    | ~ aElementOf0(v,u)
    | aElement0(v) ),
    file('RNG125+1.p',unknown),
    [] ).

cnf(63,axiom,
    ( ~ aElement0(u)
    | ~ aElement0(v)
    | ~ doDivides0(v,u)
    | aDivisorOf0(v,u) ),
    file('RNG125+1.p',unknown),
    [] ).

cnf(131,plain,
    ( ~ aSet0(xI)
    | aElement0(xu) ),
    inference(res,[status(thm),theory(equality)],[9,42]),
    [iquote('0:Res:9.0,42.1')] ).

cnf(139,plain,
    aElement0(xu),
    inference(ssi,[status(thm)],[131,25,5]),
    [iquote('0:SSi:131.0,25.0,5.1')] ).

cnf(223,plain,
    ( ~ aElement0(xb)
    | ~ aElement0(xu)
    | ~ doDivides0(xu,xb)
    | ~ aDivisorOf0(xu,xa) ),
    inference(res,[status(thm),theory(equality)],[63,39]),
    [iquote('0:Res:63.3,39.0')] ).

cnf(226,plain,
    ( ~ doDivides0(xu,xb)
    | ~ aDivisorOf0(xu,xa) ),
    inference(ssi,[status(thm)],[223,139,4]),
    [iquote('0:SSi:223.1,223.0,139.0,4.0')] ).

cnf(227,plain,
    ~ aDivisorOf0(xu,xa),
    inference(mrr,[status(thm)],[226,11]),
    [iquote('0:MRR:226.0,11.0')] ).

cnf(228,plain,
    ( ~ aElement0(xa)
    | ~ aElement0(xu)
    | ~ doDivides0(xu,xa) ),
    inference(res,[status(thm),theory(equality)],[63,227]),
    [iquote('0:Res:63.3,227.0')] ).

cnf(229,plain,
    ~ doDivides0(xu,xa),
    inference(ssi,[status(thm)],[228,139,3]),
    [iquote('0:SSi:228.1,228.0,139.0,3.0')] ).

cnf(230,plain,
    $false,
    inference(mrr,[status(thm)],[229,10]),
    [iquote('0:MRR:229.0,10.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : RNG125+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n021.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  : 600
% 0.13/0.33  % DateTime : Mon May 30 04:47:58 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.54  
% 0.19/0.54  SPASS V 3.9 
% 0.19/0.54  SPASS beiseite: Proof found.
% 0.19/0.54  % SZS status Theorem
% 0.19/0.54  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.54  SPASS derived 87 clauses, backtracked 0 clauses, performed 0 splits and kept 119 clauses.
% 0.19/0.54  SPASS allocated 99381 KBytes.
% 0.19/0.54  SPASS spent	0:00:00.19 on the problem.
% 0.19/0.54  		0:00:00.04 for the input.
% 0.19/0.54  		0:00:00.12 for the FLOTTER CNF translation.
% 0.19/0.54  		0:00:00.00 for inferences.
% 0.19/0.54  		0:00:00.00 for the backtracking.
% 0.19/0.54  		0:00:00.01 for the reduction.
% 0.19/0.54  
% 0.19/0.54  
% 0.19/0.54  Here is a proof with depth 2, length 18 :
% 0.19/0.54  % SZS output start Refutation
% See solution above
% 0.19/0.54  Formulae used in the proof : m__2091 m__2174 m__2273 m__2479 m__2612 mDefIdeal m__2416 m__2383 mEOfElem mDefDvs
% 0.19/0.54  
%------------------------------------------------------------------------------