TSTP Solution File: MGT003-1 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n032.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:07 EDT 2022

% Result   : Unsatisfiable 0.14s 0.36s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   26 (  13 unt;   0 nHn;  26 RR)
%            Number of literals    :   76 (   0 equ;  54 neg)
%            Maximal clause size   :   10 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;  13 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ reorganization_free(u,v,w)
    | reorganization_free(u,v,v) ),
    file('MGT003-1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ reorganization_free(u,v,w)
    | reorganization_free(u,w,w) ),
    file('MGT003-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ organization(u,v)
    | inertia(u,sk1(v,u),v) ),
    file('MGT003-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ greater(u,v)
    | ~ organization(w,x)
    | ~ organization(y,z)
    | ~ survival_chance(w,x1,x)
    | ~ survival_chance(y,x2,z)
    | ~ inertia(w,u,x)
    | ~ inertia(y,v,z)
    | ~ reorganization_free(w,x,x)
    | ~ reorganization_free(y,z,z)
    | greater(x1,x2) ),
    file('MGT003-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ greater(u,v)
    | ~ organization(w,u)
    | ~ organization(w,v)
    | ~ inertia(w,x,u)
    | ~ inertia(w,y,v)
    | ~ reorganization_free(w,v,u)
    | greater(x,y) ),
    file('MGT003-1.p',unknown),
    [] ).

cnf(6,axiom,
    organization(sk2,sk5),
    file('MGT003-1.p',unknown),
    [] ).

cnf(7,axiom,
    organization(sk2,sk6),
    file('MGT003-1.p',unknown),
    [] ).

cnf(8,axiom,
    reorganization_free(sk2,sk5,sk6),
    file('MGT003-1.p',unknown),
    [] ).

cnf(9,axiom,
    survival_chance(sk2,sk3,sk5),
    file('MGT003-1.p',unknown),
    [] ).

cnf(10,axiom,
    survival_chance(sk2,sk4,sk6),
    file('MGT003-1.p',unknown),
    [] ).

cnf(11,axiom,
    greater(sk6,sk5),
    file('MGT003-1.p',unknown),
    [] ).

cnf(12,axiom,
    ~ greater(sk4,sk3),
    file('MGT003-1.p',unknown),
    [] ).

cnf(17,plain,
    inertia(sk2,sk1(sk6,sk2),sk6),
    inference(res,[status(thm),theory(equality)],[7,3]),
    [iquote('0:Res:7.0,3.0')] ).

cnf(21,plain,
    ( ~ greater(u,sk5)
    | ~ organization(sk2,u)
    | ~ inertia(sk2,v,u)
    | ~ inertia(sk2,w,sk5)
    | ~ reorganization_free(sk2,sk5,u)
    | greater(v,w) ),
    inference(res,[status(thm),theory(equality)],[6,5]),
    [iquote('0:Res:6.0,5.0')] ).

cnf(22,plain,
    inertia(sk2,sk1(sk5,sk2),sk5),
    inference(res,[status(thm),theory(equality)],[6,3]),
    [iquote('0:Res:6.0,3.0')] ).

cnf(25,plain,
    reorganization_free(sk2,sk6,sk6),
    inference(res,[status(thm),theory(equality)],[8,2]),
    [iquote('0:Res:8.0,2.0')] ).

cnf(29,plain,
    reorganization_free(sk2,sk5,sk5),
    inference(res,[status(thm),theory(equality)],[8,1]),
    [iquote('0:Res:8.0,1.0')] ).

cnf(47,plain,
    ( ~ greater(u,v)
    | ~ organization(sk2,sk6)
    | ~ organization(w,x)
    | ~ survival_chance(w,y,x)
    | ~ inertia(sk2,u,sk6)
    | ~ inertia(w,v,x)
    | ~ reorganization_free(sk2,sk6,sk6)
    | ~ reorganization_free(w,x,x)
    | greater(sk4,y) ),
    inference(res,[status(thm),theory(equality)],[10,4]),
    [iquote('0:Res:10.0,4.3')] ).

