TSTP Solution File: MGT014+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT014+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:11 EDT 2022
% Result : Theorem 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of clauses : 36 ( 20 unt; 3 nHn; 36 RR)
% Number of literals : 88 ( 0 equ; 59 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 12 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
organization(skc12,skc13),
file('MGT014+1.p',unknown),
[] ).
cnf(2,axiom,
organization(skc12,skc11),
file('MGT014+1.p',unknown),
[] ).
cnf(3,axiom,
greater(skc10,skc9),
file('MGT014+1.p',unknown),
[] ).
cnf(4,axiom,
greater(skc8,skc7),
file('MGT014+1.p',unknown),
[] ).
cnf(5,axiom,
reorganization_free(skc12,skc13,skc11),
file('MGT014+1.p',unknown),
[] ).
cnf(6,axiom,
complexity(skc12,skc10,skc13),
file('MGT014+1.p',unknown),
[] ).
cnf(7,axiom,
size(skc12,skc7,skc13),
file('MGT014+1.p',unknown),
[] ).
cnf(8,axiom,
size(skc12,skc8,skc11),
file('MGT014+1.p',unknown),
[] ).
cnf(9,axiom,
complexity(skc12,skc9,skc11),
file('MGT014+1.p',unknown),
[] ).
cnf(10,axiom,
~ greater(u,u),
file('MGT014+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ organization(u,v)
| time(v) ),
file('MGT014+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ reorganization_free(u,v,w)
| reorganization_free(u,w,v) ),
file('MGT014+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ time(u)
| ~ time(v)
| greater(u,v)
| equal(v,u)
| greater(v,u) ),
file('MGT014+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ organization(u,v)
| ~ size(u,w,v)
| ~ size(u,x,v)
| equal(x,w) ),
file('MGT014+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ greater(u,v)
| ~ greater(w,x)
| ~ organization(y,u)
| ~ organization(y,v)
| ~ complexity(y,x,u)
| ~ complexity(y,w,v)
| ~ reorganization_free(y,v,u) ),
file('MGT014+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ greater(u,v)
| ~ greater(w,x)
| ~ organization(y,u)
| ~ organization(y,v)
| ~ size(y,x,u)
| ~ size(y,w,v)
| ~ reorganization_free(y,v,u) ),
file('MGT014+1.p',unknown),
[] ).
cnf(32,plain,
( ~ size(skc12,u,skc11)
| ~ size(skc12,v,skc11)
| equal(v,u) ),
inference(res,[status(thm),theory(equality)],[2,15]),
[iquote('0:Res:2.0,15.0')] ).
cnf(33,plain,
time(skc11),
inference(res,[status(thm),theory(equality)],[2,11]),
[iquote('0:Res:2.0,11.0')] ).
cnf(37,plain,
time(skc13),
inference(res,[status(thm),theory(equality)],[1,11]),
[iquote('0:Res:1.0,11.0')] ).
cnf(40,plain,
reorganization_free(skc12,skc11,skc13),
inference(res,[status(thm),theory(equality)],[5,13]),
[iquote('0:Res:5.0,13.0')] ).
cnf(42,plain,
( ~ size(skc12,u,skc11)
| equal(u,skc8) ),
inference(res,[status(thm),theory(equality)],[8,32]),
[iquote('0:Res:8.0,32.0')] ).
cnf(54,plain,
( ~ greater(skc11,u)
| ~ greater(v,skc9)
| ~ organization(skc12,skc11)
| ~ organization(skc12,u)
| ~ complexity(skc12,v,u)
| ~ reorganization_free(skc12,u,skc11) ),
inference(res,[status(thm),theory(equality)],[9,16]),
[iquote('0:Res:9.0,16.4')] ).
cnf(57,plain,
( ~ greater(skc11,u)
| ~ greater(v,skc9)
| ~ organization(skc12,u)
| ~ complexity(skc12,v,u)
| ~ reorganization_free(skc12,u,skc11) ),
inference(mrr,[status(thm)],[54,2]),
[iquote('0:MRR:54.2,2.0')] ).
cnf(62,plain,
( ~ greater(skc11,skc13)
| ~ greater(skc10,skc9)
| ~ organization(skc12,skc13)
| ~ reorganization_free(skc12,skc13,skc11) ),
inference(res,[status(thm),theory(equality)],[6,57]),
[iquote('0:Res:6.0,57.3')] ).
cnf(63,plain,
~ greater(skc11,skc13),
inference(mrr,[status(thm)],[62,3,1,5]),
[iquote('0:MRR:62.1,62.2,62.3,3.0,1.0,5.0')] ).
cnf(65,plain,
( ~ greater(skc13,u)
| ~ greater(v,skc7)
| ~ organization(skc12,skc13)
| ~ organization(skc12,u)
| ~ size(skc12,v,u)
| ~ reorganization_free(skc12,u,skc13) ),
inference(res,[status(thm),theory(equality)],[7,17]),
[iquote('0:Res:7.0,17.4')] ).
cnf(66,plain,
( ~ greater(skc13,u)
| ~ greater(v,skc7)
| ~ organization(skc12,u)
| ~ size(skc12,v,u)
| ~ reorganization_free(skc12,u,skc13) ),
inference(mrr,[status(thm)],[65,1]),
[iquote('0:MRR:65.2,1.0')] ).
cnf(68,plain,
( ~ greater(skc13,skc11)
| ~ greater(skc8,skc7)
| ~ organization(skc12,skc11)
| ~ reorganization_free(skc12,skc11,skc13) ),
inference(res,[status(thm),theory(equality)],[8,66]),
[iquote('0:Res:8.0,66.3')] ).
cnf(70,plain,
~ greater(skc13,skc11),
inference(mrr,[status(thm)],[68,4,2,40]),
[iquote('0:MRR:68.1,68.2,68.3,4.0,2.0,40.0')] ).
cnf(71,plain,
( ~ time(skc13)
| ~ time(skc11)
| equal(skc13,skc11)
| greater(skc11,skc13) ),
inference(res,[status(thm),theory(equality)],[14,70]),
[iquote('0:Res:14.2,70.0')] ).
cnf(73,plain,
( equal(skc13,skc11)
| greater(skc11,skc13) ),
inference(ssi,[status(thm)],[71,33,37]),
[iquote('0:SSi:71.1,71.0,33.0,37.0')] ).
cnf(74,plain,
equal(skc13,skc11),
inference(mrr,[status(thm)],[73,63]),
[iquote('0:MRR:73.1,63.0')] ).
cnf(78,plain,
size(skc12,skc7,skc11),
inference(rew,[status(thm),theory(equality)],[74,7]),
[iquote('0:Rew:74.0,7.0')] ).
cnf(93,plain,
equal(skc8,skc7),
inference(res,[status(thm),theory(equality)],[78,42]),
[iquote('0:Res:78.0,42.0')] ).
cnf(97,plain,
greater(skc7,skc7),
inference(rew,[status(thm),theory(equality)],[93,4]),
[iquote('0:Rew:93.0,4.0')] ).
cnf(106,plain,
$false,
inference(mrr,[status(thm)],[97,10]),
[iquote('0:MRR:97.0,10.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n027.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 11:33:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45
% 0.19/0.45 SPASS V 3.9
% 0.19/0.45 SPASS beiseite: Proof found.
% 0.19/0.45 % SZS status Theorem
% 0.19/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 SPASS derived 76 clauses, backtracked 0 clauses, performed 0 splits and kept 57 clauses.
% 0.19/0.45 SPASS allocated 97723 KBytes.
% 0.19/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.45 0:00:00.04 for the input.
% 0.19/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.45 0:00:00.00 for inferences.
% 0.19/0.45 0:00:00.00 for the backtracking.
% 0.19/0.45 0:00:00.01 for the reduction.
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Here is a proof with depth 3, length 36 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.46 Formulae used in the proof : t14_FOL mp6_1 mp15 mp17 mp16 mp19 t12_FOL t11_FOL
% 0.19/0.46
%------------------------------------------------------------------------------