%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU117+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n017.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 : Tue Jul 19 14:34:03 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(13,axiom,
    cup_closed(finite_subsets(u)),
    file('SEU117+1.p',unknown),
    [] ).

cnf(14,axiom,
    diff_closed(finite_subsets(u)),
    file('SEU117+1.p',unknown),
    [] ).

cnf(15,axiom,
    preboolean(finite_subsets(u)),
    file('SEU117+1.p',unknown),
    [] ).

cnf(29,axiom,
    element(skc7,finite_subsets(skc6)),
    file('SEU117+1.p',unknown),
    [] ).

cnf(32,axiom,
    ~ empty(finite_subsets(u)),
    file('SEU117+1.p',unknown),
    [] ).

cnf(34,axiom,
    ~ element(skc7,powerset(skc6)),
    file('SEU117+1.p',unknown),
    [] ).

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

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

cnf(62,axiom,
    ( ~ preboolean(u)
    | ~ in(v,u)
    | ~ equal(u,finite_subsets(w))
    | subset(v,w) ),
    file('SEU117+1.p',unknown),
    [] ).

cnf(67,plain,
    ( in(skc7,finite_subsets(skc6))
    | empty(finite_subsets(skc6)) ),
    inference(res,[status(thm),theory(equality)],[29,56]),
    [iquote('0:Res:29.0,56.0')] ).

cnf(70,plain,
    ~ subset(skc7,skc6),
    inference(res,[status(thm),theory(equality)],[55,34]),
    [iquote('0:Res:55.1,34.0')] ).

cnf(72,plain,
    in(skc7,finite_subsets(skc6)),
    inference(mrr,[status(thm)],[67,32]),
    [iquote('0:MRR:67.1,32.0')] ).

cnf(148,plain,
    ( ~ preboolean(finite_subsets(u))
    | ~ in(v,finite_subsets(u))
    | subset(v,u) ),
    inference(eqr,[status(thm),theory(equality)],[62]),
    [iquote('0:EqR:62.2')] ).

cnf(149,plain,
    ( ~ in(u,finite_subsets(v))
    | subset(u,v) ),
    inference(ssi,[status(thm)],[148,14,13,15]),
    [iquote('0:SSi:148.0,14.0,13.0,15.0')] ).

cnf(150,plain,
    subset(skc7,skc6),
    inference(res,[status(thm),theory(equality)],[72,149]),
    [iquote('0:Res:72.0,149.0')] ).

cnf(152,plain,
    $false,
    inference(mrr,[status(thm)],[150,70]),
    [iquote('0:MRR:150.0,70.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SEU117+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n017.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 : Sun Jun 19 04:33:13 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  
% 0.18/0.44  SPASS V 3.9 
% 0.18/0.44  SPASS beiseite: Proof found.
% 0.18/0.44  % SZS status Theorem
% 0.18/0.44  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.44  SPASS derived 81 clauses, backtracked 0 clauses, performed 0 splits and kept 118 clauses.
% 0.18/0.44  SPASS allocated 97862 KBytes.
% 0.18/0.44  SPASS spent	0:00:00.10 on the problem.
% 0.18/0.44  		0:00:00.03 for the input.
% 0.18/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.44  		0:00:00.00 for inferences.
% 0.18/0.44  		0:00:00.00 for the backtracking.
% 0.18/0.44  		0:00:00.00 for the reduction.
% 0.18/0.44  
% 0.18/0.44  
% 0.18/0.44  Here is a proof with depth 2, length 16 :
% 0.18/0.44  % SZS output start Refutation
% See solution above
% 0.18/0.44  Formulae used in the proof : fc2_finsub_1 t32_finsub_1 t3_subset t2_subset d5_finsub_1 antisymmetry_r2_hidden
% 0.18/0.44  
%------------------------------------------------------------------------------