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

View Problem - Process Solution

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

% Computer : n029.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:06 EDT 2022

% Result   : Theorem 0.38s 0.57s
% Output   : Refutation 0.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   26 (  11 unt;   0 nHn;  26 RR)
%            Number of literals    :   65 (   0 equ;  40 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   8 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    l1_orders_2(skc9),
    file('SEU413+1.p',unknown),
    [] ).

cnf(2,axiom,
    l1_orders_2(skc8),
    file('SEU413+1.p',unknown),
    [] ).

cnf(9,axiom,
    r2_hidden(skc11,u1_struct_0(skc8)),
    file('SEU413+1.p',unknown),
    [] ).

cnf(11,axiom,
    ~ r2_hidden(skc10,u1_struct_0(skc8)),
    file('SEU413+1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ l1_orders_2(u)
    | l1_struct_0(u) ),
    file('SEU413+1.p',unknown),
    [] ).

cnf(15,axiom,
    m1_subset_1(skc11,u1_struct_0(k1_latsum_1(skc8,skc9))),
    file('SEU413+1.p',unknown),
    [] ).

cnf(16,axiom,
    m1_subset_1(skc10,u1_struct_0(k1_latsum_1(skc8,skc9))),
    file('SEU413+1.p',unknown),
    [] ).

cnf(17,axiom,
    r1_orders_2(k1_latsum_1(skc8,skc9),skc10,skc11),
    file('SEU413+1.p',unknown),
    [] ).

cnf(21,axiom,
    v12_waybel_0(k3_xboole_0(u1_struct_0(skc8),u1_struct_0(skc9)),skc9),
    file('SEU413+1.p',unknown),
    [] ).

cnf(28,axiom,
    m1_subset_1(k3_xboole_0(u1_struct_0(skc8),u1_struct_0(skc9)),k1_zfmisc_1(u1_struct_0(skc9))),
    file('SEU413+1.p',unknown),
    [] ).

cnf(36,axiom,
    ( ~ l1_orders_2(u)
    | ~ l1_orders_2(v)
    | v1_orders_2(k1_latsum_1(v,u)) ),
    file('SEU413+1.p',unknown),
    [] ).

cnf(37,axiom,
    ( ~ l1_orders_2(u)
    | ~ l1_orders_2(v)
    | l1_orders_2(k1_latsum_1(v,u)) ),
    file('SEU413+1.p',unknown),
    [] ).

cnf(46,axiom,
    ( ~ l1_orders_2(u)
    | ~ m1_subset_1(v,u1_struct_0(u))
    | ~ m1_subset_1(w,u1_struct_0(u))
    | ~ r1_orders_2(u,w,v)
    | r2_hidden(k4_tarski(w,v),u1_orders_2(u)) ),
    file('SEU413+1.p',unknown),
    [] ).

cnf(47,axiom,
    ( ~ l1_orders_2(u)
    | ~ l1_orders_2(v)
    | ~ r2_hidden(w,u1_struct_0(v))
    | ~ r2_hidden(k4_tarski(x,w),u1_orders_2(k1_latsum_1(v,u)))
    | ~ v12_waybel_0(k3_xboole_0(u1_struct_0(v),u1_struct_0(u)),u)
    | ~ m1_subset_1(k3_xboole_0(u1_struct_0(v),u1_struct_0(u)),k1_zfmisc_1(u1_struct_0(u)))
    | r2_hidden(x,u1_struct_0(v)) ),
    file('SEU413+1.p',unknown),
    [] ).

cnf(52,plain,
    ( ~ l1_orders_2(u)
    | v1_orders_2(k1_latsum_1(skc8,u)) ),
    inference(res,[status(thm),theory(equality)],[2,36]),
    [iquote('0:Res:2.0,36.0')] ).

cnf(53,plain,
    ( ~ l1_orders_2(u)
    | l1_orders_2(k1_latsum_1(skc8,u)) ),
    inference(res,[status(thm),theory(equality)],[2,37]),
    [iquote('0:Res:2.0,37.0')] ).

cnf(66,plain,
    l1_struct_0(skc9),
    inference(res,[status(thm),theory(equality)],[1,12]),
    [iquote('0:Res:1.0,12.0')] ).

cnf(70,plain,
    ( ~ l1_orders_2(skc8)
    | ~ l1_orders_2(u)
    | ~ r2_hidden(k4_tarski(v,skc11),u1_orders_2(k1_latsum_1(skc8,u)))
    | ~ v12_waybel_0(k3_xboole_0(u1_struct_0(skc8),u1_struct_0(u)),u)
    | ~ m1_subset_1(k3_xboole_0(u1_struct_0(skc8),u1_struct_0(u)),k1_zfmisc_1(u1_struct_0(u)))
    | r2_hidden(v,u1_struct_0(skc8)) ),
    inference(res,[status(thm),theory(equality)],[9,47]),
    [iquote('0:Res:9.0,47.3')] ).

