↑ Up

Bliksem---1.12.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : GRP023-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n017.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:22 EDT 2022

% Result   : Unsatisfiable 0.56s 0.95s
% Output   : Refutation 0.56s
% Verified : 
% SZS Type : -

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