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

View Problem - Process Solution

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

% Computer : n020.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 07:34:15 EDT 2022

% Result   : Unsatisfiable 0.46s 1.11s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.35  % DateTime : Mon Jun 13 11:46:05 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.46/1.11  *** allocated 10000 integers for termspace/termends
% 0.46/1.11  *** allocated 10000 integers for clauses
% 0.46/1.11  *** allocated 10000 integers for justifications
% 0.46/1.11  Bliksem 1.12
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  Automatic Strategy Selection
% 0.46/1.11  
% 0.46/1.11  Clauses:
% 0.46/1.11  [
% 0.46/1.11     [ product( identity, X, X ) ],
% 0.46/1.11     [ product( X, identity, X ) ],
% 0.46/1.11     [ product( X, inverse( X ), identity ) ],
% 0.46/1.11     [ product( inverse( X ), X, identity ) ],
% 0.46/1.11     [ 'an_element'( a ) ],
% 0.46/1.11     [ ~( 'an_element'( X ) ), ~( 'an_element'( Y ) ), ~( product( X, inverse( 
% 0.46/1.11    Y ), Z ) ), 'an_element'( Z ) ],
% 0.46/1.11     [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( Z, T, W
% 0.46/1.11     ) ), product( X, U, W ) ],
% 0.46/1.11     [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( X, U, W
% 0.46/1.11     ) ), product( Z, T, W ) ],
% 0.46/1.11     [ ~( 'an_element'( identity ) ) ]
% 0.46/1.11  ] .
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  percentage equality = 0.000000, percentage horn = 1.000000
% 0.46/1.11  This is a near-Horn, non-equality  problem
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  Options Used:
% 0.46/1.11  
% 0.46/1.11  useres =            1
% 0.46/1.11  useparamod =        0
% 0.46/1.11  useeqrefl =         0
% 0.46/1.11  useeqfact =         0
% 0.46/1.11  usefactor =         1
% 0.46/1.11  usesimpsplitting =  0
% 0.46/1.11  usesimpdemod =      0
% 0.46/1.11  usesimpres =        4
% 0.46/1.11  
% 0.46/1.11  resimpinuse      =  1000
% 0.46/1.11  resimpclauses =     20000
% 0.46/1.11  substype =          standard
% 0.46/1.11  backwardsubs =      1
% 0.46/1.11  selectoldest =      5
% 0.46/1.11  
% 0.46/1.11  litorderings [0] =  split
% 0.46/1.11  litorderings [1] =  liftord
% 0.46/1.11  
% 0.46/1.11  termordering =      none
% 0.46/1.11  
% 0.46/1.11  litapriori =        1
% 0.46/1.11  termapriori =       0
% 0.46/1.11  litaposteriori =    0
% 0.46/1.11  termaposteriori =   0
% 0.46/1.11  demodaposteriori =  0
% 0.46/1.11  ordereqreflfact =   0
% 0.46/1.11  
% 0.46/1.11  litselect =         negative
% 0.46/1.11  
% 0.46/1.11  maxweight =         30000
% 0.46/1.11  maxdepth =          30000
% 0.46/1.11  maxlength =         115
% 0.46/1.11  maxnrvars =         195
% 0.46/1.11  excuselevel =       0
% 0.46/1.11  increasemaxweight = 0
% 0.46/1.11  
% 0.46/1.11  maxselected =       10000000
% 0.46/1.11  maxnrclauses =      10000000
% 0.46/1.11  
% 0.46/1.11  showgenerated =    0
% 0.46/1.11  showkept =         0
% 0.46/1.11  showselected =     0
% 0.46/1.11  showdeleted =      0
% 0.46/1.11  showresimp =       1
% 0.46/1.11  showstatus =       2000
% 0.46/1.11  
% 0.46/1.11  prologoutput =     1
% 0.46/1.11  nrgoals =          5000000
% 0.46/1.11  totalproof =       1
% 0.46/1.11  
% 0.46/1.11  Symbols occurring in the translation:
% 0.46/1.11  
% 0.46/1.11  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.46/1.11  .  [1, 2]      (w:1, o:24, a:1, s:1, b:0), 
% 0.46/1.11  !  [4, 1]      (w:1, o:17, a:1, s:1, b:0), 
% 0.46/1.11  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.46/1.11  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.46/1.11  identity  [39, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 0.46/1.11  product  [41, 3]      (w:1, o:49, a:1, s:1, b:0), 
% 0.46/1.11  inverse  [42, 1]      (w:1, o:22, a:1, s:1, b:0), 
% 0.46/1.11  a  [43, 0]      (w:1, o:12, a:1, s:1, b:0), 
% 0.46/1.11  'an_element'  [44, 1]      (w:1, o:23, a:1, s:1, b:0).
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  Starting Search:
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  Bliksems!, er is een bewijs:
% 0.46/1.11  % SZS status Unsatisfiable
% 0.46/1.11  % SZS output start Refutation
% 0.46/1.11  
% 0.46/1.11  clause( 2, [ product( X, inverse( X ), identity ) ] )
% 0.46/1.11  .
% 0.46/1.11  clause( 4, [ 'an_element'( a ) ] )
% 0.46/1.11  .
% 0.46/1.11  clause( 5, [ ~( 'an_element'( X ) ), ~( 'an_element'( Y ) ), 'an_element'( 
% 0.46/1.11    Z ), ~( product( X, inverse( Y ), Z ) ) ] )
% 0.46/1.11  .
% 0.46/1.11  clause( 8, [ ~( 'an_element'( identity ) ) ] )
% 0.46/1.11  .
% 0.46/1.11  clause( 9, [ ~( 'an_element'( X ) ), 'an_element'( Y ), ~( product( X, 
% 0.46/1.11    inverse( X ), Y ) ) ] )
% 0.46/1.11  .
% 0.46/1.11  clause( 16, [ ~( 'an_element'( X ) ) ] )
% 0.46/1.11  .
% 0.46/1.11  clause( 17, [] )
% 0.46/1.11  .
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  % SZS output end Refutation
% 0.46/1.11  found a proof!
% 0.46/1.11  
% 0.46/1.11  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.11  
% 0.46/1.11  initialclauses(
% 0.46/1.11  [ clause( 19, [ product( identity, X, X ) ] )
% 0.46/1.11  , clause( 20, [ product( X, identity, X ) ] )
% 0.46/1.11  , clause( 21, [ product( X, inverse( X ), identity ) ] )
% 0.46/1.11  , clause( 22, [ product( inverse( X ), X, identity ) ] )
% 0.46/1.11  , clause( 23, [ 'an_element'( a ) ] )
% 0.46/1.11  , clause( 24, [ ~( 'an_element'( X ) ), ~( 'an_element'( Y ) ), ~( product( 
% 0.46/1.11    X, inverse( Y ), Z ) ), 'an_element'( Z ) ] )
% 0.46/1.11  , clause( 25, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( 
% 0.46/1.11    product( Z, T, W ) ), product( X, U, W ) ] )
% 0.46/1.11  , clause( 26, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( 
% 0.46/1.11    product( X, U, W ) ), product( Z, T, W ) ] )
% 0.46/1.11  , clause( 27, [ ~( 'an_element'( identity ) ) ] )
% 0.46/1.11  ] ).
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  subsumption(
% 0.46/1.11  clause( 2, [ product( X, inverse( X ), identity ) ] )
% 0.46/1.11  , clause( 21, [ product( X, inverse( X ), identity ) ] )
% 0.46/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  subsumption(
% 0.46/1.11  clause( 4, [ 'an_element'( a ) ] )
% 0.46/1.11  , clause( 23, [ 'an_element'( a ) ] )
% 0.46/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  subsumption(
% 0.46/1.11  clause( 5, [ ~( 'an_element'( X ) ), ~( 'an_element'( Y ) ), 'an_element'( 
% 0.46/1.11    Z ), ~( product( X, inverse( Y ), Z ) ) ] )
% 0.46/1.11  , clause( 24, [ ~( 'an_element'( X ) ), ~( 'an_element'( Y ) ), ~( product( 
% 0.46/1.11    X, inverse( Y ), Z ) ), 'an_element'( Z ) ] )
% 0.46/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.46/1.11    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 3 ), ==>( 3, 2 )] )
% 0.46/1.11     ).
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  subsumption(
% 0.46/1.11  clause( 8, [ ~( 'an_element'( identity ) ) ] )
% 0.46/1.11  , clause( 27, [ ~( 'an_element'( identity ) ) ] )
% 0.46/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  factor(
% 0.46/1.11  clause( 38, [ ~( 'an_element'( X ) ), 'an_element'( Y ), ~( product( X, 
% 0.46/1.11    inverse( X ), Y ) ) ] )
% 0.46/1.11  , clause( 5, [ ~( 'an_element'( X ) ), ~( 'an_element'( Y ) ), 'an_element'( 
% 0.46/1.11    Z ), ~( product( X, inverse( Y ), Z ) ) ] )
% 0.46/1.11  , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, Y )] )).
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  subsumption(
% 0.46/1.11  clause( 9, [ ~( 'an_element'( X ) ), 'an_element'( Y ), ~( product( X, 
% 0.46/1.11    inverse( X ), Y ) ) ] )
% 0.46/1.11  , clause( 38, [ ~( 'an_element'( X ) ), 'an_element'( Y ), ~( product( X, 
% 0.46/1.11    inverse( X ), Y ) ) ] )
% 0.46/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.11     ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  resolution(
% 0.46/1.11  clause( 39, [ ~( 'an_element'( X ) ), 'an_element'( identity ) ] )
% 0.46/1.11  , clause( 9, [ ~( 'an_element'( X ) ), 'an_element'( Y ), ~( product( X, 
% 0.46/1.11    inverse( X ), Y ) ) ] )
% 0.46/1.11  , 2, clause( 2, [ product( X, inverse( X ), identity ) ] )
% 0.46/1.11  , 0, substitution( 0, [ :=( X, X ), :=( Y, identity )] ), substitution( 1
% 0.46/1.11    , [ :=( X, X )] )).
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  resolution(
% 0.46/1.11  clause( 40, [ ~( 'an_element'( X ) ) ] )
% 0.46/1.11  , clause( 8, [ ~( 'an_element'( identity ) ) ] )
% 0.46/1.11  , 0, clause( 39, [ ~( 'an_element'( X ) ), 'an_element'( identity ) ] )
% 0.46/1.11  , 1, substitution( 0, [] ), substitution( 1, [ :=( X, X )] )).
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  subsumption(
% 0.46/1.11  clause( 16, [ ~( 'an_element'( X ) ) ] )
% 0.46/1.11  , clause( 40, [ ~( 'an_element'( X ) ) ] )
% 0.46/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  resolution(
% 0.46/1.11  clause( 41, [] )
% 0.46/1.11  , clause( 16, [ ~( 'an_element'( X ) ) ] )
% 0.46/1.11  , 0, clause( 4, [ 'an_element'( a ) ] )
% 0.46/1.11  , 0, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  subsumption(
% 0.46/1.11  clause( 17, [] )
% 0.46/1.11  , clause( 41, [] )
% 0.46/1.11  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  end.
% 0.46/1.11  
% 0.46/1.11  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.11  
% 0.46/1.11  Memory use:
% 0.46/1.11  
% 0.46/1.11  space for terms:        384
% 0.46/1.11  space for clauses:      865
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  clauses generated:      25
% 0.46/1.11  clauses kept:           18
% 0.46/1.11  clauses selected:       8
% 0.46/1.11  clauses deleted:        0
% 0.46/1.11  clauses inuse deleted:  0
% 0.46/1.11  
% 0.46/1.11  subsentry:          47
% 0.46/1.11  literals s-matched: 21
% 0.46/1.11  literals matched:   15
% 0.46/1.11  full subsumption:   10
% 0.46/1.11  
% 0.46/1.11  checksum:           -7383
% 0.46/1.11  
% 0.46/1.11  
% 0.46/1.11  Bliksem ended
%------------------------------------------------------------------------------