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

View Problem - Process Solution

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

% Computer : n027.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:36:12 EDT 2022

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

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

cnf(17,axiom,
    subset(u,u),
    file('SEU317+1.p',unknown),
    [] ).

cnf(20,axiom,
    element(skc6,powerset(the_carrier(skc5))),
    file('SEU317+1.p',unknown),
    [] ).

cnf(33,axiom,
    ~ subset(skc6,topstr_closure(skc5,skc6)),
    file('SEU317+1.p',unknown),
    [] ).

cnf(34,axiom,
    ~ in(skf5(u,v),u),
    file('SEU317+1.p',unknown),
    [] ).

cnf(40,axiom,
    ( subset(u,v)
    | in(skf5(v,u),u) ),
    file('SEU317+1.p',unknown),
    [] ).

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

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

cnf(80,axiom,
    ( ~ top_str(u)
    | ~ in(v,the_carrier(u))
    | ~ element(w,powerset(the_carrier(u)))
    | in(v,topstr_closure(u,w))
    | subset(w,skf9(v,w,u)) ),
    file('SEU317+1.p',unknown),
    [] ).

cnf(82,axiom,
    ( ~ top_str(u)
    | ~ in(v,the_carrier(u))
    | ~ element(w,powerset(the_carrier(u)))
    | ~ in(v,skf9(v,w,u))
    | in(v,topstr_closure(u,w)) ),
    file('SEU317+1.p',unknown),
    [] ).

cnf(123,plain,
    ( ~ top_str(skc5)
    | ~ in(u,the_carrier(skc5))
    | subset(skc6,skf9(u,skc6,skc5))
    | in(u,topstr_closure(skc5,skc6)) ),
    inference(res,[status(thm),theory(equality)],[20,80]),
    [iquote('0:Res:20.0,80.1')] ).

cnf(126,plain,
    ( ~ top_str(skc5)
    | ~ in(u,skf9(u,skc6,skc5))
    | ~ in(u,the_carrier(skc5))
    | in(u,topstr_closure(skc5,skc6)) ),
    inference(res,[status(thm),theory(equality)],[20,82]),
    [iquote('0:Res:20.0,82.2')] ).

cnf(127,plain,
    subset(skc6,the_carrier(skc5)),
    inference(res,[status(thm),theory(equality)],[20,41]),
    [iquote('0:Res:20.0,41.0')] ).

cnf(135,plain,
    ( ~ in(u,the_carrier(skc5))
    | in(u,topstr_closure(skc5,skc6))
    | subset(skc6,skf9(u,skc6,skc5)) ),
    inference(mrr,[status(thm)],[123,1]),
    [iquote('0:MRR:123.0,1.0')] ).

cnf(136,plain,
    ( ~ in(u,the_carrier(skc5))
    | ~ in(u,skf9(u,skc6,skc5))
    | in(u,topstr_closure(skc5,skc6)) ),
    inference(mrr,[status(thm)],[126,1]),
    [iquote('0:MRR:126.0,1.0')] ).

cnf(593,plain,
    ( ~ subset(u,v)
    | subset(u,w)
    | in(skf5(w,u),v) ),
    inference(res,[status(thm),theory(equality)],[40,76]),
    [iquote('0:Res:40.1,76.0')] ).

cnf(2453,plain,
    ( ~ subset(u,v)
    | ~ subset(v,w)
    | subset(u,x)
    | in(skf5(x,u),w) ),
    inference(res,[status(thm),theory(equality)],[593,76]),
    [iquote('0:Res:593.2,76.0')] ).

cnf(2797,plain,
    ( ~ subset(u,skf9(skf5(v,u),skc6,skc5))
    | ~ in(skf5(v,u),the_carrier(skc5))
    | subset(u,v)
    | in(skf5(v,u),topstr_closure(skc5,skc6)) ),
    inference(res,[status(thm),theory(equality)],[593,136]),
    [iquote('0:Res:593.2,136.1')] ).

cnf(9938,plain,
    ( ~ subset(the_carrier(skc5),u)
    | subset(skc6,v)
    | in(skf5(v,skc6),u) ),
    inference(res,[status(thm),theory(equality)],[127,2453]),
    [iquote('0:Res:127.0,2453.0')] ).

cnf(12419,plain,
    ( ~ in(skf5(u,skc6),the_carrier(skc5))
    | ~ in(skf5(u,skc6),the_carrier(skc5))
    | in(skf5(u,skc6),topstr_closure(skc5,skc6))
    | subset(skc6,u)
    | in(skf5(u,skc6),topstr_closure(skc5,skc6)) ),
    inference(res,[status(thm),theory(equality)],[135,2797]),
    [iquote('0:Res:135.2,2797.0')] ).

cnf(12422,plain,
    ( ~ in(skf5(u,skc6),the_carrier(skc5))
    | subset(skc6,u)
    | in(skf5(u,skc6),topstr_closure(skc5,skc6)) ),
    inference(obv,[status(thm),theory(equality)],[12419]),
    [iquote('0:Obv:12419.2')] ).

cnf(37066,plain,
    ( ~ in(skf5(topstr_closure(skc5,skc6),skc6),the_carrier(skc5))
    | subset(skc6,topstr_closure(skc5,skc6)) ),
    inference(res,[status(thm),theory(equality)],[12422,34]),
    [iquote('0:Res:12422.2,34.0')] ).

cnf(37093,plain,
    ~ in(skf5(topstr_closure(skc5,skc6),skc6),the_carrier(skc5)),
    inference(mrr,[status(thm)],[37066,33]),
    [iquote('0:MRR:37066.1,33.0')] ).

cnf(37103,plain,
    ( ~ subset(the_carrier(skc5),the_carrier(skc5))
    | subset(skc6,topstr_closure(skc5,skc6)) ),
    inference(res,[status(thm),theory(equality)],[9938,37093]),
    [iquote('0:Res:9938.2,37093.0')] ).

cnf(37105,plain,
    $false,
    inference(mrr,[status(thm)],[37103,17,33]),
    [iquote('0:MRR:37103.0,37103.1,17.0,33.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU317+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun 18 19:25:53 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 15.13/15.32  
% 15.13/15.32  SPASS V 3.9 
% 15.13/15.32  SPASS beiseite: Proof found.
% 15.13/15.32  % SZS status Theorem
% 15.13/15.32  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 15.13/15.32  SPASS derived 34436 clauses, backtracked 981 clauses, performed 12 splits and kept 14975 clauses.
% 15.13/15.32  SPASS allocated 120706 KBytes.
% 15.13/15.32  SPASS spent	0:0:14.52 on the problem.
% 15.13/15.32  		0:00:00.03 for the input.
% 15.13/15.32  		0:00:00.03 for the FLOTTER CNF translation.
% 15.13/15.32  		0:00:00.42 for inferences.
% 15.13/15.32  		0:00:00.67 for the backtracking.
% 15.13/15.32  		0:0:12.82 for the reduction.
% 15.13/15.32  
% 15.13/15.32  
% 15.13/15.32  Here is a proof with depth 5, length 25 :
% 15.13/15.32  % SZS output start Refutation
% See solution above
% 15.13/15.32  Formulae used in the proof : t48_pre_topc reflexivity_r1_tarski d3_tarski antisymmetry_r2_hidden t3_subset t45_pre_topc existence_m1_subset_1
% 15.13/15.32  
%------------------------------------------------------------------------------