↑ Up

Bliksem---1.12.UNS-Ref.s

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

% Computer : n027.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 12:47:00 EDT 2022

% Result   : Unsatisfiable 0.74s 1.10s
% Output   : Refutation 0.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : HEN003-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : bliksem %s
% 0.14/0.34  % Computer : n027.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % DateTime : Fri Jul  1 14:31:52 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.74/1.10  *** allocated 10000 integers for termspace/termends
% 0.74/1.10  *** allocated 10000 integers for clauses
% 0.74/1.10  *** allocated 10000 integers for justifications
% 0.74/1.10  Bliksem 1.12
% 0.74/1.10  
% 0.74/1.10  
% 0.74/1.10  Automatic Strategy Selection
% 0.74/1.10  
% 0.74/1.10  Clauses:
% 0.74/1.10  [
% 0.74/1.10     [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ],
% 0.74/1.10     [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ],
% 0.74/1.10     [ 'less_equal'( divide( X, Y ), X ) ],
% 0.74/1.10     [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( divide( 
% 0.74/1.10    X, Z ), Y ) ) ],
% 0.74/1.10     [ 'less_equal'( zero, X ) ],
% 0.74/1.10     [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y ) ],
% 0.74/1.10     [ 'less_equal'( X, identity ) ],
% 0.74/1.10     [ ~( =( divide( a, a ), zero ) ) ]
% 0.74/1.10  ] .
% 0.74/1.10  
% 0.74/1.10  
% 0.74/1.10  percentage equality = 0.333333, percentage horn = 1.000000
% 0.74/1.10  This is a problem with some equality
% 0.74/1.10  
% 0.74/1.10  
% 0.74/1.10  
% 0.74/1.10  Options Used:
% 0.74/1.10  
% 0.74/1.10  useres =            1
% 0.74/1.10  useparamod =        1
% 0.74/1.10  useeqrefl =         1
% 0.74/1.10  useeqfact =         1
% 0.74/1.10  usefactor =         1
% 0.74/1.10  usesimpsplitting =  0
% 0.74/1.10  usesimpdemod =      5
% 0.74/1.10  usesimpres =        3
% 0.74/1.10  
% 0.74/1.10  resimpinuse      =  1000
% 0.74/1.10  resimpclauses =     20000
% 0.74/1.10  substype =          eqrewr
% 0.74/1.10  backwardsubs =      1
% 0.74/1.10  selectoldest =      5
% 0.74/1.10  
% 0.74/1.10  litorderings [0] =  split
% 0.74/1.10  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.74/1.10  
% 0.74/1.10  termordering =      kbo
% 0.74/1.10  
% 0.74/1.10  litapriori =        0
% 0.74/1.10  termapriori =       1
% 0.74/1.10  litaposteriori =    0
% 0.74/1.10  termaposteriori =   0
% 0.74/1.10  demodaposteriori =  0
% 0.74/1.10  ordereqreflfact =   0
% 0.74/1.10  
% 0.74/1.10  litselect =         negord
% 0.74/1.10  
% 0.74/1.10  maxweight =         15
% 0.74/1.10  maxdepth =          30000
% 0.74/1.10  maxlength =         115
% 0.74/1.10  maxnrvars =         195
% 0.74/1.10  excuselevel =       1
% 0.74/1.10  increasemaxweight = 1
% 0.74/1.10  
% 0.74/1.10  maxselected =       10000000
% 0.74/1.10  maxnrclauses =      10000000
% 0.74/1.10  
% 0.74/1.10  showgenerated =    0
% 0.74/1.10  showkept =         0
% 0.74/1.10  showselected =     0
% 0.74/1.10  showdeleted =      0
% 0.74/1.10  showresimp =       1
% 0.74/1.10  showstatus =       2000
% 0.74/1.10  
% 0.74/1.10  prologoutput =     1
% 0.74/1.10  nrgoals =          5000000
% 0.74/1.10  totalproof =       1
% 0.74/1.10  
% 0.74/1.10  Symbols occurring in the translation:
% 0.74/1.10  
% 0.74/1.10  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.74/1.10  .  [1, 2]      (w:1, o:20, a:1, s:1, b:0), 
% 0.74/1.10  !  [4, 1]      (w:0, o:15, a:1, s:1, b:0), 
% 0.74/1.10  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.74/1.10  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.74/1.10  'less_equal'  [41, 2]      (w:1, o:45, a:1, s:1, b:0), 
% 0.74/1.10  divide  [42, 2]      (w:1, o:46, a:1, s:1, b:0), 
% 0.74/1.10  zero  [43, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 0.74/1.10  identity  [45, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 0.74/1.10  a  [46, 0]      (w:1, o:14, a:1, s:1, b:0).
% 0.74/1.10  
% 0.74/1.10  
% 0.74/1.10  Starting Search:
% 0.74/1.10  
% 0.74/1.10  
% 0.74/1.10  Bliksems!, er is een bewijs:
% 0.74/1.10  % SZS status Unsatisfiable
% 0.74/1.10  % SZS output start Refutation
% 0.74/1.10  
% 0.74/1.10  clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 2, [ 'less_equal'( divide( X, Y ), X ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( 
% 0.74/1.10    divide( X, Z ), Y ) ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 0.74/1.10     ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 7, [ ~( =( divide( a, a ), zero ) ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 9, [ =( divide( divide( X, Y ), X ), zero ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 13, [ 'less_equal'( divide( divide( Z, X ), zero ), divide( divide( 
% 0.74/1.10    Z, divide( X, Y ) ), X ) ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 24, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 36, [ ~( =( X, zero ) ), ~( 'less_equal'( divide( a, a ), X ) ), 
% 0.74/1.10    ~( 'less_equal'( X, divide( a, a ) ) ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 41, [ ~( 'less_equal'( divide( a, a ), zero ) ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 74, [ 'less_equal'( divide( divide( X, X ), zero ), zero ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 140, [ =( divide( divide( X, X ), zero ), zero ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 161, [ 'less_equal'( divide( X, X ), zero ) ] )
% 0.74/1.10  .
% 0.74/1.10  clause( 170, [] )
% 0.74/1.10  .
% 0.74/1.10  
% 0.74/1.10  
% 0.74/1.10  % SZS output end Refutation
% 0.74/1.10  found a proof!
% 0.74/1.10  
% 0.74/1.10  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.10  
% 0.74/1.10  initialclauses(
% 0.74/1.10  [ clause( 172, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.74/1.10  , clause( 173, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.74/1.10  , clause( 174, [ 'less_equal'( divide( X, Y ), X ) ] )
% 0.74/1.10  , clause( 175, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), 
% 0.74/1.10    divide( divide( X, Z ), Y ) ) ] )
% 0.74/1.10  , clause( 176, [ 'less_equal'( zero, X ) ] )
% 0.74/1.10  , clause( 177, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X
% 0.74/1.10    , Y ) ] )
% 0.74/1.10  , clause( 178, [ 'less_equal'( X, identity ) ] )
% 0.74/1.10  , clause( 179, [ ~( =( divide( a, Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------