cnf(50,plain,
    ( ~ greater(u,v)
    | ~ organization(w,x)
    | ~ survival_chance(w,y,x)
    | ~ inertia(sk2,u,sk6)
    | ~ inertia(w,v,x)
    | ~ reorganization_free(w,x,x)
    | greater(sk4,y) ),
    inference(mrr,[status(thm)],[47,7,25]),
    [iquote('0:MRR:47.1,47.6,7.0,25.0')] ).

cnf(63,plain,
    ( ~ greater(sk6,sk5)
    | ~ organization(sk2,sk6)
    | ~ inertia(sk2,u,sk5)
    | ~ reorganization_free(sk2,sk5,sk6)
    | greater(sk1(sk6,sk2),u) ),
    inference(res,[status(thm),theory(equality)],[17,21]),
    [iquote('0:Res:17.0,21.2')] ).

cnf(65,plain,
    ( ~ inertia(sk2,u,sk5)
    | greater(sk1(sk6,sk2),u) ),
    inference(mrr,[status(thm)],[63,11,7,8]),
    [iquote('0:MRR:63.0,63.1,63.3,11.0,7.0,8.0')] ).

cnf(114,plain,
    ( ~ greater(u,v)
    | ~ organization(sk2,sk5)
    | ~ inertia(sk2,u,sk6)
    | ~ inertia(sk2,v,sk5)
    | ~ reorganization_free(sk2,sk5,sk5)
    | greater(sk4,sk3) ),
    inference(res,[status(thm),theory(equality)],[9,50]),
    [iquote('0:Res:9.0,50.2')] ).

cnf(115,plain,
    ( ~ greater(u,v)
    | ~ inertia(sk2,u,sk6)
    | ~ inertia(sk2,v,sk5) ),
    inference(mrr,[status(thm)],[114,6,29,12]),
    [iquote('0:MRR:114.1,114.4,114.5,6.0,29.0,12.0')] ).

cnf(117,plain,
    ( ~ greater(sk1(sk6,sk2),u)
    | ~ inertia(sk2,u,sk5) ),
    inference(res,[status(thm),theory(equality)],[17,115]),
    [iquote('0:Res:17.0,115.1')] ).

cnf(119,plain,
    ~ inertia(sk2,u,sk5),
    inference(mrr,[status(thm)],[117,65]),
    [iquote('0:MRR:117.0,65.1')] ).

cnf(120,plain,
    $false,
    inference(unc,[status(thm)],[119,22]),
    [iquote('0:UnC:119.0,22.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : MGT003-1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.09  % Command  : run_spass %d %s
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 600
% 0.09/0.28  % DateTime : Thu Jun  9 07:33:07 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 0.14/0.36  
% 0.14/0.36  SPASS V 3.9 
% 0.14/0.36  SPASS beiseite: Proof found.
% 0.14/0.36  % SZS status Theorem
% 0.14/0.36  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.14/0.36  SPASS derived 73 clauses, backtracked 0 clauses, performed 0 splits and kept 67 clauses.
% 0.14/0.36  SPASS allocated 63234 KBytes.
% 0.14/0.36  SPASS spent	0:00:00.06 on the problem.
% 0.14/0.36  		0:00:00.03 for the input.
% 0.14/0.36  		0:00:00.00 for the FLOTTER CNF translation.
% 0.14/0.36  		0:00:00.00 for inferences.
% 0.14/0.36  		0:00:00.00 for the backtracking.
% 0.14/0.36  		0:00:00.01 for the reduction.
% 0.14/0.36  
% 0.14/0.36  
% 0.14/0.36  Here is a proof with depth 3, length 26 :
% 0.14/0.36  % SZS output start Refutation
% See solution above
% 0.14/0.36  Formulae used in the proof : mp4_1 mp4_2 mp5_3 t1_FOL_4 t2_FOL_5 t3_FOL_6 t3_FOL_7 t3_FOL_8 t3_FOL_9 t3_FOL_10 t3_FOL_11 t3_FOL_12
% 0.14/0.36  
%------------------------------------------------------------------------------