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

View Problem - Process Solution

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

% Computer : n026.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:37:40 EDT 2022

% Result   : Theorem 0.72s 0.89s
% Output   : Refutation 0.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   32 (  17 unt;   0 nHn;  32 RR)
%            Number of literals    :   59 (   0 equ;  40 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;  10 con; 0-4 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(13,axiom,
    r1_tarski(u,u),
    file('SEU449+1.p',unknown),
    [] ).

cnf(14,axiom,
    m2_relset_1(skc12,skc8,skc10),
    file('SEU449+1.p',unknown),
    [] ).

cnf(15,axiom,
    m1_subset_1(skc11,k1_zfmisc_1(skc10)),
    file('SEU449+1.p',unknown),
    [] ).

cnf(16,axiom,
    m1_subset_1(skc9,k1_zfmisc_1(skc8)),
    file('SEU449+1.p',unknown),
    [] ).

cnf(48,axiom,
    ( ~ m2_relset_1(u,v,w)
    | m1_relset_1(u,v,w) ),
    file('SEU449+1.p',unknown),
    [] ).

cnf(50,axiom,
    ( ~ m2_relset_1(u,v,w)
    | m1_subset_1(u,k1_zfmisc_1(k2_zfmisc_1(v,w))) ),
    file('SEU449+1.p',unknown),
    [] ).

cnf(55,axiom,
    ( ~ m1_relset_1(u,v,w)
    | equal(k6_relset_1(v,w,u),k4_relat_1(u)) ),
    file('SEU449+1.p',unknown),
    [] ).

cnf(56,axiom,
    ( ~ m1_relset_1(u,v,w)
    | m2_relset_1(k6_relset_1(v,w,u),w,v) ),
    file('SEU449+1.p',unknown),
    [] ).

cnf(63,axiom,
    ( ~ m1_subset_1(u,k1_zfmisc_1(v))
    | ~ m1_subset_1(w,k1_zfmisc_1(k2_zfmisc_1(v,x)))
    | m1_subset_1(k8_relset_2(v,x,u,w),k1_zfmisc_1(x)) ),
    file('SEU449+1.p',unknown),
    [] ).

cnf(66,axiom,
    ( ~ r1_tarski(skc9,k8_relset_2(skc10,skc8,k8_relset_2(skc8,skc10,skc9,skc12),k6_relset_1(skc8,skc10,skc12)))
    | ~ r1_tarski(skc11,k8_relset_2(skc8,skc10,k8_relset_2(skc10,skc8,skc11,k6_relset_1(skc8,skc10,skc12)),skc12)) ),
    file('SEU449+1.p',unknown),
    [] ).

cnf(67,axiom,
    ( ~ m1_subset_1(u,k1_zfmisc_1(v))
    | ~ m1_subset_1(w,k1_zfmisc_1(x))
    | ~ r1_tarski(w,k8_relset_2(v,x,u,y))
    | ~ m2_relset_1(y,v,x)
    | r1_tarski(u,k8_relset_2(x,v,w,k6_relset_1(v,x,y))) ),
    file('SEU449+1.p',unknown),
    [] ).

cnf(68,axiom,
    ( ~ m1_subset_1(u,k1_zfmisc_1(v))
    | ~ m1_subset_1(w,k1_zfmisc_1(x))
    | ~ r1_tarski(u,k8_relset_2(x,v,w,k6_relset_1(v,x,y)))
    | ~ m2_relset_1(y,v,x)
    | r1_tarski(w,k8_relset_2(v,x,u,y)) ),
    file('SEU449+1.p',unknown),
    [] ).

cnf(69,plain,
    ( ~ m1_relset_1(u,v,w)
    | m2_relset_1(k4_relat_1(u),w,v) ),
    inference(rew,[status(thm),theory(equality)],[55,56]),
    [iquote('0:Rew:55.1,56.1')] ).

cnf(94,plain,
    ( ~ m1_subset_1(u,k1_zfmisc_1(k2_zfmisc_1(skc10,v)))
    | m1_subset_1(k8_relset_2(skc10,v,skc11,u),k1_zfmisc_1(v)) ),
    inference(res,[status(thm),theory(equality)],[15,63]),
    [iquote('0:Res:15.0,63.1')] ).

cnf(98,plain,
    m1_subset_1(skc12,k1_zfmisc_1(k2_zfmisc_1(skc8,skc10))),
    inference(res,[status(thm),theory(equality)],[14,50]),
    [iquote('0:Res:14.0,50.0')] ).

cnf(99,plain,
    m1_relset_1(skc12,skc8,skc10),
    inference(res,[status(thm),theory(equality)],[14,48]),
    [iquote('0:Res:14.0,48.0')] ).

cnf(469,plain,
    ( ~ m1_subset_1(k8_relset_2(u,v,w,k6_relset_1(v,u,x)),k1_zfmisc_1(v))
    | ~ m1_subset_1(w,k1_zfmisc_1(u))
    | ~ m2_relset_1(x,v,u)
    | r1_tarski(w,k8_relset_2(v,u,k8_relset_2(u,v,w,k6_relset_1(v,u,x)),x)) ),
    inference(res,[status(thm),theory(equality)],[13,68]),
    [iquote('0:Res:13.0,68.2')] ).

cnf(1394,plain,
    ~ r1_tarski(skc9,k8_relset_2(skc10,skc8,k8_relset_2(skc8,skc10,skc9,skc12),k6_relset_1(skc8,skc10,skc12))),
    inference(spt,[spt(split,[position(s1)])],[66]),
    [iquote('1:Spt:66.0')] ).

cnf(1397,plain,
    ( ~ m1_subset_1(skc9,k1_zfmisc_1(skc8))
    | ~ m1_subset_1(k8_relset_2(skc8,skc10,skc9,skc12),k1_zfmisc_1(skc10))
    | ~ r1_tarski(k8_relset_2(skc8,skc10,skc9,skc12),k8_relset_2(skc8,skc10,skc9,skc12))
    | ~ m2_relset_1(skc12,skc8,skc10) ),
    inference(res,[status(thm),theory(equality)],[67,1394]),
    [iquote('1:Res:67.4,1394.0')] ).

cnf(1399,plain,
    ~ m1_subset_1(k8_relset_2(skc8,skc10,skc9,skc12),k1_zfmisc_1(skc10)),
    inference(mrr,[status(thm)],[1397,16,13,14]),
    [iquote('1:MRR:1397.0,1397.2,1397.3,16.0,13.0,14.0')] ).

cnf(1431,plain,
    ( ~ m1_subset_1(skc9,k1_zfmisc_1(skc8))
    | ~ m1_subset_1(skc12,k1_zfmisc_1(k2_zfmisc_1(skc8,skc10))) ),
    inference(res,[status(thm),theory(equality)],[63,1399]),
    [iquote('1:Res:63.2,1399.0')] ).

cnf(1434,plain,
    $false,
    inference(mrr,[status(thm)],[1431,16,98]),
    [iquote('1:MRR:1431.0,1431.1,16.0,98.0')] ).

cnf(1435,plain,
    r1_tarski(skc9,k8_relset_2(skc10,skc8,k8_relset_2(skc8,skc10,skc9,skc12),k6_relset_1(skc8,skc10,skc12))),
    inference(spt,[spt(split,[position(sa)])],[1434,1394]),
    [iquote('1:Spt:1434.0,66.0,1394.0')] ).

cnf(1436,plain,
    ~ r1_tarski(skc11,k8_relset_2(skc8,skc10,k8_relset_2(skc10,skc8,skc11,k6_relset_1(skc8,skc10,skc12)),skc12)),
    inference(spt,[spt(split,[position(s2)])],[66]),
    [iquote('1:Spt:1434.0,66.1')] ).

cnf(2333,plain,
    ( ~ m1_subset_1(k8_relset_2(skc10,skc8,skc11,k6_relset_1(skc8,skc10,skc12)),k1_zfmisc_1(skc8))
    | ~ m1_subset_1(skc11,k1_zfmisc_1(skc10))
    | ~ m2_relset_1(skc12,skc8,skc10) ),
    inference(res,[status(thm),theory(equality)],[469,1436]),
    [iquote('1:Res:469.3,1436.0')] ).

cnf(2335,plain,
    ~ m1_subset_1(k8_relset_2(skc10,skc8,skc11,k6_relset_1(skc8,skc10,skc12)),k1_zfmisc_1(skc8)),
    inference(mrr,[status(thm)],[2333,15,14]),
    [iquote('1:MRR:2333.1,2333.2,15.0,14.0')] ).

cnf(2365,plain,
    ~ m1_subset_1(k6_relset_1(skc8,skc10,skc12),k1_zfmisc_1(k2_zfmisc_1(skc10,skc8))),
    inference(res,[status(thm),theory(equality)],[94,2335]),
    [iquote('1:Res:94.1,2335.0')] ).

cnf(2402,plain,
    ~ m2_relset_1(k6_relset_1(skc8,skc10,skc12),skc10,skc8),
    inference(res,[status(thm),theory(equality)],[50,2365]),
    [iquote('1:Res:50.1,2365.0')] ).

cnf(2404,plain,
    ( ~ m1_relset_1(skc12,skc8,skc10)
    | ~ m2_relset_1(k4_relat_1(skc12),skc10,skc8) ),
    inference(spl,[status(thm),theory(equality)],[55,2402]),
    [iquote('1:SpL:55.1,2402.0')] ).

cnf(2405,plain,
    ~ m2_relset_1(k4_relat_1(skc12),skc10,skc8),
    inference(mrr,[status(thm)],[2404,99]),
    [iquote('1:MRR:2404.0,99.0')] ).

cnf(2407,plain,
    ~ m1_relset_1(skc12,skc8,skc10),
    inference(res,[status(thm),theory(equality)],[69,2405]),
    [iquote('1:Res:69.1,2405.0')] ).

cnf(2408,plain,
    $false,
    inference(mrr,[status(thm)],[2407,99]),
    [iquote('1:MRR:2407.0,99.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU449+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n026.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 04:15:11 EDT 2022
% 0.18/0.33  % CPUTime  : 
% 0.72/0.89  
% 0.72/0.89  SPASS V 3.9 
% 0.72/0.89  SPASS beiseite: Proof found.
% 0.72/0.89  % SZS status Theorem
% 0.72/0.89  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.72/0.89  SPASS derived 2117 clauses, backtracked 68 clauses, performed 5 splits and kept 1298 clauses.
% 0.72/0.89  SPASS allocated 100540 KBytes.
% 0.72/0.89  SPASS spent	0:00:00.53 on the problem.
% 0.72/0.89  		0:00:00.04 for the input.
% 0.72/0.89  		0:00:00.04 for the FLOTTER CNF translation.
% 0.72/0.89  		0:00:00.04 for inferences.
% 0.72/0.89  		0:00:00.01 for the backtracking.
% 0.72/0.89  		0:00:00.36 for the reduction.
% 0.72/0.89  
% 0.72/0.89  
% 0.72/0.89  Here is a proof with depth 6, length 32 :
% 0.72/0.89  % SZS output start Refutation
% See solution above
% 0.72/0.89  Formulae used in the proof : reflexivity_r1_tarski t63_relset_2 redefinition_m2_relset_1 dt_m2_relset_1 redefinition_k6_relset_1 dt_k6_relset_1 dt_k8_relset_2 t61_relset_2
% 0.72/0.89  
%------------------------------------------------------------------------------