%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT013+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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:46 AM UTC 2026
% Result : Theorem 0.22s 0.56s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of clauses : 36 ( 20 unt; 3 nHn; 36 RR)
% Number of literals : 88 ( 0 equ; 59 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 12 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
organization(skc12,skc13),
file('MGT013+1.p',unknown),
[] ).
cnf(2,axiom,
organization(skc12,skc11),
file('MGT013+1.p',unknown),
[] ).
cnf(3,axiom,
greater(skc9,skc10),
file('MGT013+1.p',unknown),
[] ).
cnf(4,axiom,
greater(skc7,skc8),
file('MGT013+1.p',unknown),
[] ).
cnf(5,axiom,
reorganization_free(skc12,skc13,skc11),
file('MGT013+1.p',unknown),
[] ).
cnf(6,axiom,
complexity(skc12,skc10,skc13),
file('MGT013+1.p',unknown),
[] ).
cnf(7,axiom,
size(skc12,skc7,skc13),
file('MGT013+1.p',unknown),
[] ).
cnf(8,axiom,
size(skc12,skc8,skc11),
file('MGT013+1.p',unknown),
[] ).
cnf(9,axiom,
complexity(skc12,skc9,skc11),
file('MGT013+1.p',unknown),
[] ).
cnf(10,axiom,
~ greater(u,u),
file('MGT013+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ organization(u,v)
| time(v) ),
file('MGT013+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ reorganization_free(u,v,w)
| reorganization_free(u,w,v) ),
file('MGT013+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ time(u)
| ~ time(v)
| greater(u,v)
| equal(v,u)
| greater(v,u) ),
file('MGT013+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ organization(u,v)
| ~ complexity(u,w,v)
| ~ complexity(u,x,v)
| equal(x,w) ),
file('MGT013+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ greater(u,v)
| ~ greater(w,x)
| ~ organization(y,u)
| ~ organization(y,v)
| ~ complexity(y,x,u)
| ~ complexity(y,w,v)
| ~ reorganization_free(y,v,u) ),
file('MGT013+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ greater(u,v)
| ~ greater(w,x)
| ~ organization(y,u)
| ~ organization(y,v)
| ~ size(y,x,u)
| ~ size(y,w,v)
| ~ reorganization_free(y,v,u) ),
file('MGT013+1.p',unknown),
[] ).
cnf(32,plain,
( ~ complexity(skc12,u,skc11)
| ~ complexity(skc12,v,skc11)
| equal(v,u) ),
inference(res,[status(thm),theory(equality)],[2,15]),
[iquote('0:Res:2.0,15.0')] ).
cnf(33,plain,
time(skc11),
inference(res,[status(thm),theory(equality)],[2,11]),
[iquote('0:Res:2.0,11.0')] ).
cnf(37,plain,
time(skc13),
inference(res,[status(thm),theory(equality)],[1,11]),
[iquote('0:Res:1.0,11.0')] ).
cnf(40,plain,
reorganization_free(skc12,skc11,skc13),
inference(res,[status(thm),theory(equality)],[5,13]),
[iquote('0:Res:5.0,13.0')] ).
cnf(42,plain,
( ~ complexity(skc12,u,skc11)
| equal(u,skc9) ),
inference(res,[status(thm),theory(equality)],[9,32]),
[iquote('0:Res:9.0,32.0')] ).
cnf(58,plain,
( ~ greater(skc11,u)
| ~ greater(v,skc8)
| ~ organization(skc12,skc11)
| ~ organization(skc12,u)
| ~ size(skc12,v,u)
| ~ reorganization_free(skc12,u,skc11) ),
inference(res,[status(thm),theory(equality)],[8,17]),
[iquote('0:Res:8.0,17.4')] ).
cnf(61,plain,
( ~ greater(skc11,u)
| ~ greater(v,skc8)
| ~ organization(skc12,u)
| ~ size(skc12,v,u)
| ~ reorganization_free(skc12,u,skc11) ),
inference(mrr,[status(thm)],[58,2]),
[iquote('0:MRR:58.2,2.0')] ).
cnf(66,plain,
( ~ greater(skc11,skc13)
| ~ greater(skc7,skc8)
| ~ organization(skc12,skc13)
| ~ reorganization_free(skc12,skc13,skc11) ),
inference(res,[status(thm),theory(equality)],[7,61]),
[iquote('0:Res:7.0,61.3')] ).
cnf(67,plain,
~ greater(skc11,skc13),
inference(mrr,[status(thm)],[66,4,1,5]),
[iquote('0:MRR:66.1,66.2,66.3,4.0,1.0,5.0')] ).
cnf(69,plain,
( ~ greater(skc13,u)
| ~ greater(v,skc10)
| ~ organization(skc12,skc13)
| ~ organization(skc12,u)
| ~ complexity(skc12,v,u)
| ~ reorganization_free(skc12,u,skc13) ),
inference(res,[status(thm),theory(equality)],[6,16]),
[iquote('0:Res:6.0,16.4')] ).
cnf(70,plain,
( ~ greater(skc13,u)
| ~ greater(v,skc10)
| ~ organization(skc12,u)
| ~ complexity(skc12,v,u)
| ~ reorganization_free(skc12,u,skc13) ),
inference(mrr,[status(thm)],[69,1]),
[iquote('0:MRR:69.2,1.0')] ).
cnf(72,plain,
( ~ greater(skc13,skc11)
| ~ greater(skc9,skc10)
| ~ organization(skc12,skc11)
| ~ reorganization_free(skc12,skc11,skc13) ),
inference(res,[status(thm),theory(equality)],[9,70]),
[iquote('0:Res:9.0,70.3')] ).
cnf(74,plain,
~ greater(skc13,skc11),
inference(mrr,[status(thm)],[72,3,2,40]),
[iquote('0:MRR:72.1,72.2,72.3,3.0,2.0,40.0')] ).
cnf(75,plain,
( ~ time(skc13)
| ~ time(skc11)
| equal(skc13,skc11)
| greater(skc11,skc13) ),
inference(res,[status(thm),theory(equality)],[14,74]),
[iquote('0:Res:14.2,74.0')] ).
cnf(77,plain,
( equal(skc13,skc11)
| greater(skc11,skc13) ),
inference(ssi,[status(thm)],[75,33,37]),
[iquote('0:SSi:75.1,75.0,33.0,37.0')] ).
cnf(78,plain,
equal(skc13,skc11),
inference(mrr,[status(thm)],[77,67]),
[iquote('0:MRR:77.1,67.0')] ).
cnf(82,plain,
complexity(skc12,skc10,skc11),
inference(rew,[status(thm),theory(equality)],[78,6]),
[iquote('0:Rew:78.0,6.0')] ).
cnf(97,plain,
equal(skc10,skc9),
inference(res,[status(thm),theory(equality)],[82,42]),
[iquote('0:Res:82.0,42.0')] ).
cnf(101,plain,
greater(skc9,skc9),
inference(rew,[status(thm),theory(equality)],[97,3]),
[iquote('0:Rew:97.0,3.0')] ).
cnf(110,plain,
$false,
inference(mrr,[status(thm)],[101,10]),
[iquote('0:MRR:101.0,10.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT013+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 7 11:54:15 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.22/0.56
% 0.22/0.56 SPASS V 3.9
% 0.22/0.56 SPASS beiseite: Proof found.
% 0.22/0.56 % SZS status Theorem
% 0.22/0.56 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.56 SPASS derived 80 clauses, backtracked 0 clauses, performed 0 splits and kept 57 clauses.
% 0.22/0.56 SPASS allocated 97724 KBytes.
% 0.22/0.56 SPASS spent 0:00:00.16 on the problem.
% 0.22/0.56 0:00:00.06 for the input.
% 0.22/0.56 0:00:00.05 for the FLOTTER CNF translation.
% 0.22/0.56 0:00:00.00 for inferences.
% 0.22/0.56 0:00:00.00 for the backtracking.
% 0.22/0.56 0:00:00.01 for the reduction.
% 0.22/0.56
% 0.22/0.56
% 0.22/0.56 Here is a proof with depth 3, length 36 :
% 0.22/0.56 % SZS output start Refutation
% See solution above
% 0.22/0.56 Formulae used in the proof : t13_FOL mp6_1 mp15 mp17 mp16 mp18 t12_FOL t11_FOL
% 0.22/0.56
%------------------------------------------------------------------------------