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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU290+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:35:53 EDT 2022

% Result   : Theorem 0.42s 0.59s
% Output   : Refutation 0.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   27 (  14 unt;   1 nHn;  27 RR)
%            Number of literals    :   54 (   0 equ;  32 neg)
%            Maximal clause size   :    6 (   2 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(skc14),
    file('SEU290+1.p',unknown),
    [] ).

cnf(29,axiom,
    in(skc15,skc17),
    file('SEU290+1.p',unknown),
    [] ).

cnf(34,axiom,
    quasi_total(skc14,skc17,skc16),
    file('SEU290+1.p',unknown),
    [] ).

cnf(35,axiom,
    relation_of2_as_subset(skc14,skc17,skc16),
    file('SEU290+1.p',unknown),
    [] ).

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

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

cnf(59,axiom,
    ~ in(apply(skc14,skc15),relation_rng(skc14)),
    file('SEU290+1.p',unknown),
    [] ).

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

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

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

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

cnf(84,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('SEU290+1.p',unknown),
    [] ).

cnf(89,axiom,
    ( ~ function(u)
    | ~ relation(u)
    | ~ in(v,relation_dom(u))
    | ~ equal(w,relation_rng(u))
    | ~ equal(x,apply(u,v))
    | in(x,w) ),
    file('SEU290+1.p',unknown),
    [] ).

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

cnf(112,plain,
    ( ~ quasi_total(skc14,skc17,skc16)
    | ~ skP0(skc17,skc16)
    | equal(relation_dom_as_subset(skc17,skc16,skc14),skc17) ),
    inference(res,[status(thm),theory(equality)],[35,84]),
    [iquote('0:Res:35.0,84.2')] ).

cnf(114,plain,
    element(skc14,powerset(cartesian_product2(skc17,skc16))),
    inference(res,[status(thm),theory(equality)],[35,75]),
    [iquote('0:Res:35.0,75.0')] ).

cnf(115,plain,
    relation_of2(skc14,skc17,skc16),
    inference(res,[status(thm),theory(equality)],[35,70]),
    [iquote('0:Res:35.0,70.0')] ).

cnf(122,plain,
    equal(relation_dom_as_subset(skc17,skc16,skc14),skc17),
    inference(mrr,[status(thm)],[112,34,106]),
    [iquote('0:MRR:112.0,112.1,34.0,106.0')] ).

cnf(186,plain,
    relation(skc14),
    inference(res,[status(thm),theory(equality)],[114,66]),
    [iquote('0:Res:114.0,66.0')] ).

cnf(293,plain,
    ( ~ relation_of2(skc14,skc17,skc16)
    | equal(relation_dom(skc14),skc17) ),
    inference(spr,[status(thm),theory(equality)],[77,122]),
    [iquote('0:SpR:77.1,122.0')] ).

cnf(295,plain,
    equal(relation_dom(skc14),skc17),
    inference(mrr,[status(thm)],[293,115]),
    [iquote('0:MRR:293.0,115.0')] ).

cnf(477,plain,
    ( ~ function(u)
    | ~ relation(u)
    | ~ in(v,relation_dom(u))
    | ~ equal(w,relation_rng(u))
    | in(apply(u,v),w) ),
    inference(eqr,[status(thm),theory(equality)],[89]),
    [iquote('0:EqR:89.4')] ).

cnf(1661,plain,
    ( ~ function(skc14)
    | ~ relation(skc14)
    | ~ in(skc15,relation_dom(skc14))
    | ~ equal(relation_rng(skc14),relation_rng(skc14)) ),
    inference(res,[status(thm),theory(equality)],[477,59]),
    [iquote('0:Res:477.4,59.0')] ).

cnf(1662,plain,
    ( ~ function(skc14)
    | ~ relation(skc14)
    | ~ in(skc15,relation_dom(skc14)) ),
    inference(obv,[status(thm),theory(equality)],[1661]),
    [iquote('0:Obv:1661.3')] ).

cnf(1663,plain,
    ( ~ function(skc14)
    | ~ relation(skc14)
    | ~ in(skc15,skc17) ),
    inference(rew,[status(thm),theory(equality)],[295,1662]),
    [iquote('0:Rew:295.0,1662.2')] ).

cnf(1664,plain,
    ~ in(skc15,skc17),
    inference(ssi,[status(thm)],[1663,1,186]),
    [iquote('0:SSi:1663.1,1663.0,1.0,186.0,1.0,186.0')] ).

cnf(1665,plain,
    $false,
    inference(mrr,[status(thm)],[1664,29]),
    [iquote('0:MRR:1664.0,29.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU290+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n027.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 : Sat Jun 18 23:35:08 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.42/0.59  
% 0.42/0.59  SPASS V 3.9 
% 0.42/0.59  SPASS beiseite: Proof found.
% 0.42/0.59  % SZS status Theorem
% 0.42/0.59  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.42/0.59  SPASS derived 1303 clauses, backtracked 47 clauses, performed 3 splits and kept 685 clauses.
% 0.42/0.59  SPASS allocated 98951 KBytes.
% 0.42/0.59  SPASS spent	0:00:00.23 on the problem.
% 0.42/0.59  		0:00:00.03 for the input.
% 0.42/0.59  		0:00:00.04 for the FLOTTER CNF translation.
% 0.42/0.59  		0:00:00.02 for inferences.
% 0.42/0.59  		0:00:00.00 for the backtracking.
% 0.42/0.59  		0:00:00.11 for the reduction.
% 0.42/0.59  
% 0.42/0.59  
% 0.42/0.59  Here is a proof with depth 2, length 27 :
% 0.42/0.59  % SZS output start Refutation
% See solution above
% 0.42/0.59  Formulae used in the proof : t6_funct_2 d1_funct_2 cc1_relset_1 redefinition_m2_relset_1 dt_m2_relset_1 redefinition_k4_relset_1 d5_funct_1 antisymmetry_r2_hidden
% 0.42/0.59  
%------------------------------------------------------------------------------