↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU268+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n029.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:35:42 EDT 2022

% Result   : Theorem 0.19s 0.54s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (   7 unt;   2 nHn;  23 RR)
%            Number of literals    :   60 (   0 equ;  36 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(35,axiom,
    relation(inclusion_relation(u)),
    file('SEU268+1.p',unknown),
    [] ).

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

cnf(39,axiom,
    ~ reflexive(inclusion_relation(skc10)),
    file('SEU268+1.p',unknown),
    [] ).

cnf(65,axiom,
    ( ~ relation(u)
    | ~ is_reflexive_in(u,relation_field(u))
    | reflexive(u) ),
    file('SEU268+1.p',unknown),
    [] ).

cnf(67,axiom,
    ( ~ relation(u)
    | is_reflexive_in(u,v)
    | in(skf4(v,w),v) ),
    file('SEU268+1.p',unknown),
    [] ).

cnf(69,axiom,
    ( ~ relation(u)
    | ~ equal(u,inclusion_relation(v))
    | equal(relation_field(u),v) ),
    file('SEU268+1.p',unknown),
    [] ).

cnf(73,axiom,
    ( ~ relation(u)
    | ~ in(ordered_pair(skf4(v,u),skf4(v,u)),u)
    | is_reflexive_in(u,v) ),
    file('SEU268+1.p',unknown),
    [] ).

cnf(77,axiom,
    ( ~ relation(u)
    | ~ subset(v,w)
    | ~ in(w,x)
    | ~ in(v,x)
    | ~ equal(u,inclusion_relation(x))
    | in(ordered_pair(v,w),u) ),
    file('SEU268+1.p',unknown),
    [] ).

cnf(179,plain,
    ( ~ relation(inclusion_relation(u))
    | equal(relation_field(inclusion_relation(u)),u) ),
    inference(eqr,[status(thm),theory(equality)],[69]),
    [iquote('0:EqR:69.1')] ).

cnf(180,plain,
    equal(relation_field(inclusion_relation(u)),u),
    inference(ssi,[status(thm)],[179,35]),
    [iquote('0:SSi:179.0,35.0')] ).

cnf(186,plain,
    ( ~ relation(inclusion_relation(u))
    | ~ is_reflexive_in(inclusion_relation(u),u)
    | reflexive(inclusion_relation(u)) ),
    inference(spl,[status(thm),theory(equality)],[180,65]),
    [iquote('0:SpL:180.0,65.1')] ).

cnf(190,plain,
    ( ~ is_reflexive_in(inclusion_relation(u),u)
    | reflexive(inclusion_relation(u)) ),
    inference(ssi,[status(thm)],[186,35]),
    [iquote('0:SSi:186.0,35.0')] ).

cnf(290,plain,
    ( ~ relation(inclusion_relation(u))
    | ~ subset(v,w)
    | ~ in(w,u)
    | ~ in(v,u)
    | in(ordered_pair(v,w),inclusion_relation(u)) ),
    inference(eqr,[status(thm),theory(equality)],[77]),
    [iquote('0:EqR:77.4')] ).

cnf(291,plain,
    ( ~ subset(u,v)
    | ~ in(v,w)
    | ~ in(u,w)
    | in(ordered_pair(u,v),inclusion_relation(w)) ),
    inference(ssi,[status(thm)],[290,35]),
    [iquote('0:SSi:290.0,35.0')] ).

cnf(972,plain,
    ( ~ relation(inclusion_relation(u))
    | ~ subset(skf4(v,inclusion_relation(u)),skf4(v,inclusion_relation(u)))
    | ~ in(skf4(v,inclusion_relation(u)),u)
    | ~ in(skf4(v,inclusion_relation(u)),u)
    | is_reflexive_in(inclusion_relation(u),v) ),
    inference(res,[status(thm),theory(equality)],[291,73]),
    [iquote('0:Res:291.3,73.1')] ).

cnf(977,plain,
    ( ~ relation(inclusion_relation(u))
    | ~ subset(skf4(v,inclusion_relation(u)),skf4(v,inclusion_relation(u)))
    | ~ in(skf4(v,inclusion_relation(u)),u)
    | is_reflexive_in(inclusion_relation(u),v) ),
    inference(obv,[status(thm),theory(equality)],[972]),
    [iquote('0:Obv:972.2')] ).

cnf(978,plain,
    ( ~ subset(skf4(u,inclusion_relation(v)),skf4(u,inclusion_relation(v)))
    | ~ in(skf4(u,inclusion_relation(v)),v)
    | is_reflexive_in(inclusion_relation(v),u) ),
    inference(ssi,[status(thm)],[977,35]),
    [iquote('0:SSi:977.0,35.0')] ).

cnf(979,plain,
    ( ~ in(skf4(u,inclusion_relation(v)),v)
    | is_reflexive_in(inclusion_relation(v),u) ),
    inference(mrr,[status(thm)],[978,38]),
    [iquote('0:MRR:978.0,38.0')] ).

cnf(993,plain,
    ( ~ relation(u)
    | is_reflexive_in(u,v)
    | is_reflexive_in(inclusion_relation(v),v) ),
    inference(res,[status(thm),theory(equality)],[67,979]),
    [iquote('0:Res:67.2,979.0')] ).

cnf(994,plain,
    ( ~ relation(inclusion_relation(u))
    | is_reflexive_in(inclusion_relation(u),u) ),
    inference(fac,[status(thm)],[993]),
    [iquote('0:Fac:993.1,993.2')] ).

cnf(1006,plain,
    is_reflexive_in(inclusion_relation(u),u),
    inference(ssi,[status(thm)],[994,35]),
    [iquote('0:SSi:994.0,35.0')] ).

cnf(1007,plain,
    reflexive(inclusion_relation(u)),
    inference(mrr,[status(thm)],[190,1006]),
    [iquote('0:MRR:190.0,1006.0')] ).

cnf(1008,plain,
    $false,
    inference(unc,[status(thm)],[1007,39]),
    [iquote('0:UnC:1007.0,39.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SEU268+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n029.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 : Sun Jun 19 04:45:59 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.54  
% 0.19/0.54  SPASS V 3.9 
% 0.19/0.54  SPASS beiseite: Proof found.
% 0.19/0.54  % SZS status Theorem
% 0.19/0.54  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.54  SPASS derived 711 clauses, backtracked 0 clauses, performed 0 splits and kept 400 clauses.
% 0.19/0.54  SPASS allocated 98605 KBytes.
% 0.19/0.54  SPASS spent	0:00:00.19 on the problem.
% 0.19/0.54  		0:00:00.04 for the input.
% 0.19/0.54  		0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.54  		0:00:00.01 for inferences.
% 0.19/0.54  		0:00:00.00 for the backtracking.
% 0.19/0.54  		0:00:00.08 for the reduction.
% 0.19/0.54  
% 0.19/0.54  
% 0.19/0.54  Here is a proof with depth 4, length 23 :
% 0.19/0.54  % SZS output start Refutation
% See solution above
% 0.19/0.54  Formulae used in the proof : dt_k1_wellord2 reflexivity_r1_tarski t2_wellord2 d9_relat_2 d1_relat_2 d1_wellord2
% 0.19/0.54  
%------------------------------------------------------------------------------