TSTP Solution File: MGT008+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT008+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:09 EDT 2022
% Result : Theorem 0.18s 0.46s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of clauses : 32 ( 16 unt; 0 nHn; 32 RR)
% Number of literals : 112 ( 0 equ; 82 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 : 19 ( 19 usr; 18 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
organization(skc17,skc16),
file('MGT008+1.p',unknown),
[] ).
cnf(2,axiom,
organization(skc15,skc14),
file('MGT008+1.p',unknown),
[] ).
cnf(3,axiom,
greater(skc10,skc9),
file('MGT008+1.p',unknown),
[] ).
cnf(4,axiom,
size(skc15,skc10,skc14),
file('MGT008+1.p',unknown),
[] ).
cnf(5,axiom,
survival_chance(skc15,skc11,skc14),
file('MGT008+1.p',unknown),
[] ).
cnf(6,axiom,
class(skc15,skc13,skc14),
file('MGT008+1.p',unknown),
[] ).
cnf(7,axiom,
reorganization_free(skc15,skc14,skc14),
file('MGT008+1.p',unknown),
[] ).
cnf(8,axiom,
reorganization_free(skc17,skc16,skc16),
file('MGT008+1.p',unknown),
[] ).
cnf(9,axiom,
class(skc17,skc13,skc16),
file('MGT008+1.p',unknown),
[] ).
cnf(10,axiom,
survival_chance(skc17,skc12,skc16),
file('MGT008+1.p',unknown),
[] ).
cnf(11,axiom,
size(skc17,skc9,skc16),
file('MGT008+1.p',unknown),
[] ).
cnf(12,axiom,
~ greater(skc11,skc12),
file('MGT008+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ organization(u,v)
| inertia(u,skf1(v,u),v) ),
file('MGT008+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ organization(u,v)
| ~ organization(w,x)
| ~ greater(y,z)
| ~ reorganization_free(u,v,v)
| ~ inertia(u,y,v)
| ~ survival_chance(u,x1,v)
| ~ survival_chance(w,x2,x)
| ~ inertia(w,z,x)
| ~ reorganization_free(w,x,x)
| greater(x1,x2) ),
file('MGT008+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ greater(u,v)
| ~ organization(w,x)
| ~ organization(y,z)
| ~ inertia(w,x1,x)
| ~ size(w,v,x)
| ~ class(w,x2,x)
| ~ class(y,x2,z)
| ~ size(y,u,z)
| ~ inertia(y,x3,z)
| greater(x3,x1) ),
file('MGT008+1.p',unknown),
[] ).
cnf(18,plain,
inertia(skc15,skf1(skc14,skc15),skc14),
inference(res,[status(thm),theory(equality)],[2,13]),
[iquote('0:Res:2.0,13.0')] ).
cnf(23,plain,
inertia(skc17,skf1(skc16,skc17),skc16),
inference(res,[status(thm),theory(equality)],[1,13]),
[iquote('0:Res:1.0,13.0')] ).
cnf(25,plain,
( ~ greater(u,v)
| ~ reorganization_free(skc17,skc16,skc16)
| ~ inertia(skc17,v,skc16)
| ~ survival_chance(skc17,w,skc16)
| ~ survival_chance(x,y,z)
| ~ inertia(x,u,z)
| ~ reorganization_free(x,z,z)
| ~ organization(x,z)
| greater(y,w) ),
inference(res,[status(thm),theory(equality)],[1,14]),
[iquote('0:Res:1.0,14.1')] ).
cnf(31,plain,
( ~ inertia(u,v,w)
| ~ size(u,x,w)
| ~ class(u,y,w)
| ~ organization(u,w)
| ~ organization(skc17,skc16)
| ~ class(skc17,y,skc16)
| ~ inertia(skc17,z,skc16)
| ~ greater(x,skc9)
| greater(v,z) ),
inference(res,[status(thm),theory(equality)],[11,15]),
[iquote('0:Res:11.0,15.6')] ).
cnf(32,plain,
( ~ organization(u,v)
| ~ greater(w,skc9)
| ~ class(u,x,v)
| ~ size(u,w,v)
| ~ inertia(u,y,v)
| ~ inertia(skc17,z,skc16)
| ~ class(skc17,x,skc16)
| greater(y,z) ),
inference(mrr,[status(thm)],[31,1]),
[iquote('0:MRR:31.4,1.0')] ).
cnf(35,plain,
( ~ organization(u,v)
| ~ greater(w,x)
| ~ reorganization_free(u,v,v)
| ~ inertia(u,w,v)
| ~ survival_chance(u,y,v)
| ~ survival_chance(skc17,z,skc16)
| ~ inertia(skc17,x,skc16)
| greater(y,z) ),
inference(mrr,[status(thm)],[25,8]),
[iquote('0:MRR:25.1,8.0')] ).
cnf(62,plain,
( ~ organization(skc15,skc14)
| ~ greater(u,skc9)
| ~ size(skc15,u,skc14)
| ~ inertia(skc15,v,skc14)
| ~ inertia(skc17,w,skc16)
| ~ class(skc17,skc13,skc16)
| greater(v,w) ),
inference(res,[status(thm),theory(equality)],[6,32]),
[iquote('0:Res:6.0,32.2')] ).
cnf(63,plain,
( ~ greater(u,skc9)
| ~ size(skc15,u,skc14)
| ~ inertia(skc15,v,skc14)
| ~ inertia(skc17,w,skc16)
| greater(v,w) ),
inference(mrr,[status(thm)],[62,2,9]),
[iquote('0:MRR:62.0,62.5,2.0,9.0')] ).
cnf(65,plain,
( ~ greater(skc10,skc9)
| ~ inertia(skc15,u,skc14)
| ~ inertia(skc17,v,skc16)
| greater(u,v) ),
inference(res,[status(thm),theory(equality)],[4,63]),
[iquote('0:Res:4.0,63.1')] ).
cnf(66,plain,
( ~ inertia(skc15,u,skc14)
| ~ inertia(skc17,v,skc16)
| greater(u,v) ),
inference(mrr,[status(thm)],[65,3]),
[iquote('0:MRR:65.0,3.0')] ).
cnf(79,plain,
( ~ organization(skc15,skc14)
| ~ greater(u,v)
| ~ inertia(skc15,u,skc14)
| ~ survival_chance(skc15,w,skc14)
| ~ survival_chance(skc17,x,skc16)
| ~ inertia(skc17,v,skc16)
| greater(w,x) ),
inference(res,[status(thm),theory(equality)],[7,35]),
[iquote('0:Res:7.0,35.2')] ).
cnf(80,plain,
( ~ inertia(skc15,u,skc14)
| ~ survival_chance(skc15,v,skc14)
| ~ survival_chance(skc17,w,skc16)
| ~ inertia(skc17,x,skc16)
| greater(v,w) ),
inference(mrr,[status(thm)],[79,2,66]),
[iquote('0:MRR:79.0,79.1,2.0,66.2')] ).
cnf(82,plain,
( ~ survival_chance(skc15,u,skc14)
| ~ survival_chance(skc17,v,skc16)
| ~ inertia(skc17,w,skc16)
| greater(u,v) ),
inference(res,[status(thm),theory(equality)],[18,80]),
[iquote('0:Res:18.0,80.0')] ).
cnf(84,plain,
( ~ survival_chance(skc17,u,skc16)
| ~ inertia(skc17,v,skc16)
| greater(skc11,u) ),
inference(res,[status(thm),theory(equality)],[5,82]),
[iquote('0:Res:5.0,82.0')] ).
cnf(85,plain,
( ~ inertia(skc17,u,skc16)
| greater(skc11,skc12) ),
inference(res,[status(thm),theory(equality)],[10,84]),
[iquote('0:Res:10.0,84.0')] ).
cnf(86,plain,
~ inertia(skc17,u,skc16),
inference(mrr,[status(thm)],[85,12]),
[iquote('0:MRR:85.1,12.0')] ).
cnf(87,plain,
$false,
inference(unc,[status(thm)],[86,23]),
[iquote('0:UnC:86.0,23.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : MGT008+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n028.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 07:29:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.46
% 0.18/0.46 SPASS V 3.9
% 0.18/0.46 SPASS beiseite: Proof found.
% 0.18/0.46 % SZS status Theorem
% 0.18/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 SPASS derived 48 clauses, backtracked 0 clauses, performed 0 splits and kept 55 clauses.
% 0.18/0.46 SPASS allocated 85369 KBytes.
% 0.18/0.46 SPASS spent 0:00:00.12 on the problem.
% 0.18/0.46 0:00:00.04 for the input.
% 0.18/0.46 0:00:00.04 for the FLOTTER CNF translation.
% 0.18/0.46 0:00:00.00 for inferences.
% 0.18/0.46 0:00:00.00 for the backtracking.
% 0.18/0.46 0:00:00.01 for the reduction.
% 0.18/0.46
% 0.18/0.46
% 0.18/0.46 Here is a proof with depth 5, length 32 :
% 0.18/0.46 % SZS output start Refutation
% See solution above
% 0.18/0.46 Formulae used in the proof : t8_FOL mp5 t1_FOL a5_FOL
% 0.18/0.46
%------------------------------------------------------------------------------