TSTP Solution File: SEU114+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU114+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 : Tue Jul 19 14:34:02 EDT 2022

% Result   : Theorem 9.87s 10.04s
% Output   : Refutation 9.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   28 (   9 unt;   5 nHn;  28 RR)
%            Number of literals    :   62 (   0 equ;  33 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    finite(skc5),
    file('SEU114+1.p',unknown),
    [] ).

cnf(13,axiom,
    cup_closed(finite_subsets(u)),
    file('SEU114+1.p',unknown),
    [] ).

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

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

cnf(44,axiom,
    subset(finite_subsets(u),powerset(u)),
    file('SEU114+1.p',unknown),
    [] ).

cnf(45,axiom,
    ~ equal(finite_subsets(skc5),powerset(skc5)),
    file('SEU114+1.p',unknown),
    [] ).

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

cnf(57,axiom,
    ( subset(u,v)
    | in(skf8(v,u),u) ),
    file('SEU114+1.p',unknown),
    [] ).

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

cnf(60,axiom,
    ( ~ in(skf8(u,v),u)
    | subset(w,u) ),
    file('SEU114+1.p',unknown),
    [] ).

cnf(64,axiom,
    ( ~ finite(u)
    | ~ element(v,powerset(u))
    | finite(v) ),
    file('SEU114+1.p',unknown),
    [] ).

cnf(65,axiom,
    ( ~ subset(u,v)
    | ~ subset(v,u)
    | equal(v,u) ),
    file('SEU114+1.p',unknown),
    [] ).

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

cnf(78,plain,
    ( ~ subset(finite_subsets(skc5),powerset(skc5))
    | ~ subset(powerset(skc5),finite_subsets(skc5)) ),
    inference(res,[status(thm),theory(equality)],[65,45]),
    [iquote('0:Res:65.2,45.0')] ).

cnf(85,plain,
    ~ subset(powerset(skc5),finite_subsets(skc5)),
    inference(mrr,[status(thm)],[78,44]),
    [iquote('0:MRR:78.0,44.0')] ).

cnf(123,plain,
    ( ~ in(u,powerset(v))
    | subset(u,v) ),
    inference(res,[status(thm),theory(equality)],[53,58]),
    [iquote('0:Res:53.1,58.0')] ).

cnf(136,plain,
    ( subset(powerset(u),v)
    | subset(skf8(v,powerset(u)),u) ),
    inference(res,[status(thm),theory(equality)],[57,123]),
    [iquote('0:Res:57.1,123.0')] ).

cnf(182,plain,
    ( ~ finite(u)
    | ~ in(v,powerset(u))
    | finite(v) ),
    inference(res,[status(thm),theory(equality)],[53,64]),
    [iquote('0:Res:53.1,64.1')] ).

cnf(420,plain,
    ( ~ preboolean(finite_subsets(u))
    | ~ finite(v)
    | ~ subset(v,u)
    | in(v,finite_subsets(u)) ),
    inference(eqr,[status(thm),theory(equality)],[73]),
    [iquote('0:EqR:73.3')] ).

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

cnf(644,plain,
    ( ~ finite(u)
    | subset(powerset(u),v)
    | finite(skf8(v,powerset(u))) ),
    inference(res,[status(thm),theory(equality)],[57,182]),
    [iquote('0:Res:57.1,182.1')] ).

cnf(738,plain,
    ( ~ finite(skf8(finite_subsets(u),v))
    | ~ subset(skf8(finite_subsets(u),v),u)
    | subset(w,finite_subsets(u)) ),
    inference(res,[status(thm),theory(equality)],[421,60]),
    [iquote('0:Res:421.2,60.0')] ).

cnf(3961,plain,
    ( ~ finite(u)
    | ~ subset(skf8(finite_subsets(v),powerset(u)),v)
    | subset(w,finite_subsets(v))
    | subset(powerset(u),finite_subsets(v)) ),
    inference(sor,[status(thm)],[738,644]),
    [iquote('0:SoR:738.0,644.2')] ).

cnf(3971,plain,
    ( ~ finite(u)
    | ~ subset(skf8(finite_subsets(v),powerset(u)),v)
    | subset(powerset(u),finite_subsets(v)) ),
    inference(con,[status(thm)],[3961]),
    [iquote('0:Con:3961.2')] ).

cnf(21022,plain,
    ( ~ finite(u)
    | subset(powerset(u),finite_subsets(u))
    | subset(powerset(u),finite_subsets(u)) ),
    inference(res,[status(thm),theory(equality)],[136,3971]),
    [iquote('0:Res:136.1,3971.1')] ).

cnf(21028,plain,
    ( ~ finite(u)
    | subset(powerset(u),finite_subsets(u)) ),
    inference(obv,[status(thm),theory(equality)],[21022]),
    [iquote('0:Obv:21022.1')] ).

cnf(21050,plain,
    ~ finite(skc5),
    inference(res,[status(thm),theory(equality)],[21028,85]),
    [iquote('0:Res:21028.1,85.0')] ).

cnf(21065,plain,
    $false,
    inference(ssi,[status(thm)],[21050,1]),
    [iquote('0:SSi:21050.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU114+1 : TPTP v8.1.0. Released v3.2.0.
% 0.13/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 : Mon Jun 20 07:36:56 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 9.87/10.04  
% 9.87/10.04  SPASS V 3.9 
% 9.87/10.04  SPASS beiseite: Proof found.
% 9.87/10.04  % SZS status Theorem
% 9.87/10.04  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 9.87/10.04  SPASS derived 16949 clauses, backtracked 0 clauses, performed 0 splits and kept 7395 clauses.
% 9.87/10.04  SPASS allocated 115209 KBytes.
% 9.87/10.04  SPASS spent	0:00:09.43 on the problem.
% 9.87/10.04  		0:00:00.03 for the input.
% 9.87/10.04  		0:00:00.04 for the FLOTTER CNF translation.
% 9.87/10.04  		0:00:00.21 for inferences.
% 9.87/10.04  		0:00:00.00 for the backtracking.
% 9.87/10.04  		0:00:09.00 for the reduction.
% 9.87/10.04  
% 9.87/10.04  
% 9.87/10.04  Here is a proof with depth 5, length 28 :
% 9.87/10.04  % SZS output start Refutation
% See solution above
% 9.87/10.04  Formulae used in the proof : t27_finsub_1 fc2_finsub_1 t26_finsub_1 t1_subset d3_tarski t3_subset cc2_finset_1 d10_xboole_0 d5_finsub_1
% 9.87/10.04  
%------------------------------------------------------------------------------