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.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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 : Theorem 0.18s 0.46s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 35 ( 14 unt; 0 nHn; 35 RR)
% Number of literals : 114 ( 0 equ; 83 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(skc9,skc5),
file('MGT011+1.p',unknown),
[] ).
cnf(2,axiom,
organization(skc9,skc6),
file('MGT011+1.p',unknown),
[] ).
cnf(3,axiom,
greater(skc8,skc7),
file('MGT011+1.p',unknown),
[] ).
cnf(4,axiom,
greater(skc6,skc5),
file('MGT011+1.p',unknown),
[] ).
cnf(5,axiom,
reorganization_free(skc9,skc5,skc6),
file('MGT011+1.p',unknown),
[] ).
cnf(6,axiom,
size(skc9,skc8,skc5),
file('MGT011+1.p',unknown),
[] ).
cnf(7,axiom,
size(skc9,skc7,skc6),
file('MGT011+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ greater(u,v)
| ~ greater(v,u) ),
file('MGT011+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ organization(u,v)
| inertia(u,skf2(v,u),v) ),
file('MGT011+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ organization(u,v)
| class(u,skf3(v,u),v) ),
file('MGT011+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ organization(u,v)
| ~ organization(u,w)
| ~ class(u,x,v)
| ~ class(u,y,w)
| ~ reorganization_free(u,v,w)
| equal(x,y) ),
file('MGT011+1.p',unknown),
[] ).
cnf(13,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(14,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('MGT011+1.p',unknown),
[] ).
cnf(17,plain,
( ~ organization(u,skc6)
| ~ organization(u,skc5)
| ~ inertia(u,v,skc6)
| ~ inertia(u,w,skc5)
| ~ reorganization_free(u,skc5,skc6)
| greater(v,w) ),
inference(res,[status(thm),theory(equality)],[4,13]),
[iquote('0:Res:4.0,13.5')] ).
cnf(22,plain,
( ~ organization(u,v)
| ~ organization(w,x)
| ~ inertia(u,y,v)
| ~ class(u,z,v)
| ~ class(w,z,x)
| ~ inertia(w,x1,x)
| ~ size(u,skc7,v)
| ~ size(w,skc8,x)
| greater(x1,y) ),
inference(res,[status(thm),theory(equality)],[3,14]),
[iquote('0:Res:3.0,14.8')] ).
cnf(24,plain,
( ~ organization(skc9,u)
| ~ class(skc9,v,u)
| ~ class(skc9,w,skc6)
| ~ reorganization_free(skc9,u,skc6)
| equal(v,w) ),
inference(res,[status(thm),theory(equality)],[2,12]),
[iquote('0:Res:2.0,12.0')] ).
cnf(25,plain,
inertia(skc9,skf2(skc6,skc9),skc6),
inference(res,[status(thm),theory(equality)],[2,10]),
[iquote('0:Res:2.0,10.0')] ).
cnf(26,plain,
class(skc9,skf3(skc6,skc9),skc6),
inference(res,[status(thm),theory(equality)],[2,11]),
[iquote('0:Res:2.0,11.0')] ).
cnf(49,plain,
( ~ organization(skc9,u)
| ~ organization(skc9,u)
| ~ class(skc9,v,skc6)
| ~ reorganization_free(skc9,u,skc6)
| equal(skf3(u,skc9),v) ),
inference(res,[status(thm),theory(equality)],[11,24]),
[iquote('0:Res:11.1,24.1')] ).
cnf(50,plain,
( ~ organization(skc9,u)
| ~ class(skc9,v,skc6)
| ~ reorganization_free(skc9,u,skc6)
| equal(skf3(u,skc9),v) ),
inference(obv,[status(thm),theory(equality)],[49]),
[iquote('0:Obv:49.0')] ).
cnf(51,plain,
( ~ organization(skc9,u)
| ~ reorganization_free(skc9,u,skc6)
| equal(skf3(u,skc9),skf3(skc6,skc9)) ),
inference(res,[status(thm),theory(equality)],[26,50]),
[iquote('0:Res:26.0,50.1')] ).
cnf(53,plain,
( ~ organization(skc9,skc5)
| equal(skf3(skc6,skc9),skf3(skc5,skc9)) ),
inference(res,[status(thm),theory(equality)],[5,51]),
[iquote('0:Res:5.0,51.1')] ).
cnf(54,plain,
equal(skf3(skc6,skc9),skf3(skc5,skc9)),
inference(mrr,[status(thm)],[53,1]),
[iquote('0:MRR:53.0,1.0')] ).
cnf(55,plain,
class(skc9,skf3(skc5,skc9),skc6),
inference(rew,[status(thm),theory(equality)],[54,26]),
[iquote('0:Rew:54.0,26.0')] ).
cnf(117,plain,
( ~ organization(skc9,skc6)
| ~ organization(skc9,skc5)
| ~ inertia(skc9,u,skc5)
| ~ reorganization_free(skc9,skc5,skc6)
| greater(skf2(skc6,skc9),u) ),
inference(res,[status(thm),theory(equality)],[25,17]),
[iquote('0:Res:25.0,17.2')] ).
cnf(119,plain,
( ~ inertia(skc9,u,skc5)
| greater(skf2(skc6,skc9),u) ),
inference(mrr,[status(thm)],[117,2,1,5]),
[iquote('0:MRR:117.0,117.1,117.3,2.0,1.0,5.0')] ).
cnf(122,plain,
( ~ inertia(skc9,u,skc5)
| ~ greater(u,skf2(skc6,skc9)) ),
inference(res,[status(thm),theory(equality)],[119,9]),
[iquote('0:Res:119.1,9.0')] ).
cnf(249,plain,
( ~ organization(skc9,skc6)
| ~ organization(u,v)
| ~ class(skc9,w,skc6)
| ~ class(u,w,v)
| ~ inertia(u,x,v)
| ~ size(skc9,skc7,skc6)
| ~ size(u,skc8,v)
| greater(x,skf2(skc6,skc9)) ),
inference(res,[status(thm),theory(equality)],[25,22]),
[iquote('0:Res:25.0,22.2')] ).
cnf(251,plain,
( ~ organization(u,v)
| ~ class(skc9,w,skc6)
| ~ class(u,w,v)
| ~ inertia(u,x,v)
| ~ size(u,skc8,v)
| greater(x,skf2(skc6,skc9)) ),
inference(mrr,[status(thm)],[249,2,7]),
[iquote('0:MRR:249.0,249.5,2.0,7.0')] ).
cnf(255,plain,
( ~ organization(u,v)
| ~ class(u,skf3(skc5,skc9),v)
| ~ inertia(u,w,v)
| ~ size(u,skc8,v)
| greater(w,skf2(skc6,skc9)) ),
inference(res,[status(thm),theory(equality)],[55,251]),
[iquote('0:Res:55.0,251.1')] ).
cnf(257,plain,
( ~ organization(skc9,skc5)
| ~ organization(skc9,skc5)
| ~ inertia(skc9,u,skc5)
| ~ size(skc9,skc8,skc5)
| greater(u,skf2(skc6,skc9)) ),
inference(res,[status(thm),theory(equality)],[11,255]),
[iquote('0:Res:11.1,255.1')] ).
cnf(260,plain,
( ~ organization(skc9,skc5)
| ~ inertia(skc9,u,skc5)
| ~ size(skc9,skc8,skc5)
| greater(u,skf2(skc6,skc9)) ),
inference(obv,[status(thm),theory(equality)],[257]),
[iquote('0:Obv:257.0')] ).
cnf(261,plain,
~ inertia(skc9,u,skc5),
inference(mrr,[status(thm)],[260,1,6,122]),
[iquote('0:MRR:260.0,260.2,260.3,1.0,6.0,122.1')] ).
cnf(262,plain,
~ organization(skc9,skc5),
inference(res,[status(thm),theory(equality)],[10,261]),
[iquote('0:Res:10.1,261.0')] ).
cnf(263,plain,
$false,
inference(mrr,[status(thm)],[262,1]),
[iquote('0:MRR:262.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : MGT011+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jun 9 10:12:57 EDT 2022
% 0.11/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/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 SPASS derived 174 clauses, backtracked 0 clauses, performed 0 splits and kept 98 clauses.
% 0.18/0.46 SPASS allocated 85394 KBytes.
% 0.18/0.46 SPASS spent 0:00:00.12 on the problem.
% 0.18/0.46 0:00:00.03 for the input.
% 0.18/0.46 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.46 0:00:00.01 for inferences.
% 0.18/0.46 0:00:00.00 for the backtracking.
% 0.18/0.46 0:00:00.02 for the reduction.
% 0.18/0.46
% 0.18/0.46
% 0.18/0.46 Here is a proof with depth 5, length 35 :
% 0.18/0.46 % SZS output start Refutation
% See solution above
% 0.18/0.46 Formulae used in the proof : t11_FOL mp6_2 mp5 mp9 mp10 t2_FOL a5_FOL
% 0.18/0.46
%------------------------------------------------------------------------------