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

View Problem - Process Solution

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

% Computer : n028.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:30 EDT 2022

% Result   : Unsatisfiable 1.77s 2.19s
% Output   : Refutation 1.77s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : ROB021-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : bliksem %s
% 0.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % DateTime : Thu Jun  9 15:01:02 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 1.77/2.19  *** allocated 10000 integers for termspace/termends
% 1.77/2.19  *** allocated 10000 integers for clauses
% 1.77/2.19  *** allocated 10000 integers for justifications
% 1.77/2.19  Bliksem 1.12
% 1.77/2.19  
% 1.77/2.19  
% 1.77/2.19  Automatic Strategy Selection
% 1.77/2.19  
% 1.77/2.19  Clauses:
% 1.77/2.19  [
% 1.77/2.19     [ =( add( X, Y ), add( Y, X ) ) ],
% 1.77/2.19     [ =( add( add( X, Y ), Z ), add( X, add( Y, Z ) ) ) ],
% 1.77/2.19     [ =( negate( add( negate( add( X, Y ) ), negate( add( X, negate( Y ) ) )
% 1.77/2.19     ) ), X ) ],
% 1.77/2.19     [ ~( =( negate( X ), negate( Y ) ) ), =( X, Y ) ],
% 1.77/2.19     [ ~( =( add( negate( add( a, negate( b ) ) ), negate( add( negate( a ), 
% 1.77/2.19    negate( b ) ) ) ), b ) ) ]
% 1.77/2.19  ] .
% 1.77/2.19  
% 1.77/2.19  
% 1.77/2.19  percentage equality = 1.000000, percentage horn = 1.000000
% 1.77/2.19  This is a pure equality problem
% 1.77/2.19  
% 1.77/2.19  
% 1.77/2.19  
% 1.77/2.19  Options Used:
% 1.77/2.19  
% 1.77/2.19  useres =            1
% 1.77/2.19  useparamod =        1
% 1.77/2.19  useeqrefl =         1
% 1.77/2.19  useeqfact =         1
% 1.77/2.19  usefactor =         1
% 1.77/2.19  usesimpsplitting =  0
% 1.77/2.19  usesimpdemod =      5
% 1.77/2.19  usesimpres =        3
% 1.77/2.19  
% 1.77/2.19  resimpinuse      =  1000
% 1.77/2.19  resimpclauses =     20000
% 1.77/2.19  substype =          eqrewr
% 1.77/2.19  backwardsubs =      1
% 1.77/2.19  selectoldest =      5
% 1.77/2.19  
% 1.77/2.19  litorderings [0] =  split
% 1.77/2.19  litorderings [1] =  extend the termordering, first sorting on arguments
% 1.77/2.19  
% 1.77/2.19  termordering =      kbo
% 1.77/2.19  
% 1.77/2.19  litapriori =        0
% 1.77/2.19  termapriori =       1
% 1.77/2.19  litaposteriori =    0
% 1.77/2.19  termaposteriori =   0
% 1.77/2.19  demodaposteriori =  0
% 1.77/2.19  ordereqreflfact =   0
% 1.77/2.19  
% 1.77/2.19  litselect =         negord
% 1.77/2.19  
% 1.77/2.19  maxweight =         15
% 1.77/2.19  maxdepth =          30000
% 1.77/2.19  maxlength =         115
% 1.77/2.19  maxnrvars =         195
% 1.77/2.19  excuselevel =       1
% 1.77/2.19  increasemaxweight = 1
% 1.77/2.19  
% 1.77/2.19  maxselected =       10000000
% 1.77/2.19  maxnrclauses =      10000000
% 1.77/2.19  
% 1.77/2.19  showgenerated =    0
% 1.77/2.19  showkept =         0
% 1.77/2.19  showselected =     0
% 1.77/2.19  showdeleted =      0
% 1.77/2.19  showresimp =       1
% 1.77/2.19  showstatus =       2000
% 1.77/2.19  
% 1.77/2.19  prologoutput =     1
% 1.77/2.19  nrgoals =          5000000
% 1.77/2.19  totalproof =       1
% 1.77/2.19  
% 1.77/2.19  Symbols occurring in the translation:
% 1.77/2.19  
% 1.77/2.19  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 1.77/2.19  .  [1, 2]      (w:1, o:20, a:1, s:1, b:0), 
% 1.77/2.19  !  [4, 1]      (w:0, o:14, a:1, s:1, b:0), 
% 1.77/2.19  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 1.77/2.19  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 1.77/2.19  add  [41, 2]      (w:1, o:45, a:1, s:1, b:0), 
% 1.77/2.19  negate  [43, 1]      (w:1, o:19, a:1, s:1, b:0), 
% 1.77/2.19  a  [44, 0]      (w:1, o:12, a:1, s:1, b:0), 
% 1.77/2.19  b  [45, 0]      (w:1, o:13, a:1, s:1, b:0).
% 1.77/2.19  
% 1.77/2.19  
% 1.77/2.19  Starting Search:
% 1.77/2.19  
% 1.77/2.19  
% 1.77/2.19  Bliksems!, er is een bewijs:
% 1.77/2.19  % SZS status Unsatisfiable
% 1.77/2.19  % SZS output start Refutation
% 1.77/2.19  
% 1.77/2.19  clause( 0, [ =( add( X, Y ), add( Y, X ) ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 2, [ =( negate( add( negate( add( X, Y ) ), negate( add( X, negate( 
% 1.77/2.19    Y ) ) ) ) ), X ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 3, [ ~( =( negate( X ), negate( Y ) ) ), =( X, Y ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 4, [ ~( =( add( negate( add( a, negate( b ) ) ), negate( add( 
% 1.77/2.19    negate( a ), negate( b ) ) ) ), b ) ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 31, [ =( negate( Z ), X ), ~( =( X, negate( Z ) ) ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 37, [ =( negate( add( negate( add( X, negate( Y ) ) ), negate( add( 
% 1.77/2.19    X, Y ) ) ) ), X ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 44, [ ~( =( Y, negate( Z ) ) ), =( X, Z ), ~( =( Y, negate( X ) ) )
% 1.77/2.19     ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 78, [ =( negate( Z ), X ), ~( =( T, negate( Z ) ) ), ~( =( T, X ) )
% 1.77/2.19     ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 84, [ =( Z, X ), ~( =( T, Z ) ), ~( =( T, X ) ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 88, [ =( X, Y ), ~( =( Z, Y ) ), ~( =( negate( Z ), negate( X ) ) )
% 1.77/2.19     ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 93, [ =( X, Y ), ~( =( negate( Z ), negate( X ) ) ), ~( =( T, Z ) )
% 1.77/2.19    , ~( =( T, Y ) ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 96, [ =( negate( Z ), X ), ~( =( T, Z ) ), ~( =( negate( T ), X ) )
% 1.77/2.19     ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 97, [ =( negate( X ), negate( Y ) ), ~( =( Y, X ) ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 104, [ =( negate( add( X, Y ) ), negate( add( Y, X ) ) ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 357, [ =( negate( add( negate( add( negate( Y ), X ) ), negate( add( 
% 1.77/2.19    X, Y ) ) ) ), X ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 359, [ =( negate( add( negate( add( negate( Y ), X ) ), negate( add( 
% 1.77/2.19    Y, X ) ) ) ), X ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 361, [ =( negate( add( negate( add( X, Y ) ), negate( add( negate( 
% 1.77/2.19    X ), Y ) ) ) ), Y ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 362, [ ~( =( X, b ) ), ~( =( Z, Y ) ), ~( =( Z, X ) ), ~( =( negate( 
% 1.77/2.19    Y ), negate( b ) ) ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 364, [ ~( =( negate( X ), negate( b ) ) ) ] )
% 1.77/2.19  .
% 1.77/2.19  clause( 365, [] )
% 1.77/2.19  .
% 1.77/2.19  
% 1.77/2.19  
% 1.77/2.19  % SZS output end Refutation
% 1.77/2.19  found a proof!
% 1.77/2.19  
% 1.77/2.19  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.77/2.19  
% 1.77/2.19  initialclauses(
% 1.77/2.19  [ clause( 367, [ =( add( X, Y ), add( Y, X ) ) ] )
% 1.77/2.19  , clause( 368, [ =( add( add( X, Y ), Z ), add( X, add( Y, Z ) ) ) ] )
% 1.77/2.19  , clause( 369, [ =( negate( add( negate( add( Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------