↑ Up

Bliksem---1.12.TMO-Non.f

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : SWX196+1 : TPTP v9.3.0. Released v9.3.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 : Tue May  5 06:56:46 PM UTC 2026

% Result   : Timeout 299.64s 300.03s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWX196+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.13  % Command  : bliksem %s
% 0.17/0.34  % Computer : n015.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit : 300
% 0.17/0.34  % DateTime : Tue May  5 10:59:16 EDT 2026
% 0.17/0.34  % CPUTime  : 
% 6.13/6.59  *** allocated 10000 integers for termspace/termends
% 6.13/6.59  *** allocated 10000 integers for clauses
% 6.13/6.59  *** allocated 10000 integers for justifications
% 6.13/6.59  Bliksem 1.12
% 6.13/6.59  
% 6.13/6.59  
% 6.13/6.59  Automatic Strategy Selection
% 6.13/6.59  
% 6.13/6.59  
% 6.13/6.59  Clauses:
% 6.13/6.59  
% 6.13/6.59  { head( cons( X, Y ) ) = X }.
% 6.13/6.59  { tail( cons( X, Y ) ) = Y }.
% 6.13/6.59  { ! nil = cons( X, Y ) }.
% 6.13/6.59  { proj1Suc( suc( X ) ) = X }.
% 6.13/6.59  { ! zero = suc( X ) }.
% 6.13/6.59  { proj1N( n( X ) ) = X }.
% 6.13/6.59  { proj1Add( add( X, Y ) ) = X }.
% 6.13/6.59  { proj2Add( add( X, Y ) ) = Y }.
% 6.13/6.59  { proj1Mul( mul( X, Y ) ) = X }.
% 6.13/6.59  { proj2Mul( mul( X, Y ) ) = Y }.
% 6.13/6.59  { proj1Eq( eq( X, Y ) ) = X }.
% 6.13/6.59  { proj2Eq( eq( X, Y ) ) = Y }.
% 6.13/6.59  { proj1V( v( X ) ) = X }.
% 6.13/6.59  { ! n( X ) = add( Y, Z ) }.
% 6.13/6.59  { ! n( X ) = mul( Y, Z ) }.
% 6.13/6.59  { ! n( X ) = eq( Y, Z ) }.
% 6.13/6.59  { ! n( X ) = v( Y ) }.
% 6.13/6.59  { ! add( X, Y ) = mul( Z, T ) }.
% 6.13/6.59  { ! add( X, Y ) = eq( Z, T ) }.
% 6.13/6.59  { ! add( X, Y ) = v( Z ) }.
% 6.13/6.59  { ! mul( X, Y ) = eq( Z, T ) }.
% 6.13/6.59  { ! mul( X, Y ) = v( Z ) }.
% 6.13/6.59  { ! eq( X, Y ) = v( Z ) }.
% 6.13/6.59  { ! X = Y, fail1( X, Y ) = mul( n( suc( suc( zero ) ) ), X ) }.
% 6.13/6.59  { X = Y, X = add( proj1Add( X ), proj2Add( X ) ), fail1( X, Y ) = add( X, Y
% 6.13/6.59     ) }.
% 6.13/6.59  { add( Y, Z ) = X, fail1( add( Y, Z ), X ) = add( Y, add( Z, X ) ) }.
% 6.13/6.59  { X = n( proj1N( X ) ), fail( Y, X ) = fail1( Y, X ) }.
% 6.13/6.59  { fail( X, n( zero ) ) = X }.
% 6.13/6.59  { fail( X, n( suc( Y ) ) ) = fail1( X, n( suc( Y ) ) ) }.
% 6.13/6.59  { X = mul( proj1Mul( X ), proj2Mul( X ) ), fail3( X, Y ) = mul( X, Y ) }.
% 6.13/6.59  { fail3( mul( Y, Z ), X ) = mul( Y, mul( Z, X ) ) }.
% 6.13/6.59  { X = n( proj1N( X ) ), fail22( Y, X ) = fail3( Y, X ) }.
% 6.13/6.59  { fail22( X, n( zero ) ) = fail3( X, n( zero ) ) }.
% 6.13/6.59  { fail22( X, n( suc( zero ) ) ) = X }.
% 6.13/6.59  { fail22( X, n( suc( suc( Y ) ) ) ) = fail3( X, n( suc( suc( Y ) ) ) ) }.
% 6.13/6.59  { X = n( proj1N( X ) ), fail12( X, Y ) = fail22( X, Y ) }.
% 6.13/6.59  { fail12( n( zero ), X ) = fail22( n( zero ), X ) }.
% 6.13/6.59  { fail12( n( suc( zero ) ), X ) = X }.
% 6.13/6.59  { fail12( n( suc( suc( Y ) ) ), X ) = fail22( n( suc( suc( Y ) ) ), X ) }.
% 6.13/6.59  { X = n( proj1N( X ) ), fail2( Y, X ) = fail12( Y, X ) }.
% 6.13/6.59  { fail2( X, n( zero ) ) = n( zero ) }.
% 6.13/6.59  { fail2( X, n( suc( Y ) ) ) = fail12( X, n( suc( Y ) ) ) }.
% 6.13/6.59  { X = add( proj1Add( X ), proj2Add( X ) ), X = mul( proj1Mul( X ), proj2Mul
% 6.13/6.59    ( X ) ), X = eq( proj1Eq( X ), proj2Eq( X ) ), step4( X ) = X }.
% 6.13/6.59  { X = n( proj1N( X ) ), step4( add( X, Y ) ) = fail( X, Y ) }.
% 6.13/6.59  { step4( add( n( zero ), X ) ) = X }.
% 6.13/6.59  { step4( add( n( suc( Y ) ), X ) ) = fail( n( suc( Y ) ), X ) }.
% 6.13/6.59  { X = n( proj1N( X ) ), step4( mul( X, Y ) ) = fail2( X, Y ) }.
% 6.13/6.59  { step4( mul( n( zero ), X ) ) = n( zero ) }.
% 6.13/6.59  { step4( mul( n( suc( Y ) ), X ) ) = fail2( n( suc( Y ) ), X ) }.
% 6.13/6.59  { ! X = Y, step4( eq( X, Y ) ) = n( suc( zero ) ) }.
% 6.13/6.59  { X = Y, step4( eq( X, Y ) ) = eq( X, Y ) }.
% 6.13/6.59  { X = add( proj1Add( X ), proj2Add( X ) ), X = mul( proj1Mul( X ), proj2Mul
% 6.13/6.59    ( X ) ), X = eq( proj1Eq( X ), proj2Eq( X ) ), simp4( X ) = step4( X ) }
% 6.13/6.59    .
% 6.13/6.59  { simp4( add( X, Y ) ) = step4( add( simp4( X ), simp4( Y ) ) ) }.
% 6.13/6.59  { simp4( mul( X, Y ) ) = step4( mul( simp4( X ), simp4( Y ) ) ) }.
% 6.13/6.59  { simp4( eq( X, Y ) ) = step4( eq( simp4( X ), simp4( Y ) ) ) }.
% 6.13/6.59  { fetch( nil, X ) = zero }.
% 6.13/6.59  { fetch( cons( X, Y ), zero ) = X }.
% 6.13/6.59  { fetch( cons( X, Y ), suc( Z ) ) = fetch( Y, Z ) }.
% 6.13/6.59  { addNat( zero, X ) = X }.
% 6.13/6.59  { addNat( suc( Y ), X ) = suc( addNat( Y, X ) ) }.
% 6.13/6.59  { mulNat( zero, X ) = zero }.
% 6.13/6.59  { mulNat( suc( Y ), X ) = addNat( X, mulNat( Y, X ) ) }.
% 6.13/6.59  { eval( X, n( Y ) ) = Y }.
% 6.13/6.59  { eval( X, add( Y, Z ) ) = addNat( eval( X, Y ), eval( X, Z ) ) }.
% 6.13/6.59  { eval( X, mul( Y, Z ) ) = mulNat( eval( X, Y ), eval( X, Z ) ) }.
% 6.13/6.59  { ! eval( X, Y ) = eval( X, Z ), eval( X, eq( Y, Z ) ) = suc( zero ) }.
% 6.13/6.59  { eval( X, Y ) = eval( X, Z ), eval( X, eq( Y, Z ) ) = zero }.
% 6.13/6.59  { eval( X, v( Y ) ) = fetch( X, Y ) }.
% 6.13/6.59  { eval( X, Y ) = eval( X, simp4( Y ) ) }.
% 6.13/6.59  
% 6.13/6.59  percentage equality = 1.000000, percentage horn = 0.811594
% 6.13/6.59  This is a pure equality problem
% 6.13/6.59  
% 6.13/6.59  
% 6.13/6.59  
% 6.13/6.59  Options Used:
% 6.13/6.59  
% 6.13/6.59  useres =            1
% 6.13/6.59  useparamod =        1
% 6.13/6.59  useeqrefl =         1
% 6.13/6.59  useeqfact =         1
% 6.13/6.59  usefactor =         1
% 6.13/6.59  usesimpsplitting =  0
% 6.13/6.59  usesimpdemod =      5
% 6.13/6.59  usesimpres =        3
% 6.13/6.59  
% 6.13/6.59  resimpinuse      =  1000
% 6.13/6.59  resimpclauses =     20000
% 6.13/6.59  substype =          eqrewr
% 6.13/6.59  backwardsubs =      1
% 6.13/6.59  selectoldest =      5
% 6.13/6.59  
% 6.13/6.59  litorderings [0] =  split
% 6.13/6.59  litorderings [1] =  extend the termordering, first sorting on arguments
% 6.13/6.59  
% 6.13/6.59  termordering =      kbo
% 6.13/6.59  
% 6.13/6.59  litapriori =        0
% 281.74/282.17  termapriori =       1
% 281.74/282.17  litaposteriori =    0
% 281.74/282.17  termaposteriori =   0
% 281.74/282.17  demodaposteriori =  0
% 281.74/282.17  ordereqreflfact =   0
% 281.74/282.17  
% 281.74/282.17  litselect =         negord
% 281.74/282.17  
% 281.74/282.17  maxweight =         15
% 281.74/282.17  maxdepth =          30000
% 281.74/282.17  maxlength =         115
% 281.74/282.17  maxnrvars =         195
% 281.74/282.17  excuselevel =       1
% 281.74/282.17  increasemaxweight = 1
% 281.74/282.17  
% 281.74/282.17  maxselected =       10000000
% 281.74/282.17  maxnrclauses =      10000000
% 281.74/282.17  
% 281.74/282.17  showgenerated =    0
% 281.74/282.17  showkept =         0
% 281.74/282.17  showselected =     0
% 281.74/282.17  showdeleted =      0
% 281.74/282.17  showresimp =       1
% 281.74/282.17  showstatus =       2000
% 281.74/282.17  
% 281.74/282.17  prologoutput =     0
% 281.74/282.17  nrgoals =          5000000
% 281.74/282.17  totalproof =       1
% 281.74/282.17  
% 281.74/282.17  Symbols occurring in the translation:
% 281.74/282.17  
% 281.74/282.17  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 281.74/282.17  .  [1, 2]      (w:1, o:51, a:1, s:1, b:0), 
% 281.74/282.17  !  [4, 1]      (w:0, o:30, a:1, s:1, b:0), 
% 281.74/282.17  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 281.74/282.17  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 281.74/282.17  cons  [37, 2]      (w:1, o:75, a:1, s:1, b:0), 
% 281.74/282.17  head  [38, 1]      (w:1, o:35, a:1, s:1, b:0), 
% 281.74/282.17  tail  [39, 1]      (w:1, o:39, a:1, s:1, b:0), 
% 281.74/282.17  nil  [40, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 281.74/282.17  suc  [41, 1]      (w:1, o:37, a:1, s:1, b:0), 
% 281.74/282.17  proj1Suc  [42, 1]      (w:1, o:40, a:1, s:1, b:0), 
% 281.74/282.17  zero  [43, 0]      (w:1, o:12, a:1, s:1, b:0), 
% 281.74/282.17  n  [44, 1]      (w:1, o:41, a:1, s:1, b:0), 
% 281.74/282.17  proj1N  [45, 1]      (w:1, o:43, a:1, s:1, b:0), 
% 281.74/282.17  add  [46, 2]      (w:1, o:76, a:1, s:1, b:0), 
% 281.74/282.17  proj1Add  [47, 1]      (w:1, o:44, a:1, s:1, b:0), 
% 281.74/282.17  proj2Add  [48, 1]      (w:1, o:47, a:1, s:1, b:0), 
% 281.74/282.17  mul  [49, 2]      (w:1, o:77, a:1, s:1, b:0), 
% 281.74/282.17  proj1Mul  [50, 1]      (w:1, o:42, a:1, s:1, b:0), 
% 281.74/282.17  proj2Mul  [51, 1]      (w:1, o:48, a:1, s:1, b:0), 
% 281.74/282.17  eq  [52, 2]      (w:1, o:78, a:1, s:1, b:0), 
% 281.74/282.17  proj1Eq  [53, 1]      (w:1, o:45, a:1, s:1, b:0), 
% 281.74/282.17  proj2Eq  [54, 1]      (w:1, o:49, a:1, s:1, b:0), 
% 281.74/282.17  v  [55, 1]      (w:1, o:50, a:1, s:1, b:0), 
% 281.74/282.17  proj1V  [56, 1]      (w:1, o:46, a:1, s:1, b:0), 
% 281.74/282.17  fail1  [61, 2]      (w:1, o:80, a:1, s:1, b:0), 
% 281.74/282.17  fail  [64, 2]      (w:1, o:81, a:1, s:1, b:0), 
% 281.74/282.17  fail3  [67, 2]      (w:1, o:85, a:1, s:1, b:0), 
% 281.74/282.17  fail22  [70, 2]      (w:1, o:83, a:1, s:1, b:0), 
% 281.74/282.17  fail12  [72, 2]      (w:1, o:82, a:1, s:1, b:0), 
% 281.74/282.17  fail2  [74, 2]      (w:1, o:84, a:1, s:1, b:0), 
% 281.74/282.17  step4  [76, 1]      (w:1, o:36, a:1, s:1, b:0), 
% 281.74/282.17  simp4  [80, 1]      (w:1, o:38, a:1, s:1, b:0), 
% 281.74/282.17  fetch  [82, 2]      (w:1, o:86, a:1, s:1, b:0), 
% 281.74/282.17  addNat  [86, 2]      (w:1, o:87, a:1, s:1, b:0), 
% 281.74/282.17  mulNat  [87, 2]      (w:1, o:88, a:1, s:1, b:0), 
% 281.74/282.17  eval  [88, 2]      (w:1, o:79, a:1, s:1, b:0).
% 281.74/282.17  
% 281.74/282.17  
% 281.74/282.17  Starting Search:
% 281.74/282.17  
% 281.74/282.17  *** allocated 15000 integers for clauses
% 281.74/282.17  *** allocated 22500 integers for clauses
% 281.74/282.17  *** allocated 33750 integers for clauses
% 281.74/282.17  *** allocated 15000 integers for termspace/termends
% 281.74/282.17  *** allocated 50625 integers for clauses
% 281.74/282.17  *** allocated 75937 integers for clauses
% 281.74/282.17  *** allocated 22500 integers for termspace/termends
% 281.74/282.17  Resimplifying inuse:
% 281.74/282.17  Done
% 281.74/282.17  
% 281.74/282.17  *** allocated 113905 integers for clauses
% 281.74/282.17  *** allocated 33750 integers for termspace/termends
% 281.74/282.17  *** allocated 170857 integers for clauses
% 281.74/282.17  *** allocated 50625 integers for termspace/termends
% 281.74/282.17  
% 281.74/282.17  Intermediate Status:
% 281.74/282.17  Generated:    65471
% 281.74/282.17  Kept:         2004
% 281.74/282.17  Inuse:        338
% 281.74/282.17  Deleted:      10
% 281.74/282.17  Deletedinuse: 1
% 281.74/282.17  
% 281.74/282.17  Resimplifying inuse:
% 281.74/282.17  Done
% 281.74/282.17  
% 281.74/282.17  *** allocated 256285 integers for clauses
% 281.74/282.17  *** allocated 75937 integers for termspace/termends
% 281.74/282.17  Resimplifying inuse:
% 281.74/282.17  Done
% 281.74/282.17  
% 281.74/282.17  *** allocated 384427 integers for clauses
% 281.74/282.17  *** allocated 113905 integers for termspace/termends
% 281.74/282.17  
% 281.74/282.17  Intermediate Status:
% 281.74/282.17  Generated:    323148
% 281.74/282.17  Kept:         4769
% 281.74/282.17  Inuse:        621
% 281.74/282.17  Deleted:      31
% 281.74/282.17  Deletedinuse: 4
% 281.74/282.17  
% 281.74/282.17  Resimplifying inuse:
% 281.74/282.17  Done
% 281.74/282.17  
% 281.74/282.17  Resimplifying inuse:
% 281.74/282.17  Done
% 281.74/282.17  
% 281.74/282.17  
% 281.74/282.17  Intermediate Status:
% 281.74/282.17  Generated:    394684
% 281.74/282.17  Kept:         6784
% 281.74/282.17  Inuse:        694
% 281.74/282.17  Deleted:      43
% 281.74/282.17  Deletedinuse: 14
% 281.74/282.17  
% 281.74/282.17  *** allocated 170857 integers for termspace/termends
% 281.74/282.17  *** allocated 576640 integers for clauses
% 281.74/282.17  Resimplifying inuse:
% 281.74/282.17  Done
% 281.74/282.17  
% 281.74/282.17  Resimplifying inuse:
% 281.74/282.17  Done
% 281.74/282.17  
% 281.74/282.17  
% 281.74/282.17  Intermediate Status:
% 281.74/282.17  Generated:    490264
% 281.74/282.17  Kept:         8789
% 281.74/282.17  Inuse:        773
% 281.74/282.17  Deleted:      44
% 281.74/282.17  Deletedinuse: 14
% 281.74/282.17  
% 281.74/282.17  Resimplifying inuse:
% 281.74/282.17  Done
% 281.74/282.17  
% 281.74/282.17  Resimplifying inuse:
% 281.74/282.17  Done
% 281.74/282.17  
% 281.74/282.17  *** allocated 256285 integers for termspace/termends
% 281.74/282.17  
% 281.74/282.17  Intermediate Status:
% 281.74/282.17  Generated:    630785
% 281.74/282.17  Kept:         10820
% 281.74/282.17  Inuse:        858
% 281.74/282.17  Deleted:      51
% 281.74/282.17  Deletedinuse: 19
% 281.74/282.17  
% 281.74/282.17  *** allocated 864960 integers for clauTerminated 
% 299.64/300.03  Bliksem ended
%------------------------------------------------------------------------------