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

View Problem - Process Solution

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

% Computer : n020.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 : Thu Jul 21 21:34:59 EDT 2022

% Result   : Theorem 0.21s 0.50s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   30 (  17 unt;   6 nHn;  30 RR)
%            Number of literals    :   64 (   0 equ;  35 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   15 (  14 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    v2_pre_topc(skc5),
    file('TOP028+1.p',unknown),
    [] ).

cnf(2,axiom,
    l1_pre_topc(skc5),
    file('TOP028+1.p',unknown),
    [] ).

cnf(5,axiom,
    v1_xboole_0(k1_xboole_0),
    file('TOP028+1.p',unknown),
    [] ).

cnf(6,axiom,
    v1_membered(k1_xboole_0),
    file('TOP028+1.p',unknown),
    [] ).

cnf(7,axiom,
    v2_membered(k1_xboole_0),
    file('TOP028+1.p',unknown),
    [] ).

cnf(8,axiom,
    v3_membered(k1_xboole_0),
    file('TOP028+1.p',unknown),
    [] ).

cnf(9,axiom,
    v4_membered(k1_xboole_0),
    file('TOP028+1.p',unknown),
    [] ).

cnf(10,axiom,
    v5_membered(k1_xboole_0),
    file('TOP028+1.p',unknown),
    [] ).

cnf(17,axiom,
    ~ v3_struct_0(skc5),
    file('TOP028+1.p',unknown),
    [] ).

cnf(19,axiom,
    v1_xboole_0(skf15(u)),
    file('TOP028+1.p',unknown),
    [] ).

cnf(35,axiom,
    m1_subset_1(skf15(u),k1_zfmisc_1(u)),
    file('TOP028+1.p',unknown),
    [] ).

cnf(57,axiom,
    ( ~ v1_xboole_0(u)
    | equal(u,k1_xboole_0) ),
    file('TOP028+1.p',unknown),
    [] ).

cnf(61,axiom,
    m1_subset_1(skf23(u,v),k1_zfmisc_1(u1_struct_0(v))),
    file('TOP028+1.p',unknown),
    [] ).

cnf(103,axiom,
    ( ~ v1_tsp_2(u,skc5)
    | ~ m1_subset_1(u,k1_zfmisc_1(u1_struct_0(skc5))) ),
    file('TOP028+1.p',unknown),
    [] ).

cnf(141,axiom,
    ( ~ l1_pre_topc(u)
    | ~ v3_tex_2(v,u)
    | ~ m1_subset_1(v,k1_zfmisc_1(u1_struct_0(u)))
    | v3_struct_0(u)
    | v1_tsp_1(v,u) ),
    file('TOP028+1.p',unknown),
    [] ).

cnf(143,axiom,
    ( ~ v1_xboole_0(u)
    | ~ l1_pre_topc(v)
    | ~ v2_pre_topc(v)
    | ~ m1_subset_1(u,k1_zfmisc_1(u1_struct_0(v)))
    | v3_struct_0(v)
    | v3_tex_2(u,v) ),
    file('TOP028+1.p',unknown),
    [] ).

cnf(150,axiom,
    ( ~ l1_pre_topc(u)
    | ~ v2_pre_topc(u)
    | ~ v1_tsp_1(v,u)
    | ~ m1_subset_1(v,k1_zfmisc_1(u1_struct_0(u)))
    | v3_struct_0(u)
    | v1_tsp_2(skf23(v,u),u) ),
    file('TOP028+1.p',unknown),
    [] ).

cnf(165,plain,
    ( ~ v2_pre_topc(skc5)
    | ~ v1_xboole_0(u)
    | ~ m1_subset_1(u,k1_zfmisc_1(u1_struct_0(skc5)))
    | v3_struct_0(skc5)
    | v3_tex_2(u,skc5) ),
    inference(res,[status(thm),theory(equality)],[2,143]),
    [iquote('0:Res:2.0,143.1')] ).

cnf(170,plain,
    ( ~ m1_subset_1(u,k1_zfmisc_1(u1_struct_0(skc5)))
    | ~ v3_tex_2(u,skc5)
    | v3_struct_0(skc5)
    | v1_tsp_1(u,skc5) ),
    inference(res,[status(thm),theory(equality)],[2,141]),
    [iquote('0:Res:2.0,141.0')] ).

cnf(210,plain,
    ( ~ l1_pre_topc(skc5)
    | ~ m1_subset_1(u,k1_zfmisc_1(u1_struct_0(skc5)))
    | ~ v1_tsp_1(u,skc5)
    | v1_tsp_2(skf23(u,skc5),skc5)
    | v3_struct_0(skc5) ),
    inference(res,[status(thm),theory(equality)],[1,150]),
    [iquote('0:Res:1.0,150.0')] ).

cnf(271,plain,
    ~ v1_tsp_2(skf23(u,skc5),skc5),
    inference(res,[status(thm),theory(equality)],[61,103]),
    [iquote('0:Res:61.0,103.0')] ).

cnf(304,plain,
    ( ~ m1_subset_1(u,k1_zfmisc_1(u1_struct_0(skc5)))
    | ~ v3_tex_2(u,skc5)
    | v1_tsp_1(u,skc5) ),
    inference(mrr,[status(thm)],[170,17]),
    [iquote('0:MRR:170.2,17.0')] ).

cnf(306,plain,
    ( ~ v1_xboole_0(u)
    | ~ m1_subset_1(u,k1_zfmisc_1(u1_struct_0(skc5)))
    | v3_tex_2(u,skc5) ),
    inference(mrr,[status(thm)],[165,1,17]),
    [iquote('0:MRR:165.0,165.3,1.0,17.0')] ).

cnf(313,plain,
    ( ~ v1_tsp_1(u,skc5)
    | ~ m1_subset_1(u,k1_zfmisc_1(u1_struct_0(skc5))) ),
    inference(mrr,[status(thm)],[210,2,271,17]),
    [iquote('0:MRR:210.0,210.3,210.4,2.0,271.0,17.0')] ).

cnf(314,plain,
    ( ~ v3_tex_2(u,skc5)
    | ~ m1_subset_1(u,k1_zfmisc_1(u1_struct_0(skc5))) ),
    inference(mrr,[status(thm)],[304,313]),
    [iquote('0:MRR:304.2,313.1')] ).

cnf(315,plain,
    ( ~ v1_xboole_0(u)
    | ~ m1_subset_1(u,k1_zfmisc_1(u1_struct_0(skc5))) ),
    inference(mrr,[status(thm)],[306,314]),
    [iquote('0:MRR:306.2,314.1')] ).

cnf(321,plain,
    equal(skf15(u),k1_xboole_0),
    inference(ems,[status(thm)],[57,19]),
    [iquote('0:EmS:57.0,19.0')] ).

cnf(352,plain,
    m1_subset_1(k1_xboole_0,k1_zfmisc_1(u)),
    inference(rew,[status(thm),theory(equality)],[321,35]),
    [iquote('0:Rew:321.0,35.0')] ).

cnf(413,plain,
    ~ v1_xboole_0(k1_xboole_0),
    inference(res,[status(thm),theory(equality)],[352,315]),
    [iquote('0:Res:352.0,315.1')] ).

cnf(424,plain,
    $false,
    inference(ssi,[status(thm)],[413,6,7,8,10,9,5]),
    [iquote('0:SSi:413.0,6.0,7.0,8.0,10.0,9.0,5.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : TOP028+1 : TPTP v8.1.0. Released v3.4.0.
% 0.13/0.15  % Command  : run_spass %d %s
% 0.15/0.36  % Computer : n020.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Sun May 29 03:43:54 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.21/0.50  
% 0.21/0.50  SPASS V 3.9 
% 0.21/0.50  SPASS beiseite: Proof found.
% 0.21/0.50  % SZS status Theorem
% 0.21/0.50  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.21/0.50  SPASS derived 225 clauses, backtracked 0 clauses, performed 0 splits and kept 250 clauses.
% 0.21/0.50  SPASS allocated 97946 KBytes.
% 0.21/0.50  SPASS spent	0:00:00.12 on the problem.
% 0.21/0.50  		0:00:00.03 for the input.
% 0.21/0.50  		0:00:00.04 for the FLOTTER CNF translation.
% 0.21/0.50  		0:00:00.00 for inferences.
% 0.21/0.50  		0:00:00.00 for the backtracking.
% 0.21/0.50  		0:00:00.01 for the reduction.
% 0.21/0.50  
% 0.21/0.50  
% 0.21/0.50  Here is a proof with depth 2, length 30 :
% 0.21/0.50  % SZS output start Refutation
% See solution above
% 0.21/0.50  Formulae used in the proof : t10_tsp_2 fc6_membered rc2_subset_1 t6_boole t9_tsp_2 existence_m1_subset_1 t11_tsp_1 t35_tex_2
% 0.21/0.50  
%------------------------------------------------------------------------------