%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM383+1 : TPTP v8.1.0. Released v3.2.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:25:47 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(27,axiom,
    in(skc12,skc13),
    file('NUM383+1.p',unknown),
    [] ).

cnf(28,axiom,
    subset(skc13,skc12),
    file('NUM383+1.p',unknown),
    [] ).

cnf(38,axiom,
    ( ~ in(u,v)
    | ~ in(v,u) ),
    file('NUM383+1.p',unknown),
    [] ).

cnf(40,axiom,
    ( ~ subset(u,v)
    | element(u,powerset(v)) ),
    file('NUM383+1.p',unknown),
    [] ).

cnf(41,axiom,
    ( ~ element(u,v)
    | empty(v)
    | in(u,v) ),
    file('NUM383+1.p',unknown),
    [] ).

cnf(44,axiom,
    ( ~ in(u,v)
    | ~ element(v,powerset(w))
    | element(u,w) ),
    file('NUM383+1.p',unknown),
    [] ).

cnf(45,axiom,
    ( ~ empty(u)
    | ~ in(v,w)
    | ~ element(w,powerset(u)) ),
    file('NUM383+1.p',unknown),
    [] ).

cnf(47,plain,
    element(skc13,powerset(skc12)),
    inference(res,[status(thm),theory(equality)],[28,40]),
    [iquote('0:Res:28.0,40.0')] ).

cnf(50,plain,
    ( ~ element(skc13,powerset(u))
    | element(skc12,u) ),
    inference(res,[status(thm),theory(equality)],[27,44]),
    [iquote('0:Res:27.0,44.0')] ).

cnf(53,plain,
    ( ~ empty(u)
    | ~ element(skc13,powerset(u)) ),
    inference(res,[status(thm),theory(equality)],[27,45]),
    [iquote('0:Res:27.0,45.2')] ).

cnf(68,plain,
    ~ empty(skc12),
    inference(res,[status(thm),theory(equality)],[47,53]),
    [iquote('0:Res:47.0,53.1')] ).

cnf(73,plain,
    element(skc12,skc12),
    inference(res,[status(thm),theory(equality)],[47,50]),
    [iquote('0:Res:47.0,50.0')] ).

cnf(85,plain,
    ( empty(skc12)
    | in(skc12,skc12) ),
    inference(res,[status(thm),theory(equality)],[73,41]),
    [iquote('0:Res:73.0,41.0')] ).

cnf(90,plain,
    in(skc12,skc12),
    inference(mrr,[status(thm)],[85,68]),
    [iquote('0:MRR:85.0,68.0')] ).

cnf(92,plain,
    ~ in(skc12,skc12),
    inference(res,[status(thm),theory(equality)],[90,38]),
    [iquote('0:Res:90.0,38.0')] ).

cnf(93,plain,
    $false,
    inference(mrr,[status(thm)],[92,90]),
    [iquote('0:MRR:92.0,90.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM383+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n026.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 : Thu Jul  7 00:52:08 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.43  
% 0.18/0.43  SPASS V 3.9 
% 0.18/0.43  SPASS beiseite: Proof found.
% 0.18/0.43  % SZS status Theorem
% 0.18/0.43  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.43  SPASS derived 45 clauses, backtracked 0 clauses, performed 0 splits and kept 65 clauses.
% 0.18/0.43  SPASS allocated 97676 KBytes.
% 0.18/0.43  SPASS spent	0:00:00.09 on the problem.
% 0.18/0.43  		0:00:00.03 for the input.
% 0.18/0.43  		0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.43  		0:00:00.00 for inferences.
% 0.18/0.43  		0:00:00.00 for the backtracking.
% 0.18/0.43  		0:00:00.00 for the reduction.
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  Here is a proof with depth 4, length 16 :
% 0.18/0.43  % SZS output start Refutation
% See solution above
% 0.18/0.43  Formulae used in the proof : t7_ordinal1 antisymmetry_r2_hidden t3_subset t2_subset t4_subset t5_subset
% 0.18/0.43  
%------------------------------------------------------------------------------