TSTP Solution File: MGT016-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT016-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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:11 EDT 2022
% Result : Unsatisfiable 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of clauses : 35 ( 18 unt; 1 nHn; 35 RR)
% Number of literals : 129 ( 0 equ; 102 neg)
% Maximal clause size : 13 ( 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(u,v)
| inertia(u,sk1(v,u),v) ),
file('MGT016-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ greater(u,v)
| ~ organization(w,x)
| ~ organization(y,z)
| ~ inertia(w,x1,x)
| ~ inertia(y,x2,z)
| ~ complexity(w,u,x)
| ~ complexity(y,v,z)
| ~ class(w,x3,x)
| ~ class(y,x3,z)
| greater(x1,x2) ),
file('MGT016-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ greater(u,v)
| ~ organization(w,x)
| ~ organization(y,x)
| ~ inertia(w,u,x)
| ~ inertia(y,v,x)
| ~ reorganization_type(w,z,x)
| ~ reorganization_type(y,z,x)
| ~ reorganization(w,x,x1)
| ~ reorganization(y,x,x2)
| ~ class(w,x3,x)
| ~ class(y,x3,x)
| greater(x2,x1)
| organization(w,x1) ),
file('MGT016-1.p',unknown),
[] ).
cnf(4,axiom,
organization(sk2,sk8),
file('MGT016-1.p',unknown),
[] ).
cnf(5,axiom,
organization(sk3,sk8),
file('MGT016-1.p',unknown),
[] ).
cnf(6,axiom,
~ organization(sk3,sk10),
file('MGT016-1.p',unknown),
[] ).
cnf(7,axiom,
class(sk2,sk5,sk8),
file('MGT016-1.p',unknown),
[] ).
cnf(8,axiom,
class(sk3,sk5,sk8),
file('MGT016-1.p',unknown),
[] ).
cnf(9,axiom,
reorganization(sk2,sk8,sk9),
file('MGT016-1.p',unknown),
[] ).
cnf(10,axiom,
reorganization(sk3,sk8,sk10),
file('MGT016-1.p',unknown),
[] ).
cnf(11,axiom,
reorganization_type(sk2,sk4,sk8),
file('MGT016-1.p',unknown),
[] ).
cnf(12,axiom,
reorganization_type(sk3,sk4,sk8),
file('MGT016-1.p',unknown),
[] ).
cnf(13,axiom,
complexity(sk2,sk6,sk8),
file('MGT016-1.p',unknown),
[] ).
cnf(14,axiom,
complexity(sk3,sk7,sk8),
file('MGT016-1.p',unknown),
[] ).
cnf(15,axiom,
greater(sk7,sk6),
file('MGT016-1.p',unknown),
[] ).
cnf(16,axiom,
~ greater(sk9,sk10),
file('MGT016-1.p',unknown),
[] ).
cnf(17,plain,
( ~ organization(u,v)
| ~ organization(w,x)
| ~ inertia(u,y,v)
| ~ inertia(w,z,x)
| ~ class(u,x1,v)
| ~ class(w,x1,x)
| ~ complexity(u,sk7,v)
| ~ complexity(w,sk6,x)
| greater(y,z) ),
inference(res,[status(thm),theory(equality)],[15,2]),
[iquote('0:Res:15.0,2.8')] ).
cnf(21,plain,
inertia(sk3,sk1(sk8,sk3),sk8),
inference(res,[status(thm),theory(equality)],[5,1]),
[iquote('0:Res:5.0,1.0')] ).
cnf(26,plain,
inertia(sk2,sk1(sk8,sk2),sk8),
inference(res,[status(thm),theory(equality)],[4,1]),
[iquote('0:Res:4.0,1.0')] ).
cnf(29,plain,
( ~ greater(u,v)
| ~ organization(w,x)
| ~ organization(y,x)
| ~ inertia(w,u,x)
| ~ inertia(y,v,x)
| ~ reorganization_type(w,z,x)
| ~ reorganization_type(y,z,x)
| ~ class(w,x1,x)
| ~ class(y,x1,x)
| ~ reorganization(w,x,sk10)
| ~ reorganization(y,x,sk9)
| organization(w,sk10) ),
inference(res,[status(thm),theory(equality)],[3,16]),
[iquote('0:Res:3.12,16.0')] ).
cnf(120,plain,
( ~ organization(sk3,sk8)
| ~ organization(u,v)
| ~ inertia(u,w,v)
| ~ class(sk3,x,sk8)
| ~ class(u,x,v)
| ~ complexity(sk3,sk7,sk8)
| ~ complexity(u,sk6,v)
| greater(sk1(sk8,sk3),w) ),
inference(res,[status(thm),theory(equality)],[21,17]),
[iquote('0:Res:21.0,17.2')] ).
cnf(122,plain,
( ~ organization(u,v)
| ~ inertia(u,w,v)
| ~ class(sk3,x,sk8)
| ~ class(u,x,v)
| ~ complexity(u,sk6,v)
| greater(sk1(sk8,sk3),w) ),
inference(mrr,[status(thm)],[120,5,14]),
[iquote('0:MRR:120.0,120.5,5.0,14.0')] ).
cnf(128,plain,
( ~ organization(sk2,sk8)
| ~ class(sk3,u,sk8)
| ~ class(sk2,u,sk8)
| ~ complexity(sk2,sk6,sk8)
| greater(sk1(sk8,sk3),sk1(sk8,sk2)) ),
inference(res,[status(thm),theory(equality)],[26,122]),
[iquote('0:Res:26.0,122.1')] ).
cnf(133,plain,
( ~ class(sk3,u,sk8)
| ~ class(sk2,u,sk8)
| greater(sk1(sk8,sk3),sk1(sk8,sk2)) ),
inference(mrr,[status(thm)],[128,4,13]),
[iquote('0:MRR:128.0,128.3,4.0,13.0')] ).
cnf(140,plain,
( ~ class(sk2,sk5,sk8)
| greater(sk1(sk8,sk3),sk1(sk8,sk2)) ),
inference(res,[status(thm),theory(equality)],[8,133]),
[iquote('0:Res:8.0,133.0')] ).
cnf(141,plain,
greater(sk1(sk8,sk3),sk1(sk8,sk2)),
inference(mrr,[status(thm)],[140,7]),
[iquote('0:MRR:140.0,7.0')] ).
cnf(218,plain,
( ~ greater(sk1(sk8,sk3),u)
| ~ organization(sk3,sk8)
| ~ organization(v,sk8)
| ~ inertia(v,u,sk8)
| ~ reorganization_type(sk3,w,sk8)
| ~ reorganization_type(v,w,sk8)
| ~ class(sk3,x,sk8)
| ~ class(v,x,sk8)
| ~ reorganization(sk3,sk8,sk10)
| ~ reorganization(v,sk8,sk9)
| organization(sk3,sk10) ),
inference(res,[status(thm),theory(equality)],[21,29]),
[iquote('0:Res:21.0,29.3')] ).
cnf(220,plain,
( ~ greater(sk1(sk8,sk3),u)
| ~ organization(v,sk8)
| ~ inertia(v,u,sk8)
| ~ reorganization_type(sk3,w,sk8)
| ~ reorganization_type(v,w,sk8)
| ~ class(sk3,x,sk8)
| ~ class(v,x,sk8)
| ~ reorganization(v,sk8,sk9) ),
inference(mrr,[status(thm)],[218,5,10,6]),
[iquote('0:MRR:218.1,218.8,218.10,5.0,10.0,6.0')] ).
cnf(359,plain,
( ~ organization(u,sk8)
| ~ inertia(u,sk1(sk8,sk2),sk8)
| ~ reorganization_type(sk3,v,sk8)
| ~ reorganization_type(u,v,sk8)
| ~ class(sk3,w,sk8)
| ~ class(u,w,sk8)
| ~ reorganization(u,sk8,sk9) ),
inference(res,[status(thm),theory(equality)],[141,220]),
[iquote('0:Res:141.0,220.0')] ).
cnf(361,plain,
( ~ organization(sk2,sk8)
| ~ reorganization_type(sk3,u,sk8)
| ~ reorganization_type(sk2,u,sk8)
| ~ class(sk3,v,sk8)
| ~ class(sk2,v,sk8)
| ~ reorganization(sk2,sk8,sk9) ),
inference(res,[status(thm),theory(equality)],[26,359]),
[iquote('0:Res:26.0,359.1')] ).
cnf(363,plain,
( ~ reorganization_type(sk3,u,sk8)
| ~ reorganization_type(sk2,u,sk8)
| ~ class(sk3,v,sk8)
| ~ class(sk2,v,sk8) ),
inference(mrr,[status(thm)],[361,4,9]),
[iquote('0:MRR:361.0,361.5,4.0,9.0')] ).
cnf(370,plain,
( ~ reorganization_type(sk2,sk4,sk8)
| ~ class(sk3,u,sk8)
| ~ class(sk2,u,sk8) ),
inference(res,[status(thm),theory(equality)],[12,363]),
[iquote('0:Res:12.0,363.0')] ).
cnf(371,plain,
( ~ class(sk3,u,sk8)
| ~ class(sk2,u,sk8) ),
inference(mrr,[status(thm)],[370,11]),
[iquote('0:MRR:370.0,11.0')] ).
cnf(372,plain,
~ class(sk3,sk5,sk8),
inference(res,[status(thm),theory(equality)],[7,371]),
[iquote('0:Res:7.0,371.1')] ).
cnf(373,plain,
$false,
inference(mrr,[status(thm)],[372,8]),
[iquote('0:MRR:372.0,8.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT016-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 08:06:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.51
% 0.19/0.51 SPASS V 3.9
% 0.19/0.51 SPASS beiseite: Proof found.
% 0.19/0.51 % SZS status Theorem
% 0.19/0.51 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.51 SPASS derived 227 clauses, backtracked 0 clauses, performed 0 splits and kept 174 clauses.
% 0.19/0.51 SPASS allocated 63623 KBytes.
% 0.19/0.51 SPASS spent 0:00:00.16 on the problem.
% 0.19/0.51 0:00:00.04 for the input.
% 0.19/0.51 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.51 0:00:00.01 for inferences.
% 0.19/0.51 0:00:00.00 for the backtracking.
% 0.19/0.51 0:00:00.07 for the reduction.
% 0.19/0.51
% 0.19/0.51
% 0.19/0.51 Here is a proof with depth 8, length 35 :
% 0.19/0.51 % SZS output start Refutation
% See solution above
% 0.19/0.51 Formulae used in the proof : mp5_1 a12_FOL_2 a14_FOL_3 t16_FOL_4 t16_FOL_5 t16_FOL_6 t16_FOL_7 t16_FOL_8 t16_FOL_9 t16_FOL_10 t16_FOL_11 t16_FOL_12 t16_FOL_13 t16_FOL_14 t16_FOL_15 t16_FOL_16
% 0.19/0.51
%------------------------------------------------------------------------------