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

View Problem - Process Solution

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

% Computer : n005.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:20 EDT 2022

% Result   : Unsatisfiable 0.71s 1.12s
% Output   : Refutation 0.71s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GRP020-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : bliksem %s
% 0.13/0.35  % Computer : n005.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % DateTime : Mon Jun 13 21:59:54 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.71/1.12  *** allocated 10000 integers for termspace/termends
% 0.71/1.12  *** allocated 10000 integers for clauses
% 0.71/1.12  *** allocated 10000 integers for justifications
% 0.71/1.12  Bliksem 1.12
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  Automatic Strategy Selection
% 0.71/1.12  
% 0.71/1.12  Clauses:
% 0.71/1.12  [
% 0.71/1.12     [ product( identity, X, X ) ],
% 0.71/1.12     [ product( X, identity, X ) ],
% 0.71/1.12     [ product( inverse( X ), X, identity ) ],
% 0.71/1.12     [ product( X, inverse( X ), identity ) ],
% 0.71/1.12     [ product( X, Y, multiply( X, Y ) ) ],
% 0.71/1.12     [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), =( Z, T ) ],
% 0.71/1.12     [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( Z, T, W
% 0.71/1.12     ) ), product( X, U, W ) ],
% 0.71/1.12     [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( X, U, W
% 0.71/1.12     ) ), product( Z, T, W ) ],
% 0.71/1.12     [ ~( =( multiply( inverse( a ), a ), identity ) ) ]
% 0.71/1.12  ] .
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  percentage equality = 0.117647, percentage horn = 1.000000
% 0.71/1.12  This is a problem with some equality
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  Options Used:
% 0.71/1.12  
% 0.71/1.12  useres =            1
% 0.71/1.12  useparamod =        1
% 0.71/1.12  useeqrefl =         1
% 0.71/1.12  useeqfact =         1
% 0.71/1.12  usefactor =         1
% 0.71/1.12  usesimpsplitting =  0
% 0.71/1.12  usesimpdemod =      5
% 0.71/1.12  usesimpres =        3
% 0.71/1.12  
% 0.71/1.12  resimpinuse      =  1000
% 0.71/1.12  resimpclauses =     20000
% 0.71/1.12  substype =          eqrewr
% 0.71/1.12  backwardsubs =      1
% 0.71/1.12  selectoldest =      5
% 0.71/1.12  
% 0.71/1.12  litorderings [0] =  split
% 0.71/1.12  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.71/1.12  
% 0.71/1.12  termordering =      kbo
% 0.71/1.12  
% 0.71/1.12  litapriori =        0
% 0.71/1.12  termapriori =       1
% 0.71/1.12  litaposteriori =    0
% 0.71/1.12  termaposteriori =   0
% 0.71/1.12  demodaposteriori =  0
% 0.71/1.12  ordereqreflfact =   0
% 0.71/1.12  
% 0.71/1.12  litselect =         negord
% 0.71/1.12  
% 0.71/1.12  maxweight =         15
% 0.71/1.12  maxdepth =          30000
% 0.71/1.12  maxlength =         115
% 0.71/1.12  maxnrvars =         195
% 0.71/1.12  excuselevel =       1
% 0.71/1.12  increasemaxweight = 1
% 0.71/1.12  
% 0.71/1.12  maxselected =       10000000
% 0.71/1.12  maxnrclauses =      10000000
% 0.71/1.12  
% 0.71/1.12  showgenerated =    0
% 0.71/1.12  showkept =         0
% 0.71/1.12  showselected =     0
% 0.71/1.12  showdeleted =      0
% 0.71/1.12  showresimp =       1
% 0.71/1.12  showstatus =       2000
% 0.71/1.12  
% 0.71/1.12  prologoutput =     1
% 0.71/1.12  nrgoals =          5000000
% 0.71/1.12  totalproof =       1
% 0.71/1.12  
% 0.71/1.12  Symbols occurring in the translation:
% 0.71/1.12  
% 0.71/1.12  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.71/1.12  .  [1, 2]      (w:1, o:23, a:1, s:1, b:0), 
% 0.71/1.12  !  [4, 1]      (w:0, o:17, a:1, s:1, b:0), 
% 0.71/1.12  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.71/1.12  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.71/1.12  identity  [39, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 0.71/1.12  product  [41, 3]      (w:1, o:49, a:1, s:1, b:0), 
% 0.71/1.12  inverse  [42, 1]      (w:1, o:22, a:1, s:1, b:0), 
% 0.71/1.12  multiply  [44, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.71/1.12  a  [49, 0]      (w:1, o:16, a:1, s:1, b:0).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  Starting Search:
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  Bliksems!, er is een bewijs:
% 0.71/1.12  % SZS status Unsatisfiable
% 0.71/1.12  % SZS output start Refutation
% 0.71/1.12  
% 0.71/1.12  clause( 2, [ product( inverse( X ), X, identity ) ] )
% 0.71/1.12  .
% 0.71/1.12  clause( 4, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.71/1.12  .
% 0.71/1.12  clause( 5, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), =( Z, T ) ]
% 0.71/1.12     )
% 0.71/1.12  .
% 0.71/1.12  clause( 8, [ ~( =( multiply( inverse( a ), a ), identity ) ) ] )
% 0.71/1.12  .
% 0.71/1.12  clause( 15, [ ~( product( X, Y, Z ) ), =( multiply( X, Y ), Z ) ] )
% 0.71/1.12  .
% 0.71/1.12  clause( 537, [ ~( =( X, identity ) ), ~( product( inverse( a ), a, X ) ) ]
% 0.71/1.12     )
% 0.71/1.12  .
% 0.71/1.12  clause( 541, [] )
% 0.71/1.12  .
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  % SZS output end Refutation
% 0.71/1.12  found a proof!
% 0.71/1.12  
% 0.71/1.12  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.12  
% 0.71/1.12  initialclauses(
% 0.71/1.12  [ clause( 543, [ product( identity, X, X ) ] )
% 0.71/1.12  , clause( 544, [ product( X, identity, X ) ] )
% 0.71/1.12  , clause( 545, [ product( inverse( X ), X, identity ) ] )
% 0.71/1.12  , clause( 546, [ product( X, inverse( X ), identity ) ] )
% 0.71/1.12  , clause( 547, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.71/1.12  , clause( 548, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), =( Z, T
% 0.71/1.12     ) ] )
% 0.71/1.12  , clause( 549, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( 
% 0.71/1.12    product( Z, T, W ) ), product( X, U, W ) ] )
% 0.71/1.12  , clause( 550, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( 
% 0.71/1.12    product( X, U, W ) ), product( Z, T, W ) ] )
% 0.71/1.12  , clause( 551, [ ~( =( multiply( inverse( a ), a ), identity ) ) ] )
% 0.71/1.12  ] ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 2, [ product( inverse( X ), X, identity ) ] )
% 0.71/1.12  , clause( 545, [ product( inverse( X ), X, identity ) ] )
% 0.71/1.12  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 4, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.71/1.12  , clause( 547, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.71/1.12  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.12     )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 5, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), =( Z, T ) ]
% 9.23/9.60     )
% 9.23/9.60  , clause( 548, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), =( Z, T
% 9.23/9.60     ) ] )
% 9.23/9.60  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ), 
% 9.23/9.60    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  subsumption(
% 9.23/9.60  clause( 8, [ ~( =( multiply( inverse( a ), a ), identity ) ) ] )
% 9.23/9.60  , clause( 551, [ ~( =( multiply( inverse( a ), a ), identity ) ) ] )
% 9.23/9.60  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  resolution(
% 9.23/9.60  clause( 563, [ ~( product( X, Y, Z ) ), =( multiply( X, Y ), Z ) ] )
% 9.23/9.60  , clause( 5, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), =( Z, T )
% 9.23/9.60     ] )
% 9.23/9.60  , 0, clause( 4, [ product( X, Y, multiply( X, Y ) ) ] )
% 9.23/9.60  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, multiply( X, Y ) ), 
% 9.23/9.60    :=( T, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  subsumption(
% 9.23/9.60  clause( 15, [ ~( product( X, Y, Z ) ), =( multiply( X, Y ), Z ) ] )
% 9.23/9.60  , clause( 563, [ ~( product( X, Y, Z ) ), =( multiply( X, Y ), Z ) ] )
% 9.23/9.60  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 9.23/9.60    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  eqswap(
% 9.23/9.60  clause( 566, [ ~( =( identity, multiply( inverse( a ), a ) ) ) ] )
% 9.23/9.60  , clause( 8, [ ~( =( multiply( inverse( a ), a ), identity ) ) ] )
% 9.23/9.60  , 0, substitution( 0, [] )).
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  paramod(
% 9.23/9.60  clause( 10054, [ ~( =( identity, X ) ), ~( product( inverse( a ), a, X ) )
% 9.23/9.60     ] )
% 9.23/9.60  , clause( 15, [ ~( product( X, Y, Z ) ), =( multiply( X, Y ), Z ) ] )
% 9.23/9.60  , 1, clause( 566, [ ~( =( identity, multiply( inverse( a ), a ) ) ) ] )
% 9.23/9.60  , 0, 3, substitution( 0, [ :=( X, inverse( a ) ), :=( Y, a ), :=( Z, X )] )
% 9.23/9.60    , substitution( 1, [] )).
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  eqswap(
% 9.23/9.60  clause( 10055, [ ~( =( X, identity ) ), ~( product( inverse( a ), a, X ) )
% 9.23/9.60     ] )
% 9.23/9.60  , clause( 10054, [ ~( =( identity, X ) ), ~( product( inverse( a ), a, X )
% 9.23/9.60     ) ] )
% 9.23/9.60  , 0, substitution( 0, [ :=( X, X )] )).
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  subsumption(
% 9.23/9.60  clause( 537, [ ~( =( X, identity ) ), ~( product( inverse( a ), a, X ) ) ]
% 9.23/9.60     )
% 9.23/9.60  , clause( 10055, [ ~( =( X, identity ) ), ~( product( inverse( a ), a, X )
% 9.23/9.60     ) ] )
% 9.23/9.60  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 9.23/9.60    1 )] ) ).
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  eqswap(
% 9.23/9.60  clause( 10056, [ ~( =( identity, X ) ), ~( product( inverse( a ), a, X ) )
% 9.23/9.60     ] )
% 9.23/9.60  , clause( 537, [ ~( =( X, identity ) ), ~( product( inverse( a ), a, X ) )
% 9.23/9.60     ] )
% 9.23/9.60  , 0, substitution( 0, [ :=( X, X )] )).
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  eqrefl(
% 9.23/9.60  clause( 10057, [ ~( product( inverse( a ), a, identity ) ) ] )
% 9.23/9.60  , clause( 10056, [ ~( =( identity, X ) ), ~( product( inverse( a ), a, X )
% 9.23/9.60     ) ] )
% 9.23/9.60  , 0, substitution( 0, [ :=( X, identity )] )).
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  resolution(
% 9.23/9.60  clause( 10058, [] )
% 9.23/9.60  , clause( 10057, [ ~( product( inverse( a ), a, identity ) ) ] )
% 9.23/9.60  , 0, clause( 2, [ product( inverse( X ), X, identity ) ] )
% 9.23/9.60  , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  subsumption(
% 9.23/9.60  clause( 541, [] )
% 9.23/9.60  , clause( 10058, [] )
% 9.23/9.60  , substitution( 0, [] ), permutation( 0, [] ) ).
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  end.
% 9.23/9.60  
% 9.23/9.60  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 9.23/9.60  
% 9.23/9.60  Memory use:
% 9.23/9.60  
% 9.23/9.60  space for terms:        7564
% 9.23/9.60  space for clauses:      22401
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  clauses generated:      2516
% 9.23/9.60  clauses kept:           542
% 9.23/9.60  clauses selected:       51
% 9.23/9.60  clauses deleted:        0
% 9.23/9.60  clauses inuse deleted:  0
% 9.23/9.60  
% 9.23/9.60  subsentry:          8542592
% 9.23/9.60  literals s-matched: 1960210
% 9.23/9.60  literals matched:   1692446
% 9.23/9.60  full subsumption:   1688086
% 9.23/9.60  
% 9.23/9.60  checksum:           2088539513
% 9.23/9.60  
% 9.23/9.60  
% 9.23/9.60  Bliksem ended
%------------------------------------------------------------------------------