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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : ROB013-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n022.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 20:49:28 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : ROB013-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : bliksem %s
% 0.12/0.34  % Computer : n022.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 Jun  9 13:39:19 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.44/1.08  *** allocated 10000 integers for termspace/termends
% 0.44/1.08  *** allocated 10000 integers for clauses
% 0.44/1.08  *** allocated 10000 integers for justifications
% 0.44/1.08  Bliksem 1.12
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  Automatic Strategy Selection
% 0.44/1.08  
% 0.44/1.08  Clauses:
% 0.44/1.08  [
% 0.44/1.08     [ =( add( X, Y ), add( Y, X ) ) ],
% 0.44/1.08     [ =( add( add( X, Y ), Z ), add( X, add( Y, Z ) ) ) ],
% 0.44/1.08     [ =( negate( add( negate( add( X, Y ) ), negate( add( X, negate( Y ) ) )
% 0.44/1.08     ) ), X ) ],
% 0.44/1.08     [ =( negate( add( a, b ) ), c ) ],
% 0.44/1.08     [ ~( =( negate( add( c, negate( add( negate( b ), a ) ) ) ), a ) ) ]
% 0.44/1.08  ] .
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  percentage equality = 1.000000, percentage horn = 1.000000
% 0.44/1.08  This is a pure equality problem
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  Options Used:
% 0.44/1.08  
% 0.44/1.08  useres =            1
% 0.44/1.08  useparamod =        1
% 0.44/1.08  useeqrefl =         1
% 0.44/1.08  useeqfact =         1
% 0.44/1.08  usefactor =         1
% 0.44/1.08  usesimpsplitting =  0
% 0.44/1.08  usesimpdemod =      5
% 0.44/1.08  usesimpres =        3
% 0.44/1.08  
% 0.44/1.08  resimpinuse      =  1000
% 0.44/1.08  resimpclauses =     20000
% 0.44/1.08  substype =          eqrewr
% 0.44/1.08  backwardsubs =      1
% 0.44/1.08  selectoldest =      5
% 0.44/1.08  
% 0.44/1.08  litorderings [0] =  split
% 0.44/1.08  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.44/1.08  
% 0.44/1.08  termordering =      kbo
% 0.44/1.08  
% 0.44/1.08  litapriori =        0
% 0.44/1.08  termapriori =       1
% 0.44/1.08  litaposteriori =    0
% 0.44/1.08  termaposteriori =   0
% 0.44/1.08  demodaposteriori =  0
% 0.44/1.08  ordereqreflfact =   0
% 0.44/1.08  
% 0.44/1.08  litselect =         negord
% 0.44/1.08  
% 0.44/1.08  maxweight =         15
% 0.44/1.08  maxdepth =          30000
% 0.44/1.08  maxlength =         115
% 0.44/1.08  maxnrvars =         195
% 0.44/1.08  excuselevel =       1
% 0.44/1.08  increasemaxweight = 1
% 0.44/1.08  
% 0.44/1.08  maxselected =       10000000
% 0.44/1.08  maxnrclauses =      10000000
% 0.44/1.08  
% 0.44/1.08  showgenerated =    0
% 0.44/1.08  showkept =         0
% 0.44/1.08  showselected =     0
% 0.44/1.08  showdeleted =      0
% 0.44/1.08  showresimp =       1
% 0.44/1.08  showstatus =       2000
% 0.44/1.08  
% 0.44/1.08  prologoutput =     1
% 0.44/1.08  nrgoals =          5000000
% 0.44/1.08  totalproof =       1
% 0.44/1.08  
% 0.44/1.08  Symbols occurring in the translation:
% 0.44/1.08  
% 0.44/1.08  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.44/1.08  .  [1, 2]      (w:1, o:21, a:1, s:1, b:0), 
% 0.44/1.08  !  [4, 1]      (w:0, o:15, a:1, s:1, b:0), 
% 0.44/1.08  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.44/1.08  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.44/1.08  add  [41, 2]      (w:1, o:46, a:1, s:1, b:0), 
% 0.44/1.08  negate  [43, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.44/1.08  a  [44, 0]      (w:1, o:12, a:1, s:1, b:0), 
% 0.44/1.08  b  [45, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 0.44/1.08  c  [46, 0]      (w:1, o:14, a:1, s:1, b:0).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  Starting Search:
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  Bliksems!, er is een bewijs:
% 0.44/1.08  % SZS status Unsatisfiable
% 0.44/1.08  % SZS output start Refutation
% 0.44/1.08  
% 0.44/1.08  clause( 0, [ =( add( X, Y ), add( Y, X ) ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 2, [ =( negate( add( negate( add( X, Y ) ), negate( add( X, negate( 
% 0.44/1.08    Y ) ) ) ) ), X ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 3, [ =( negate( add( a, b ) ), c ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 4, [ ~( =( negate( add( c, negate( add( negate( b ), a ) ) ) ), a )
% 0.44/1.08     ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 7, [ ~( =( negate( add( c, negate( add( a, negate( b ) ) ) ) ), a )
% 0.44/1.08     ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 30, [] )
% 0.44/1.08  .
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  % SZS output end Refutation
% 0.44/1.08  found a proof!
% 0.44/1.08  
% 0.44/1.08  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.08  
% 0.44/1.08  initialclauses(
% 0.44/1.08  [ clause( 32, [ =( add( X, Y ), add( Y, X ) ) ] )
% 0.44/1.08  , clause( 33, [ =( add( add( X, Y ), Z ), add( X, add( Y, Z ) ) ) ] )
% 0.44/1.08  , clause( 34, [ =( negate( add( negate( add( X, Y ) ), negate( add( X, 
% 0.44/1.08    negate( Y ) ) ) ) ), X ) ] )
% 0.44/1.08  , clause( 35, [ =( negate( add( a, b ) ), c ) ] )
% 0.44/1.08  , clause( 36, [ ~( =( negate( add( c, negate( add( negate( b ), a ) ) ) ), 
% 0.44/1.08    a ) ) ] )
% 0.44/1.08  ] ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 0, [ =( add( X, Y ), add( Y, X ) ) ] )
% 0.44/1.08  , clause( 32, [ =( add( X, Y ), add( Y, X ) ) ] )
% 0.44/1.08  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.08     )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 2, [ =( negate( add( negate( add( X, Y ) ), negate( add( X, negate( 
% 0.44/1.08    Y ) ) ) ) ), X ) ] )
% 0.44/1.08  , clause( 34, [ =( negate( add( negate( add( X, Y ) ), negate( add( X, 
% 0.44/1.08    negate( Y ) ) ) ) ), X ) ] )
% 0.44/1.08  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.08     )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 3, [ =( negate( add( a, b ) ), c ) ] )
% 0.44/1.08  , clause( 35, [ =( negate( add( a, b ) ), c ) ] )
% 0.44/1.08  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 4, [ ~( =( negate( add( c, negate( add( negate( b ), a ) ) ) ), a )
% 0.44/1.08     ) ] )
% 0.44/1.08  , clause( 36, [ ~( =( negate( add( c, negate( add( negate( b ), a ) ) ) ), 
% 0.44/1.08    a ) ) ] )
% 0.44/1.08  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  eqswap(
% 0.44/1.08  clause( 46, [ ~( =( a, negate( add( c, negate( add( negate( b ), a ) ) ) )
% 0.44/1.08     ) ) ] )
% 0.44/1.08  , clause( 4, [ ~( =( negate( add( c, negate( add( negate( b ), a ) ) ) ), a
% 0.44/1.08     ) ) ] )
% 0.44/1.08  , 0, substitution( 0, [] )).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  paramod(
% 0.44/1.08  clause( 48, [ ~( =( a, negate( add( c, negate( add( a, negate( b ) ) ) ) )
% 0.44/1.08     ) ) ] )
% 0.44/1.08  , clause( 0, [ =( add( X, Y ), add( Y, X ) ) ] )
% 0.44/1.08  , 0, clause( 46, [ ~( =( a, negate( add( c, negate( add( negate( b ), a ) )
% 0.44/1.08     ) ) ) ) ] )
% 0.44/1.08  , 0, 7, substitution( 0, [ :=( X, negate( b ) ), :=( Y, a )] ), 
% 0.44/1.08    substitution( 1, [] )).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  eqswap(
% 0.44/1.08  clause( 54, [ ~( =( negate( add( c, negate( add( a, negate( b ) ) ) ) ), a
% 0.44/1.08     ) ) ] )
% 0.44/1.08  , clause( 48, [ ~( =( a, negate( add( c, negate( add( a, negate( b ) ) ) )
% 0.44/1.08     ) ) ) ] )
% 0.44/1.08  , 0, substitution( 0, [] )).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 7, [ ~( =( negate( add( c, negate( add( a, negate( b ) ) ) ) ), a )
% 0.44/1.08     ) ] )
% 0.44/1.08  , clause( 54, [ ~( =( negate( add( c, negate( add( a, negate( b ) ) ) ) ), 
% 0.44/1.08    a ) ) ] )
% 0.44/1.08  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  eqswap(
% 0.44/1.08  clause( 56, [ =( X, negate( add( negate( add( X, Y ) ), negate( add( X, 
% 0.44/1.08    negate( Y ) ) ) ) ) ) ] )
% 0.44/1.08  , clause( 2, [ =( negate( add( negate( add( X, Y ) ), negate( add( X, 
% 0.44/1.08    negate( Y ) ) ) ) ), X ) ] )
% 0.44/1.08  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  eqswap(
% 0.44/1.08  clause( 57, [ ~( =( a, negate( add( c, negate( add( a, negate( b ) ) ) ) )
% 0.44/1.08     ) ) ] )
% 0.44/1.08  , clause( 7, [ ~( =( negate( add( c, negate( add( a, negate( b ) ) ) ) ), a
% 0.44/1.08     ) ) ] )
% 0.44/1.08  , 0, substitution( 0, [] )).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  paramod(
% 0.44/1.08  clause( 58, [ =( a, negate( add( c, negate( add( a, negate( b ) ) ) ) ) ) ]
% 0.44/1.08     )
% 0.44/1.08  , clause( 3, [ =( negate( add( a, b ) ), c ) ] )
% 0.44/1.08  , 0, clause( 56, [ =( X, negate( add( negate( add( X, Y ) ), negate( add( X
% 0.44/1.08    , negate( Y ) ) ) ) ) ) ] )
% 0.44/1.08  , 0, 4, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b )] )
% 0.44/1.08    ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  resolution(
% 0.44/1.08  clause( 60, [] )
% 0.44/1.08  , clause( 57, [ ~( =( a, negate( add( c, negate( add( a, negate( b ) ) ) )
% 0.44/1.08     ) ) ) ] )
% 0.44/1.08  , 0, clause( 58, [ =( a, negate( add( c, negate( add( a, negate( b ) ) ) )
% 0.44/1.08     ) ) ] )
% 0.44/1.08  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 30, [] )
% 0.44/1.08  , clause( 60, [] )
% 0.44/1.08  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  end.
% 0.44/1.08  
% 0.44/1.08  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.08  
% 0.44/1.08  Memory use:
% 0.44/1.08  
% 0.44/1.08  space for terms:        513
% 0.44/1.08  space for clauses:      3185
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  clauses generated:      161
% 0.44/1.08  clauses kept:           31
% 0.44/1.08  clauses selected:       11
% 0.44/1.08  clauses deleted:        0
% 0.44/1.08  clauses inuse deleted:  0
% 0.44/1.08  
% 0.44/1.08  subsentry:          215
% 0.44/1.08  literals s-matched: 129
% 0.44/1.08  literals matched:   129
% 0.44/1.08  full subsumption:   0
% 0.44/1.08  
% 0.44/1.08  checksum:           -809000389
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  Bliksem ended
%------------------------------------------------------------------------------