TSTP Solution File: MGT005+2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : MGT005+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n011.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 : 300s
% DateTime : Wed Aug 31 17:50:50 EDT 2022
% Result : Theorem 1.62s 0.58s
% Output : Refutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 56 ( 27 unt; 0 def)
% Number of atoms : 459 ( 35 equ)
% Maximal formula atoms : 46 ( 8 avg)
% Number of connectives : 556 ( 153 ~; 145 |; 240 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 12 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 13 con; 0-0 aty)
% Number of variables : 249 ( 197 !; 52 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f191,plain,
$false,
inference(subsumption_resolution,[],[f190,f151]) ).
fof(f151,plain,
organization(sK7,sK5),
inference(unit_resulting_resolution,[],[f77,f90,f137,f141,f100]) ).
fof(f100,plain,
! [X2,X3,X0,X1] :
( ~ organization(X0,X3)
| ~ greater(X2,X1)
| ~ organization(X0,X1)
| ~ greater(X3,X2)
| organization(X0,X2) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2,X3] :
( organization(X0,X2)
| ~ greater(X2,X1)
| ~ organization(X0,X1)
| ~ organization(X0,X3)
| ~ greater(X3,X2) ),
inference(flattening,[],[f31]) ).
fof(f31,plain,
! [X3,X2,X0,X1] :
( organization(X0,X2)
| ~ organization(X0,X1)
| ~ greater(X3,X2)
| ~ greater(X2,X1)
| ~ organization(X0,X3) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,plain,
! [X3,X2,X0,X1] :
( ( organization(X0,X1)
& greater(X3,X2)
& greater(X2,X1)
& organization(X0,X3) )
=> organization(X0,X2) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X0,X7,X5,X8] :
( ( greater(X8,X5)
& greater(X5,X7)
& organization(X0,X8)
& organization(X0,X7) )
=> organization(X0,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp13) ).
fof(f141,plain,
greater(sK4,sK5),
inference(unit_resulting_resolution,[],[f75,f73,f71,f107,f84,f74,f89,f70,f83,f88,f90,f81,f96]) ).
fof(f96,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ complexity(X7,X3,X5)
| ~ organization(X7,X5)
| ~ greater(X6,X3)
| greater(X8,X0)
| ~ organization(X2,X5)
| ~ complexity(X2,X6,X5)
| ~ class(X2,X4,X5)
| ~ reorganization(X2,X5,X8)
| ~ class(X7,X4,X5)
| ~ reorganization(X7,X5,X0)
| ~ reorganization_type(X2,X1,X5)
| ~ organization(X2,X8)
| ~ reorganization_type(X7,X1,X5) ),
inference(cnf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ complexity(X2,X6,X5)
| ~ class(X7,X4,X5)
| ~ class(X2,X4,X5)
| ~ reorganization(X2,X5,X8)
| ~ reorganization_type(X2,X1,X5)
| greater(X8,X0)
| ~ reorganization(X7,X5,X0)
| ~ organization(X2,X5)
| ~ organization(X2,X8)
| ~ organization(X7,X5)
| ~ complexity(X7,X3,X5)
| ~ reorganization_type(X7,X1,X5)
| ~ greater(X6,X3) ),
inference(rectify,[],[f48]) ).
fof(f48,plain,
! [X3,X8,X7,X6,X5,X1,X4,X2,X0] :
( ~ complexity(X7,X4,X1)
| ~ class(X2,X5,X1)
| ~ class(X7,X5,X1)
| ~ reorganization(X7,X1,X0)
| ~ reorganization_type(X7,X8,X1)
| greater(X0,X3)
| ~ reorganization(X2,X1,X3)
| ~ organization(X7,X1)
| ~ organization(X7,X0)
| ~ organization(X2,X1)
| ~ complexity(X2,X6,X1)
| ~ reorganization_type(X2,X8,X1)
| ~ greater(X4,X6) ),
inference(flattening,[],[f47]) ).
fof(f47,plain,
! [X2,X8,X0,X4,X7,X5,X6,X1,X3] :
( greater(X0,X3)
| ~ reorganization_type(X7,X8,X1)
| ~ complexity(X7,X4,X1)
| ~ reorganization_type(X2,X8,X1)
| ~ complexity(X2,X6,X1)
| ~ class(X2,X5,X1)
| ~ greater(X4,X6)
| ~ organization(X7,X1)
| ~ class(X7,X5,X1)
| ~ organization(X7,X0)
| ~ reorganization(X2,X1,X3)
| ~ organization(X2,X1)
| ~ reorganization(X7,X1,X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
! [X2,X8,X0,X4,X7,X5,X6,X1,X3] :
( ( reorganization_type(X7,X8,X1)
& complexity(X7,X4,X1)
& reorganization_type(X2,X8,X1)
& complexity(X2,X6,X1)
& class(X2,X5,X1)
& greater(X4,X6)
& organization(X7,X1)
& class(X7,X5,X1)
& organization(X7,X0)
& reorganization(X2,X1,X3)
& organization(X2,X1)
& reorganization(X7,X1,X0) )
=> greater(X0,X3) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X15,X9,X0,X10,X14,X12,X13,X1,X11] :
( ( class(X0,X12,X9)
& reorganization(X0,X9,X10)
& greater(X14,X13)
& complexity(X0,X13,X9)
& reorganization(X1,X9,X15)
& organization(X0,X9)
& organization(X1,X9)
& reorganization_type(X1,X11,X9)
& organization(X1,X15)
& complexity(X1,X14,X9)
& reorganization_type(X0,X11,X9)
& class(X1,X12,X9) )
=> greater(X15,X10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a10_FOL) ).
fof(f81,plain,
complexity(sK7,sK10,sK1),
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
( organization(sK7,sK1)
& complexity(sK2,sK13,sK1)
& class(sK7,sK3,sK1)
& survival_chance(sK2,sK11,sK5)
& ( greater(sK8,sK11)
| sK5 != sK4 )
& survival_chance(sK7,sK6,sK1)
& greater(sK13,sK10)
& class(sK2,sK3,sK1)
& reorganization(sK7,sK1,sK9)
& complexity(sK7,sK10,sK1)
& ~ greater(sK8,sK11)
& survival_chance(sK7,sK8,sK5)
& reorganization_free(sK7,sK9,sK4)
& organization(sK7,sK4)
& sK11 != sK8
& organization(sK2,sK4)
& reorganization(sK2,sK1,sK4)
& reorganization_type(sK7,sK12,sK1)
& survival_chance(sK2,sK6,sK1)
& reorganization_type(sK2,sK12,sK1)
& organization(sK2,sK1)
& sK9 = sK5 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11,sK12,sK13])],[f53,f54]) ).
fof(f54,plain,
( ? [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12] :
( organization(X6,X0)
& complexity(X1,X12,X0)
& class(X6,X2,X0)
& survival_chance(X1,X10,X4)
& ( greater(X7,X10)
| X3 != X4 )
& survival_chance(X6,X5,X0)
& greater(X12,X9)
& class(X1,X2,X0)
& reorganization(X6,X0,X8)
& complexity(X6,X9,X0)
& ~ greater(X7,X10)
& survival_chance(X6,X7,X4)
& reorganization_free(X6,X8,X3)
& organization(X6,X3)
& X7 != X10
& organization(X1,X3)
& reorganization(X1,X0,X3)
& reorganization_type(X6,X11,X0)
& survival_chance(X1,X5,X0)
& reorganization_type(X1,X11,X0)
& organization(X1,X0)
& X4 = X8 )
=> ( organization(sK7,sK1)
& complexity(sK2,sK13,sK1)
& class(sK7,sK3,sK1)
& survival_chance(sK2,sK11,sK5)
& ( greater(sK8,sK11)
| sK5 != sK4 )
& survival_chance(sK7,sK6,sK1)
& greater(sK13,sK10)
& class(sK2,sK3,sK1)
& reorganization(sK7,sK1,sK9)
& complexity(sK7,sK10,sK1)
& ~ greater(sK8,sK11)
& survival_chance(sK7,sK8,sK5)
& reorganization_free(sK7,sK9,sK4)
& organization(sK7,sK4)
& sK11 != sK8
& organization(sK2,sK4)
& reorganization(sK2,sK1,sK4)
& reorganization_type(sK7,sK12,sK1)
& survival_chance(sK2,sK6,sK1)
& reorganization_type(sK2,sK12,sK1)
& organization(sK2,sK1)
& sK9 = sK5 ) ),
introduced(choice_axiom,[]) ).
fof(f53,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12] :
( organization(X6,X0)
& complexity(X1,X12,X0)
& class(X6,X2,X0)
& survival_chance(X1,X10,X4)
& ( greater(X7,X10)
| X3 != X4 )
& survival_chance(X6,X5,X0)
& greater(X12,X9)
& class(X1,X2,X0)
& reorganization(X6,X0,X8)
& complexity(X6,X9,X0)
& ~ greater(X7,X10)
& survival_chance(X6,X7,X4)
& reorganization_free(X6,X8,X3)
& organization(X6,X3)
& X7 != X10
& organization(X1,X3)
& reorganization(X1,X0,X3)
& reorganization_type(X6,X11,X0)
& survival_chance(X1,X5,X0)
& reorganization_type(X1,X11,X0)
& organization(X1,X0)
& X4 = X8 ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
? [X11,X1,X7,X4,X10,X5,X12,X3,X6,X0,X2,X8,X9] :
( organization(X12,X11)
& complexity(X1,X9,X11)
& class(X12,X7,X11)
& survival_chance(X1,X2,X10)
& ( greater(X3,X2)
| X4 != X10 )
& survival_chance(X12,X5,X11)
& greater(X9,X0)
& class(X1,X7,X11)
& reorganization(X12,X11,X6)
& complexity(X12,X0,X11)
& ~ greater(X3,X2)
& survival_chance(X12,X3,X10)
& reorganization_free(X12,X6,X4)
& organization(X12,X4)
& X2 != X3
& organization(X1,X4)
& reorganization(X1,X11,X4)
& reorganization_type(X12,X8,X11)
& survival_chance(X1,X5,X11)
& reorganization_type(X1,X8,X11)
& organization(X1,X11)
& X6 = X10 ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
? [X5,X8,X7,X9,X10,X0,X2,X3,X12,X4,X11,X6,X1] :
( ~ greater(X3,X2)
& X2 != X3
& X6 = X10
& ( greater(X3,X2)
| X4 != X10 )
& class(X12,X7,X11)
& reorganization_free(X12,X6,X4)
& reorganization_type(X12,X8,X11)
& organization(X1,X11)
& organization(X12,X11)
& complexity(X1,X9,X11)
& survival_chance(X12,X5,X11)
& complexity(X12,X0,X11)
& reorganization_type(X1,X8,X11)
& organization(X1,X4)
& survival_chance(X1,X2,X10)
& organization(X12,X4)
& greater(X9,X0)
& survival_chance(X1,X5,X11)
& class(X1,X7,X11)
& reorganization(X12,X11,X6)
& survival_chance(X12,X3,X10)
& reorganization(X1,X11,X4) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
~ ! [X5,X8,X7,X9,X10,X0,X2,X3,X12,X4,X11,X6,X1] :
( ( ( X4 = X10
=> greater(X3,X2) )
& class(X12,X7,X11)
& reorganization_free(X12,X6,X4)
& reorganization_type(X12,X8,X11)
& organization(X1,X11)
& organization(X12,X11)
& complexity(X1,X9,X11)
& survival_chance(X12,X5,X11)
& complexity(X12,X0,X11)
& reorganization_type(X1,X8,X11)
& organization(X1,X4)
& survival_chance(X1,X2,X10)
& organization(X12,X4)
& greater(X9,X0)
& survival_chance(X1,X5,X11)
& class(X1,X7,X11)
& reorganization(X12,X11,X6)
& survival_chance(X12,X3,X10)
& reorganization(X1,X11,X4) )
=> ( X6 = X10
=> ( greater(X3,X2)
| X2 = X3 ) ) ),
inference(rectify,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X13,X1,X4,X3,X15,X6,X10,X12,X11,X14,X5,X9,X0] :
( ( survival_chance(X1,X4,X5)
& organization(X0,X15)
& reorganization(X1,X9,X15)
& organization(X1,X9)
& survival_chance(X1,X6,X9)
& survival_chance(X0,X6,X9)
& reorganization_type(X1,X11,X9)
& reorganization_type(X0,X11,X9)
& class(X1,X12,X9)
& organization(X0,X9)
& greater(X14,X13)
& survival_chance(X0,X3,X5)
& ( X5 = X15
=> greater(X3,X4) )
& complexity(X1,X14,X9)
& reorganization(X0,X9,X10)
& reorganization_free(X0,X10,X15)
& organization(X1,X15)
& complexity(X0,X13,X9)
& class(X0,X12,X9) )
=> ( X5 = X10
=> ( X3 = X4
| greater(X3,X4) ) ) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X13,X1,X4,X3,X15,X6,X10,X12,X11,X14,X5,X9,X0] :
( ( survival_chance(X1,X4,X5)
& organization(X0,X15)
& reorganization(X1,X9,X15)
& organization(X1,X9)
& survival_chance(X1,X6,X9)
& survival_chance(X0,X6,X9)
& reorganization_type(X1,X11,X9)
& reorganization_type(X0,X11,X9)
& class(X1,X12,X9)
& organization(X0,X9)
& greater(X14,X13)
& survival_chance(X0,X3,X5)
& ( X5 = X15
=> greater(X3,X4) )
& complexity(X1,X14,X9)
& reorganization(X0,X9,X10)
& reorganization_free(X0,X10,X15)
& organization(X1,X15)
& complexity(X0,X13,X9)
& class(X0,X12,X9) )
=> ( X5 = X10
=> ( X3 = X4
| greater(X3,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_plus_FOL) ).
fof(f88,plain,
class(sK7,sK3,sK1),
inference(cnf_transformation,[],[f55]) ).
fof(f83,plain,
class(sK2,sK3,sK1),
inference(cnf_transformation,[],[f55]) ).
fof(f70,plain,
organization(sK2,sK1),
inference(cnf_transformation,[],[f55]) ).
fof(f89,plain,
complexity(sK2,sK13,sK1),
inference(cnf_transformation,[],[f55]) ).
fof(f74,plain,
reorganization(sK2,sK1,sK4),
inference(cnf_transformation,[],[f55]) ).
fof(f84,plain,
greater(sK13,sK10),
inference(cnf_transformation,[],[f55]) ).
fof(f107,plain,
reorganization(sK7,sK1,sK5),
inference(forward_demodulation,[],[f82,f69]) ).
fof(f69,plain,
sK9 = sK5,
inference(cnf_transformation,[],[f55]) ).
fof(f82,plain,
reorganization(sK7,sK1,sK9),
inference(cnf_transformation,[],[f55]) ).
fof(f71,plain,
reorganization_type(sK2,sK12,sK1),
inference(cnf_transformation,[],[f55]) ).
fof(f73,plain,
reorganization_type(sK7,sK12,sK1),
inference(cnf_transformation,[],[f55]) ).
fof(f75,plain,
organization(sK2,sK4),
inference(cnf_transformation,[],[f55]) ).
fof(f137,plain,
greater(sK5,sK1),
inference(unit_resulting_resolution,[],[f107,f68]) ).
fof(f68,plain,
! [X2,X0,X1] :
( ~ reorganization(X1,X0,X2)
| greater(X2,X0) ),
inference(cnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X0,X1,X2] :
( greater(X2,X0)
| ~ reorganization(X1,X0,X2) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,plain,
! [X1,X2,X0] :
( reorganization(X1,X0,X2)
=> greater(X2,X0) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X9,X0,X10] :
( reorganization(X0,X9,X10)
=> greater(X10,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp7) ).
fof(f90,plain,
organization(sK7,sK1),
inference(cnf_transformation,[],[f55]) ).
fof(f77,plain,
organization(sK7,sK4),
inference(cnf_transformation,[],[f55]) ).
fof(f190,plain,
~ organization(sK7,sK5),
inference(unit_resulting_resolution,[],[f84,f81,f88,f83,f70,f74,f80,f90,f76,f79,f107,f85,f73,f71,f72,f89,f87,f150,f99]) ).
fof(f99,plain,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ complexity(X11,X7,X10)
| ~ greater(X6,X7)
| ~ complexity(X9,X6,X10)
| greater(X1,X3)
| ~ survival_chance(X9,X8,X10)
| ~ class(X11,X5,X10)
| ~ reorganization_type(X11,X4,X10)
| ~ organization(X9,X0)
| ~ survival_chance(X11,X1,X0)
| X1 = X3
| ~ organization(X11,X10)
| ~ reorganization_type(X9,X4,X10)
| ~ reorganization(X9,X10,X2)
| ~ organization(X9,X10)
| ~ organization(X11,X0)
| ~ class(X9,X5,X10)
| ~ survival_chance(X11,X8,X10)
| ~ reorganization(X11,X10,X0)
| ~ survival_chance(X9,X3,X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f62,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] :
( X1 = X3
| ~ survival_chance(X11,X1,X0)
| ~ class(X9,X5,X10)
| ~ survival_chance(X9,X3,X0)
| greater(X1,X3)
| ~ greater(X6,X7)
| ~ reorganization(X9,X10,X2)
| ~ organization(X11,X0)
| ~ organization(X9,X10)
| ~ class(X11,X5,X10)
| ~ survival_chance(X9,X8,X10)
| ~ reorganization_type(X11,X4,X10)
| ~ complexity(X9,X6,X10)
| ~ survival_chance(X11,X8,X10)
| ~ complexity(X11,X7,X10)
| ~ organization(X9,X0)
| ~ organization(X11,X10)
| ~ reorganization_type(X9,X4,X10)
| ~ reorganization(X11,X10,X0) ),
inference(rectify,[],[f43]) ).
fof(f43,plain,
! [X4,X5,X8,X7,X10,X3,X6,X11,X1,X0,X9,X2] :
( X5 = X7
| ~ survival_chance(X2,X5,X4)
| ~ class(X0,X3,X9)
| ~ survival_chance(X0,X7,X4)
| greater(X5,X7)
| ~ greater(X6,X11)
| ~ reorganization(X0,X9,X8)
| ~ organization(X2,X4)
| ~ organization(X0,X9)
| ~ class(X2,X3,X9)
| ~ survival_chance(X0,X1,X9)
| ~ reorganization_type(X2,X10,X9)
| ~ complexity(X0,X6,X9)
| ~ survival_chance(X2,X1,X9)
| ~ complexity(X2,X11,X9)
| ~ organization(X0,X4)
| ~ organization(X2,X9)
| ~ reorganization_type(X0,X10,X9)
| ~ reorganization(X2,X9,X4) ),
inference(flattening,[],[f42]) ).
fof(f42,plain,
! [X6,X9,X11,X5,X2,X4,X10,X1,X8,X7,X3,X0] :
( X5 = X7
| greater(X5,X7)
| ~ organization(X2,X4)
| ~ survival_chance(X0,X1,X9)
| ~ survival_chance(X2,X1,X9)
| ~ reorganization_type(X2,X10,X9)
| ~ class(X0,X3,X9)
| ~ class(X2,X3,X9)
| ~ organization(X2,X9)
| ~ greater(X6,X11)
| ~ reorganization(X0,X9,X8)
| ~ organization(X0,X4)
| ~ organization(X0,X9)
| ~ reorganization(X2,X9,X4)
| ~ survival_chance(X2,X5,X4)
| ~ complexity(X2,X11,X9)
| ~ reorganization_type(X0,X10,X9)
| ~ complexity(X0,X6,X9)
| ~ survival_chance(X0,X7,X4) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
! [X6,X9,X11,X5,X2,X4,X10,X1,X8,X7,X3,X0] :
( ( organization(X2,X4)
& survival_chance(X0,X1,X9)
& survival_chance(X2,X1,X9)
& reorganization_type(X2,X10,X9)
& class(X0,X3,X9)
& class(X2,X3,X9)
& organization(X2,X9)
& greater(X6,X11)
& reorganization(X0,X9,X8)
& organization(X0,X4)
& organization(X0,X9)
& reorganization(X2,X9,X4)
& survival_chance(X2,X5,X4)
& complexity(X2,X11,X9)
& reorganization_type(X0,X10,X9)
& complexity(X0,X6,X9)
& survival_chance(X0,X7,X4) )
=> ( X5 = X7
| greater(X5,X7) ) ),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
! [X1,X6,X0,X12,X10,X3,X14,X4,X15,X9,X11,X13] :
( ( reorganization_type(X0,X11,X9)
& survival_chance(X1,X6,X9)
& complexity(X1,X14,X9)
& reorganization_type(X1,X11,X9)
& organization(X1,X9)
& organization(X0,X10)
& greater(X14,X13)
& reorganization(X0,X9,X10)
& reorganization(X1,X9,X15)
& complexity(X0,X13,X9)
& organization(X1,X10)
& survival_chance(X1,X4,X10)
& survival_chance(X0,X6,X9)
& class(X1,X12,X9)
& organization(X0,X9)
& survival_chance(X0,X3,X10)
& class(X0,X12,X9) )
=> ( X3 = X4
| greater(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a11_FOL) ).
fof(f150,plain,
organization(sK2,sK5),
inference(unit_resulting_resolution,[],[f75,f70,f137,f141,f100]) ).
fof(f87,plain,
survival_chance(sK2,sK11,sK5),
inference(cnf_transformation,[],[f55]) ).
fof(f72,plain,
survival_chance(sK2,sK6,sK1),
inference(cnf_transformation,[],[f55]) ).
fof(f85,plain,
survival_chance(sK7,sK6,sK1),
inference(cnf_transformation,[],[f55]) ).
fof(f79,plain,
survival_chance(sK7,sK8,sK5),
inference(cnf_transformation,[],[f55]) ).
fof(f76,plain,
sK11 != sK8,
inference(cnf_transformation,[],[f55]) ).
fof(f80,plain,
~ greater(sK8,sK11),
inference(cnf_transformation,[],[f55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : MGT005+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 30 03:08:25 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.20/0.50 % (26135)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (26138)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.51 % (26150)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.52 % (26136)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.52 % (26137)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.52 % (26141)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.52 % (26142)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.52 % (26159)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.52 % (26143)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52 % (26151)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.53 % (26151)Instruction limit reached!
% 0.20/0.53 % (26151)------------------------------
% 0.20/0.53 % (26151)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (26155)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.53 % (26133)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.53 % (26147)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.53 % (26150)Instruction limit reached!
% 0.20/0.53 % (26150)------------------------------
% 0.20/0.53 % (26150)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (26150)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (26150)Termination reason: Unknown
% 0.20/0.53 % (26150)Termination phase: Saturation
% 0.20/0.53
% 0.20/0.53 % (26150)Memory used [KB]: 1535
% 0.20/0.53 % (26150)Time elapsed: 0.004 s
% 0.20/0.53 % (26150)Instructions burned: 3 (million)
% 0.20/0.53 % (26150)------------------------------
% 0.20/0.53 % (26150)------------------------------
% 0.20/0.53 % (26134)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.53 % (26145)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53 % (26161)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.20/0.53 % (26149)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.53 % (26152)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.20/0.54 % (26153)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.54 % (26154)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.54 % (26132)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.54 % (26143)Instruction limit reached!
% 0.20/0.54 % (26143)------------------------------
% 0.20/0.54 % (26143)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (26151)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (26151)Termination reason: Unknown
% 0.20/0.54 % (26151)Termination phase: Saturation
% 0.20/0.54
% 0.20/0.54 % (26151)Memory used [KB]: 6140
% 0.20/0.54 % (26151)Time elapsed: 0.129 s
% 0.20/0.54 % (26151)Instructions burned: 11 (million)
% 0.20/0.54 % (26151)------------------------------
% 0.20/0.54 % (26151)------------------------------
% 0.20/0.54 % (26143)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (26143)Termination reason: Unknown
% 0.20/0.54 % (26143)Termination phase: Saturation
% 0.20/0.54
% 0.20/0.54 % (26143)Memory used [KB]: 6140
% 0.20/0.54 % (26143)Time elapsed: 0.138 s
% 0.20/0.54 % (26143)Instructions burned: 7 (million)
% 0.20/0.54 % (26143)------------------------------
% 0.20/0.54 % (26143)------------------------------
% 0.20/0.54 % (26146)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.54 % (26146)Instruction limit reached!
% 0.20/0.54 % (26146)------------------------------
% 0.20/0.54 % (26146)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (26146)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (26146)Termination reason: Unknown
% 0.20/0.54 % (26146)Termination phase: Saturation
% 0.20/0.54
% 0.20/0.54 % (26146)Memory used [KB]: 6012
% 0.20/0.54 % (26146)Time elapsed: 0.003 s
% 0.20/0.54 % (26146)Instructions burned: 3 (million)
% 0.20/0.54 % (26146)------------------------------
% 0.20/0.54 % (26146)------------------------------
% 0.20/0.54 % (26142)Instruction limit reached!
% 0.20/0.54 % (26142)------------------------------
% 0.20/0.54 % (26142)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (26142)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (26142)Termination reason: Unknown
% 0.20/0.54 % (26142)Termination phase: Saturation
% 0.20/0.54
% 0.20/0.54 % (26142)Memory used [KB]: 6140
% 0.20/0.54 % (26142)Time elapsed: 0.135 s
% 0.20/0.54 % (26142)Instructions burned: 13 (million)
% 0.20/0.54 % (26142)------------------------------
% 0.20/0.54 % (26142)------------------------------
% 0.20/0.54 % (26161)Instruction limit reached!
% 0.20/0.54 % (26161)------------------------------
% 0.20/0.54 % (26161)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (26161)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (26161)Termination reason: Unknown
% 0.20/0.54 % (26161)Termination phase: Saturation
% 0.20/0.54
% 0.20/0.54 % (26161)Memory used [KB]: 6140
% 0.20/0.54 % (26161)Time elapsed: 0.131 s
% 0.20/0.54 % (26161)Instructions burned: 8 (million)
% 0.20/0.54 % (26161)------------------------------
% 0.20/0.54 % (26161)------------------------------
% 0.20/0.54 % (26160)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.54 % (26136)Instruction limit reached!
% 0.20/0.54 % (26136)------------------------------
% 0.20/0.54 % (26136)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (26136)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (26136)Termination reason: Unknown
% 0.20/0.54 % (26136)Termination phase: Saturation
% 0.20/0.54
% 0.20/0.54 % (26136)Memory used [KB]: 6140
% 0.20/0.54 % (26136)Time elapsed: 0.136 s
% 0.20/0.54 % (26136)Instructions burned: 13 (million)
% 0.20/0.54 % (26136)------------------------------
% 0.20/0.54 % (26136)------------------------------
% 0.20/0.54 % (26137)Instruction limit reached!
% 0.20/0.54 % (26137)------------------------------
% 0.20/0.54 % (26137)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (26137)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (26137)Termination reason: Unknown
% 0.20/0.54 % (26137)Termination phase: Saturation
% 0.20/0.54
% 0.20/0.54 % (26137)Memory used [KB]: 1663
% 0.20/0.54 % (26137)Time elapsed: 0.139 s
% 0.20/0.54 % (26137)Instructions burned: 15 (million)
% 0.20/0.54 % (26137)------------------------------
% 0.20/0.54 % (26137)------------------------------
% 0.20/0.54 % (26162)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.54 % (26144)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.20/0.55 % (26140)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.55 % (26139)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.55 % (26148)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.55 % (26147)Instruction limit reached!
% 0.20/0.55 % (26147)------------------------------
% 0.20/0.55 % (26147)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (26149)Instruction limit reached!
% 0.20/0.55 % (26149)------------------------------
% 0.20/0.55 % (26149)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (26149)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (26149)Termination reason: Unknown
% 0.20/0.55 % (26149)Termination phase: Function definition elimination
% 0.20/0.55
% 0.20/0.55 % (26149)Memory used [KB]: 1535
% 0.20/0.55 % (26149)Time elapsed: 0.003 s
% 0.20/0.55 % (26149)Instructions burned: 3 (million)
% 0.20/0.55 % (26149)------------------------------
% 0.20/0.55 % (26149)------------------------------
% 0.20/0.55 % (26157)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.55 % (26134)Instruction limit reached!
% 0.20/0.55 % (26134)------------------------------
% 0.20/0.55 % (26134)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (26134)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (26134)Termination reason: Unknown
% 0.20/0.55 % (26134)Termination phase: Saturation
% 0.20/0.55
% 0.20/0.55 % (26134)Memory used [KB]: 6012
% 0.20/0.55 % (26134)Time elapsed: 0.137 s
% 0.20/0.55 % (26134)Instructions burned: 4 (million)
% 0.20/0.55 % (26134)------------------------------
% 0.20/0.55 % (26134)------------------------------
% 1.51/0.56 % (26147)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.56 % (26147)Termination reason: Unknown
% 1.51/0.56 % (26147)Termination phase: Saturation
% 1.51/0.56
% 1.51/0.56 % (26147)Memory used [KB]: 6140
% 1.51/0.56 % (26147)Time elapsed: 0.101 s
% 1.51/0.56 % (26147)Instructions burned: 7 (million)
% 1.51/0.56 % (26147)------------------------------
% 1.51/0.56 % (26147)------------------------------
% 1.51/0.56 % (26133)Instruction limit reached!
% 1.51/0.56 % (26133)------------------------------
% 1.51/0.56 % (26133)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.56 % (26133)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.56 % (26133)Termination reason: Unknown
% 1.51/0.56 % (26133)Termination phase: Saturation
% 1.51/0.56
% 1.51/0.56 % (26133)Memory used [KB]: 6140
% 1.51/0.56 % (26133)Time elapsed: 0.127 s
% 1.51/0.56 % (26133)Instructions burned: 14 (million)
% 1.51/0.56 % (26133)------------------------------
% 1.51/0.56 % (26133)------------------------------
% 1.51/0.56 % (26158)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 1.51/0.57 % (26160)Instruction limit reached!
% 1.51/0.57 % (26160)------------------------------
% 1.51/0.57 % (26160)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.57 % (26144)Instruction limit reached!
% 1.51/0.57 % (26144)------------------------------
% 1.51/0.57 % (26144)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.57 % (26144)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.57 % (26144)Termination reason: Unknown
% 1.51/0.57 % (26144)Termination phase: Saturation
% 1.51/0.57
% 1.51/0.57 % (26144)Memory used [KB]: 1791
% 1.51/0.57 % (26144)Time elapsed: 0.146 s
% 1.51/0.57 % (26144)Instructions burned: 16 (million)
% 1.51/0.57 % (26144)------------------------------
% 1.51/0.57 % (26144)------------------------------
% 1.62/0.58 % (26162)Instruction limit reached!
% 1.62/0.58 % (26162)------------------------------
% 1.62/0.58 % (26162)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.62/0.58 % (26135)First to succeed.
% 1.62/0.58 % (26138)Instruction limit reached!
% 1.62/0.58 % (26138)------------------------------
% 1.62/0.58 % (26138)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.62/0.58 % (26138)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.62/0.58 % (26138)Termination reason: Unknown
% 1.62/0.58 % (26138)Termination phase: Saturation
% 1.62/0.58
% 1.62/0.58 % (26138)Memory used [KB]: 6396
% 1.62/0.58 % (26138)Time elapsed: 0.154 s
% 1.62/0.58 % (26138)Instructions burned: 40 (million)
% 1.62/0.58 % (26138)------------------------------
% 1.62/0.58 % (26138)------------------------------
% 1.62/0.58 % (26135)Refutation found. Thanks to Tanya!
% 1.62/0.58 % SZS status Theorem for theBenchmark
% 1.62/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.62/0.58 % (26135)------------------------------
% 1.62/0.58 % (26135)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.62/0.58 % (26135)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.62/0.58 % (26135)Termination reason: Refutation
% 1.62/0.58
% 1.62/0.58 % (26135)Memory used [KB]: 6396
% 1.62/0.58 % (26135)Time elapsed: 0.173 s
% 1.62/0.58 % (26135)Instructions burned: 39 (million)
% 1.62/0.58 % (26135)------------------------------
% 1.62/0.58 % (26135)------------------------------
% 1.62/0.58 % (26129)Success in time 0.209 s
%------------------------------------------------------------------------------