↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU041+1 : 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:33:41 EDT 2022

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

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

cnf(23,axiom,
    subset(skc13,skc12),
    file('SEU041+1.p',unknown),
    [] ).

cnf(51,axiom,
    ( ~ relation(u)
    | ~ subset(v,w)
    | equal(relation_dom_restriction(relation_dom_restriction(u,v),w),relation_dom_restriction(u,v)) ),
    file('SEU041+1.p',unknown),
    [] ).

cnf(52,axiom,
    ( ~ relation(u)
    | ~ subset(v,w)
    | equal(relation_dom_restriction(relation_dom_restriction(u,w),v),relation_dom_restriction(u,v)) ),
    file('SEU041+1.p',unknown),
    [] ).

cnf(53,axiom,
    ( ~ equal(relation_dom_restriction(relation_dom_restriction(skc11,skc13),skc12),relation_dom_restriction(skc11,skc13))
    | ~ equal(relation_dom_restriction(relation_dom_restriction(skc11,skc12),skc13),relation_dom_restriction(skc11,skc13)) ),
    file('SEU041+1.p',unknown),
    [] ).

cnf(62,plain,
    ( ~ relation(u)
    | equal(relation_dom_restriction(relation_dom_restriction(u,skc13),skc12),relation_dom_restriction(u,skc13)) ),
    inference(res,[status(thm),theory(equality)],[23,51]),
    [iquote('0:Res:23.0,51.1')] ).

cnf(63,plain,
    ( ~ relation(u)
    | equal(relation_dom_restriction(relation_dom_restriction(u,skc12),skc13),relation_dom_restriction(u,skc13)) ),
    inference(res,[status(thm),theory(equality)],[23,52]),
    [iquote('0:Res:23.0,52.1')] ).

cnf(65,plain,
    equal(relation_dom_restriction(relation_dom_restriction(skc11,skc12),skc13),relation_dom_restriction(skc11,skc13)),
    inference(res,[status(thm),theory(equality)],[1,63]),
    [iquote('0:Res:1.0,63.0')] ).

cnf(66,plain,
    equal(relation_dom_restriction(relation_dom_restriction(skc11,skc13),skc12),relation_dom_restriction(skc11,skc13)),
    inference(res,[status(thm),theory(equality)],[1,62]),
    [iquote('0:Res:1.0,62.0')] ).

cnf(69,plain,
    ( ~ equal(relation_dom_restriction(relation_dom_restriction(skc11,skc13),skc12),relation_dom_restriction(skc11,skc13))
    | ~ equal(relation_dom_restriction(skc11,skc13),relation_dom_restriction(skc11,skc13)) ),
    inference(rew,[status(thm),theory(equality)],[65,53]),
    [iquote('0:Rew:65.0,53.1')] ).

cnf(70,plain,
    ~ equal(relation_dom_restriction(relation_dom_restriction(skc11,skc13),skc12),relation_dom_restriction(skc11,skc13)),
    inference(obv,[status(thm),theory(equality)],[69]),
    [iquote('0:Obv:69.1')] ).

cnf(71,plain,
    ~ equal(relation_dom_restriction(skc11,skc13),relation_dom_restriction(skc11,skc13)),
    inference(rew,[status(thm),theory(equality)],[66,70]),
    [iquote('0:Rew:66.0,70.0')] ).

cnf(72,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[71]),
    [iquote('0:Obv:71.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU041+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n006.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 11:05:10 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  
% 0.18/0.44  SPASS V 3.9 
% 0.18/0.44  SPASS beiseite: Proof found.
% 0.18/0.44  % SZS status Theorem
% 0.18/0.44  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.44  SPASS derived 14 clauses, backtracked 0 clauses, performed 0 splits and kept 59 clauses.
% 0.18/0.44  SPASS allocated 97702 KBytes.
% 0.18/0.44  SPASS spent	0:00:00.09 on the problem.
% 0.18/0.44  		0:00:00.04 for the input.
% 0.18/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.44  		0:00:00.00 for inferences.
% 0.18/0.44  		0:00:00.00 for the backtracking.
% 0.18/0.44  		0:00:00.00 for the reduction.
% 0.18/0.44  
% 0.18/0.44  
% 0.18/0.44  Here is a proof with depth 2, length 13 :
% 0.18/0.44  % SZS output start Refutation
% See solution above
% 0.18/0.44  Formulae used in the proof : t82_funct_1 t102_relat_1 t103_relat_1
% 0.18/0.44  
%------------------------------------------------------------------------------