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

% Computer : n026.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 14:26:19 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    aInteger0(sz10),
    file('NUM450+6.p',unknown),
    [] ).

cnf(9,axiom,
    aInteger0(skf50(u)),
    file('NUM450+6.p',unknown),
    [] ).

cnf(21,axiom,
    equal(stldt0(sbsmnsldt0(xS)),cS2076),
    file('NUM450+6.p',unknown),
    [] ).

cnf(51,axiom,
    ( ~ equal(u,sz10)
    | aElementOf0(u,stldt0(sbsmnsldt0(xS))) ),
    file('NUM450+6.p',unknown),
    [] ).

cnf(76,axiom,
    ( ~ equal(skf50(u),sz00)
    | ~ aElementOf0(u,stldt0(sbsmnsldt0(xS))) ),
    file('NUM450+6.p',unknown),
    [] ).

cnf(95,axiom,
    ( ~ aInteger0(u)
    | ~ aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,u),stldt0(sbsmnsldt0(xS)))
    | equal(u,sz00) ),
    file('NUM450+6.p',unknown),
    [] ).

cnf(103,axiom,
    ( ~ aElementOf0(u,stldt0(sbsmnsldt0(xS)))
    | aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(u,skf50(u)),stldt0(sbsmnsldt0(xS))) ),
    file('NUM450+6.p',unknown),
    [] ).

cnf(202,plain,
    ( ~ equal(u,sz10)
    | aElementOf0(u,cS2076) ),
    inference(rew,[status(thm),theory(equality)],[21,51]),
    [iquote('0:Rew:21.0,51.1')] ).

cnf(208,plain,
    ( ~ aElementOf0(u,cS2076)
    | ~ equal(skf50(u),sz00) ),
    inference(rew,[status(thm),theory(equality)],[21,76]),
    [iquote('0:Rew:21.0,76.1')] ).

cnf(217,plain,
    ( ~ aElementOf0(u,cS2076)
    | aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(u,skf50(u)),cS2076) ),
    inference(rew,[status(thm),theory(equality)],[21,103]),
    [iquote('0:Rew:21.0,103.1,21.0,103.0')] ).

cnf(218,plain,
    ( ~ aInteger0(u)
    | ~ aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,u),cS2076)
    | equal(u,sz00) ),
    inference(rew,[status(thm),theory(equality)],[21,95]),
    [iquote('0:Rew:21.0,95.1')] ).

cnf(1919,plain,
    ( ~ aInteger0(skf50(sz10))
    | ~ aElementOf0(sz10,cS2076)
    | equal(skf50(sz10),sz00) ),
    inference(res,[status(thm),theory(equality)],[217,218]),
    [iquote('0:Res:217.1,218.1')] ).

cnf(1921,plain,
    ( ~ aElementOf0(sz10,cS2076)
    | equal(skf50(sz10),sz00) ),
    inference(ssi,[status(thm)],[1919,9,2]),
    [iquote('0:SSi:1919.0,9.0,2.0')] ).

cnf(1922,plain,
    ~ aElementOf0(sz10,cS2076),
    inference(mrr,[status(thm)],[1921,208]),
    [iquote('0:MRR:1921.1,208.1')] ).

cnf(1923,plain,
    ~ equal(sz10,sz10),
    inference(res,[status(thm),theory(equality)],[202,1922]),
    [iquote('0:Res:202.1,1922.0')] ).

cnf(1924,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[1923]),
    [iquote('0:Obv:1923.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM450+6 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n026.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 : Wed Jul  6 19:53:08 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 1.06/1.29  
% 1.06/1.29  SPASS V 3.9 
% 1.06/1.29  SPASS beiseite: Proof found.
% 1.06/1.29  % SZS status Theorem
% 1.06/1.29  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 1.06/1.29  SPASS derived 1144 clauses, backtracked 1220 clauses, performed 37 splits and kept 2001 clauses.
% 1.06/1.29  SPASS allocated 101251 KBytes.
% 1.06/1.29  SPASS spent	0:00:00.94 on the problem.
% 1.06/1.29  		0:00:00.04 for the input.
% 1.06/1.29  		0:00:00.35 for the FLOTTER CNF translation.
% 1.06/1.29  		0:00:00.01 for inferences.
% 1.06/1.29  		0:00:00.01 for the backtracking.
% 1.06/1.29  		0:00:00.43 for the reduction.
% 1.06/1.29  
% 1.06/1.29  
% 1.06/1.29  Here is a proof with depth 2, length 16 :
% 1.06/1.29  % SZS output start Refutation
% See solution above
% 1.06/1.29  Formulae used in the proof : mIntOne m__2144 m__2079 m__
% 1.06/1.29  
%------------------------------------------------------------------------------