TSTP Solution File: NUM287-1 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : NUM287-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n015.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 : Mon Jul 18 06:21:08 EDT 2022

% Result   : Unknown 0.72s 1.52s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM287-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/0.12  % Command  : bliksem %s
% 0.12/0.33  % Computer : n015.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 : Wed Jul  6 02:30:03 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.72/1.52  *** allocated 10000 integers for termspace/termends
% 0.72/1.52  *** allocated 10000 integers for clauses
% 0.72/1.52  *** allocated 10000 integers for justifications
% 0.72/1.52  Bliksem 1.12
% 0.72/1.52  
% 0.72/1.52  
% 0.72/1.52  Automatic Strategy Selection
% 0.72/1.52  
% 0.72/1.52  Clauses:
% 0.72/1.52  [
% 0.72/1.52     [ equalish( add( X, n0 ), X ) ],
% 0.72/1.52     [ equalish( add( X, successor( Y ) ), successor( add( X, Y ) ) ) ],
% 0.72/1.52     [ equalish( multiply( X, n0 ), n0 ) ],
% 0.72/1.52     [ equalish( multiply( X, successor( Y ) ), add( multiply( X, Y ), X ) )
% 0.72/1.52     ],
% 0.72/1.52     [ ~( equalish( successor( X ), successor( Y ) ) ), equalish( X, Y ) ]
% 0.72/1.52    ,
% 0.72/1.52     [ ~( equalish( X, Y ) ), equalish( successor( X ), successor( Y ) ) ]
% 0.72/1.52    ,
% 0.72/1.52     [ ~( less( X, Y ) ), ~( less( Z, X ) ), less( Z, Y ) ],
% 0.72/1.52     [ ~( equalish( add( successor( X ), Y ), Z ) ), less( Y, Z ) ],
% 0.72/1.52     [ ~( less( X, Y ) ), equalish( add( successor( 
% 0.72/1.52    'predecessor_of_1st_minus_2nd'( Y, X ) ), X ), Y ) ]
% 0.72/1.52  ] .
% 0.72/1.52  
% 0.72/1.52  
% 0.72/1.52  percentage equality = 0.000000, percentage horn = 1.000000
% 0.72/1.52  This is a near-Horn, non-equality  problem
% 0.72/1.52  
% 0.72/1.52  
% 0.72/1.52  Options Used:
% 0.72/1.52  
% 0.72/1.52  useres =            1
% 0.72/1.52  useparamod =        0
% 0.72/1.52  useeqrefl =         0
% 0.72/1.52  useeqfact =         0
% 0.72/1.52  usefactor =         1
% 0.72/1.52  usesimpsplitting =  0
% 0.72/1.52  usesimpdemod =      0
% 0.72/1.52  usesimpres =        4
% 0.72/1.52  
% 0.72/1.52  resimpinuse      =  1000
% 0.72/1.52  resimpclauses =     20000
% 0.72/1.52  substype =          standard
% 0.72/1.52  backwardsubs =      1
% 0.72/1.52  selectoldest =      5
% 0.72/1.52  
% 0.72/1.52  litorderings [0] =  split
% 0.72/1.52  litorderings [1] =  liftord
% 0.72/1.52  
% 0.72/1.52  termordering =      none
% 0.72/1.52  
% 0.72/1.52  litapriori =        1
% 0.72/1.52  termapriori =       0
% 0.72/1.52  litaposteriori =    0
% 0.72/1.52  termaposteriori =   0
% 0.72/1.52  demodaposteriori =  0
% 0.72/1.52  ordereqreflfact =   0
% 0.72/1.52  
% 0.72/1.52  litselect =         negative
% 0.72/1.52  
% 0.72/1.52  maxweight =         30000
% 0.72/1.52  maxdepth =          30000
% 0.72/1.52  maxlength =         115
% 0.72/1.52  maxnrvars =         195
% 0.72/1.52  excuselevel =       0
% 0.72/1.52  increasemaxweight = 0
% 0.72/1.52  
% 0.72/1.52  maxselected =       10000000
% 0.72/1.52  maxnrclauses =      10000000
% 0.72/1.52  
% 0.72/1.52  showgenerated =    0
% 0.72/1.52  showkept =         0
% 0.72/1.52  showselected =     0
% 0.72/1.52  showdeleted =      0
% 0.72/1.52  showresimp =       1
% 0.72/1.52  showstatus =       2000
% 0.72/1.52  
% 0.72/1.52  prologoutput =     1
% 0.72/1.52  nrgoals =          5000000
% 0.72/1.52  totalproof =       1
% 0.72/1.52  
% 0.72/1.52  Symbols occurring in the translation:
% 0.72/1.52  
% 0.72/1.52  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.72/1.52  .  [1, 2]      (w:1, o:19, a:1, s:1, b:0), 
% 0.72/1.52  !  [4, 1]      (w:1, o:13, a:1, s:1, b:0), 
% 0.72/1.52  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.72/1.52  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.72/1.52  n0  [40, 0]      (w:1, o:10, a:1, s:1, b:0), 
% 0.72/1.52  add  [41, 2]      (w:1, o:44, a:1, s:1, b:0), 
% 0.72/1.52  equalish  [42, 2]      (w:1, o:45, a:1, s:1, b:0), 
% 0.72/1.52  successor  [44, 1]      (w:1, o:18, a:1, s:1, b:0), 
% 0.72/1.52  multiply  [45, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.72/1.52  less  [46, 2]      (w:1, o:46, a:1, s:1, b:0), 
% 0.72/1.52  'predecessor_of_1st_minus_2nd'  [48, 2]      (w:1, o:48, a:1, s:1, b:0).
% 0.72/1.52  
% 0.72/1.52  
% 0.72/1.52  Starting Search:
% 0.72/1.52  
% 0.72/1.52  Resimplifying inuse:
% 0.72/1.52  Done
% 0.72/1.52  
% 0.72/1.52  renaming is full
% 0.72/1.52  
% 0.72/1.52  Memory use:
% 0.72/1.52  
% 0.72/1.52  space for terms:        287469
% 0.72/1.52  space for clauses:      1030931
% 0.72/1.52  
% 0.72/1.52  
% 0.72/1.52  clauses generated:      12202
% 0.72/1.52  clauses kept:           1825
% 0.72/1.52  clauses selected:       1581
% 0.72/1.52  clauses deleted:        0
% 0.72/1.52  clauses inuse deleted:  0
% 0.72/1.52  
% 0.72/1.52  subsentry:          22566
% 0.72/1.52  literals s-matched: 21311
% 0.72/1.52  literals matched:   21311
% 0.72/1.52  full subsumption:   0
% 0.72/1.52  
% 0.72/1.52  checksum:           -144845031
% 0.72/1.52  
% 0.72/1.52  
% 0.72/1.52  Bliksem ended
%------------------------------------------------------------------------------