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

View Problem - Process Solution

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

% Computer : n018.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:38 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    subset(skf8(u),u),
    file('SEU168+1.p',unknown),
    [] ).

cnf(3,axiom,
    in(u,skf14(u)),
    file('SEU168+1.p',unknown),
    [] ).

cnf(4,axiom,
    subset(skf9(u),skf10(u)),
    file('SEU168+1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ in(skf9(u),u),
    file('SEU168+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( skP0(u)
    | in(skf10(u),u) ),
    file('SEU168+1.p',unknown),
    [] ).

cnf(7,axiom,
    ( skP1(u)
    | in(skf11(u),u) ),
    file('SEU168+1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ in(skf13(u,v),u),
    file('SEU168+1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ in(powerset(skf11(u)),u)
    | skP1(u) ),
    file('SEU168+1.p',unknown),
    [] ).

cnf(11,axiom,
    ( subset(u,v)
    | in(skf13(v,u),u) ),
    file('SEU168+1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ subset(u,v)
    | in(u,skf16(v,w)) ),
    file('SEU168+1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ in(u,skf14(v))
    | in(skf16(u,v),skf14(v)) ),
    file('SEU168+1.p',unknown),
    [] ).

cnf(16,axiom,
    ( ~ in(u,v)
    | ~ equal(v,powerset(w))
    | subset(u,w) ),
    file('SEU168+1.p',unknown),
    [] ).

cnf(18,axiom,
    ( ~ subset(u,v)
    | ~ in(v,skf14(w))
    | in(u,skf14(w)) ),
    file('SEU168+1.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ subset(u,skf14(v))
    | in(u,skf14(v))
    | are_equipotent(u,skf14(v)) ),
    file('SEU168+1.p',unknown),
    [] ).

cnf(20,axiom,
    ( ~ skP1(u)
    | ~ skP0(u)
    | ~ in(skc1,u)
    | ~ are_equipotent(skf8(u),u) ),
    file('SEU168+1.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ skP1(u)
    | ~ skP0(u)
    | ~ in(skc1,u)
    | ~ in(skf8(u),u) ),
    file('SEU168+1.p',unknown),
    [] ).

cnf(33,plain,
    ( ~ in(skf10(u),skf14(v))
    | in(skf9(u),skf14(v)) ),
    inference(res,[status(thm),theory(equality)],[4,18]),
    [iquote('0:Res:4.0,18.1')] ).

cnf(58,plain,
    ~ subset(skf13(skf16(u,v),w),u),
    inference(res,[status(thm),theory(equality)],[12,8]),
    [iquote('0:Res:12.1,8.0')] ).

cnf(98,plain,
    ( ~ in(u,powerset(v))
    | subset(u,v) ),
    inference(eqr,[status(thm),theory(equality)],[16]),
    [iquote('0:EqR:16.1')] ).

cnf(103,plain,
    ( subset(powerset(u),v)
    | subset(skf13(v,powerset(u)),u) ),
    inference(res,[status(thm),theory(equality)],[11,98]),
    [iquote('0:Res:11.1,98.0')] ).

cnf(137,plain,
    ( ~ in(u,skf14(v))
    | ~ subset(w,skf16(u,v))
    | in(w,skf14(v)) ),
    inference(res,[status(thm),theory(equality)],[15,18]),
    [iquote('0:Res:15.1,18.1')] ).

cnf(148,plain,
    ( ~ skP1(skf14(u))
    | ~ skP0(skf14(u))
    | ~ subset(skf8(skf14(u)),skf14(u))
    | ~ in(skc1,skf14(u))
    | in(skf8(skf14(u)),skf14(u)) ),
    inference(res,[status(thm),theory(equality)],[19,20]),
    [iquote('0:Res:19.2,20.3')] ).

cnf(149,plain,
    ( ~ skP1(skf14(u))
    | ~ skP0(skf14(u))
    | ~ in(skc1,skf14(u))
    | in(skf8(skf14(u)),skf14(u)) ),
    inference(mrr,[status(thm)],[148,2]),
    [iquote('0:MRR:148.2,2.0')] ).

cnf(150,plain,
    ( ~ skP1(skf14(u))
    | ~ skP0(skf14(u))
    | ~ in(skc1,skf14(u)) ),
    inference(mrr,[status(thm)],[149,21]),
    [iquote('0:MRR:149.3,21.3')] ).

cnf(245,plain,
    ( skP0(skf14(u))
    | in(skf9(skf14(u)),skf14(u)) ),
    inference(res,[status(thm),theory(equality)],[6,33]),
    [iquote('0:Res:6.1,33.0')] ).

cnf(249,plain,
    skP0(skf14(u)),
    inference(mrr,[status(thm)],[245,5]),
    [iquote('0:MRR:245.1,5.0')] ).

cnf(250,plain,
    ( ~ skP1(skf14(u))
    | ~ in(skc1,skf14(u)) ),
    inference(mrr,[status(thm)],[150,249]),
    [iquote('0:MRR:150.1,249.0')] ).

cnf(395,plain,
    subset(powerset(u),skf16(u,v)),
    inference(res,[status(thm),theory(equality)],[103,58]),
    [iquote('0:Res:103.1,58.0')] ).

cnf(420,plain,
    ( ~ in(u,skf14(v))
    | in(powerset(u),skf14(v)) ),
    inference(res,[status(thm),theory(equality)],[395,137]),
    [iquote('0:Res:395.0,137.1')] ).

cnf(443,plain,
    ( ~ in(skf11(skf14(u)),skf14(u))
    | skP1(skf14(u)) ),
    inference(res,[status(thm),theory(equality)],[420,9]),
    [iquote('0:Res:420.1,9.0')] ).

cnf(446,plain,
    skP1(skf14(u)),
    inference(mrr,[status(thm)],[443,7]),
    [iquote('0:MRR:443.0,7.1')] ).

cnf(447,plain,
    ~ in(skc1,skf14(u)),
    inference(mrr,[status(thm)],[250,446]),
    [iquote('0:MRR:250.0,446.0')] ).

cnf(448,plain,
    $false,
    inference(unc,[status(thm)],[447,3]),
    [iquote('0:UnC:447.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SEU168+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n018.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 : Mon Jun 20 05:51:05 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.20/0.51  
% 0.20/0.51  SPASS V 3.9 
% 0.20/0.51  SPASS beiseite: Proof found.
% 0.20/0.51  % SZS status Theorem
% 0.20/0.51  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.51  SPASS derived 409 clauses, backtracked 0 clauses, performed 0 splits and kept 373 clauses.
% 0.20/0.51  SPASS allocated 98087 KBytes.
% 0.20/0.51  SPASS spent	0:00:00.16 on the problem.
% 0.20/0.51  		0:00:00.04 for the input.
% 0.20/0.51  		0:00:00.04 for the FLOTTER CNF translation.
% 0.20/0.51  		0:00:00.01 for inferences.
% 0.20/0.51  		0:00:00.00 for the backtracking.
% 0.20/0.51  		0:00:00.04 for the reduction.
% 0.20/0.51  
% 0.20/0.51  
% 0.20/0.51  Here is a proof with depth 5, length 33 :
% 0.20/0.51  % SZS output start Refutation
% See solution above
% 0.20/0.51  Formulae used in the proof : t136_zfmisc_1 reflexivity_r1_tarski t9_tarski antisymmetry_r2_hidden d3_tarski d1_zfmisc_1
% 0.20/0.51  
%------------------------------------------------------------------------------