cnf(80,plain,
    ( ~ l1_orders_2(k1_latsum_1(skc8,skc9))
    | ~ m1_subset_1(u,u1_struct_0(k1_latsum_1(skc8,skc9)))
    | ~ r1_orders_2(k1_latsum_1(skc8,skc9),skc10,u)
    | r2_hidden(k4_tarski(skc10,u),u1_orders_2(k1_latsum_1(skc8,skc9))) ),
    inference(res,[status(thm),theory(equality)],[16,46]),
    [iquote('0:Res:16.0,46.2')] ).

cnf(98,plain,
    ( ~ l1_orders_2(u)
    | ~ r2_hidden(k4_tarski(v,skc11),u1_orders_2(k1_latsum_1(skc8,u)))
    | ~ v12_waybel_0(k3_xboole_0(u1_struct_0(skc8),u1_struct_0(u)),u)
    | ~ m1_subset_1(k3_xboole_0(u1_struct_0(skc8),u1_struct_0(u)),k1_zfmisc_1(u1_struct_0(u)))
    | r2_hidden(v,u1_struct_0(skc8)) ),
    inference(mrr,[status(thm)],[70,2]),
    [iquote('0:MRR:70.0,2.0')] ).

cnf(426,plain,
    ( ~ m1_subset_1(u,u1_struct_0(k1_latsum_1(skc8,skc9)))
    | ~ r1_orders_2(k1_latsum_1(skc8,skc9),skc10,u)
    | r2_hidden(k4_tarski(skc10,u),u1_orders_2(k1_latsum_1(skc8,skc9))) ),
    inference(ssi,[status(thm)],[80,52,1,66,53]),
    [iquote('0:SSi:80.0,52.0,1.0,66.1,53.0,1.0,66.1')] ).

cnf(1081,plain,
    ( ~ l1_orders_2(skc9)
    | ~ r2_hidden(k4_tarski(u,skc11),u1_orders_2(k1_latsum_1(skc8,skc9)))
    | ~ v12_waybel_0(k3_xboole_0(u1_struct_0(skc8),u1_struct_0(skc9)),skc9)
    | r2_hidden(u,u1_struct_0(skc8)) ),
    inference(res,[status(thm),theory(equality)],[28,98]),
    [iquote('0:Res:28.0,98.3')] ).

cnf(1082,plain,
    ( ~ r2_hidden(k4_tarski(u,skc11),u1_orders_2(k1_latsum_1(skc8,skc9)))
    | ~ v12_waybel_0(k3_xboole_0(u1_struct_0(skc8),u1_struct_0(skc9)),skc9)
    | r2_hidden(u,u1_struct_0(skc8)) ),
    inference(ssi,[status(thm)],[1081,1,66]),
    [iquote('0:SSi:1081.0,1.0,66.0')] ).

cnf(1083,plain,
    ( ~ r2_hidden(k4_tarski(u,skc11),u1_orders_2(k1_latsum_1(skc8,skc9)))
    | r2_hidden(u,u1_struct_0(skc8)) ),
    inference(mrr,[status(thm)],[1082,21]),
    [iquote('0:MRR:1082.1,21.0')] ).

cnf(1124,plain,
    ( ~ m1_subset_1(skc11,u1_struct_0(k1_latsum_1(skc8,skc9)))
    | ~ r1_orders_2(k1_latsum_1(skc8,skc9),skc10,skc11)
    | r2_hidden(skc10,u1_struct_0(skc8)) ),
    inference(res,[status(thm),theory(equality)],[426,1083]),
    [iquote('0:Res:426.2,1083.0')] ).

cnf(1126,plain,
    $false,
    inference(mrr,[status(thm)],[1124,15,17,11]),
    [iquote('0:MRR:1124.0,1124.1,1124.2,15.0,17.0,11.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU413+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n029.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 : Sun Jun 19 21:05:45 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.38/0.57  
% 0.38/0.57  SPASS V 3.9 
% 0.38/0.57  SPASS beiseite: Proof found.
% 0.38/0.57  % SZS status Theorem
% 0.38/0.57  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.38/0.57  SPASS derived 802 clauses, backtracked 16 clauses, performed 1 splits and kept 449 clauses.
% 0.38/0.57  SPASS allocated 98915 KBytes.
% 0.38/0.57  SPASS spent	0:00:00.22 on the problem.
% 0.38/0.57  		0:00:00.04 for the input.
% 0.38/0.57  		0:00:00.03 for the FLOTTER CNF translation.
% 0.38/0.57  		0:00:00.02 for inferences.
% 0.38/0.57  		0:00:00.00 for the backtracking.
% 0.38/0.57  		0:00:00.09 for the reduction.
% 0.38/0.57  
% 0.38/0.57  
% 0.38/0.57  Here is a proof with depth 3, length 26 :
% 0.38/0.57  % SZS output start Refutation
% See solution above
% 0.38/0.57  Formulae used in the proof : t23_latsum_1 dt_l1_orders_2 dt_k1_latsum_1 d9_orders_2 t21_latsum_1
% 0.38/0.57  
%------------------------------------------------------------------------------