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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : COL083-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n022.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:37 EDT 2022

% Result   : Unsatisfiable 0.41s 1.05s
% Output   : Refutation 0.41s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : COL083-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12  % Command  : bliksem %s
% 0.12/0.32  % Computer : n022.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % DateTime : Tue May 31 09:27:22 EDT 2022
% 0.18/0.32  % CPUTime  : 
% 0.41/1.05  *** allocated 10000 integers for termspace/termends
% 0.41/1.05  *** allocated 10000 integers for clauses
% 0.41/1.05  *** allocated 10000 integers for justifications
% 0.41/1.05  Bliksem 1.12
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  Automatic Strategy Selection
% 0.41/1.05  
% 0.41/1.05  Clauses:
% 0.41/1.05  [
% 0.41/1.05     [ =( response( 'mocking_bird', X ), response( X, X ) ) ],
% 0.41/1.05     [ =( response( compose( X, Y ), Z ), response( X, response( Y, Z ) ) ) ]
% 0.41/1.05    ,
% 0.41/1.05     [ ~( =( response( a, X ), Y ) ) ]
% 0.41/1.05  ] .
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  percentage equality = 1.000000, percentage horn = 1.000000
% 0.41/1.05  This is a pure equality problem
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  Options Used:
% 0.41/1.05  
% 0.41/1.05  useres =            1
% 0.41/1.05  useparamod =        1
% 0.41/1.05  useeqrefl =         1
% 0.41/1.05  useeqfact =         1
% 0.41/1.05  usefactor =         1
% 0.41/1.05  usesimpsplitting =  0
% 0.41/1.05  usesimpdemod =      5
% 0.41/1.05  usesimpres =        3
% 0.41/1.05  
% 0.41/1.05  resimpinuse      =  1000
% 0.41/1.05  resimpclauses =     20000
% 0.41/1.05  substype =          eqrewr
% 0.41/1.05  backwardsubs =      1
% 0.41/1.05  selectoldest =      5
% 0.41/1.05  
% 0.41/1.05  litorderings [0] =  split
% 0.41/1.05  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.41/1.05  
% 0.41/1.05  termordering =      kbo
% 0.41/1.05  
% 0.41/1.05  litapriori =        0
% 0.41/1.05  termapriori =       1
% 0.41/1.05  litaposteriori =    0
% 0.41/1.05  termaposteriori =   0
% 0.41/1.05  demodaposteriori =  0
% 0.41/1.05  ordereqreflfact =   0
% 0.41/1.05  
% 0.41/1.05  litselect =         negord
% 0.41/1.05  
% 0.41/1.05  maxweight =         15
% 0.41/1.05  maxdepth =          30000
% 0.41/1.05  maxlength =         115
% 0.41/1.05  maxnrvars =         195
% 0.41/1.05  excuselevel =       1
% 0.41/1.05  increasemaxweight = 1
% 0.41/1.05  
% 0.41/1.05  maxselected =       10000000
% 0.41/1.05  maxnrclauses =      10000000
% 0.41/1.05  
% 0.41/1.05  showgenerated =    0
% 0.41/1.05  showkept =         0
% 0.41/1.05  showselected =     0
% 0.41/1.05  showdeleted =      0
% 0.41/1.05  showresimp =       1
% 0.41/1.05  showstatus =       2000
% 0.41/1.05  
% 0.41/1.05  prologoutput =     1
% 0.41/1.05  nrgoals =          5000000
% 0.41/1.05  totalproof =       1
% 0.41/1.05  
% 0.41/1.05  Symbols occurring in the translation:
% 0.41/1.05  
% 0.41/1.05  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.41/1.05  .  [1, 2]      (w:1, o:19, a:1, s:1, b:0), 
% 0.41/1.05  !  [4, 1]      (w:0, o:14, a:1, s:1, b:0), 
% 0.41/1.05  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.41/1.05  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.41/1.05  'mocking_bird'  [39, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 0.41/1.05  response  [41, 2]      (w:1, o:44, a:1, s:1, b:0), 
% 0.41/1.05  compose  [43, 2]      (w:1, o:45, a:1, s:1, b:0), 
% 0.41/1.05  a  [45, 0]      (w:1, o:13, a:1, s:1, b:0).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  Starting Search:
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  Bliksems!, er is een bewijs:
% 0.41/1.05  % SZS status Unsatisfiable
% 0.41/1.05  % SZS output start Refutation
% 0.41/1.05  
% 0.41/1.05  clause( 2, [ ~( =( response( a, X ), Y ) ) ] )
% 0.41/1.05  .
% 0.41/1.05  clause( 3, [] )
% 0.41/1.05  .
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  % SZS output end Refutation
% 0.41/1.05  found a proof!
% 0.41/1.05  
% 0.41/1.05  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.41/1.05  
% 0.41/1.05  initialclauses(
% 0.41/1.05  [ clause( 5, [ =( response( 'mocking_bird', X ), response( X, X ) ) ] )
% 0.41/1.05  , clause( 6, [ =( response( compose( X, Y ), Z ), response( X, response( Y
% 0.41/1.05    , Z ) ) ) ] )
% 0.41/1.05  , clause( 7, [ ~( =( response( a, X ), Y ) ) ] )
% 0.41/1.05  ] ).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  subsumption(
% 0.41/1.05  clause( 2, [ ~( =( response( a, X ), Y ) ) ] )
% 0.41/1.05  , clause( 7, [ ~( =( response( a, X ), Y ) ) ] )
% 0.41/1.05  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.41/1.05     )] ) ).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  eqswap(
% 0.41/1.05  clause( 11, [ ~( =( Y, response( a, X ) ) ) ] )
% 0.41/1.05  , clause( 2, [ ~( =( response( a, X ), Y ) ) ] )
% 0.41/1.05  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  eqrefl(
% 0.41/1.05  clause( 12, [] )
% 0.41/1.05  , clause( 11, [ ~( =( Y, response( a, X ) ) ) ] )
% 0.41/1.05  , 0, substitution( 0, [ :=( X, X ), :=( Y, response( a, X ) )] )).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  subsumption(
% 0.41/1.05  clause( 3, [] )
% 0.41/1.05  , clause( 12, [] )
% 0.41/1.05  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  end.
% 0.41/1.05  
% 0.41/1.05  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.41/1.05  
% 0.41/1.05  Memory use:
% 0.41/1.05  
% 0.41/1.05  space for terms:        91
% 0.41/1.05  space for clauses:      342
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  clauses generated:      4
% 0.41/1.05  clauses kept:           4
% 0.41/1.05  clauses selected:       0
% 0.41/1.05  clauses deleted:        0
% 0.41/1.05  clauses inuse deleted:  0
% 0.41/1.05  
% 0.41/1.05  subsentry:          21
% 0.41/1.05  literals s-matched: 10
% 0.41/1.05  literals matched:   10
% 0.41/1.05  full subsumption:   0
% 0.41/1.05  
% 0.41/1.05  checksum:           426812
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  Bliksem ended
%------------------------------------------------------------------------------