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

View Problem - Process Solution

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

% Computer : n010.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 : Sat Jul 16 13:11:34 EDT 2022

% Result   : Unknown 2.13s 2.55s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : HWV003-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.12  % Command  : bliksem %s
% 0.12/0.33  % Computer : n010.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % DateTime : Thu Jun 16 22:17:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.13/2.55  *** allocated 10000 integers for termspace/termends
% 2.13/2.55  *** allocated 10000 integers for clauses
% 2.13/2.55  *** allocated 10000 integers for justifications
% 2.13/2.55  Bliksem 1.12
% 2.13/2.55  
% 2.13/2.55  
% 2.13/2.55  Automatic Strategy Selection
% 2.13/2.55  
% 2.13/2.55  Clauses:
% 2.13/2.55  [
% 2.13/2.55     [ =( and( X, n0 ), n0 ) ],
% 2.13/2.55     [ =( and( X, n1 ), X ) ],
% 2.13/2.55     [ =( or( X, n0 ), X ) ],
% 2.13/2.55     [ =( or( X, n1 ), n1 ) ],
% 2.13/2.55     [ =( not( n0 ), n1 ) ],
% 2.13/2.55     [ =( not( n1 ), n0 ) ],
% 2.13/2.55     [ =( not( and( X, Y ) ), or( not( X ), not( Y ) ) ) ],
% 2.13/2.55     [ =( not( or( X, Y ) ), and( not( X ), not( Y ) ) ) ],
% 2.13/2.55     [ =( not( not( X ) ), X ) ],
% 2.13/2.55     [ =( and( X, Y ), and( Y, X ) ) ],
% 2.13/2.55     [ =( or( X, Y ), or( Y, X ) ) ],
% 2.13/2.55     [ =( and( or( X, Y ), Z ), or( and( X, Z ), and( Y, Z ) ) ) ],
% 2.13/2.55     [ =( and( and( X, Y ), Z ), and( and( X, Z ), Y ) ) ],
% 2.13/2.55     [ =( or( or( X, Y ), Z ), or( or( X, Z ), Y ) ) ],
% 2.13/2.55     [ =( and( X, not( X ) ), n0 ) ],
% 2.13/2.55     [ =( or( X, not( X ) ), n1 ) ],
% 2.13/2.55     [ =( and( X, X ), X ) ],
% 2.13/2.55     [ =( or( X, X ), X ) ],
% 2.13/2.55     [ =( and( and( X, Y ), not( Y ) ), n0 ) ],
% 2.13/2.55     [ =( and( and( X, Y ), not( X ) ), n0 ) ],
% 2.13/2.55     [ =( or( or( X, Y ), not( Y ) ), n1 ) ],
% 2.13/2.55     [ =( or( or( X, Y ), not( X ) ), n1 ) ],
% 2.13/2.55     [ =( and( and( X, Y ), Y ), and( X, Y ) ) ],
% 2.13/2.55     [ =( or( or( X, Y ), Y ), or( X, Y ) ) ],
% 2.13/2.55     [ =( and( and( and( X, Y ), Z ), not( X ) ), n0 ) ],
% 2.13/2.55     [ =( and( and( and( X, Y ), Z ), not( Y ) ), n0 ) ],
% 2.13/2.55     [ =( or( and( X, Y ), Y ), Y ) ],
% 2.13/2.55     [ =( or( and( X, Y ), X ), X ) ],
% 2.13/2.55     [ =( or( or( and( X, Y ), Z ), Y ), or( Z, Y ) ) ],
% 2.13/2.55     [ =( or( or( X, and( Y, Z ) ), Z ), or( X, Z ) ) ],
% 2.13/2.55     [ =( or( and( X, not( Y ) ), Y ), or( X, Y ) ) ],
% 2.13/2.55     [ =( or( and( not( X ), not( Y ) ), Y ), or( Y, not( X ) ) ) ],
% 2.13/2.55     [ =( or( and( and( X, Y ), not( Z ) ), and( X, Z ) ), or( and( X, Y ), 
% 2.13/2.55    and( X, Z ) ) ) ],
% 2.13/2.55     [ =( xor( X, Y ), or( and( X, not( Y ) ), and( Y, not( X ) ) ) ) ],
% 2.13/2.55     [ =( carryout( X, Y, Z ), or( and( X, or( Y, Z ) ), and( not( X ), and( 
% 2.13/2.55    Y, Z ) ) ) ) ],
% 2.13/2.55     [ =( sum( X, Y, Z ), xor( xor( X, Y ), Z ) ) ],
% 2.13/2.55     [ =( a11, not( and( a, b ) ) ) ],
% 2.13/2.55     [ =( a12, not( and( a11, a ) ) ) ],
% 2.13/2.55     [ =( a13, not( and( a11, b ) ) ) ],
% 2.13/2.55     [ =( a14, not( and( a12, a13 ) ) ) ],
% 2.13/2.55     [ =( a15, not( and( a14, carryin ) ) ) ],
% 2.13/2.55     [ =( a16, not( and( a14, a15 ) ) ) ],
% 2.13/2.55     [ =( a17, not( and( a15, carryin ) ) ) ],
% 2.13/2.55     [ =( s1, not( and( a16, a17 ) ) ) ],
% 2.13/2.55     [ =( c1, not( and( a11, a15 ) ) ) ],
% 2.13/2.55     [ circuit( s1, c1 ) ],
% 2.13/2.55     [ ~( circuit( sum( a, b, carryin ), carryout( a, b, carryin ) ) ) ]
% 2.13/2.55  ] .
% 2.13/2.55  
% 2.13/2.55  
% 2.13/2.55  percentage equality = 0.957447, percentage horn = 1.000000
% 2.13/2.55  This is a pure equality problem
% 2.13/2.55  
% 2.13/2.55  
% 2.13/2.55  
% 2.13/2.55  Options Used:
% 2.13/2.55  
% 2.13/2.55  useres =            1
% 2.13/2.55  useparamod =        1
% 2.13/2.55  useeqrefl =         1
% 2.13/2.55  useeqfact =         1
% 2.13/2.55  usefactor =         1
% 2.13/2.55  usesimpsplitting =  0
% 2.13/2.55  usesimpdemod =      5
% 2.13/2.55  usesimpres =        3
% 2.13/2.55  
% 2.13/2.55  resimpinuse      =  1000
% 2.13/2.55  resimpclauses =     20000
% 2.13/2.55  substype =          eqrewr
% 2.13/2.55  backwardsubs =      1
% 2.13/2.55  selectoldest =      5
% 2.13/2.55  
% 2.13/2.55  litorderings [0] =  split
% 2.13/2.55  litorderings [1] =  extend the termordering, first sorting on arguments
% 2.13/2.55  
% 2.13/2.55  termordering =      kbo
% 2.13/2.55  
% 2.13/2.55  litapriori =        0
% 2.13/2.55  termapriori =       1
% 2.13/2.55  litaposteriori =    0
% 2.13/2.55  termaposteriori =   0
% 2.13/2.55  demodaposteriori =  0
% 2.13/2.55  ordereqreflfact =   0
% 2.13/2.55  
% 2.13/2.55  litselect =         negord
% 2.13/2.55  
% 2.13/2.55  maxweight =         15
% 2.13/2.55  maxdepth =          30000
% 2.13/2.55  maxlength =         115
% 2.13/2.55  maxnrvars =         195
% 2.13/2.55  excuselevel =       1
% 2.13/2.55  increasemaxweight = 1
% 2.13/2.55  
% 2.13/2.55  maxselected =       10000000
% 2.13/2.55  maxnrclauses =      10000000
% 2.13/2.55  
% 2.13/2.55  showgenerated =    0
% 2.13/2.55  showkept =         0
% 2.13/2.55  showselected =     0
% 2.13/2.55  showdeleted =      0
% 2.13/2.55  showresimp =       1
% 2.13/2.55  showstatus =       2000
% 2.13/2.55  
% 2.13/2.55  prologoutput =     1
% 2.13/2.55  nrgoals =          5000000
% 2.13/2.55  totalproof =       1
% 2.13/2.55  
% 2.13/2.55  Symbols occurring in the translation:
% 2.13/2.55  
% 2.13/2.55  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 2.13/2.55  .  [1, 2]      (w:1, o:35, a:1, s:1, b:0), 
% 2.13/2.55  !  [4, 1]      (w:0, o:29, a:1, s:1, b:0), 
% 2.13/2.55  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 2.13/2.55  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 2.13/2.55  n0  [40, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 2.13/2.55  and  [41, 2]      (w:1, o:60, a:1, s:1, b:0), 
% 2.13/2.55  n1  [42, 0]      (w:1, o:12, a:1, s:1, b:0), 
% 2.13/2.55  or  [43, 2]      (w:1, o:61, a:1, s:1, b:0), 
% 2.13/2.55  not  [44, 1]      (w:1, o:34, a:1, s:1, b:0), 
% 2.13/2.55  xor  [50, 2]      (w:1, o:62, a:1, s:1, b:0), 
% 2.13/2.55  carryout  [51, 3]      (w:1, o:64, a:1, s:1, b:0), 
% 2.13/2.55  sum  [52, 3]      (w:1, o:65, a:1, s:1, b:0),Segmentation fault (core dumped) 
% 2.13/2.55  Bliksem ended
%------------------------------------------------------------------------------