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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : MGT017+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n021.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 : Sun Jul 17 22:26:12 EDT 2022

% Result   : Theorem 0.37s 0.53s
% Output   : Refutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   34 (  17 unt;   0 nHn;  34 RR)
%            Number of literals    :  126 (   0 equ;  96 neg)
%            Maximal clause size   :   13 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :   19 (  19 usr;  18 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    organization(skc17,skc13),
    file('MGT017+1.p',unknown),
    [] ).

cnf(2,axiom,
    organization(skc16,skc10),
    file('MGT017+1.p',unknown),
    [] ).

cnf(3,axiom,
    organization(skc16,skc13),
    file('MGT017+1.p',unknown),
    [] ).

cnf(4,axiom,
    greater(skc11,skc12),
    file('MGT017+1.p',unknown),
    [] ).

cnf(5,axiom,
    size(skc16,skc11,skc13),
    file('MGT017+1.p',unknown),
    [] ).

cnf(6,axiom,
    reorganization_type(skc16,skc15,skc13),
    file('MGT017+1.p',unknown),
    [] ).

cnf(7,axiom,
    reorganization(skc16,skc13,skc10),
    file('MGT017+1.p',unknown),
    [] ).

cnf(8,axiom,
    class(skc16,skc14,skc13),
    file('MGT017+1.p',unknown),
    [] ).

cnf(9,axiom,
    class(skc17,skc14,skc13),
    file('MGT017+1.p',unknown),
    [] ).

cnf(10,axiom,
    reorganization(skc17,skc13,skc9),
    file('MGT017+1.p',unknown),
    [] ).

cnf(11,axiom,
    reorganization_type(skc17,skc15,skc13),
    file('MGT017+1.p',unknown),
    [] ).

cnf(12,axiom,
    size(skc17,skc12,skc13),
    file('MGT017+1.p',unknown),
    [] ).

cnf(13,axiom,
    ~ greater(skc10,skc9),
    file('MGT017+1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ organization(u,v)
    | inertia(u,skf1(v,u),v) ),
    file('MGT017+1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ greater(u,v)
    | ~ organization(w,x)
    | ~ organization(y,z)
    | ~ inertia(w,x1,x)
    | ~ size(w,v,x)
    | ~ class(w,x2,x)
    | ~ class(y,x2,z)
    | ~ size(y,u,z)
    | ~ inertia(y,x3,z)
    | greater(x3,x1) ),
    file('MGT017+1.p',unknown),
    [] ).

cnf(16,axiom,
    ( ~ greater(u,v)
    | ~ organization(w,x)
    | ~ organization(y,x)
    | ~ organization(y,z)
    | ~ inertia(w,v,x)
    | ~ reorganization_type(w,x1,x)
    | ~ reorganization(w,x,x2)
    | ~ class(w,x3,x)
    | ~ class(y,x3,x)
    | ~ reorganization(y,x,z)
    | ~ reorganization_type(y,x1,x)
    | ~ inertia(y,u,x)
    | greater(z,x2) ),
    file('MGT017+1.p',unknown),
    [] ).

cnf(17,plain,
    ( ~ organization(u,v)
    | ~ organization(w,x)
    | ~ inertia(u,y,v)
    | ~ class(u,z,v)
    | ~ class(w,z,x)
    | ~ inertia(w,x1,x)
    | ~ size(u,skc12,v)
    | ~ size(w,skc11,x)
    | greater(x1,y) ),
    inference(res,[status(thm),theory(equality)],[4,15]),
    [iquote('0:Res:4.0,15.8')] ).

cnf(19,plain,
    inertia(skc16,skf1(skc13,skc16),skc13),
    inference(res,[status(thm),theory(equality)],[3,14]),
    [iquote('0:Res:3.0,14.0')] ).

cnf(28,plain,
    ( ~ greater(u,v)
    | ~ organization(w,x)
    | ~ organization(skc16,x)
    | ~ inertia(w,v,x)
    | ~ reorganization_type(w,y,x)
    | ~ reorganization(w,x,z)
    | ~ class(w,x1,x)
    | ~ class(skc16,x1,x)
    | ~ reorganization_type(skc16,y,x)
    | ~ inertia(skc16,u,x)
    | ~ reorganization(skc16,x,skc10)
    | greater(skc10,z) ),
    inference(res,[status(thm),theory(equality)],[2,16]),
    [iquote('0:Res:2.0,16.4')] ).

cnf(31,plain,
    inertia(skc17,skf1(skc13,skc17),skc13),
    inference(res,[status(thm),theory(equality)],[1,14]),
    [iquote('0:Res:1.0,14.0')] ).

cnf(125,plain,
    ( ~ organization(skc17,skc13)
    | ~ organization(u,v)
    | ~ class(skc17,w,skc13)
    | ~ class(u,w,v)
    | ~ inertia(u,x,v)
    | ~ size(skc17,skc12,skc13)
    | ~ size(u,skc11,v)
    | greater(x,skf1(skc13,skc17)) ),
    inference(res,[status(thm),theory(equality)],[31,17]),
    [iquote('0:Res:31.0,17.2')] ).

cnf(131,plain,
    ( ~ organization(u,v)
    | ~ class(skc17,w,skc13)
    | ~ class(u,w,v)
    | ~ inertia(u,x,v)
    | ~ size(u,skc11,v)
    | greater(x,skf1(skc13,skc17)) ),
    inference(mrr,[status(thm)],[125,1,12]),
    [iquote('0:MRR:125.0,125.5,1.0,12.0')] ).

