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

View Problem - Process Solution

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

% Computer : n011.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:54 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    function(skc18),
    file('SEU292+1.p',unknown),
    [] ).

cnf(2,axiom,
    relation(skc18),
    file('SEU292+1.p',unknown),
    [] ).

cnf(3,axiom,
    function(skc15),
    file('SEU292+1.p',unknown),
    [] ).

cnf(31,axiom,
    in(skc19,skc17),
    file('SEU292+1.p',unknown),
    [] ).

cnf(36,axiom,
    ~ equal(skc16,empty_set),
    file('SEU292+1.p',unknown),
    [] ).

cnf(37,axiom,
    relation_of2_as_subset(skc15,skc17,skc16),
    file('SEU292+1.p',unknown),
    [] ).

cnf(38,axiom,
    quasi_total(skc15,skc17,skc16),
    file('SEU292+1.p',unknown),
    [] ).

cnf(49,axiom,
    ( skP0(u,v)
    | equal(v,empty_set) ),
    file('SEU292+1.p',unknown),
    [] ).

cnf(65,axiom,
    ( ~ element(u,powerset(cartesian_product2(v,w)))
    | relation(u) ),
    file('SEU292+1.p',unknown),
    [] ).

cnf(68,axiom,
    ( ~ relation_of2_as_subset(u,v,w)
    | relation_of2(u,v,w) ),
    file('SEU292+1.p',unknown),
    [] ).

cnf(78,axiom,
    ( ~ relation_of2_as_subset(u,v,w)
    | element(u,powerset(cartesian_product2(v,w))) ),
    file('SEU292+1.p',unknown),
    [] ).

cnf(79,axiom,
    ~ equal(apply(relation_composition(skc15,skc18),skc19),apply(skc18,apply(skc15,skc19))),
    file('SEU292+1.p',unknown),
    [] ).

cnf(81,axiom,
    ( ~ relation_of2(u,v,w)
    | equal(relation_dom_as_subset(v,w,u),relation_dom(u)) ),
    file('SEU292+1.p',unknown),
    [] ).

cnf(89,axiom,
    ( ~ skP0(u,v)
    | ~ relation_of2_as_subset(w,u,v)
    | ~ quasi_total(w,u,v)
    | equal(relation_dom_as_subset(u,v,w),u) ),
    file('SEU292+1.p',unknown),
    [] ).

cnf(90,axiom,
    ( ~ relation(u)
    | ~ function(u)
    | ~ relation(v)
    | ~ function(v)
    | ~ in(w,relation_dom(u))
    | equal(apply(relation_composition(u,v),w),apply(v,apply(u,w))) ),
    file('SEU292+1.p',unknown),
    [] ).

cnf(118,plain,
    ( ~ skP0(skc17,skc16)
    | ~ relation_of2_as_subset(skc15,skc17,skc16)
    | equal(relation_dom_as_subset(skc17,skc16,skc15),skc17) ),
    inference(res,[status(thm),theory(equality)],[38,89]),
    [iquote('0:Res:38.0,89.0')] ).

cnf(122,plain,
    element(skc15,powerset(cartesian_product2(skc17,skc16))),
    inference(res,[status(thm),theory(equality)],[37,78]),
    [iquote('0:Res:37.0,78.0')] ).

cnf(123,plain,
    relation_of2(skc15,skc17,skc16),
    inference(res,[status(thm),theory(equality)],[37,68]),
    [iquote('0:Res:37.0,68.0')] ).

cnf(127,plain,
    skP0(u,skc16),
    inference(res,[status(thm),theory(equality)],[49,36]),
    [iquote('0:Res:49.0,36.0')] ).

cnf(134,plain,
    ( ~ function(skc18)
    | ~ relation(skc18)
    | ~ function(skc15)
    | ~ relation(skc15)
    | ~ in(skc19,relation_dom(skc15)) ),
    inference(res,[status(thm),theory(equality)],[90,79]),
    [iquote('0:Res:90.5,79.0')] ).

cnf(138,plain,
    equal(relation_dom_as_subset(skc17,skc16,skc15),skc17),
    inference(mrr,[status(thm)],[118,127,37]),
    [iquote('0:MRR:118.0,118.1,127.0,37.0')] ).

cnf(139,plain,
    ( ~ relation(skc15)
    | ~ in(skc19,relation_dom(skc15)) ),
    inference(mrr,[status(thm)],[134,1,2,3]),
    [iquote('0:MRR:134.0,134.1,134.2,1.0,2.0,3.0')] ).

cnf(250,plain,
    relation(skc15),
    inference(res,[status(thm),theory(equality)],[122,65]),
    [iquote('0:Res:122.0,65.0')] ).

cnf(256,plain,
    ~ in(skc19,relation_dom(skc15)),
    inference(mrr,[status(thm)],[139,250]),
    [iquote('0:MRR:139.0,250.0')] ).

cnf(433,plain,
    ( ~ relation_of2(skc15,skc17,skc16)
    | equal(relation_dom(skc15),skc17) ),
    inference(spr,[status(thm),theory(equality)],[81,138]),
    [iquote('0:SpR:81.1,138.0')] ).

cnf(435,plain,
    equal(relation_dom(skc15),skc17),
    inference(mrr,[status(thm)],[433,123]),
    [iquote('0:MRR:433.0,123.0')] ).

cnf(436,plain,
    ~ in(skc19,skc17),
    inference(rew,[status(thm),theory(equality)],[435,256]),
    [iquote('0:Rew:435.0,256.0')] ).

cnf(445,plain,
    $false,
    inference(mrr,[status(thm)],[436,31]),
    [iquote('0:MRR:436.0,31.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SEU292+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n011.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 01:36: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/sandbox/benchmark/theBenchmark.p 
% 0.19/0.47  SPASS derived 319 clauses, backtracked 0 clauses, performed 0 splits and kept 241 clauses.
% 0.19/0.47  SPASS allocated 97963 KBytes.
% 0.19/0.47  SPASS spent	0:00:00.12 on the problem.
% 0.19/0.47  		0:00:00.03 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 2, length 28 :
% 0.19/0.47  % SZS output start Refutation
% See solution above
% 0.19/0.47  Formulae used in the proof : t21_funct_2 d1_funct_2 cc1_relset_1 redefinition_m2_relset_1 dt_m2_relset_1 redefinition_k4_relset_1 t23_funct_1
% 0.19/0.47  
%------------------------------------------------------------------------------