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

% Computer : n027.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.46s 0.68s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   10 (   8 unt;   0 nHn;  10 RR)
%            Number of literals    :   14 (   0 equ;   5 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   9 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(31,axiom,
    aElementOf0(xb,xI),
    file('RNG123+4.p',unknown),
    [] ).

cnf(32,axiom,
    ~ aElementOf0(xr,xI),
    file('RNG123+4.p',unknown),
    [] ).

cnf(81,axiom,
    aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
    file('RNG123+4.p',unknown),
    [] ).

cnf(94,axiom,
    equal(smndt0(sdtasdt0(xq,xu)),sdtpldt0(skc71,skc70)),
    file('RNG123+4.p',unknown),
    [] ).

cnf(95,axiom,
    equal(sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),xr),
    file('RNG123+4.p',unknown),
    [] ).

cnf(133,axiom,
    ( ~ aElementOf0(u,xI)
    | ~ aElementOf0(v,xI)
    | aElementOf0(sdtpldt0(u,v),xI) ),
    file('RNG123+4.p',unknown),
    [] ).

cnf(190,plain,
    aElementOf0(sdtpldt0(skc71,skc70),xI),
    inference(rew,[status(thm),theory(equality)],[94,81]),
    [iquote('0:Rew:94.0,81.0')] ).

cnf(191,plain,
    equal(sdtpldt0(sdtpldt0(skc71,skc70),xb),xr),
    inference(rew,[status(thm),theory(equality)],[94,95]),
    [iquote('0:Rew:94.0,95.0')] ).

cnf(571,plain,
    ( ~ aElementOf0(sdtpldt0(skc71,skc70),xI)
    | ~ aElementOf0(xb,xI)
    | aElementOf0(xr,xI) ),
    inference(spr,[status(thm),theory(equality)],[191,133]),
    [iquote('0:SpR:191.0,133.2')] ).

cnf(579,plain,
    $false,
    inference(mrr,[status(thm)],[571,190,31,32]),
    [iquote('0:MRR:571.0,571.1,571.2,190.0,31.0,32.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : RNG123+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n027.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 : Mon May 30 11:42:01 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.46/0.68  
% 0.46/0.68  SPASS V 3.9 
% 0.46/0.68  SPASS beiseite: Proof found.
% 0.46/0.68  % SZS status Theorem
% 0.46/0.68  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.46/0.68  SPASS derived 304 clauses, backtracked 0 clauses, performed 0 splits and kept 320 clauses.
% 0.46/0.68  SPASS allocated 100582 KBytes.
% 0.46/0.68  SPASS spent	0:00:00.33 on the problem.
% 0.46/0.68  		0:00:00.04 for the input.
% 0.46/0.68  		0:00:00.23 for the FLOTTER CNF translation.
% 0.46/0.68  		0:00:00.01 for inferences.
% 0.46/0.68  		0:00:00.00 for the backtracking.
% 0.46/0.68  		0:00:00.03 for the reduction.
% 0.46/0.68  
% 0.46/0.68  
% 0.46/0.68  Here is a proof with depth 1, length 10 :
% 0.46/0.68  % SZS output start Refutation
% See solution above
% 0.46/0.68  Formulae used in the proof : m__2699 m__ m__2690 m__2718 m__2174 m__2666
% 0.46/0.68  
%------------------------------------------------------------------------------