↑ Up

Bliksem---1.12.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : GRP007-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:15 EDT 2022

% Result   : Unsatisfiable 0.48s 1.14s
% Output   : Refutation 0.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : GRP007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14  % Command  : bliksem %s
% 0.14/0.36  % Computer : n005.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % DateTime : Mon Jun 13 22:58:24 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.48/1.14  *** allocated 10000 integers for termspace/termends
% 0.48/1.14  *** allocated 10000 integers for clauses
% 0.48/1.14  *** allocated 10000 integers for justifications
% 0.48/1.14  Bliksem 1.12
% 0.48/1.14  
% 0.48/1.14  
% 0.48/1.14  Automatic Strategy Selection
% 0.48/1.14  
% 0.48/1.14  Clauses:
% 0.48/1.14  [
% 0.48/1.14     [ product( identity, X, X ) ],
% 0.48/1.14     [ product( X, identity, X ) ],
% 0.48/1.14     [ product( inverse( X ), X, identity ) ],
% 0.48/1.14     [ product( X, inverse( X ), identity ) ],
% 0.48/1.14     [ product( X, Y, multiply( X, Y ) ) ],
% 0.48/1.14     [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), =( Z, T ) ],
% 0.48/1.14     [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( Z, T, W
% 0.48/1.14     ) ), product( X, U, W ) ],
% 0.48/1.14     [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( X, U, W
% 0.48/1.14     ) ), product( Z, T, W ) ],
% 0.48/1.14     [ product( c, X, X ) ],
% 0.48/1.14     [ product( X, c, X ) ],
% 0.48/1.14     [ ~( =( identity, c ) ) ]
% 0.48/1.14  ] .
% 0.48/1.14  
% 0.48/1.14  
% 0.48/1.14  percentage equality = 0.105263, percentage horn = 1.000000
% 0.48/1.14  This is a problem with some equality
% 0.48/1.14  
% 0.48/1.14  
% 0.48/1.14  
% 0.48/1.14  Options Used:
% 0.48/1.14  
% 0.48/1.14  useres =            1
% 0.48/1.14  useparamod =        1
% 0.48/1.14  useeqrefl =         1
% 0.48/1.14  useeqfact =         1
% 0.48/1.14  usefactor =         1
% 0.48/1.14  usesimpsplitting =  0
% 0.48/1.14  usesimpdemod =      5
% 0.48/1.14  usesimpres =        3
% 0.48/1.14  
% 0.48/1.14  resimpinuse      =  1000
% 0.48/1.14  resimpclauses =     20000
% 0.48/1.14  substype =          eqrewr
% 0.48/1.14  backwardsubs =      1
% 0.48/1.14  selectoldest =      5
% 0.48/1.14  
% 0.48/1.14  litorderings [0] =  split
% 0.48/1.14  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.48/1.14  
% 0.48/1.14  termordering =      kbo
% 0.48/1.14  
% 0.48/1.14  litapriori =        0
% 0.48/1.14  termapriori =       1
% 0.48/1.14  litaposteriori =    0
% 0.48/1.14  termaposteriori =   0
% 0.48/1.14  demodaposteriori =  0
% 0.48/1.14  ordereqreflfact =   0
% 0.48/1.14  
% 0.48/1.14  litselect =         negord
% 0.48/1.14  
% 0.48/1.14  maxweight =         15
% 0.48/1.14  maxdepth =          30000
% 0.48/1.14  maxlength =         115
% 0.48/1.14  maxnrvars =         195
% 0.48/1.14  excuselevel =       1
% 0.48/1.14  increasemaxweight = 1
% 0.48/1.14  
% 0.48/1.14  maxselected =       10000000
% 0.48/1.14  maxnrclauses =      10000000
% 0.48/1.14  
% 0.48/1.14  showgenerated =    0
% 0.48/1.14  showkept =         0
% 0.48/1.14  showselected =     0
% 0.48/1.14  showdeleted =      0
% 0.48/1.14  showresimp =       1
% 0.48/1.14  showstatus =       2000
% 0.48/1.14  
% 0.48/1.14  prologoutput =     1
% 0.48/1.14  nrgoals =          5000000
% 0.48/1.14  totalproof =       1
% 0.48/1.14  
% 0.48/1.14  Symbols occurring in the translation:
% 0.48/1.14  
% 0.48/1.14  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.48/1.14  .  [1, 2]      (w:1, o:24, a:1, s:1, b:0), 
% 0.48/1.14  !  [4, 1]      (w:0, o:18, a:1, s:1, b:0), 
% 0.48/1.14  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.48/1.14  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.48/1.14  identity  [39, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 0.48/1.14  product  [41, 3]      (w:1, o:50, a:1, s:1, b:0), 
% 0.48/1.14  inverse  [42, 1]      (w:1, o:23, a:1, s:1, b:0), 
% 0.48/1.14  multiply  [44, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.48/1.14  c  [49, 0]      (w:1, o:16, a:1, s:1, b:0).
% 0.48/1.14  
% 0.48/1.14  
% 0.48/1.14  Starting Search:
% 0.48/1.14  
% 0.48/1.14  
% 0.48/1.14  Bliksems!, er is een bewijs:
% 0.48/1.14  % SZS status Unsatisfiable
% 0.48/1.14  % SZS output start Refutation
% 0.48/1.14  
% 0.48/1.14  clause( 0, [ product( identity, X, X ) ] )
% 0.48/1.14  .
% 0.48/1.14  clause( 5, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), =( Z, T ) ]
% 0.48/1.14     )
% 0.48/1.14  .
% 0.48/1.14  clause( 9, [ product( X, c, X ) ] )
% 0.48/1.14  .
% 0.48/1.14  clause( 10, [ ~( =( c, identity ) ) ] )
% 0.48/1.14  .
% 0.48/1.14  clause( 20, [ ~( product( identity, X, Y ) ), =( X, Y ) ] )
% 0.48/1.14  .
% 0.48/1.14  clause( 37, [ =( c, identity ) ] )
% 0.48/1.14  .
% 0.48/1.14  clause( 56, [ ~( =( X, identity ) ), ~( product( identity, X, identity ) )
% 0.48/1.14     ] )
% 0.48/1.14  .
% 0.48/1.14  clause( 57, [] )
% 0.48/1.14  .
% 0.48/1.14  
% 0.48/1.14  
% 0.48/1.14  % SZS output end Refutation
% 0.48/1.14  found a proof!
% 0.48/1.14  
% 0.48/1.14  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.48/1.14  
% 0.48/1.14  initialclauses(
% 0.48/1.14  [ clause( 59, [ product( identity, X, X ) ] )
% 0.48/1.14  , clause( 60, [ product( X, identity, X ) ] )
% 0.48/1.14  , clause( 61, [ product( inverse( X ), X, identity ) ] )
% 0.48/1.14  , clause( 62, [ product( X, inverse( X ), identity ) ] )
% 0.48/1.14  , clause( 63, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.48/1.14  , clause( 64, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), =( Z, T )
% 0.48/1.14     ] )
% 0.48/1.14  , clause( 65, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( 
% 0.48/1.14    product( Z, T, W ) ), product( X, U, W ) ] )
% 0.48/1.14  , clause( 66, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( 
% 0.48/1.14    product( X, U, W ) ), product( Z, T, W ) ] )
% 0.48/1.14  , clause( 67, [ product( c, X, X ) ] )
% 0.48/1.14  , clause( 68, [ product( X, c, X ) ] )
% 0.48/1.14  , clause( 69, [ ~( =( identity, c ) ) ] )
% 0.48/1.14  ] ).
% 0.48/1.14  
% 0.48/1.14  
% 0.48/1.14  
% 0.48/1.14  subsumption(
% 0.48/1.14  clause( 0, [ product( identity, X, X ) ] )
% 0.48/1.14  , clause( 59, [ product( identity, X, X ) ] )
% 0.48/1.14  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.14  
% 0.48/1.14  
% 0.48/1.14  subsumption(
% 0.48/1.14  clause( 5, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), =( Z, T ) ]
% 0.48/1.14     )
% 0.48/1.14  , clause( 64, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), =( Z, T )
% 0.48/1.14     ] )
% 0.48/1.14  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ),Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------