%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT002+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 8 06:19:43 AM UTC 2026
% Result : Theorem 0.32s 0.63s
% Output : Refutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 28 ( 13 unt; 0 nHn; 28 RR)
% Number of literals : 87 ( 0 equ; 60 neg)
% Maximal clause size : 10 ( 3 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,
organization(skc9,skc5),
file('MGT002+1.p',unknown),
[] ).
cnf(2,axiom,
organization(skc9,skc6),
file('MGT002+1.p',unknown),
[] ).
cnf(3,axiom,
greater(skc6,skc5),
file('MGT002+1.p',unknown),
[] ).
cnf(4,axiom,
reorganization_free(skc9,skc5,skc6),
file('MGT002+1.p',unknown),
[] ).
cnf(5,axiom,
inertia(skc9,skc8,skc5),
file('MGT002+1.p',unknown),
[] ).
cnf(6,axiom,
inertia(skc9,skc7,skc6),
file('MGT002+1.p',unknown),
[] ).
cnf(7,axiom,
~ greater(skc7,skc8),
file('MGT002+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ reorganization_free(u,v,w)
| reorganization_free(u,v,v) ),
file('MGT002+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ reorganization_free(u,v,w)
| reorganization_free(u,w,w) ),
file('MGT002+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ organization(u,v)
| reproducibility(u,skf1(v,u),v) ),
file('MGT002+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ greater(u,v)
| ~ organization(w,u)
| ~ organization(w,v)
| ~ reproducibility(w,x,u)
| ~ reproducibility(w,y,v)
| ~ reorganization_free(w,v,u)
| greater(x,y) ),
file('MGT002+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ organization(u,v)
| ~ organization(w,x)
| ~ greater(y,z)
| ~ reorganization_free(u,v,v)
| ~ reproducibility(u,y,v)
| ~ inertia(u,x1,v)
| ~ inertia(w,x2,x)
| ~ reproducibility(w,z,x)
| ~ reorganization_free(w,x,x)
| greater(x1,x2) ),
file('MGT002+1.p',unknown),
[] ).
cnf(18,plain,
reproducibility(skc9,skf1(skc6,skc9),skc6),
inference(res,[status(thm),theory(equality)],[2,10]),
[iquote('0:Res:2.0,10.0')] ).
cnf(19,plain,
( ~ greater(skc6,u)
| ~ organization(skc9,u)
| ~ reproducibility(skc9,v,u)
| ~ reproducibility(skc9,w,skc6)
| ~ reorganization_free(skc9,u,skc6)
| greater(w,v) ),
inference(res,[status(thm),theory(equality)],[2,11]),
[iquote('0:Res:2.0,11.1')] ).
cnf(23,plain,
( ~ organization(u,v)
| ~ greater(w,x)
| ~ inertia(u,y,v)
| ~ reproducibility(u,x,v)
| ~ reorganization_free(u,v,v)
| ~ reproducibility(skc9,w,skc6)
| ~ inertia(skc9,z,skc6)
| ~ reorganization_free(skc9,skc6,skc6)
| greater(z,y) ),
inference(res,[status(thm),theory(equality)],[2,13]),
[iquote('0:Res:2.0,13.8')] ).
cnf(25,plain,
reproducibility(skc9,skf1(skc5,skc9),skc5),
inference(res,[status(thm),theory(equality)],[1,10]),
[iquote('0:Res:1.0,10.0')] ).
cnf(31,plain,
reorganization_free(skc9,skc6,skc6),
inference(res,[status(thm),theory(equality)],[4,9]),
[iquote('0:Res:4.0,9.0')] ).
cnf(35,plain,
( ~ organization(u,v)
| ~ greater(w,x)
| ~ inertia(u,y,v)
| ~ reproducibility(u,x,v)
| ~ reorganization_free(u,v,v)
| ~ reproducibility(skc9,w,skc6)
| ~ inertia(skc9,z,skc6)
| greater(z,y) ),
inference(mrr,[status(thm)],[23,31]),
[iquote('0:MRR:23.7,31.0')] ).
cnf(37,plain,
reorganization_free(skc9,skc5,skc5),
inference(res,[status(thm),theory(equality)],[4,8]),
[iquote('0:Res:4.0,8.0')] ).
cnf(77,plain,
( ~ greater(skc6,skc5)
| ~ organization(skc9,skc5)
| ~ reproducibility(skc9,u,skc6)
| ~ reorganization_free(skc9,skc5,skc6)
| greater(u,skf1(skc5,skc9)) ),
inference(res,[status(thm),theory(equality)],[25,19]),
[iquote('0:Res:25.0,19.2')] ).
cnf(81,plain,
( ~ reproducibility(skc9,u,skc6)
| greater(u,skf1(skc5,skc9)) ),
inference(mrr,[status(thm)],[77,3,1,4]),
[iquote('0:MRR:77.0,77.1,77.3,3.0,1.0,4.0')] ).
cnf(158,plain,
( ~ organization(skc9,skc5)
| ~ greater(u,v)
| ~ reproducibility(skc9,v,skc5)
| ~ reorganization_free(skc9,skc5,skc5)
| ~ reproducibility(skc9,u,skc6)
| ~ inertia(skc9,w,skc6)
| greater(w,skc8) ),
inference(res,[status(thm),theory(equality)],[5,35]),
[iquote('0:Res:5.0,35.2')] ).
cnf(159,plain,
( ~ greater(u,v)
| ~ reproducibility(skc9,v,skc5)
| ~ reproducibility(skc9,u,skc6)
| ~ inertia(skc9,w,skc6)
| greater(w,skc8) ),
inference(mrr,[status(thm)],[158,1,37]),
[iquote('0:MRR:158.0,158.3,1.0,37.0')] ).
cnf(176,plain,
( ~ greater(u,skf1(skc5,skc9))
| ~ reproducibility(skc9,u,skc6)
| ~ inertia(skc9,v,skc6)
| greater(v,skc8) ),
inference(res,[status(thm),theory(equality)],[25,159]),
[iquote('0:Res:25.0,159.1')] ).
cnf(178,plain,
( ~ reproducibility(skc9,u,skc6)
| ~ inertia(skc9,v,skc6)
| greater(v,skc8) ),
inference(mrr,[status(thm)],[176,81]),
[iquote('0:MRR:176.0,81.1')] ).
cnf(184,plain,
( ~ inertia(skc9,u,skc6)
| greater(u,skc8) ),
inference(res,[status(thm),theory(equality)],[18,178]),
[iquote('0:Res:18.0,178.0')] ).
cnf(186,plain,
greater(skc7,skc8),
inference(res,[status(thm),theory(equality)],[6,184]),
[iquote('0:Res:6.0,184.0')] ).
cnf(187,plain,
$false,
inference(mrr,[status(thm)],[186,7]),
[iquote('0:MRR:186.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT002+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.09/0.43 % Computer : n003.cluster.edu
% 0.09/0.43 % Model : x86_64 x86_64
% 0.09/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.43 % Memory : 8046.5625MB
% 0.09/0.43 % OS : Linux 6.8.0-71-generic
% 0.09/0.43 % CPULimit : 300
% 0.09/0.43 % WCLimit : 300
% 0.09/0.43 % DateTime : Mon Sep 7 11:33:54 UTC 2026
% 0.09/0.43 % CPUTime :
% 0.32/0.63
% 0.32/0.63 SPASS V 3.9
% 0.32/0.63 SPASS beiseite: Proof found.
% 0.32/0.63 % SZS status Theorem
% 0.32/0.63 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.32/0.63 SPASS derived 129 clauses, backtracked 0 clauses, performed 0 splits and kept 98 clauses.
% 0.32/0.63 SPASS allocated 85325 KBytes.
% 0.32/0.63 SPASS spent 0:00:00.18 on the problem.
% 0.32/0.63 0:00:00.06 for the input.
% 0.32/0.63 0:00:00.05 for the FLOTTER CNF translation.
% 0.32/0.63 0:00:00.00 for inferences.
% 0.32/0.63 0:00:00.00 for the backtracking.
% 0.32/0.63 0:00:00.02 for the reduction.
% 0.32/0.63
% 0.32/0.63
% 0.32/0.63 Here is a proof with depth 5, length 28 :
% 0.32/0.63 % SZS output start Refutation
% See solution above
% 0.32/0.63 Formulae used in the proof : t2_FOL mp4 mp3 a4_FOL a3_FOL
% 0.32/0.63
%------------------------------------------------------------------------------