TSTP Solution File: MGT011-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT011-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:10 EDT 2022
% Result : Unsatisfiable 0.18s 0.45s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 39 ( 13 unt; 0 nHn; 39 RR)
% Number of literals : 142 ( 0 equ; 106 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 : 16 ( 16 usr; 14 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ organization(u,v)
| inertia(u,sk1(v,u),v) ),
file('MGT011-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ greater(u,v)
| ~ greater(v,u) ),
file('MGT011-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ organization(u,v)
| class(u,sk2(v,u),v) ),
file('MGT011-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ organization(u,v)
| ~ organization(u,w)
| ~ class(u,x,v)
| ~ class(u,y,w)
| ~ reorganization_free(u,w,v)
| equal(y,x) ),
file('MGT011-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ greater(u,v)
| ~ organization(w,x)
| ~ organization(y,z)
| ~ inertia(w,x1,x)
| ~ inertia(y,x2,z)
| ~ size(w,u,x)
| ~ size(y,v,z)
| ~ class(w,x3,x)
| ~ class(y,x3,z)
| greater(x1,x2) ),
file('MGT011-1.p',unknown),
[] ).
cnf(7,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('MGT011-1.p',unknown),
[] ).
cnf(8,axiom,
organization(sk3,sk6),
file('MGT011-1.p',unknown),
[] ).
cnf(9,axiom,
organization(sk3,sk7),
file('MGT011-1.p',unknown),
[] ).
cnf(10,axiom,
reorganization_free(sk3,sk6,sk7),
file('MGT011-1.p',unknown),
[] ).
cnf(11,axiom,
size(sk3,sk4,sk6),
file('MGT011-1.p',unknown),
[] ).
cnf(12,axiom,
size(sk3,sk5,sk7),
file('MGT011-1.p',unknown),
[] ).
cnf(13,axiom,
greater(sk7,sk6),
file('MGT011-1.p',unknown),
[] ).
cnf(14,axiom,
greater(sk4,sk5),
file('MGT011-1.p',unknown),
[] ).
cnf(28,plain,
inertia(sk3,sk1(sk7,sk3),sk7),
inference(res,[status(thm),theory(equality)],[9,1]),
[iquote('0:Res:9.0,1.0')] ).
cnf(29,plain,
class(sk3,sk2(sk7,sk3),sk7),
inference(res,[status(thm),theory(equality)],[9,4]),
[iquote('0:Res:9.0,4.0')] ).
cnf(43,plain,
( ~ organization(sk3,sk7)
| ~ organization(sk3,u)
| ~ class(sk3,v,u)
| ~ reorganization_free(sk3,u,sk7)
| equal(v,sk2(sk7,sk3)) ),
inference(res,[status(thm),theory(equality)],[29,5]),
[iquote('0:Res:29.0,5.2')] ).
cnf(45,plain,
( ~ organization(sk3,u)
| ~ class(sk3,v,u)
| ~ reorganization_free(sk3,u,sk7)
| equal(v,sk2(sk7,sk3)) ),
inference(mrr,[status(thm)],[43,9]),
[iquote('0:MRR:43.0,9.0')] ).
cnf(50,plain,
( ~ organization(sk3,u)
| ~ organization(sk3,u)
| ~ reorganization_free(sk3,u,sk7)
| equal(sk2(u,sk3),sk2(sk7,sk3)) ),
inference(res,[status(thm),theory(equality)],[4,45]),
[iquote('0:Res:4.1,45.1')] ).
cnf(51,plain,
( ~ organization(sk3,u)
| ~ reorganization_free(sk3,u,sk7)
| equal(sk2(u,sk3),sk2(sk7,sk3)) ),
inference(obv,[status(thm),theory(equality)],[50]),
[iquote('0:Obv:50.0')] ).
cnf(52,plain,
( ~ organization(sk3,sk6)
| equal(sk2(sk7,sk3),sk2(sk6,sk3)) ),
inference(res,[status(thm),theory(equality)],[10,51]),
[iquote('0:Res:10.0,51.1')] ).
cnf(53,plain,
equal(sk2(sk7,sk3),sk2(sk6,sk3)),
inference(mrr,[status(thm)],[52,8]),
[iquote('0:MRR:52.0,8.0')] ).
cnf(54,plain,
class(sk3,sk2(sk6,sk3),sk7),
inference(rew,[status(thm),theory(equality)],[53,29]),
[iquote('0:Rew:53.0,29.0')] ).
cnf(59,plain,
( ~ greater(sk7,u)
| ~ organization(sk3,sk7)
| ~ organization(sk3,u)
| ~ inertia(sk3,v,u)
| ~ reorganization_free(sk3,u,sk7)
| greater(sk1(sk7,sk3),v) ),
inference(res,[status(thm),theory(equality)],[28,7]),
[iquote('0:Res:28.0,7.3')] ).
cnf(61,plain,
( ~ greater(sk7,u)
| ~ organization(sk3,u)
| ~ inertia(sk3,v,u)
| ~ reorganization_free(sk3,u,sk7)
| greater(sk1(sk7,sk3),v) ),
inference(mrr,[status(thm)],[59,9]),
[iquote('0:MRR:59.1,9.0')] ).
cnf(71,plain,
( ~ organization(u,v)
| ~ greater(w,x)
| ~ organization(u,v)
| ~ organization(y,z)
| ~ inertia(y,x1,z)
| ~ size(u,w,v)
| ~ size(y,x,z)
| ~ class(u,x2,v)
| ~ class(y,x2,z)
| greater(sk1(v,u),x1) ),
inference(res,[status(thm),theory(equality)],[1,6]),
[iquote('0:Res:1.1,6.3')] ).
cnf(73,plain,
( ~ greater(u,v)
| ~ organization(w,x)
| ~ organization(y,z)
| ~ inertia(y,x1,z)
| ~ size(w,u,x)
| ~ size(y,v,z)
| ~ class(w,x2,x)
| ~ class(y,x2,z)
| greater(sk1(x,w),x1) ),
inference(obv,[status(thm),theory(equality)],[71]),
[iquote('0:Obv:71.0')] ).
cnf(89,plain,
( ~ organization(sk3,u)
| ~ greater(sk7,u)
| ~ organization(sk3,u)
| ~ reorganization_free(sk3,u,sk7)
| greater(sk1(sk7,sk3),sk1(u,sk3)) ),
inference(res,[status(thm),theory(equality)],[1,61]),
[iquote('0:Res:1.1,61.2')] ).
cnf(91,plain,
( ~ greater(sk7,u)
| ~ organization(sk3,u)
| ~ reorganization_free(sk3,u,sk7)
| greater(sk1(sk7,sk3),sk1(u,sk3)) ),
inference(obv,[status(thm),theory(equality)],[89]),
[iquote('0:Obv:89.0')] ).
cnf(99,plain,
( ~ greater(sk7,u)
| ~ organization(sk3,u)
| ~ reorganization_free(sk3,u,sk7)
| ~ greater(sk1(u,sk3),sk1(sk7,sk3)) ),
inference(res,[status(thm),theory(equality)],[91,3]),
[iquote('0:Res:91.3,3.0')] ).
cnf(265,plain,
( ~ greater(u,v)
| ~ organization(w,x)
| ~ organization(sk3,sk7)
| ~ size(w,u,x)
| ~ size(sk3,v,sk7)
| ~ class(w,y,x)
| ~ class(sk3,y,sk7)
| greater(sk1(x,w),sk1(sk7,sk3)) ),
inference(res,[status(thm),theory(equality)],[28,73]),
[iquote('0:Res:28.0,73.3')] ).
cnf(267,plain,
( ~ greater(u,v)
| ~ organization(w,x)
| ~ size(w,u,x)
| ~ size(sk3,v,sk7)
| ~ class(w,y,x)
| ~ class(sk3,y,sk7)
| greater(sk1(x,w),sk1(sk7,sk3)) ),
inference(mrr,[status(thm)],[265,9]),
[iquote('0:MRR:265.2,9.0')] ).
cnf(335,plain,
( ~ greater(sk4,u)
| ~ organization(sk3,sk6)
| ~ size(sk3,u,sk7)
| ~ class(sk3,v,sk6)
| ~ class(sk3,v,sk7)
| greater(sk1(sk6,sk3),sk1(sk7,sk3)) ),
inference(res,[status(thm),theory(equality)],[11,267]),
[iquote('0:Res:11.0,267.2')] ).
cnf(336,plain,
( ~ greater(sk4,u)
| ~ size(sk3,u,sk7)
| ~ class(sk3,v,sk6)
| ~ class(sk3,v,sk7)
| greater(sk1(sk6,sk3),sk1(sk7,sk3)) ),
inference(mrr,[status(thm)],[335,8]),
[iquote('0:MRR:335.1,8.0')] ).
cnf(338,plain,
( ~ greater(sk4,sk5)
| ~ class(sk3,u,sk6)
| ~ class(sk3,u,sk7)
| greater(sk1(sk6,sk3),sk1(sk7,sk3)) ),
inference(res,[status(thm),theory(equality)],[12,336]),
[iquote('0:Res:12.0,336.1')] ).
cnf(339,plain,
( ~ class(sk3,u,sk6)
| ~ class(sk3,u,sk7)
| greater(sk1(sk6,sk3),sk1(sk7,sk3)) ),
inference(mrr,[status(thm)],[338,14]),
[iquote('0:MRR:338.0,14.0')] ).
cnf(340,plain,
( ~ organization(sk3,sk6)
| ~ class(sk3,sk2(sk6,sk3),sk7)
| greater(sk1(sk6,sk3),sk1(sk7,sk3)) ),
inference(res,[status(thm),theory(equality)],[4,339]),
[iquote('0:Res:4.1,339.0')] ).
cnf(341,plain,
greater(sk1(sk6,sk3),sk1(sk7,sk3)),
inference(mrr,[status(thm)],[340,8,54]),
[iquote('0:MRR:340.0,340.1,8.0,54.0')] ).
cnf(345,plain,
( ~ greater(sk7,sk6)
| ~ organization(sk3,sk6)
| ~ reorganization_free(sk3,sk6,sk7) ),
inference(res,[status(thm),theory(equality)],[341,99]),
[iquote('0:Res:341.0,99.3')] ).
cnf(350,plain,
$false,
inference(mrr,[status(thm)],[345,13,8,10]),
[iquote('0:MRR:345.0,345.1,345.2,13.0,8.0,10.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT011-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n023.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 10:35:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45
% 0.18/0.45 SPASS V 3.9
% 0.18/0.45 SPASS beiseite: Proof found.
% 0.18/0.45 % SZS status Theorem
% 0.18/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 SPASS derived 235 clauses, backtracked 0 clauses, performed 0 splits and kept 129 clauses.
% 0.18/0.45 SPASS allocated 63498 KBytes.
% 0.18/0.45 SPASS spent 0:00:00.11 on the problem.
% 0.18/0.45 0:00:00.03 for the input.
% 0.18/0.45 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.45 0:00:00.01 for inferences.
% 0.18/0.45 0:00:00.00 for the backtracking.
% 0.18/0.45 0:00:00.04 for the reduction.
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 Here is a proof with depth 6, length 39 :
% 0.18/0.45 % SZS output start Refutation
% See solution above
% 0.18/0.45 Formulae used in the proof : mp5_20 mp6_2_22 mp9_23 mp10_24 a5_FOL_25 t2_FOL_26 t11_FOL_27 t11_FOL_28 t11_FOL_29 t11_FOL_30 t11_FOL_31 t11_FOL_32 t11_FOL_33
% 0.18/0.45
%------------------------------------------------------------------------------