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

View Problem - Process Solution

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

% Computer : n024.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:09 EDT 2022

% Result   : Theorem 0.18s 0.50s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   35 (  17 unt;   0 nHn;  35 RR)
%            Number of literals    :  120 (   0 equ;  86 neg)
%            Maximal clause size   :   10 (   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,skc16),
    file('MGT009+1.p',unknown),
    [] ).

cnf(2,axiom,
    organization(skc15,skc14),
    file('MGT009+1.p',unknown),
    [] ).

cnf(3,axiom,
    greater(skc10,skc9),
    file('MGT009+1.p',unknown),
    [] ).

cnf(4,axiom,
    size(skc15,skc10,skc14),
    file('MGT009+1.p',unknown),
    [] ).

cnf(5,axiom,
    reproducibility(skc15,skc11,skc14),
    file('MGT009+1.p',unknown),
    [] ).

cnf(6,axiom,
    class(skc15,skc13,skc14),
    file('MGT009+1.p',unknown),
    [] ).

cnf(7,axiom,
    reorganization_free(skc15,skc14,skc14),
    file('MGT009+1.p',unknown),
    [] ).

cnf(8,axiom,
    reorganization_free(skc17,skc16,skc16),
    file('MGT009+1.p',unknown),
    [] ).

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

cnf(10,axiom,
    reproducibility(skc17,skc12,skc16),
    file('MGT009+1.p',unknown),
    [] ).

cnf(11,axiom,
    size(skc17,skc9,skc16),
    file('MGT009+1.p',unknown),
    [] ).

cnf(12,axiom,
    ~ greater(skc11,skc12),
    file('MGT009+1.p',unknown),
    [] ).

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

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

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

cnf(20,plain,
    inertia(skc15,skf1(skc14,skc15),skc14),
    inference(res,[status(thm),theory(equality)],[2,13]),
    [iquote('0:Res:2.0,13.0')] ).

cnf(27,plain,
    inertia(skc17,skf1(skc16,skc17),skc16),
    inference(res,[status(thm),theory(equality)],[1,13]),
    [iquote('0:Res:1.0,13.0')] ).

cnf(30,plain,
    ( ~ greater(u,v)
    | ~ organization(w,x)
    | ~ class(w,y,x)
    | ~ size(w,u,x)
    | ~ inertia(w,z,x)
    | ~ inertia(skc17,x1,skc16)
    | ~ size(skc17,v,skc16)
    | ~ class(skc17,y,skc16)
    | greater(z,x1) ),
    inference(res,[status(thm),theory(equality)],[1,14]),
    [iquote('0:Res:1.0,14.4')] ).

cnf(33,plain,
    ( ~ greater(u,v)
    | ~ reorganization_free(skc17,skc16,skc16)
    | ~ reproducibility(skc17,w,skc16)
    | ~ inertia(skc17,v,skc16)
    | ~ inertia(x,u,y)
    | ~ reproducibility(x,z,y)
    | ~ reorganization_free(x,y,y)
    | ~ organization(x,y)
    | greater(z,w) ),
    inference(res,[status(thm),theory(equality)],[1,15]),
    [iquote('0:Res:1.0,15.1')] ).

cnf(34,plain,
    ( ~ organization(u,v)
    | ~ greater(w,x)
    | ~ reorganization_free(u,v,v)
    | ~ reproducibility(u,y,v)
    | ~ inertia(u,w,v)
    | ~ inertia(skc17,x,skc16)
    | ~ reproducibility(skc17,z,skc16)
    | greater(y,z) ),
    inference(mrr,[status(thm)],[33,8]),
    [iquote('0:MRR:33.1,8.0')] ).

cnf(89,plain,
    ( ~ organization(skc15,skc14)
    | ~ greater(u,v)
    | ~ reproducibility(skc15,w,skc14)
    | ~ inertia(skc15,u,skc14)
    | ~ inertia(skc17,v,skc16)
    | ~ reproducibility(skc17,x,skc16)
    | greater(w,x) ),
    inference(res,[status(thm),theory(equality)],[7,34]),
    [iquote('0:Res:7.0,34.2')] ).

cnf(90,plain,
    ( ~ greater(u,v)
    | ~ reproducibility(skc15,w,skc14)
    | ~ inertia(skc15,u,skc14)
    | ~ inertia(skc17,v,skc16)
    | ~ reproducibility(skc17,x,skc16)
    | greater(w,x) ),
    inference(mrr,[status(thm)],[89,2]),
    [iquote('0:MRR:89.0,2.0')] ).

cnf(156,plain,
    ( ~ greater(u,v)
    | ~ organization(skc15,skc14)
    | ~ size(skc15,u,skc14)
    | ~ inertia(skc15,w,skc14)
    | ~ inertia(skc17,x,skc16)
    | ~ size(skc17,v,skc16)
    | ~ class(skc17,skc13,skc16)
    | greater(w,x) ),
    inference(res,[status(thm),theory(equality)],[6,30]),
    [iquote('0:Res:6.0,30.2')] ).

