TSTP Solution File: MGT005+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : MGT005+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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 : 0s
% DateTime : Sun Jul 17 21:57:33 EDT 2022
% Result : Timeout 293.76s 294.19s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT005+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Thu Jun 9 07:23:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 293.76/294.19 *** allocated 10000 integers for termspace/termends
% 293.76/294.19 *** allocated 10000 integers for clauses
% 293.76/294.19 *** allocated 10000 integers for justifications
% 293.76/294.19 Bliksem 1.12
% 293.76/294.19
% 293.76/294.19
% 293.76/294.19 Automatic Strategy Selection
% 293.76/294.19
% 293.76/294.19
% 293.76/294.19 Clauses:
% 293.76/294.19
% 293.76/294.19 { ! greater( X, Y ), ! X = Y }.
% 293.76/294.19 { ! greater( X, Y ), ! greater( Y, X ) }.
% 293.76/294.19 { ! greater( X, Z ), ! greater( Z, Y ), greater( X, Y ) }.
% 293.76/294.19 { ! organization( X, Y ), survival_chance( X, skol1( X, Y ), Y ) }.
% 293.76/294.19 { ! organization( X, Z ), ! organization( X, T ), ! greater( Y, Z ), !
% 293.76/294.19 greater( T, Y ), organization( X, Y ) }.
% 293.76/294.19 { ! reorganization( Z, X, Y ), greater( Y, X ) }.
% 293.76/294.19 { ! organization( Z, T ), ! organization( Z, U ), ! reorganization_free( Z
% 293.76/294.19 , T, U ), ! survival_chance( Z, X, T ), ! survival_chance( Z, Y, U ), !
% 293.76/294.19 greater( U, T ), greater( Y, X ) }.
% 293.76/294.19 { ! organization( Z, T ), ! organization( Z, U ), ! reorganization( Z, W,
% 293.76/294.19 V0 ), ! survival_chance( Z, X, T ), ! survival_chance( Z, Y, U ), greater
% 293.76/294.19 ( W, T ), ! greater( U, T ), greater( U, V0 ), greater( X, Y ) }.
% 293.76/294.19 { ! organization( Z, T ), ! organization( U, T ), ! organization( U, Y ), !
% 293.76/294.19 class( Z, W, T ), ! class( U, W, T ), ! reorganization( Z, T, X ), !
% 293.76/294.19 reorganization( U, T, Y ), ! reorganization_type( Z, V0, T ), !
% 293.76/294.19 reorganization_type( U, V0, T ), ! complexity( Z, V1, T ), ! complexity(
% 293.76/294.19 U, V2, T ), ! greater( V2, V1 ), greater( Y, X ) }.
% 293.76/294.19 { ! organization( Z, T ), ! organization( U, T ), ! organization( Z, W ), !
% 293.76/294.19 organization( U, W ), ! class( Z, V0, T ), ! class( U, V0, T ), !
% 293.76/294.19 survival_chance( Z, V1, T ), ! survival_chance( U, V1, T ), !
% 293.76/294.19 reorganization( Z, T, W ), ! reorganization( U, T, V2 ), !
% 293.76/294.19 reorganization_type( Z, V3, T ), ! reorganization_type( U, V3, T ), !
% 293.76/294.19 survival_chance( Z, X, W ), ! survival_chance( U, Y, W ), ! complexity( Z
% 293.76/294.19 , V4, T ), ! complexity( U, V5, T ), ! greater( V5, V4 ), greater( X, Y )
% 293.76/294.19 , X = Y }.
% 293.76/294.19 { organization( skol4, skol5 ) }.
% 293.76/294.19 { organization( skol6, skol5 ) }.
% 293.76/294.19 { organization( skol4, skol7 ) }.
% 293.76/294.19 { organization( skol6, skol7 ) }.
% 293.76/294.19 { class( skol4, skol8, skol5 ) }.
% 293.76/294.19 { class( skol6, skol8, skol5 ) }.
% 293.76/294.19 { survival_chance( skol4, skol9, skol5 ) }.
% 293.76/294.19 { survival_chance( skol6, skol9, skol5 ) }.
% 293.76/294.19 { reorganization( skol4, skol5, skol10 ) }.
% 293.76/294.19 { reorganization( skol6, skol5, skol7 ) }.
% 293.76/294.19 { reorganization_type( skol4, skol11, skol5 ) }.
% 293.76/294.19 { reorganization_type( skol6, skol11, skol5 ) }.
% 293.76/294.19 { reorganization_free( skol4, skol10, skol7 ) }.
% 293.76/294.19 { survival_chance( skol4, skol2, skol7 ) }.
% 293.76/294.19 { survival_chance( skol6, skol3, skol7 ) }.
% 293.76/294.19 { complexity( skol4, skol12, skol5 ) }.
% 293.76/294.19 { complexity( skol6, skol13, skol5 ) }.
% 293.76/294.19 { greater( skol13, skol12 ) }.
% 293.76/294.19 { ! greater( skol2, skol3 ) }.
% 293.76/294.19
% 293.76/294.19 percentage equality = 0.024096, percentage horn = 0.931034
% 293.76/294.19 This is a problem with some equality
% 293.76/294.19
% 293.76/294.19
% 293.76/294.19
% 293.76/294.19 Options Used:
% 293.76/294.19
% 293.76/294.19 useres = 1
% 293.76/294.19 useparamod = 1
% 293.76/294.19 useeqrefl = 1
% 293.76/294.19 useeqfact = 1
% 293.76/294.19 usefactor = 1
% 293.76/294.19 usesimpsplitting = 0
% 293.76/294.19 usesimpdemod = 5
% 293.76/294.19 usesimpres = 3
% 293.76/294.19
% 293.76/294.19 resimpinuse = 1000
% 293.76/294.19 resimpclauses = 20000
% 293.76/294.19 substype = eqrewr
% 293.76/294.19 backwardsubs = 1
% 293.76/294.19 selectoldest = 5
% 293.76/294.19
% 293.76/294.19 litorderings [0] = split
% 293.76/294.19 litorderings [1] = extend the termordering, first sorting on arguments
% 293.76/294.19
% 293.76/294.19 termordering = kbo
% 293.76/294.19
% 293.76/294.19 litapriori = 0
% 293.76/294.19 termapriori = 1
% 293.76/294.19 litaposteriori = 0
% 293.76/294.19 termaposteriori = 0
% 293.76/294.19 demodaposteriori = 0
% 293.76/294.19 ordereqreflfact = 0
% 293.76/294.19
% 293.76/294.19 litselect = negord
% 293.76/294.19
% 293.76/294.19 maxweight = 15
% 293.76/294.19 maxdepth = 30000
% 293.76/294.19 maxlength = 115
% 293.76/294.19 maxnrvars = 195
% 293.76/294.19 excuselevel = 1
% 293.76/294.19 increasemaxweight = 1
% 293.76/294.19
% 293.76/294.19 maxselected = 10000000
% 293.76/294.19 maxnrclauses = 10000000
% 293.76/294.19
% 293.76/294.19 showgenerated = 0
% 293.76/294.19 showkept = 0
% 293.76/294.19 showselected = 0
% 293.76/294.19 showdeleted = 0
% 293.76/294.19 showresimp = 1
% 293.76/294.19 showstatus = 2000
% 293.76/294.19
% 293.76/294.19 prologoutput = 0
% 293.76/294.19 nrgoals = 5000000
% 293.76/294.19 totalproof = 1
% 293.76/294.19
% 293.76/294.19 Symbols occurring in the translation:
% 293.76/294.19
% 293.76/294.19 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 293.76/294.19 . [1, 2] (w:1, o:39, a:1, s:1, b:0),
% 293.76/294.19 ! [4, 1] (w:0, o:34, a:1, s:1, b:0),
% 293.76/294.19 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 293.76/294.19 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 293.76/294.19 greater [37, 2] (w:1, o:63, a:1, s:1, b:0),
% 293.76/294.19 organization [40, 2] (w:1, o:64, a:1, s:1, b:0),
% 293.76/294.19 survival_chance [42, 3] (w:1, o:69, a:Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------