TSTP Solution File: NUM374+1 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : NUM374+1 : TPTP v8.1.0. Released v3.2.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:43 EDT 2022

% Result   : Timeout 300.01s 300.39s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : NUM374+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n015.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  % DateTime : Tue Jul  5 12:19:32 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 249.21/249.61  *** allocated 10000 integers for termspace/termends
% 249.21/249.61  *** allocated 10000 integers for clauses
% 249.21/249.61  *** allocated 10000 integers for justifications
% 249.21/249.61  Bliksem 1.12
% 249.21/249.61  
% 249.21/249.61  
% 249.21/249.61  Automatic Strategy Selection
% 249.21/249.61  
% 249.21/249.61  
% 249.21/249.61  Clauses:
% 249.21/249.61  
% 249.21/249.61  { sum( X, Y ) = sum( Y, X ) }.
% 249.21/249.61  { sum( X, sum( Y, Z ) ) = sum( sum( X, Y ), Z ) }.
% 249.21/249.61  { product( X, n1 ) = X }.
% 249.21/249.61  { product( X, Y ) = product( Y, X ) }.
% 249.21/249.61  { product( X, product( Y, Z ) ) = product( product( X, Y ), Z ) }.
% 249.21/249.61  { product( X, sum( Y, Z ) ) = sum( product( X, Y ), product( X, Z ) ) }.
% 249.21/249.61  { exponent( n1, X ) = n1 }.
% 249.21/249.61  { exponent( X, n1 ) = X }.
% 249.21/249.61  { exponent( X, sum( Y, Z ) ) = product( exponent( X, Y ), exponent( X, Z )
% 249.21/249.61     ) }.
% 249.21/249.61  { exponent( product( X, Y ), Z ) = product( exponent( X, Z ), exponent( Y, 
% 249.21/249.61    Z ) ) }.
% 249.21/249.61  { exponent( exponent( X, Y ), Z ) = exponent( X, product( Y, Z ) ) }.
% 249.21/249.61  { skol6 = product( skol5, skol5 ) }.
% 249.21/249.61  { skol1 = sum( n1, skol5 ) }.
% 249.21/249.61  { skol2 = sum( skol1, skol6 ) }.
% 249.21/249.61  { skol3 = sum( n1, product( skol5, skol6 ) ) }.
% 249.21/249.61  { skol4 = sum( sum( n1, skol6 ), product( skol6, skol6 ) ) }.
% 249.21/249.61  { ! product( exponent( sum( exponent( skol1, skol5 ), exponent( skol2, 
% 249.21/249.61    skol5 ) ), skol7 ), exponent( sum( exponent( skol3, skol7 ), exponent( 
% 249.21/249.61    skol4, skol7 ) ), skol5 ) ) = product( exponent( sum( exponent( skol1, 
% 249.21/249.61    skol7 ), exponent( skol2, skol7 ) ), skol5 ), exponent( sum( exponent( 
% 249.21/249.61    skol3, skol5 ), exponent( skol4, skol5 ) ), skol7 ) ) }.
% 249.21/249.61  
% 249.21/249.61  percentage equality = 1.000000, percentage horn = 1.000000
% 249.21/249.61  This is a pure equality problem
% 249.21/249.61  
% 249.21/249.61  
% 249.21/249.61  
% 249.21/249.61  Options Used:
% 249.21/249.61  
% 249.21/249.61  useres =            1
% 249.21/249.61  useparamod =        1
% 249.21/249.61  useeqrefl =         1
% 249.21/249.61  useeqfact =         1
% 249.21/249.61  usefactor =         1
% 249.21/249.61  usesimpsplitting =  0
% 249.21/249.61  usesimpdemod =      5
% 249.21/249.61  usesimpres =        3
% 249.21/249.61  
% 249.21/249.61  resimpinuse      =  1000
% 249.21/249.61  resimpclauses =     20000
% 249.21/249.61  substype =          eqrewr
% 249.21/249.61  backwardsubs =      1
% 249.21/249.61  selectoldest =      5
% 249.21/249.61  
% 249.21/249.61  litorderings [0] =  split
% 249.21/249.61  litorderings [1] =  extend the termordering, first sorting on arguments
% 249.21/249.61  
% 249.21/249.61  termordering =      kbo
% 249.21/249.61  
% 249.21/249.61  litapriori =        0
% 249.21/249.61  termapriori =       1
% 249.21/249.61  litaposteriori =    0
% 249.21/249.61  termaposteriori =   0
% 249.21/249.61  demodaposteriori =  0
% 249.21/249.61  ordereqreflfact =   0
% 249.21/249.61  
% 249.21/249.61  litselect =         negord
% 249.21/249.61  
% 249.21/249.61  maxweight =         15
% 249.21/249.61  maxdepth =          30000
% 249.21/249.61  maxlength =         115
% 249.21/249.61  maxnrvars =         195
% 249.21/249.61  excuselevel =       1
% 249.21/249.61  increasemaxweight = 1
% 249.21/249.61  
% 249.21/249.61  maxselected =       10000000
% 249.21/249.61  maxnrclauses =      10000000
% 249.21/249.61  
% 249.21/249.61  showgenerated =    0
% 249.21/249.61  showkept =         0
% 249.21/249.61  showselected =     0
% 249.21/249.61  showdeleted =      0
% 249.21/249.61  showresimp =       1
% 249.21/249.61  showstatus =       2000
% 249.21/249.61  
% 249.21/249.61  prologoutput =     0
% 249.21/249.61  nrgoals =          5000000
% 249.21/249.61  totalproof =       1
% 249.21/249.61  
% 249.21/249.61  Symbols occurring in the translation:
% 249.21/249.61  
% 249.21/249.61  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 249.21/249.61  .  [1, 2]      (w:1, o:29, a:1, s:1, b:0), 
% 249.21/249.61  !  [4, 1]      (w:0, o:24, a:1, s:1, b:0), 
% 249.21/249.61  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 249.21/249.61  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 249.21/249.61  sum  [37, 2]      (w:1, o:53, a:1, s:1, b:0), 
% 249.21/249.61  n1  [39, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 249.21/249.61  product  [40, 2]      (w:1, o:54, a:1, s:1, b:0), 
% 249.21/249.61  exponent  [41, 2]      (w:1, o:55, a:1, s:1, b:0), 
% 249.21/249.61  skol1  [49, 0]      (w:1, o:17, a:1, s:1, b:1), 
% 249.21/249.61  skol2  [50, 0]      (w:1, o:18, a:1, s:1, b:1), 
% 249.21/249.61  skol3  [51, 0]      (w:1, o:19, a:1, s:1, b:1), 
% 249.21/249.61  skol4  [52, 0]      (w:1, o:20, a:1, s:1, b:1), 
% 249.21/249.61  skol5  [53, 0]      (w:1, o:21, a:1, s:1, b:1), 
% 249.21/249.61  skol6  [54, 0]      (w:1, o:22, a:1, s:1, b:1), 
% 249.21/249.61  skol7  [55, 0]      (w:1, o:23, a:1, s:1, b:1).
% 249.21/249.61  
% 249.21/249.61  
% 249.21/249.61  Starting Search:
% 249.21/249.61  
% 249.21/249.61  *** allocated 15000 integers for clauses
% 249.21/249.61  *** allocated 22500 integers for clauses
% 249.21/249.61  *** allocated 33750 integers for clauses
% 249.21/249.61  *** allocated 50625 integers for clauses
% 249.21/249.61  *** allocated 75937 integers for clauses
% 249.21/249.61  *** allocated 15000 integers for termspace/termends
% 249.21/249.61  *** allocated 113905 integers for clauses
% 249.21/249.61  Resimplifying inuse:
% 249.21/249.61  Done
% 249.21/249.61  
% 249.21/249.61  *** allocated 22500 integers for termspace/termends
% 249.21/249.61  *** allocated 170857 integers for clauses
% 249.21/249.61  *** allocated 33750 integers for termspace/termends
% 249.21/249.61  *** allocated 256285 integers for clauses
% 249.21/249.61  
% 249.21/249.61  Intermediate Status:
% 249.21/249.61  Generated:    18764
% 249.21/249.61  Kept:         2003
% 249.21/249.61  Inuse:        224
% 249.21/249.61  Deleted:      45
% 249.21/249.61  Deletedinuse: 10
% 249.21/249.61  
% 249.21/249.61  Resimplifying inuse:
% 249.21/249.61  Done
% 249.21/249.61  
% 249.21/249.61  *** allocated 50625 integers for termspace/termends
% 249.21/249.61  *** allocated 384427 integers for clauses
% 249.21/249.61  Resimplifying inuse:
% 249.21/249.61  Done
% 249.21/249.61  
% 249.21/249.61  *** allocated 75937 integers for termspace/termends
% 249.21/249.61  *** allocateCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------