TSTP Solution File: MGT003+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT003+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:07 EDT 2022
% Result : Theorem 0.19s 0.46s
% Output : Refutation 0.19s
% 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('MGT003+1.p',unknown),
[] ).
cnf(2,axiom,
organization(skc9,skc6),
file('MGT003+1.p',unknown),
[] ).
cnf(3,axiom,
greater(skc6,skc5),
file('MGT003+1.p',unknown),
[] ).
cnf(4,axiom,
reorganization_free(skc9,skc5,skc6),
file('MGT003+1.p',unknown),
[] ).
cnf(5,axiom,
survival_chance(skc9,skc8,skc5),
file('MGT003+1.p',unknown),
[] ).
cnf(6,axiom,
survival_chance(skc9,skc7,skc6),
file('MGT003+1.p',unknown),
[] ).
cnf(7,axiom,
~ greater(skc7,skc8),
file('MGT003+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ reorganization_free(u,v,w)
| reorganization_free(u,v,v) ),
file('MGT003+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ reorganization_free(u,v,w)
| reorganization_free(u,w,w) ),
file('MGT003+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ organization(u,v)
| inertia(u,skf1(v,u),v) ),
file('MGT003+1.p',unknown),
[] ).
cnf(11,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('MGT003+1.p',unknown),
[] ).
cnf(12,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('MGT003+1.p',unknown),
[] ).
cnf(16,plain,
inertia(skc9,skf1(skc6,skc9),skc6),
inference(res,[status(thm),theory(equality)],[2,10]),
[iquote('0:Res:2.0,10.0')] ).
cnf(17,plain,
( ~ greater(skc6,u)
| ~ organization(skc9,u)
| ~ inertia(skc9,v,u)
| ~ inertia(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(19,plain,
( ~ organization(u,v)
| ~ greater(w,x)
| ~ survival_chance(u,y,v)
| ~ inertia(u,x,v)
| ~ reorganization_free(u,v,v)
| ~ inertia(skc9,w,skc6)
| ~ survival_chance(skc9,z,skc6)
| ~ reorganization_free(skc9,skc6,skc6)
| greater(z,y) ),
inference(res,[status(thm),theory(equality)],[2,12]),
[iquote('0:Res:2.0,12.8')] ).
cnf(21,plain,
inertia(skc9,skf1(skc5,skc9),skc5),
inference(res,[status(thm),theory(equality)],[1,10]),
[iquote('0:Res:1.0,10.0')] ).
cnf(25,plain,
reorganization_free(skc9,skc6,skc6),
inference(res,[status(thm),theory(equality)],[4,9]),
[iquote('0:Res:4.0,9.0')] ).
cnf(27,plain,
( ~ organization(u,v)
| ~ greater(w,x)
| ~ survival_chance(u,y,v)
| ~ inertia(u,x,v)
| ~ reorganization_free(u,v,v)
| ~ inertia(skc9,w,skc6)
| ~ survival_chance(skc9,z,skc6)
| greater(z,y) ),
inference(mrr,[status(thm)],[19,25]),
[iquote('0:MRR:19.7,25.0')] ).
cnf(29,plain,
reorganization_free(skc9,skc5,skc5),
inference(res,[status(thm),theory(equality)],[4,8]),
[iquote('0:Res:4.0,8.0')] ).
cnf(65,plain,
( ~ greater(skc6,skc5)
| ~ organization(skc9,skc5)
| ~ inertia(skc9,u,skc6)
| ~ reorganization_free(skc9,skc5,skc6)
| greater(u,skf1(skc5,skc9)) ),
inference(res,[status(thm),theory(equality)],[21,17]),
[iquote('0:Res:21.0,17.2')] ).
cnf(69,plain,
( ~ inertia(skc9,u,skc6)
| greater(u,skf1(skc5,skc9)) ),
inference(mrr,[status(thm)],[65,3,1,4]),
[iquote('0:MRR:65.0,65.1,65.3,3.0,1.0,4.0')] ).
cnf(113,plain,
( ~ organization(skc9,skc5)
| ~ greater(u,v)
| ~ inertia(skc9,v,skc5)
| ~ reorganization_free(skc9,skc5,skc5)
| ~ inertia(skc9,u,skc6)
| ~ survival_chance(skc9,w,skc6)
| greater(w,skc8) ),
inference(res,[status(thm),theory(equality)],[5,27]),
[iquote('0:Res:5.0,27.2')] ).
cnf(114,plain,
( ~ greater(u,v)
| ~ inertia(skc9,v,skc5)
| ~ inertia(skc9,u,skc6)
| ~ survival_chance(skc9,w,skc6)
| greater(w,skc8) ),
inference(mrr,[status(thm)],[113,1,29]),
[iquote('0:MRR:113.0,113.3,1.0,29.0')] ).
cnf(116,plain,
( ~ greater(u,skf1(skc5,skc9))
| ~ inertia(skc9,u,skc6)
| ~ survival_chance(skc9,v,skc6)
| greater(v,skc8) ),
inference(res,[status(thm),theory(equality)],[21,114]),
[iquote('0:Res:21.0,114.1')] ).
cnf(118,plain,
( ~ inertia(skc9,u,skc6)
| ~ survival_chance(skc9,v,skc6)
| greater(v,skc8) ),
inference(mrr,[status(thm)],[116,69]),
[iquote('0:MRR:116.0,69.1')] ).
cnf(119,plain,
( ~ survival_chance(skc9,u,skc6)
| greater(u,skc8) ),
inference(res,[status(thm),theory(equality)],[16,118]),
[iquote('0:Res:16.0,118.0')] ).
cnf(121,plain,
greater(skc7,skc8),
inference(res,[status(thm),theory(equality)],[6,119]),
[iquote('0:Res:6.0,119.0')] ).
cnf(122,plain,
$false,
inference(mrr,[status(thm)],[121,7]),
[iquote('0:MRR:121.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT003+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n026.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 09:43:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46
% 0.19/0.46 SPASS V 3.9
% 0.19/0.46 SPASS beiseite: Proof found.
% 0.19/0.46 % SZS status Theorem
% 0.19/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 SPASS derived 76 clauses, backtracked 0 clauses, performed 0 splits and kept 66 clauses.
% 0.19/0.46 SPASS allocated 85290 KBytes.
% 0.19/0.46 SPASS spent 0:00:00.11 on the problem.
% 0.19/0.46 0:00:00.04 for the input.
% 0.19/0.46 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.46 0:00:00.00 for inferences.
% 0.19/0.46 0:00:00.00 for the backtracking.
% 0.19/0.46 0:00:00.01 for the reduction.
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 Here is a proof with depth 5, length 28 :
% 0.19/0.46 % SZS output start Refutation
% See solution above
% 0.19/0.46 Formulae used in the proof : t3_FOL mp4 mp5 t2_FOL t1_FOL
% 0.19/0.46
%------------------------------------------------------------------------------