cnf(140,plain,
    ( ~ organization(u,v)
    | ~ class(u,skc14,v)
    | ~ inertia(u,w,v)
    | ~ size(u,skc11,v)
    | greater(w,skf1(skc13,skc17)) ),
    inference(res,[status(thm),theory(equality)],[9,131]),
    [iquote('0:Res:9.0,131.1')] ).

cnf(142,plain,
    ( ~ organization(skc16,skc13)
    | ~ inertia(skc16,u,skc13)
    | ~ size(skc16,skc11,skc13)
    | greater(u,skf1(skc13,skc17)) ),
    inference(res,[status(thm),theory(equality)],[8,140]),
    [iquote('0:Res:8.0,140.1')] ).

cnf(144,plain,
    ( ~ inertia(skc16,u,skc13)
    | greater(u,skf1(skc13,skc17)) ),
    inference(mrr,[status(thm)],[142,3,5]),
    [iquote('0:MRR:142.0,142.2,3.0,5.0')] ).

cnf(223,plain,
    ( ~ greater(u,skf1(skc13,skc17))
    | ~ organization(skc17,skc13)
    | ~ organization(skc16,skc13)
    | ~ reorganization_type(skc17,v,skc13)
    | ~ reorganization(skc17,skc13,w)
    | ~ class(skc17,x,skc13)
    | ~ class(skc16,x,skc13)
    | ~ reorganization_type(skc16,v,skc13)
    | ~ inertia(skc16,u,skc13)
    | ~ reorganization(skc16,skc13,skc10)
    | greater(skc10,w) ),
    inference(res,[status(thm),theory(equality)],[31,28]),
    [iquote('0:Res:31.0,28.3')] ).

cnf(230,plain,
    ( ~ reorganization_type(skc17,u,skc13)
    | ~ reorganization(skc17,skc13,v)
    | ~ class(skc17,w,skc13)
    | ~ class(skc16,w,skc13)
    | ~ reorganization_type(skc16,u,skc13)
    | ~ inertia(skc16,x,skc13)
    | greater(skc10,v) ),
    inference(mrr,[status(thm)],[223,144,1,3,7]),
    [iquote('0:MRR:223.0,223.1,223.2,223.9,144.1,1.0,3.0,7.0')] ).

cnf(255,plain,
    ( ~ reorganization(skc17,skc13,u)
    | ~ class(skc17,v,skc13)
    | ~ class(skc16,v,skc13)
    | ~ reorganization_type(skc16,skc15,skc13)
    | ~ inertia(skc16,w,skc13)
    | greater(skc10,u) ),
    inference(res,[status(thm),theory(equality)],[11,230]),
    [iquote('0:Res:11.0,230.0')] ).

cnf(256,plain,
    ( ~ reorganization(skc17,skc13,u)
    | ~ class(skc17,v,skc13)
    | ~ class(skc16,v,skc13)
    | ~ inertia(skc16,w,skc13)
    | greater(skc10,u) ),
    inference(mrr,[status(thm)],[255,6]),
    [iquote('0:MRR:255.3,6.0')] ).

cnf(257,plain,
    ( ~ class(skc17,u,skc13)
    | ~ class(skc16,u,skc13)
    | ~ inertia(skc16,v,skc13)
    | greater(skc10,skc9) ),
    inference(res,[status(thm),theory(equality)],[10,256]),
    [iquote('0:Res:10.0,256.0')] ).

cnf(258,plain,
    ( ~ class(skc17,u,skc13)
    | ~ class(skc16,u,skc13)
    | ~ inertia(skc16,v,skc13) ),
    inference(mrr,[status(thm)],[257,13]),
    [iquote('0:MRR:257.3,13.0')] ).

cnf(281,plain,
    ( ~ class(skc16,skc14,skc13)
    | ~ inertia(skc16,u,skc13) ),
    inference(res,[status(thm),theory(equality)],[9,258]),
    [iquote('0:Res:9.0,258.0')] ).

cnf(282,plain,
    ~ inertia(skc16,u,skc13),
    inference(mrr,[status(thm)],[281,8]),
    [iquote('0:MRR:281.0,8.0')] ).

cnf(283,plain,
    $false,
    inference(unc,[status(thm)],[282,19]),
    [iquote('0:UnC:282.0,19.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : MGT017+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Thu Jun  9 08:12:23 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.37/0.53  
% 0.37/0.53  SPASS V 3.9 
% 0.37/0.53  SPASS beiseite: Proof found.
% 0.37/0.53  % SZS status Theorem
% 0.37/0.53  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.37/0.53  SPASS derived 172 clauses, backtracked 0 clauses, performed 0 splits and kept 156 clauses.
% 0.37/0.53  SPASS allocated 85540 KBytes.
% 0.37/0.53  SPASS spent	0:00:00.18 on the problem.
% 0.37/0.53  		0:00:00.04 for the input.
% 0.37/0.53  		0:00:00.04 for the FLOTTER CNF translation.
% 0.37/0.53  		0:00:00.01 for inferences.
% 0.37/0.53  		0:00:00.00 for the backtracking.
% 0.37/0.53  		0:00:00.05 for the reduction.
% 0.37/0.53  
% 0.37/0.53  
% 0.37/0.53  Here is a proof with depth 5, length 34 :
% 0.37/0.53  % SZS output start Refutation
% See solution above
% 0.37/0.53  Formulae used in the proof : t17_FOL mp5 a5_FOL a13_FOL
% 0.37/0.53  
%------------------------------------------------------------------------------