↑ Up

SPASS---3.9.THM-Ref.s

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

% Computer : n019.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:33:47 EDT 2022

% Result   : Theorem 0.19s 0.47s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   13 (   4 unt;   3 nHn;  13 RR)
%            Number of literals    :   26 (   0 equ;  12 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    relation(skc10),
    file('SEU062+1.p',unknown),
    [] ).

cnf(29,axiom,
    ~ subset(skc11,relation_rng(skc10)),
    file('SEU062+1.p',unknown),
    [] ).

cnf(41,axiom,
    ( subset(u,v)
    | in(skf4(v,u),u) ),
    file('SEU062+1.p',unknown),
    [] ).

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

cnf(48,axiom,
    ( ~ in(u,skc11)
    | ~ equal(relation_inverse_image(skc10,singleton(u)),empty_set) ),
    file('SEU062+1.p',unknown),
    [] ).

cnf(53,axiom,
    ( ~ relation(u)
    | in(v,relation_rng(u))
    | equal(relation_inverse_image(u,singleton(v)),empty_set) ),
    file('SEU062+1.p',unknown),
    [] ).

cnf(181,plain,
    ( ~ relation(skc10)
    | ~ in(u,skc11)
    | ~ equal(empty_set,empty_set)
    | in(u,relation_rng(skc10)) ),
    inference(spl,[status(thm),theory(equality)],[53,48]),
    [iquote('0:SpL:53.2,48.1')] ).

cnf(182,plain,
    ( ~ relation(skc10)
    | ~ in(u,skc11)
    | in(u,relation_rng(skc10)) ),
    inference(obv,[status(thm),theory(equality)],[181]),
    [iquote('0:Obv:181.2')] ).

cnf(183,plain,
    ( ~ in(u,skc11)
    | in(u,relation_rng(skc10)) ),
    inference(ssi,[status(thm)],[182,1]),
    [iquote('0:SSi:182.0,1.0')] ).

cnf(187,plain,
    ( ~ in(skf4(relation_rng(skc10),u),skc11)
    | subset(v,relation_rng(skc10)) ),
    inference(res,[status(thm),theory(equality)],[183,44]),
    [iquote('0:Res:183.1,44.0')] ).

cnf(565,plain,
    ( subset(skc11,relation_rng(skc10))
    | subset(u,relation_rng(skc10)) ),
    inference(res,[status(thm),theory(equality)],[41,187]),
    [iquote('0:Res:41.1,187.0')] ).

cnf(567,plain,
    subset(skc11,relation_rng(skc10)),
    inference(con,[status(thm)],[565]),
    [iquote('0:Con:565.1')] ).

cnf(568,plain,
    $false,
    inference(mrr,[status(thm)],[567,29]),
    [iquote('0:MRR:567.0,29.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU062+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n019.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 : Mon Jun 20 01:32:24 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.47  
% 0.19/0.47  SPASS V 3.9 
% 0.19/0.47  SPASS beiseite: Proof found.
% 0.19/0.47  % SZS status Theorem
% 0.19/0.47  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.47  SPASS derived 448 clauses, backtracked 0 clauses, performed 0 splits and kept 241 clauses.
% 0.19/0.47  SPASS allocated 97971 KBytes.
% 0.19/0.47  SPASS spent	0:00:00.12 on the problem.
% 0.19/0.47  		0:00:00.04 for the input.
% 0.19/0.47  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.47  		0:00:00.01 for inferences.
% 0.19/0.47  		0:00:00.00 for the backtracking.
% 0.19/0.47  		0:00:00.02 for the reduction.
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  Here is a proof with depth 3, length 13 :
% 0.19/0.47  % SZS output start Refutation
% See solution above
% 0.19/0.47  Formulae used in the proof : t143_funct_1 d3_tarski t142_funct_1
% 0.19/0.47  
%------------------------------------------------------------------------------