↑ Up

Bliksem---1.12.UNS-Ref.s

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

% Computer : n023.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 : Thu Jul 14 23:54:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CAT014-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : bliksem %s
% 0.13/0.33  % Computer : n023.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % DateTime : Sun May 29 20:59:42 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.68/1.12  *** allocated 10000 integers for termspace/termends
% 0.68/1.12  *** allocated 10000 integers for clauses
% 0.68/1.12  *** allocated 10000 integers for justifications
% 0.68/1.12  Bliksem 1.12
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  Automatic Strategy Selection
% 0.68/1.12  
% 0.68/1.12  Clauses:
% 0.68/1.12  [
% 0.68/1.12     [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ],
% 0.68/1.12     [ ~( equivalent( X, Y ) ), =( X, Y ) ],
% 0.68/1.12     [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y ) ],
% 0.68/1.12     [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ],
% 0.68/1.12     [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ],
% 0.68/1.12     [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain( X ) )
% 0.68/1.12     ],
% 0.68/1.12     [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), codomain( Y )
% 0.68/1.12     ) ],
% 0.68/1.12     [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ), codomain( Y ) )
% 0.68/1.12     ), 'there_exists'( compose( X, Y ) ) ],
% 0.68/1.12     [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y ), Z ) ) ]
% 0.68/1.12    ,
% 0.68/1.12     [ =( compose( X, domain( X ) ), X ) ],
% 0.68/1.12     [ =( compose( codomain( X ), X ), X ) ],
% 0.68/1.12     [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ],
% 0.68/1.12     [ ~( 'there_exists'( X ) ), ~( 'there_exists'( Y ) ), ~( =( X, Y ) ), 
% 0.68/1.12    equivalent( X, Y ) ],
% 0.68/1.12     [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( codomain( X )
% 0.68/1.12     ) ],
% 0.68/1.12     [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ],
% 0.68/1.12     [ =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ), =( X, Y ) ],
% 0.68/1.12     [ ~( =( X, f1( X, Y ) ) ), ~( =( Y, f1( X, Y ) ) ), =( X, Y ) ],
% 0.68/1.12     [ 'there_exists'( codomain( a ) ) ],
% 0.68/1.12     [ ~( =( codomain( codomain( a ) ), codomain( a ) ) ) ]
% 0.68/1.12  ] .
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  percentage equality = 0.428571, percentage horn = 0.888889
% 0.68/1.12  This is a problem with some equality
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  Options Used:
% 0.68/1.12  
% 0.68/1.12  useres =            1
% 0.68/1.12  useparamod =        1
% 0.68/1.12  useeqrefl =         1
% 0.68/1.12  useeqfact =         1
% 0.68/1.12  usefactor =         1
% 0.68/1.12  usesimpsplitting =  0
% 0.68/1.12  usesimpdemod =      5
% 0.68/1.12  usesimpres =        3
% 0.68/1.12  
% 0.68/1.12  resimpinuse      =  1000
% 0.68/1.12  resimpclauses =     20000
% 0.68/1.12  substype =          eqrewr
% 0.68/1.12  backwardsubs =      1
% 0.68/1.12  selectoldest =      5
% 0.68/1.12  
% 0.68/1.12  litorderings [0] =  split
% 0.68/1.12  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.68/1.12  
% 0.68/1.12  termordering =      kbo
% 0.68/1.12  
% 0.68/1.12  litapriori =        0
% 0.68/1.12  termapriori =       1
% 0.68/1.12  litaposteriori =    0
% 0.68/1.12  termaposteriori =   0
% 0.68/1.12  demodaposteriori =  0
% 0.68/1.12  ordereqreflfact =   0
% 0.68/1.12  
% 0.68/1.12  litselect =         negord
% 0.68/1.12  
% 0.68/1.12  maxweight =         15
% 0.68/1.12  maxdepth =          30000
% 0.68/1.12  maxlength =         115
% 0.68/1.12  maxnrvars =         195
% 0.68/1.12  excuselevel =       1
% 0.68/1.12  increasemaxweight = 1
% 0.68/1.12  
% 0.68/1.12  maxselected =       10000000
% 0.68/1.12  maxnrclauses =      10000000
% 0.68/1.12  
% 0.68/1.12  showgenerated =    0
% 0.68/1.12  showkept =         0
% 0.68/1.12  showselected =     0
% 0.68/1.12  showdeleted =      0
% 0.68/1.12  showresimp =       1
% 0.68/1.12  showstatus =       2000
% 0.68/1.12  
% 0.68/1.12  prologoutput =     1
% 0.68/1.12  nrgoals =          5000000
% 0.68/1.12  totalproof =       1
% 0.68/1.12  
% 0.68/1.12  Symbols occurring in the translation:
% 0.68/1.12  
% 0.68/1.12  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.68/1.12  .  [1, 2]      (w:1, o:21, a:1, s:1, b:0), 
% 0.68/1.12  !  [4, 1]      (w:0, o:13, a:1, s:1, b:0), 
% 0.68/1.12  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.68/1.12  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.68/1.12  equivalent  [41, 2]      (w:1, o:46, a:1, s:1, b:0), 
% 0.68/1.12  'there_exists'  [42, 1]      (w:1, o:18, a:1, s:1, b:0), 
% 0.68/1.12  domain  [43, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.68/1.12  codomain  [44, 1]      (w:1, o:19, a:1, s:1, b:0), 
% 0.68/1.12  compose  [45, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.68/1.12  f1  [47, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.68/1.12  a  [48, 0]      (w:1, o:12, a:1, s:1, b:0).
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  Starting Search:
% 0.68/1.12  
% 0.68/1.12  Resimplifying inuse:
% 0.68/1.12  Done
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  Bliksems!, er is een bewijs:
% 0.68/1.12  % SZS status Unsatisfiable
% 0.68/1.12  % SZS output start Refutation
% 0.68/1.12  
% 0.68/1.12  clause( 3, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 4, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), 
% 0.68/1.12    codomain( Y ) ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 9, [ =( compose( X, domain( X ) ), X ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 10, [ =( compose( codomain( X ), X ), X ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 13, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 14, [ =( f1( X, Y ), X ), =( f1( X, Y ), Y ), =( X, Y ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 15, [ ~( =( f1( X, Y ), X ) ), ~( =( f1( X, Y ), Y ) ), =( X, Y ) ]
% 0.68/1.12     )
% 0.68/1.12  .
% 0.68/1.12  clause( 16, [ 'there_exists'( codomain( a ) ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 17, [ ~( =( codomain( codomain( a ) ), codomain( a ) ) ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 19, [ ~( =( X, Y ) ), =( f1( Y, X ), Y ), =( Y, X ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 31, [ 'there_exists'( a ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 544, [ 'there_exists'( X ), =( X, Y ), =( f1( X, Y ), Y ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 607, [ 'there_exists'( X ), =( f1( X, codomain( a ) ), X ), =( f1( 
% 0.68/1.12    X, codomain( a ) ), codomain( a ) ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 609, [ 'there_exists'( X ), =( f1( X, codomain( a ) ), codomain( a
% 0.68/1.12     ) ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 753, [ ~( =( Z, X ) ), ~( =( Z, Y ) ), =( X, Y ), ~( =( f1( Z, f1( 
% 0.68/1.12    X, Y ) ), Z ) ), ~( =( f1( Z, f1( X, Y ) ), f1( X, Y ) ) ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 830, [ 'there_exists'( X ), ~( =( codomain( a ), X ) ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 832, [ ~( =( X, Y ) ), =( Y, X ), ~( =( X, Y ) ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 833, [ ~( =( X, Y ) ), =( Y, X ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 883, [ =( compose( X, Y ), X ), ~( =( Y, domain( X ) ) ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 973, [ ~( =( domain( X ), codomain( a ) ) ), ~( 'there_exists'( X )
% 0.68/1.12     ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 993, [ ~( =( codomain( a ), domain( X ) ) ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 1021, [ ~( =( codomain( a ), codomain( Y ) ) ), ~( 'there_exists'( 
% 0.68/1.12    compose( X, Y ) ) ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 1029, [ ~( 'there_exists'( compose( X, a ) ) ) ] )
% 0.68/1.12  .
% 0.68/1.12  clause( 1055, [] )
% 0.68/1.12  .
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  % SZS output end Refutation
% 0.68/1.12  found a proof!
% 0.68/1.12  
% 0.68/1.12  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.12  
% 0.68/1.12  initialclauses(
% 0.68/1.12  [ clause( 1057, [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ] )
% 0.68/1.12  , clause( 1058, [ ~( equivalent( X, Y ) ), =( X, Y ) ] )
% 0.68/1.12  , clause( 1059, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, 
% 0.68/1.12    Y ) ] )
% 0.68/1.12  , clause( 1060, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ]
% 0.68/1.12     )
% 0.68/1.12  , clause( 1061, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X )
% 0.68/1.12     ] )
% 0.68/1.12  , clause( 1062, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( 
% 0.68/1.12    domain( X ) ) ] )
% 0.68/1.12  , clause( 1063, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), 
% 0.68/1.12    codomain( Y ) ) ] )
% 0.68/1.12  , clause( 1064, [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ), 
% 0.68/1.12    codomain( Y ) ) ), 'there_exists'( compose( X, Y ) ) ] )
% 0.68/1.12  , clause( 1065, [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y
% 0.68/1.12     ), Z ) ) ] )
% 0.68/1.12  , clause( 1066, [ =( compose( X, domain( X ) ), X ) ] )
% 0.68/1.12  , clause( 1067, [ =( compose( codomain( X ), X ), X ) ] )
% 0.68/1.12  , clause( 1068, [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ] )
% 0.68/1.12  , clause( 1069, [ ~( 'there_exists'( X ) ), ~( 'there_exists'( Y ) ), ~( 
% 0.68/1.12    =( X, Y ) ), equivalent( X, Y ) ] )
% 0.68/1.12  , clause( 1070, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( 
% 0.68/1.12    codomain( X ) ) ] )
% 0.68/1.12  , clause( 1071, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.68/1.12  , clause( 1072, [ =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ), =( X, Y ) ] )
% 0.68/1.12  , clause( 1073, [ ~( =( X, f1( X, Y ) ) ), ~( =( Y, f1( X, Y ) ) ), =( X, Y
% 0.68/1.12     ) ] )
% 0.68/1.12  , clause( 1074, [ 'there_exists'( codomain( a ) ) ] )
% 0.68/1.12  , clause( 1075, [ ~( =( codomain( codomain( a ) ), codomain( a ) ) ) ] )
% 0.68/1.12  ] ).
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  subsumption(
% 0.68/1.12  clause( 3, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ] )
% 0.68/1.12  , clause( 1060, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ]
% 0.68/1.12     )
% 0.68/1.12  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.68/1.12    1 )] ) ).
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  subsumption(
% 0.68/1.12  clause( 4, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ] )
% 0.68/1.12  , clause( 1061, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X )
% 0.68/1.12     ] )
% 0.68/1.12  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.68/1.12    1 )] ) ).
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  subsumption(
% 0.68/1.12  clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), 
% 0.68/1.12    codomain( Y ) ) ] )
% 0.68/1.12  , clause( 1063, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), 
% 0.68/1.12    codomain( Y ) ) ] )
% 0.68/1.12  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.68/1.12     ), ==>( 1, 1 )] ) ).
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  subsumption(
% 0.68/1.12  clause( 9, [ =( compose( X, domain( X ) ), X ) ] )
% 0.68/1.12  , clause( 1066, [ =( compose( X, domain( X ) ), X ) ] )
% 0.68/1.12  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  subsumption(
% 0.68/1.12  clause( 10, [ =( compose( codomain( X ), X ), X ) ] )
% 0.68/1.12  , clause( 1067, [ =( compose( codomain( X ), X ), X ) ] )
% 0.68/1.12  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  subsumption(
% 0.68/1.12  clause( 13, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.68/1.12  , clause( 1071, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.68/1.12  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.68/1.12     ), ==>( 1, 1 )] ) ).
% 0.68/1.12  
% 0.68/1.12  
% 0.68/1.12  eqswap(
% 0.68/1.12  clauseCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------