TSTP Solution File: MGT013-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT013-1 : TPTP v8.1.0. Released v2.4.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:10 EDT 2022
% Result : Unsatisfiable 0.21s 0.42s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 36 ( 17 unt; 3 nHn; 36 RR)
% Number of literals : 98 ( 0 equ; 70 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,
( ~ equal(u,v)
| ~ greater(u,v) ),
file('MGT013-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ organization(u,v)
| time(v) ),
file('MGT013-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ time(u)
| ~ time(v)
| greater(u,v)
| equal(v,u)
| greater(v,u) ),
file('MGT013-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ reorganization_free(u,v,w)
| reorganization_free(u,w,v) ),
file('MGT013-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ equal(u,v)
| ~ organization(w,v)
| ~ organization(w,u)
| ~ complexity(w,x,v)
| ~ complexity(w,y,u)
| equal(y,x) ),
file('MGT013-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ greater(u,v)
| ~ greater(w,x)
| ~ organization(y,w)
| ~ organization(y,x)
| ~ size(y,v,w)
| ~ size(y,u,x)
| ~ reorganization_free(y,x,w) ),
file('MGT013-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ greater(u,v)
| ~ greater(w,x)
| ~ organization(y,w)
| ~ organization(y,x)
| ~ complexity(y,v,w)
| ~ complexity(y,u,x)
| ~ reorganization_free(y,x,w) ),
file('MGT013-1.p',unknown),
[] ).
cnf(9,axiom,
organization(sk1,sk6),
file('MGT013-1.p',unknown),
[] ).
cnf(10,axiom,
organization(sk1,sk7),
file('MGT013-1.p',unknown),
[] ).
cnf(11,axiom,
reorganization_free(sk1,sk6,sk7),
file('MGT013-1.p',unknown),
[] ).
cnf(12,axiom,
complexity(sk1,sk2,sk6),
file('MGT013-1.p',unknown),
[] ).
cnf(13,axiom,
complexity(sk1,sk3,sk7),
file('MGT013-1.p',unknown),
[] ).
cnf(14,axiom,
size(sk1,sk4,sk6),
file('MGT013-1.p',unknown),
[] ).
cnf(15,axiom,
size(sk1,sk5,sk7),
file('MGT013-1.p',unknown),
[] ).
cnf(16,axiom,
greater(sk3,sk2),
file('MGT013-1.p',unknown),
[] ).
cnf(17,axiom,
greater(sk4,sk5),
file('MGT013-1.p',unknown),
[] ).
cnf(25,plain,
~ equal(sk3,sk2),
inference(res,[status(thm),theory(equality)],[16,1]),
[iquote('0:Res:16.0,1.0')] ).
cnf(35,plain,
time(sk7),
inference(res,[status(thm),theory(equality)],[10,3]),
[iquote('0:Res:10.0,3.0')] ).
cnf(38,plain,
( ~ equal(u,sk7)
| ~ organization(sk1,u)
| ~ complexity(sk1,v,u)
| ~ complexity(sk1,w,sk7)
| equal(v,w) ),
inference(res,[status(thm),theory(equality)],[10,6]),
[iquote('0:Res:10.0,6.1')] ).
cnf(40,plain,
time(sk6),
inference(res,[status(thm),theory(equality)],[9,3]),
[iquote('0:Res:9.0,3.0')] ).
cnf(44,plain,
reorganization_free(sk1,sk7,sk6),
inference(res,[status(thm),theory(equality)],[11,5]),
[iquote('0:Res:11.0,5.0')] ).
cnf(52,plain,
( ~ equal(sk7,sk6)
| ~ organization(sk1,sk6)
| ~ complexity(sk1,u,sk7)
| equal(sk2,u) ),
inference(res,[status(thm),theory(equality)],[12,38]),
[iquote('0:Res:12.0,38.2')] ).
cnf(55,plain,
( ~ equal(sk7,sk6)
| ~ complexity(sk1,u,sk7)
| equal(sk2,u) ),
inference(mrr,[status(thm)],[52,9]),
[iquote('0:MRR:52.1,9.0')] ).
cnf(61,plain,
( ~ equal(sk7,sk6)
| equal(sk3,sk2) ),
inference(res,[status(thm),theory(equality)],[13,55]),
[iquote('0:Res:13.0,55.1')] ).
cnf(62,plain,
~ equal(sk7,sk6),
inference(mrr,[status(thm)],[61,25]),
[iquote('0:MRR:61.1,25.0')] ).
cnf(67,plain,
( ~ greater(u,sk5)
| ~ greater(sk7,v)
| ~ organization(sk1,sk7)
| ~ organization(sk1,v)
| ~ size(sk1,u,v)
| ~ reorganization_free(sk1,v,sk7) ),
inference(res,[status(thm),theory(equality)],[15,7]),
[iquote('0:Res:15.0,7.4')] ).
cnf(70,plain,
( ~ greater(u,sk5)
| ~ greater(sk7,v)
| ~ organization(sk1,v)
| ~ size(sk1,u,v)
| ~ reorganization_free(sk1,v,sk7) ),
inference(mrr,[status(thm)],[67,10]),
[iquote('0:MRR:67.2,10.0')] ).
cnf(74,plain,
( ~ greater(sk4,sk5)
| ~ greater(sk7,sk6)
| ~ organization(sk1,sk6)
| ~ reorganization_free(sk1,sk6,sk7) ),
inference(res,[status(thm),theory(equality)],[14,70]),
[iquote('0:Res:14.0,70.3')] ).
cnf(75,plain,
~ greater(sk7,sk6),
inference(mrr,[status(thm)],[74,17,9,11]),
[iquote('0:MRR:74.0,74.2,74.3,17.0,9.0,11.0')] ).
cnf(76,plain,
( ~ time(sk7)
| ~ time(sk6)
| equal(sk7,sk6)
| greater(sk6,sk7) ),
inference(res,[status(thm),theory(equality)],[4,75]),
[iquote('0:Res:4.2,75.0')] ).
cnf(78,plain,
( equal(sk7,sk6)
| greater(sk6,sk7) ),
inference(ssi,[status(thm)],[76,40,35]),
[iquote('0:SSi:76.1,76.0,40.0,35.0')] ).
cnf(79,plain,
greater(sk6,sk7),
inference(mrr,[status(thm)],[78,62]),
[iquote('0:MRR:78.0,62.0')] ).
cnf(82,plain,
( ~ greater(u,sk2)
| ~ greater(sk6,v)
| ~ organization(sk1,sk6)
| ~ organization(sk1,v)
| ~ complexity(sk1,u,v)
| ~ reorganization_free(sk1,v,sk6) ),
inference(res,[status(thm),theory(equality)],[12,8]),
[iquote('0:Res:12.0,8.4')] ).
cnf(83,plain,
( ~ greater(u,sk2)
| ~ greater(sk6,v)
| ~ organization(sk1,v)
| ~ complexity(sk1,u,v)
| ~ reorganization_free(sk1,v,sk6) ),
inference(mrr,[status(thm)],[82,9]),
[iquote('0:MRR:82.2,9.0')] ).
cnf(85,plain,
( ~ greater(sk3,sk2)
| ~ greater(sk6,sk7)
| ~ organization(sk1,sk7)
| ~ reorganization_free(sk1,sk7,sk6) ),
inference(res,[status(thm),theory(equality)],[13,83]),
[iquote('0:Res:13.0,83.3')] ).
cnf(87,plain,
$false,
inference(mrr,[status(thm)],[85,16,79,10,44]),
[iquote('0:MRR:85.0,85.1,85.2,85.3,16.0,79.0,10.0,44.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : MGT013-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 09:42:17 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.42
% 0.21/0.42 SPASS V 3.9
% 0.21/0.42 SPASS beiseite: Proof found.
% 0.21/0.42 % SZS status Theorem
% 0.21/0.42 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.42 SPASS derived 56 clauses, backtracked 0 clauses, performed 0 splits and kept 50 clauses.
% 0.21/0.42 SPASS allocated 75680 KBytes.
% 0.21/0.42 SPASS spent 0:00:00.06 on the problem.
% 0.21/0.42 0:00:00.03 for the input.
% 0.21/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.42 0:00:00.00 for inferences.
% 0.21/0.42 0:00:00.00 for the backtracking.
% 0.21/0.42 0:00:00.00 for the reduction.
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 Here is a proof with depth 3, length 36 :
% 0.21/0.42 % SZS output start Refutation
% See solution above
% 0.21/0.42 Formulae used in the proof : mp6_1_18 mp15_20 mp16_21 mp17_22 mp18_23 t11_FOL_24 t12_FOL_25 t13_FOL_26 t13_FOL_27 t13_FOL_28 t13_FOL_29 t13_FOL_30 t13_FOL_31 t13_FOL_32 t13_FOL_33 t13_FOL_34
% 0.21/0.42
%------------------------------------------------------------------------------