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

View Problem - Process Solution

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

% Computer : n006.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:39 EDT 2022

% Result   : Theorem 0.23s 0.52s
% Output   : Refutation 0.23s
% 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(4,axiom,
    subset(skf8(u),u),
    file('SEU168+3.p',unknown),
    [] ).

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(22,axiom,
    ( ~ skP1(u)
    | ~ skP0(u)
    | ~ in(skc3,u)
    | ~ are_equipotent(skf8(u),u) ),
    file('SEU168+3.p',unknown),
    [] ).

cnf(23,axiom,
    ( ~ skP1(u)
    | ~ skP0(u)
    | ~ in(skc3,u)
    | ~ in(skf8(u),u) ),
    file('SEU168+3.p',unknown),
    [] ).

cnf(35,plain,
    ( ~ in(skf10(u),skf14(v))
    | in(skf9(u),skf14(v)) ),
    inference(res,[status(thm),theory(equality)],[6,20]),
    [iquote('0:Res:6.0,20.1')] ).

cnf(55,plain,
    ~ subset(skf13(skf16(u,v),w),u),
    inference(res,[status(thm),theory(equality)],[14,10]),
    [iquote('0:Res:14.1,10.0')] ).

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

cnf(102,plain,
    ( subset(powerset(u),v)
    | subset(skf13(v,powerset(u)),u) ),
    inference(res,[status(thm),theory(equality)],[13,97]),
    [iquote('0:Res:13.1,97.0')] ).

cnf(134,plain,
    ( ~ in(u,skf14(v))
    | ~ subset(w,skf16(u,v))
    | in(w,skf14(v)) ),
    inference(res,[status(thm),theory(equality)],[17,20]),
    [iquote('0:Res:17.1,20.1')] ).

cnf(145,plain,
    ( ~ skP1(skf14(u))
    | ~ skP0(skf14(u))
    | ~ subset(skf8(skf14(u)),skf14(u))
    | ~ in(skc3,skf14(u))
    | in(skf8(skf14(u)),skf14(u)) ),
    inference(res,[status(thm),theory(equality)],[21,22]),
    [iquote('0:Res:21.2,22.3')] ).

cnf(146,plain,
    ( ~ skP1(skf14(u))
    | ~ skP0(skf14(u))
    | ~ in(skc3,skf14(u))
    | in(skf8(skf14(u)),skf14(u)) ),
    inference(mrr,[status(thm)],[145,4]),
    [iquote('0:MRR:145.2,4.0')] ).

cnf(147,plain,
    ( ~ skP1(skf14(u))
    | ~ skP0(skf14(u))
    | ~ in(skc3,skf14(u)) ),
    inference(mrr,[status(thm)],[146,23]),
    [iquote('0:MRR:146.3,23.3')] ).

cnf(246,plain,
    ( skP0(skf14(u))
    | in(skf9(skf14(u)),skf14(u)) ),
    inference(res,[status(thm),theory(equality)],[8,35]),
    [iquote('0:Res:8.1,35.0')] ).

cnf(250,plain,
    skP0(skf14(u)),
    inference(mrr,[status(thm)],[246,7]),
    [iquote('0:MRR:246.1,7.0')] ).

cnf(251,plain,
    ( ~ skP1(skf14(u))
    | ~ in(skc3,skf14(u)) ),
    inference(mrr,[status(thm)],[147,250]),
    [iquote('0:MRR:147.1,250.0')] ).

cnf(389,plain,
    subset(powerset(u),skf16(u,v)),
    inference(res,[status(thm),theory(equality)],[102,55]),
    [iquote('0:Res:102.1,55.0')] ).

cnf(428,plain,
    ( ~ in(u,skf14(v))
    | in(powerset(u),skf14(v)) ),
    inference(res,[status(thm),theory(equality)],[389,134]),
    [iquote('0:Res:389.0,134.1')] ).

cnf(445,plain,
    ( ~ in(skf11(skf14(u)),skf14(u))
    | skP1(skf14(u)) ),
    inference(res,[status(thm),theory(equality)],[428,11]),
    [iquote('0:Res:428.1,11.0')] ).

cnf(448,plain,
    skP1(skf14(u)),
    inference(mrr,[status(thm)],[445,9]),
    [iquote('0:MRR:445.0,9.1')] ).

cnf(449,plain,
    ~ in(skc3,skf14(u)),
    inference(mrr,[status(thm)],[251,448]),
    [iquote('0:MRR:251.0,448.0')] ).

cnf(450,plain,
    $false,
    inference(unc,[status(thm)],[449,5]),
    [iquote('0:UnC:449.0,5.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : SEU168+3 : TPTP v8.1.0. Released v3.2.0.
% 0.15/0.15  % Command  : run_spass %d %s
% 0.16/0.36  % Computer : n006.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 600
% 0.16/0.36  % DateTime : Sun Jun 19 11:42:40 EDT 2022
% 0.16/0.37  % CPUTime  : 
% 0.23/0.52  
% 0.23/0.52  SPASS V 3.9 
% 0.23/0.52  SPASS beiseite: Proof found.
% 0.23/0.52  % SZS status Theorem
% 0.23/0.52  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.23/0.52  SPASS derived 409 clauses, backtracked 0 clauses, performed 0 splits and kept 375 clauses.
% 0.23/0.52  SPASS allocated 98090 KBytes.
% 0.23/0.52  SPASS spent	0:00:00.14 on the problem.
% 0.23/0.52  		0:00:00.03 for the input.
% 0.23/0.52  		0:00:00.04 for the FLOTTER CNF translation.
% 0.23/0.52  		0:00:00.01 for inferences.
% 0.23/0.52  		0:00:00.00 for the backtracking.
% 0.23/0.52  		0:00:00.03 for the reduction.
% 0.23/0.52  
% 0.23/0.52  
% 0.23/0.52  Here is a proof with depth 5, length 33 :
% 0.23/0.52  % SZS output start Refutation
% See solution above
% 0.23/0.52  Formulae used in the proof : t136_zfmisc_1 reflexivity_r1_tarski t9_tarski antisymmetry_r2_hidden d3_tarski d1_zfmisc_1
% 0.23/0.52  
%------------------------------------------------------------------------------