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

View Problem - Process Solution

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

% Computer : n008.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:19:19 EDT 2022

% Result   : Unsatisfiable 0.44s 1.07s
% Output   : Refutation 0.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM020-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.11/0.13  % Command  : bliksem %s
% 0.12/0.34  % Computer : n008.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % DateTime : Thu Jul  7 21:38:38 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.44/1.07  *** allocated 10000 integers for termspace/termends
% 0.44/1.07  *** allocated 10000 integers for clauses
% 0.44/1.07  *** allocated 10000 integers for justifications
% 0.44/1.07  Bliksem 1.12
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  Automatic Strategy Selection
% 0.44/1.07  
% 0.44/1.07  Clauses:
% 0.44/1.07  [
% 0.44/1.07     [ equalish( add( X, n0 ), X ) ],
% 0.44/1.07     [ equalish( add( X, successor( Y ) ), successor( add( X, Y ) ) ) ],
% 0.44/1.07     [ equalish( multiply( X, n0 ), n0 ) ],
% 0.44/1.07     [ equalish( multiply( X, successor( Y ) ), add( multiply( X, Y ), X ) )
% 0.44/1.07     ],
% 0.44/1.07     [ ~( equalish( successor( X ), successor( Y ) ) ), equalish( X, Y ) ]
% 0.44/1.07    ,
% 0.44/1.07     [ ~( equalish( X, Y ) ), equalish( successor( X ), successor( Y ) ) ]
% 0.44/1.07    ,
% 0.44/1.07     [ equalish( X, X ) ],
% 0.44/1.07     [ ~( equalish( X, Y ) ), equalish( Y, X ) ],
% 0.44/1.07     [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X, Z ) ],
% 0.44/1.07     [ equalish( n1, successor( n0 ) ) ],
% 0.44/1.07     [ ~( equalish( add( a, successor( n0 ) ), successor( a ) ) ) ],
% 0.44/1.07     [ ~( equalish( successor( X ), n0 ) ) ]
% 0.44/1.07  ] .
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  percentage equality = 0.000000, percentage horn = 1.000000
% 0.44/1.07  This is a near-Horn, non-equality  problem
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  Options Used:
% 0.44/1.07  
% 0.44/1.07  useres =            1
% 0.44/1.07  useparamod =        0
% 0.44/1.07  useeqrefl =         0
% 0.44/1.07  useeqfact =         0
% 0.44/1.07  usefactor =         1
% 0.44/1.07  usesimpsplitting =  0
% 0.44/1.07  usesimpdemod =      0
% 0.44/1.07  usesimpres =        4
% 0.44/1.07  
% 0.44/1.07  resimpinuse      =  1000
% 0.44/1.07  resimpclauses =     20000
% 0.44/1.07  substype =          standard
% 0.44/1.07  backwardsubs =      1
% 0.44/1.07  selectoldest =      5
% 0.44/1.07  
% 0.44/1.07  litorderings [0] =  split
% 0.44/1.07  litorderings [1] =  liftord
% 0.44/1.07  
% 0.44/1.07  termordering =      none
% 0.44/1.07  
% 0.44/1.07  litapriori =        1
% 0.44/1.07  termapriori =       0
% 0.44/1.07  litaposteriori =    0
% 0.44/1.07  termaposteriori =   0
% 0.44/1.07  demodaposteriori =  0
% 0.44/1.07  ordereqreflfact =   0
% 0.44/1.07  
% 0.44/1.07  litselect =         negative
% 0.44/1.07  
% 0.44/1.07  maxweight =         30000
% 0.44/1.07  maxdepth =          30000
% 0.44/1.07  maxlength =         115
% 0.44/1.07  maxnrvars =         195
% 0.44/1.07  excuselevel =       0
% 0.44/1.07  increasemaxweight = 0
% 0.44/1.07  
% 0.44/1.07  maxselected =       10000000
% 0.44/1.07  maxnrclauses =      10000000
% 0.44/1.07  
% 0.44/1.07  showgenerated =    0
% 0.44/1.07  showkept =         0
% 0.44/1.07  showselected =     0
% 0.44/1.07  showdeleted =      0
% 0.44/1.07  showresimp =       1
% 0.44/1.07  showstatus =       2000
% 0.44/1.07  
% 0.44/1.07  prologoutput =     1
% 0.44/1.07  nrgoals =          5000000
% 0.44/1.07  totalproof =       1
% 0.44/1.07  
% 0.44/1.07  Symbols occurring in the translation:
% 0.44/1.07  
% 0.44/1.07  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.44/1.07  .  [1, 2]      (w:1, o:23, a:1, s:1, b:0), 
% 0.44/1.07  !  [4, 1]      (w:1, o:17, a:1, s:1, b:0), 
% 0.44/1.07  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.44/1.07  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.44/1.07  n0  [40, 0]      (w:1, o:10, a:1, s:1, b:0), 
% 0.44/1.07  add  [41, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.44/1.07  equalish  [42, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.44/1.07  successor  [44, 1]      (w:1, o:22, a:1, s:1, b:0), 
% 0.44/1.07  multiply  [45, 2]      (w:1, o:50, a:1, s:1, b:0), 
% 0.44/1.07  n1  [49, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 0.44/1.07  a  [50, 0]      (w:1, o:16, a:1, s:1, b:0).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  Starting Search:
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  Bliksems!, er is een bewijs:
% 0.44/1.07  % SZS status Unsatisfiable
% 0.44/1.07  % SZS output start Refutation
% 0.44/1.07  
% 0.44/1.07  clause( 0, [ equalish( add( X, n0 ), X ) ] )
% 0.44/1.07  .
% 0.44/1.07  clause( 1, [ equalish( add( X, successor( Y ) ), successor( add( X, Y ) ) )
% 0.44/1.07     ] )
% 0.44/1.07  .
% 0.44/1.07  clause( 5, [ equalish( successor( X ), successor( Y ) ), ~( equalish( X, Y
% 0.44/1.07     ) ) ] )
% 0.44/1.07  .
% 0.44/1.07  clause( 8, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z ) )
% 0.44/1.07     ] )
% 0.44/1.07  .
% 0.44/1.07  clause( 10, [ ~( equalish( add( a, successor( n0 ) ), successor( a ) ) ) ]
% 0.44/1.07     )
% 0.44/1.07  .
% 0.44/1.07  clause( 22, [ equalish( successor( add( X, n0 ) ), successor( X ) ) ] )
% 0.44/1.07  .
% 0.44/1.07  clause( 32, [ equalish( X, successor( Y ) ), ~( equalish( X, successor( add( 
% 0.44/1.07    Y, n0 ) ) ) ) ] )
% 0.44/1.07  .
% 0.44/1.07  clause( 211, [ equalish( add( X, successor( n0 ) ), successor( X ) ) ] )
% 0.44/1.07  .
% 0.44/1.07  clause( 219, [] )
% 0.44/1.07  .
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  % SZS output end Refutation
% 0.44/1.07  found a proof!
% 0.44/1.07  
% 0.44/1.07  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.07  
% 0.44/1.07  initialclauses(
% 0.44/1.07  [ clause( 221, [ equalish( add( X, n0 ), X ) ] )
% 0.44/1.07  , clause( 222, [ equalish( add( X, successor( Y ) ), successor( add( X, Y )
% 0.44/1.07     ) ) ] )
% 0.44/1.07  , clause( 223, [ equalish( multiply( X, n0 ), n0 ) ] )
% 0.44/1.07  , clause( 224, [ equalish( multiply( X, successor( Y ) ), add( multiply( X
% 0.44/1.07    , Y ), X ) ) ] )
% 0.44/1.07  , clause( 225, [ ~( equalish( successor( X ), successor( Y ) ) ), equalish( 
% 0.44/1.07    X, Y ) ] )
% 0.44/1.07  , clause( 226, [ ~( equalish( X, Y ) ), equalish( successor( X ), successor( 
% 0.44/1.07    Y ) ) ] )
% 0.44/1.07  , clause( 227, [ equalish( X, X ) ] )
% 0.44/1.07  , clause( 228, [ ~( equalish( X, Y ) ), equalish( Y, X ) ] )
% 0.44/1.07  , clause( 229, [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X
% 0.44/1.07    , Z ) ] )
% 0.44/1.07  , clause( 230, [ equalish( n1, successor( n0 ) ) ] )
% 0.44/1.07  , clause( 231, [ ~( equalish( add( a, successor( n0 ) ), successor( a ) ) )
% 0.44/1.07     ] )
% 0.44/1.07  , clause( 232, [ ~( equalish( successor( X ), n0 ) ) ] )
% 0.44/1.07  ] ).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  subsumption(
% 0.44/1.07  clause( 0, [ equalish( add( X, n0 ), X ) ] )
% 0.44/1.07  , clause( 221, [ equalish( add( X, n0 ), X ) ] )
% 0.44/1.07  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  subsumption(
% 0.44/1.07  clause( 1, [ equalish( add( X, successor( Y ) ), successor( add( X, Y ) ) )
% 0.44/1.07     ] )
% 0.44/1.07  , clause( 222, [ equalish( add( X, successor( Y ) ), successor( add( X, Y )
% 0.44/1.07     ) ) ] )
% 0.44/1.07  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.07     )] ) ).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  subsumption(
% 0.44/1.07  clause( 5, [ equalish( successor( X ), successor( Y ) ), ~( equalish( X, Y
% 0.44/1.07     ) ) ] )
% 0.44/1.07  , clause( 226, [ ~( equalish( X, Y ) ), equalish( successor( X ), successor( 
% 0.44/1.07    Y ) ) ] )
% 0.44/1.07  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.44/1.07     ), ==>( 1, 0 )] ) ).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  subsumption(
% 0.44/1.07  clause( 8, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z ) )
% 0.44/1.07     ] )
% 0.44/1.07  , clause( 229, [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X
% 0.44/1.07    , Z ) ] )
% 0.44/1.07  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.44/1.07    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  subsumption(
% 0.44/1.07  clause( 10, [ ~( equalish( add( a, successor( n0 ) ), successor( a ) ) ) ]
% 0.44/1.07     )
% 0.44/1.07  , clause( 231, [ ~( equalish( add( a, successor( n0 ) ), successor( a ) ) )
% 0.44/1.07     ] )
% 0.44/1.07  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  resolution(
% 0.44/1.07  clause( 235, [ equalish( successor( add( X, n0 ) ), successor( X ) ) ] )
% 0.44/1.07  , clause( 5, [ equalish( successor( X ), successor( Y ) ), ~( equalish( X, 
% 0.44/1.07    Y ) ) ] )
% 0.44/1.07  , 1, clause( 0, [ equalish( add( X, n0 ), X ) ] )
% 0.44/1.07  , 0, substitution( 0, [ :=( X, add( X, n0 ) ), :=( Y, X )] ), 
% 0.44/1.07    substitution( 1, [ :=( X, X )] )).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  subsumption(
% 0.44/1.07  clause( 22, [ equalish( successor( add( X, n0 ) ), successor( X ) ) ] )
% 0.44/1.07  , clause( 235, [ equalish( successor( add( X, n0 ) ), successor( X ) ) ] )
% 0.44/1.07  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  resolution(
% 0.44/1.07  clause( 237, [ ~( equalish( X, successor( add( Y, n0 ) ) ) ), equalish( X, 
% 0.44/1.07    successor( Y ) ) ] )
% 0.44/1.07  , clause( 8, [ ~( equalish( X, Y ) ), equalish( X, Z ), ~( equalish( Y, Z )
% 0.44/1.07     ) ] )
% 0.44/1.07  , 2, clause( 22, [ equalish( successor( add( X, n0 ) ), successor( X ) ) ]
% 0.44/1.07     )
% 0.44/1.07  , 0, substitution( 0, [ :=( X, X ), :=( Y, successor( add( Y, n0 ) ) ), 
% 0.44/1.07    :=( Z, successor( Y ) )] ), substitution( 1, [ :=( X, Y )] )).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  subsumption(
% 0.44/1.07  clause( 32, [ equalish( X, successor( Y ) ), ~( equalish( X, successor( add( 
% 0.44/1.07    Y, n0 ) ) ) ) ] )
% 0.44/1.07  , clause( 237, [ ~( equalish( X, successor( add( Y, n0 ) ) ) ), equalish( X
% 0.44/1.07    , successor( Y ) ) ] )
% 0.44/1.07  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.44/1.07     ), ==>( 1, 0 )] ) ).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  resolution(
% 0.44/1.07  clause( 238, [ equalish( add( X, successor( n0 ) ), successor( X ) ) ] )
% 0.44/1.07  , clause( 32, [ equalish( X, successor( Y ) ), ~( equalish( X, successor( 
% 0.44/1.07    add( Y, n0 ) ) ) ) ] )
% 0.44/1.07  , 1, clause( 1, [ equalish( add( X, successor( Y ) ), successor( add( X, Y
% 0.44/1.07     ) ) ) ] )
% 0.44/1.07  , 0, substitution( 0, [ :=( X, add( X, successor( n0 ) ) ), :=( Y, X )] ), 
% 0.44/1.07    substitution( 1, [ :=( X, X ), :=( Y, n0 )] )).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  subsumption(
% 0.44/1.07  clause( 211, [ equalish( add( X, successor( n0 ) ), successor( X ) ) ] )
% 0.44/1.07  , clause( 238, [ equalish( add( X, successor( n0 ) ), successor( X ) ) ] )
% 0.44/1.07  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  resolution(
% 0.44/1.07  clause( 239, [] )
% 0.44/1.07  , clause( 10, [ ~( equalish( add( a, successor( n0 ) ), successor( a ) ) )
% 0.44/1.07     ] )
% 0.44/1.07  , 0, clause( 211, [ equalish( add( X, successor( n0 ) ), successor( X ) ) ]
% 0.44/1.07     )
% 0.44/1.07  , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  subsumption(
% 0.44/1.07  clause( 219, [] )
% 0.44/1.07  , clause( 239, [] )
% 0.44/1.07  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  end.
% 0.44/1.07  
% 0.44/1.07  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.07  
% 0.44/1.07  Memory use:
% 0.44/1.07  
% 0.44/1.07  space for terms:        2331
% 0.44/1.07  space for clauses:      14749
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  clauses generated:      317
% 0.44/1.07  clauses kept:           220
% 0.44/1.07  clauses selected:       72
% 0.44/1.07  clauses deleted:        0
% 0.44/1.07  clauses inuse deleted:  0
% 0.44/1.07  
% 0.44/1.07  subsentry:          264
% 0.44/1.07  literals s-matched: 195
% 0.44/1.07  literals matched:   195
% 0.44/1.07  full subsumption:   4
% 0.44/1.07  
% 0.44/1.07  checksum:           -347769503
% 0.44/1.07  
% 0.44/1.07  
% 0.44/1.07  Bliksem ended
%------------------------------------------------------------------------------