cnf(157,plain,
    ( ~ greater(u,v)
    | ~ size(skc15,u,skc14)
    | ~ inertia(skc15,w,skc14)
    | ~ inertia(skc17,x,skc16)
    | ~ size(skc17,v,skc16)
    | greater(w,x) ),
    inference(mrr,[status(thm)],[156,2,9]),
    [iquote('0:MRR:156.1,156.6,2.0,9.0')] ).

cnf(206,plain,
    ( ~ greater(u,v)
    | ~ inertia(skc15,u,skc14)
    | ~ inertia(skc17,v,skc16)
    | ~ reproducibility(skc17,w,skc16)
    | greater(skc11,w) ),
    inference(res,[status(thm),theory(equality)],[5,90]),
    [iquote('0:Res:5.0,90.1')] ).

cnf(207,plain,
    ( ~ greater(skf1(skc14,skc15),u)
    | ~ inertia(skc17,u,skc16)
    | ~ reproducibility(skc17,v,skc16)
    | greater(skc11,v) ),
    inference(res,[status(thm),theory(equality)],[20,206]),
    [iquote('0:Res:20.0,206.1')] ).

cnf(252,plain,
    ( ~ greater(skc10,u)
    | ~ inertia(skc15,v,skc14)
    | ~ inertia(skc17,w,skc16)
    | ~ size(skc17,u,skc16)
    | greater(v,w) ),
    inference(res,[status(thm),theory(equality)],[4,157]),
    [iquote('0:Res:4.0,157.1')] ).

cnf(269,plain,
    ( ~ greater(skc10,u)
    | ~ inertia(skc17,v,skc16)
    | ~ size(skc17,u,skc16)
    | greater(skf1(skc14,skc15),v) ),
    inference(res,[status(thm),theory(equality)],[20,252]),
    [iquote('0:Res:20.0,252.1')] ).

cnf(271,plain,
    ( ~ greater(skc10,u)
    | ~ size(skc17,u,skc16)
    | greater(skf1(skc14,skc15),skf1(skc16,skc17)) ),
    inference(res,[status(thm),theory(equality)],[27,269]),
    [iquote('0:Res:27.0,269.1')] ).

cnf(274,plain,
    ( ~ greater(skc10,skc9)
    | greater(skf1(skc14,skc15),skf1(skc16,skc17)) ),
    inference(res,[status(thm),theory(equality)],[11,271]),
    [iquote('0:Res:11.0,271.1')] ).

cnf(275,plain,
    greater(skf1(skc14,skc15),skf1(skc16,skc17)),
    inference(mrr,[status(thm)],[274,3]),
    [iquote('0:MRR:274.0,3.0')] ).

cnf(276,plain,
    ( ~ inertia(skc17,skf1(skc16,skc17),skc16)
    | ~ reproducibility(skc17,u,skc16)
    | greater(skc11,u) ),
    inference(res,[status(thm),theory(equality)],[275,207]),
    [iquote('0:Res:275.0,207.0')] ).

cnf(280,plain,
    ( ~ reproducibility(skc17,u,skc16)
    | greater(skc11,u) ),
    inference(mrr,[status(thm)],[276,27]),
    [iquote('0:MRR:276.0,27.0')] ).

cnf(286,plain,
    greater(skc11,skc12),
    inference(res,[status(thm),theory(equality)],[10,280]),
    [iquote('0:Res:10.0,280.0')] ).

cnf(287,plain,
    $false,
    inference(mrr,[status(thm)],[286,12]),
    [iquote('0:MRR:286.0,12.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : MGT009+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n024.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 : Thu Jun  9 09:35:04 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.50  
% 0.18/0.50  SPASS V 3.9 
% 0.18/0.50  SPASS beiseite: Proof found.
% 0.18/0.50  % SZS status Theorem
% 0.18/0.50  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.50  SPASS derived 196 clauses, backtracked 0 clauses, performed 0 splits and kept 164 clauses.
% 0.18/0.50  SPASS allocated 85455 KBytes.
% 0.18/0.50  SPASS spent	0:00:00.15 on the problem.
% 0.18/0.50  		0:00:00.04 for the input.
% 0.18/0.50  		0:00:00.04 for the FLOTTER CNF translation.
% 0.18/0.50  		0:00:00.01 for inferences.
% 0.18/0.50  		0:00:00.00 for the backtracking.
% 0.18/0.50  		0:00:00.03 for the reduction.
% 0.18/0.50  
% 0.18/0.50  
% 0.18/0.50  Here is a proof with depth 8, length 35 :
% 0.18/0.50  % SZS output start Refutation
% See solution above
% 0.18/0.50  Formulae used in the proof : t9_FOL mp5 a5_FOL a3_FOL
% 0.18/0.50  
%------------------------------------------------------------------------------