↑ Up

Bliksem---1.12.UNS-Ref.s

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

% Computer : n026.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 : Fri Jul 15 00:12:30 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : COL056-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n026.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.34  % DateTime : Tue May 31 12:07:56 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.70/1.11  *** allocated 10000 integers for termspace/termends
% 0.70/1.11  *** allocated 10000 integers for clauses
% 0.70/1.11  *** allocated 10000 integers for justifications
% 0.70/1.11  Bliksem 1.12
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  Automatic Strategy Selection
% 0.70/1.11  
% 0.70/1.11  Clauses:
% 0.70/1.11  [
% 0.70/1.11     [ =( response( compose( X, Y ), Z ), response( X, response( Y, Z ) ) ) ]
% 0.70/1.11    ,
% 0.70/1.11     [ =( response( a, b ), c ) ],
% 0.70/1.11     [ =( response( a, c ), b ) ],
% 0.70/1.11     [ ~( =( response( X, Y ), Y ) ) ]
% 0.70/1.11  ] .
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  percentage equality = 1.000000, percentage horn = 1.000000
% 0.70/1.11  This is a pure equality problem
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  Options Used:
% 0.70/1.11  
% 0.70/1.11  useres =            1
% 0.70/1.11  useparamod =        1
% 0.70/1.11  useeqrefl =         1
% 0.70/1.11  useeqfact =         1
% 0.70/1.11  usefactor =         1
% 0.70/1.11  usesimpsplitting =  0
% 0.70/1.11  usesimpdemod =      5
% 0.70/1.11  usesimpres =        3
% 0.70/1.11  
% 0.70/1.11  resimpinuse      =  1000
% 0.70/1.11  resimpclauses =     20000
% 0.70/1.11  substype =          eqrewr
% 0.70/1.11  backwardsubs =      1
% 0.70/1.11  selectoldest =      5
% 0.70/1.11  
% 0.70/1.11  litorderings [0] =  split
% 0.70/1.11  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.70/1.11  
% 0.70/1.11  termordering =      kbo
% 0.70/1.11  
% 0.70/1.11  litapriori =        0
% 0.70/1.11  termapriori =       1
% 0.70/1.11  litaposteriori =    0
% 0.70/1.11  termaposteriori =   0
% 0.70/1.11  demodaposteriori =  0
% 0.70/1.11  ordereqreflfact =   0
% 0.70/1.11  
% 0.70/1.11  litselect =         negord
% 0.70/1.11  
% 0.70/1.11  maxweight =         15
% 0.70/1.11  maxdepth =          30000
% 0.70/1.11  maxlength =         115
% 0.70/1.11  maxnrvars =         195
% 0.70/1.11  excuselevel =       1
% 0.70/1.11  increasemaxweight = 1
% 0.70/1.11  
% 0.70/1.11  maxselected =       10000000
% 0.70/1.11  maxnrclauses =      10000000
% 0.70/1.11  
% 0.70/1.11  showgenerated =    0
% 0.70/1.11  showkept =         0
% 0.70/1.11  showselected =     0
% 0.70/1.11  showdeleted =      0
% 0.70/1.11  showresimp =       1
% 0.70/1.11  showstatus =       2000
% 0.70/1.11  
% 0.70/1.11  prologoutput =     1
% 0.70/1.11  nrgoals =          5000000
% 0.70/1.11  totalproof =       1
% 0.70/1.11  
% 0.70/1.11  Symbols occurring in the translation:
% 0.70/1.11  
% 0.70/1.11  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.70/1.11  .  [1, 2]      (w:1, o:21, a:1, s:1, b:0), 
% 0.70/1.11  !  [4, 1]      (w:0, o:16, a:1, s:1, b:0), 
% 0.70/1.11  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.70/1.11  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.70/1.11  compose  [41, 2]      (w:1, o:46, a:1, s:1, b:0), 
% 0.70/1.11  response  [43, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.70/1.11  a  [44, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 0.70/1.11  b  [45, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 0.70/1.11  c  [46, 0]      (w:1, o:15, a:1, s:1, b:0).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  Starting Search:
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  Bliksems!, er is een bewijs:
% 0.70/1.11  % SZS status Unsatisfiable
% 0.70/1.11  % SZS output start Refutation
% 0.70/1.11  
% 0.70/1.11  clause( 0, [ =( response( X, response( Y, Z ) ), response( compose( X, Y )
% 0.70/1.11    , Z ) ) ] )
% 0.70/1.11  .
% 0.70/1.11  clause( 1, [ =( response( a, b ), c ) ] )
% 0.70/1.11  .
% 0.70/1.11  clause( 2, [ =( response( a, c ), b ) ] )
% 0.70/1.11  .
% 0.70/1.11  clause( 3, [ ~( =( response( X, Y ), Y ) ) ] )
% 0.70/1.11  .
% 0.70/1.11  clause( 6, [ =( response( compose( X, a ), b ), response( X, c ) ) ] )
% 0.70/1.11  .
% 0.70/1.11  clause( 10, [ ~( =( response( X, c ), b ) ) ] )
% 0.70/1.11  .
% 0.70/1.11  clause( 11, [] )
% 0.70/1.11  .
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  % SZS output end Refutation
% 0.70/1.11  found a proof!
% 0.70/1.11  
% 0.70/1.11  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.11  
% 0.70/1.11  initialclauses(
% 0.70/1.11  [ clause( 13, [ =( response( compose( X, Y ), Z ), response( X, response( Y
% 0.70/1.11    , Z ) ) ) ] )
% 0.70/1.11  , clause( 14, [ =( response( a, b ), c ) ] )
% 0.70/1.11  , clause( 15, [ =( response( a, c ), b ) ] )
% 0.70/1.11  , clause( 16, [ ~( =( response( X, Y ), Y ) ) ] )
% 0.70/1.11  ] ).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  eqswap(
% 0.70/1.11  clause( 17, [ =( response( X, response( Y, Z ) ), response( compose( X, Y )
% 0.70/1.11    , Z ) ) ] )
% 0.70/1.11  , clause( 13, [ =( response( compose( X, Y ), Z ), response( X, response( Y
% 0.70/1.11    , Z ) ) ) ] )
% 0.70/1.11  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  subsumption(
% 0.70/1.11  clause( 0, [ =( response( X, response( Y, Z ) ), response( compose( X, Y )
% 0.70/1.11    , Z ) ) ] )
% 0.70/1.11  , clause( 17, [ =( response( X, response( Y, Z ) ), response( compose( X, Y
% 0.70/1.11     ), Z ) ) ] )
% 0.70/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.70/1.11    permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  subsumption(
% 0.70/1.11  clause( 1, [ =( response( a, b ), c ) ] )
% 0.70/1.11  , clause( 14, [ =( response( a, b ), c ) ] )
% 0.70/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  subsumption(
% 0.70/1.11  clause( 2, [ =( response( a, c ), b ) ] )
% 0.70/1.11  , clause( 15, [ =( response( a, c ), b ) ] )
% 0.70/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  subsumption(
% 0.70/1.11  clause( 3, [ ~( =( response( X, Y ), Y ) ) ] )
% 0.70/1.11  , clause( 16, [ ~( =( response( X, Y ), Y ) ) ] )
% 0.70/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.11     )] ) ).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  eqswap(
% 0.70/1.11  clause( 28, [ =( response( compose( X, Y ), Z ), response( X, response( Y, 
% 0.70/1.11    Z ) ) ) ] )
% 0.70/1.11  , clause( 0, [ =( response( X, response( Y, Z ) ), response( compose( X, Y
% 0.70/1.11     ), Z ) ) ] )
% 0.70/1.11  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  paramod(
% 0.70/1.11  clause( 29, [ =( response( compose( X, a ), b ), response( X, c ) ) ] )
% 0.70/1.11  , clause( 1, [ =( response( a, b ), c ) ] )
% 0.70/1.11  , 0, clause( 28, [ =( response( compose( X, Y ), Z ), response( X, response( 
% 0.70/1.11    Y, Z ) ) ) ] )
% 0.70/1.11  , 0, 8, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, a ), 
% 0.70/1.11    :=( Z, b )] )).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  subsumption(
% 0.70/1.11  clause( 6, [ =( response( compose( X, a ), b ), response( X, c ) ) ] )
% 0.70/1.11  , clause( 29, [ =( response( compose( X, a ), b ), response( X, c ) ) ] )
% 0.70/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  eqswap(
% 0.70/1.11  clause( 32, [ ~( =( Y, response( X, Y ) ) ) ] )
% 0.70/1.11  , clause( 3, [ ~( =( response( X, Y ), Y ) ) ] )
% 0.70/1.11  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  paramod(
% 0.70/1.11  clause( 33, [ ~( =( b, response( X, c ) ) ) ] )
% 0.70/1.11  , clause( 6, [ =( response( compose( X, a ), b ), response( X, c ) ) ] )
% 0.70/1.11  , 0, clause( 32, [ ~( =( Y, response( X, Y ) ) ) ] )
% 0.70/1.11  , 0, 3, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, compose( 
% 0.70/1.11    X, a ) ), :=( Y, b )] )).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  eqswap(
% 0.70/1.11  clause( 34, [ ~( =( response( X, c ), b ) ) ] )
% 0.70/1.11  , clause( 33, [ ~( =( b, response( X, c ) ) ) ] )
% 0.70/1.11  , 0, substitution( 0, [ :=( X, X )] )).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  subsumption(
% 0.70/1.11  clause( 10, [ ~( =( response( X, c ), b ) ) ] )
% 0.70/1.11  , clause( 34, [ ~( =( response( X, c ), b ) ) ] )
% 0.70/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  eqswap(
% 0.70/1.11  clause( 35, [ ~( =( b, response( X, c ) ) ) ] )
% 0.70/1.11  , clause( 10, [ ~( =( response( X, c ), b ) ) ] )
% 0.70/1.11  , 0, substitution( 0, [ :=( X, X )] )).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  eqswap(
% 0.70/1.11  clause( 36, [ =( b, response( a, c ) ) ] )
% 0.70/1.11  , clause( 2, [ =( response( a, c ), b ) ] )
% 0.70/1.11  , 0, substitution( 0, [] )).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  resolution(
% 0.70/1.11  clause( 37, [] )
% 0.70/1.11  , clause( 35, [ ~( =( b, response( X, c ) ) ) ] )
% 0.70/1.11  , 0, clause( 36, [ =( b, response( a, c ) ) ] )
% 0.70/1.11  , 0, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  subsumption(
% 0.70/1.11  clause( 11, [] )
% 0.70/1.11  , clause( 37, [] )
% 0.70/1.11  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  end.
% 0.70/1.11  
% 0.70/1.11  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.11  
% 0.70/1.11  Memory use:
% 0.70/1.11  
% 0.70/1.11  space for terms:        171
% 0.70/1.11  space for clauses:      1042
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  clauses generated:      31
% 0.70/1.11  clauses kept:           12
% 0.70/1.11  clauses selected:       9
% 0.70/1.11  clauses deleted:        0
% 0.70/1.11  clauses inuse deleted:  0
% 0.70/1.11  
% 0.70/1.11  subsentry:          88
% 0.70/1.11  literals s-matched: 42
% 0.70/1.11  literals matched:   42
% 0.70/1.11  full subsumption:   0
% 0.70/1.11  
% 0.70/1.11  checksum:           -1921909740
% 0.70/1.11  
% 0.70/1.11  
% 0.70/1.11  Bliksem ended
%------------------------------------------------------------------------------