TSTP Solution File: HEN005-3 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : HEN005-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n013.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:03 EDT 2022

% Result   : Unsatisfiable 0.77s 1.29s
% Output   : Refutation 0.77s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : HEN005-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n013.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 : Fri Jul  1 13:46:44 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.77/1.29  *** allocated 10000 integers for termspace/termends
% 0.77/1.29  *** allocated 10000 integers for clauses
% 0.77/1.29  *** allocated 10000 integers for justifications
% 0.77/1.29  Bliksem 1.12
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  Automatic Strategy Selection
% 0.77/1.29  
% 0.77/1.29  Clauses:
% 0.77/1.29  [
% 0.77/1.29     [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ],
% 0.77/1.29     [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ],
% 0.77/1.29     [ 'less_equal'( divide( X, Y ), X ) ],
% 0.77/1.29     [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( divide( 
% 0.77/1.29    X, Z ), Y ) ) ],
% 0.77/1.29     [ 'less_equal'( zero, X ) ],
% 0.77/1.29     [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y ) ],
% 0.77/1.29     [ 'less_equal'( X, identity ) ],
% 0.77/1.29     [ 'less_equal'( a, b ) ],
% 0.77/1.29     [ 'less_equal'( b, c ) ],
% 0.77/1.29     [ ~( 'less_equal'( a, c ) ) ]
% 0.77/1.29  ] .
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  percentage equality = 0.214286, percentage horn = 1.000000
% 0.77/1.29  This is a problem with some equality
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  Options Used:
% 0.77/1.29  
% 0.77/1.29  useres =            1
% 0.77/1.29  useparamod =        1
% 0.77/1.29  useeqrefl =         1
% 0.77/1.29  useeqfact =         1
% 0.77/1.29  usefactor =         1
% 0.77/1.29  usesimpsplitting =  0
% 0.77/1.29  usesimpdemod =      5
% 0.77/1.29  usesimpres =        3
% 0.77/1.29  
% 0.77/1.29  resimpinuse      =  1000
% 0.77/1.29  resimpclauses =     20000
% 0.77/1.29  substype =          eqrewr
% 0.77/1.29  backwardsubs =      1
% 0.77/1.29  selectoldest =      5
% 0.77/1.29  
% 0.77/1.29  litorderings [0] =  split
% 0.77/1.29  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.77/1.29  
% 0.77/1.29  termordering =      kbo
% 0.77/1.29  
% 0.77/1.29  litapriori =        0
% 0.77/1.29  termapriori =       1
% 0.77/1.29  litaposteriori =    0
% 0.77/1.29  termaposteriori =   0
% 0.77/1.29  demodaposteriori =  0
% 0.77/1.29  ordereqreflfact =   0
% 0.77/1.29  
% 0.77/1.29  litselect =         negord
% 0.77/1.29  
% 0.77/1.29  maxweight =         15
% 0.77/1.29  maxdepth =          30000
% 0.77/1.29  maxlength =         115
% 0.77/1.29  maxnrvars =         195
% 0.77/1.29  excuselevel =       1
% 0.77/1.29  increasemaxweight = 1
% 0.77/1.29  
% 0.77/1.29  maxselected =       10000000
% 0.77/1.29  maxnrclauses =      10000000
% 0.77/1.29  
% 0.77/1.29  showgenerated =    0
% 0.77/1.29  showkept =         0
% 0.77/1.29  showselected =     0
% 0.77/1.29  showdeleted =      0
% 0.77/1.29  showresimp =       1
% 0.77/1.29  showstatus =       2000
% 0.77/1.29  
% 0.77/1.29  prologoutput =     1
% 0.77/1.29  nrgoals =          5000000
% 0.77/1.29  totalproof =       1
% 0.77/1.29  
% 0.77/1.29  Symbols occurring in the translation:
% 0.77/1.29  
% 0.77/1.29  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.77/1.29  .  [1, 2]      (w:1, o:22, a:1, s:1, b:0), 
% 0.77/1.29  !  [4, 1]      (w:0, o:17, a:1, s:1, b:0), 
% 0.77/1.29  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.77/1.29  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.77/1.29  'less_equal'  [41, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.77/1.29  divide  [42, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.77/1.29  zero  [43, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 0.77/1.29  identity  [45, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 0.77/1.29  a  [46, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 0.77/1.29  b  [47, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 0.77/1.29  c  [48, 0]      (w:1, o:16, a:1, s:1, b:0).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  Starting Search:
% 0.77/1.29  
% 0.77/1.29  Resimplifying inuse:
% 0.77/1.29  Done
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  Bliksems!, er is een bewijs:
% 0.77/1.29  % SZS status Unsatisfiable
% 0.77/1.29  % SZS output start Refutation
% 0.77/1.29  
% 0.77/1.29  clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( 
% 0.77/1.29    divide( X, Z ), Y ) ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 0.77/1.29     ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 7, [ 'less_equal'( a, b ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 8, [ 'less_equal'( b, c ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 9, [ ~( 'less_equal'( a, c ) ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 10, [ =( divide( a, b ), zero ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 11, [ =( divide( b, c ), zero ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 12, [ =( divide( zero, X ), zero ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 15, [ ~( =( divide( a, c ), zero ) ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 20, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 25, [ ~( =( X, zero ) ), ~( 'less_equal'( divide( a, c ), X ) ), 
% 0.77/1.29    ~( 'less_equal'( X, divide( a, c ) ) ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 43, [ ~( 'less_equal'( divide( a, c ), zero ) ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 54, [ 'less_equal'( divide( divide( X, c ), zero ), divide( divide( 
% 0.77/1.29    X, b ), c ) ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 63, [ ~( =( divide( divide( a, c ), zero ), zero ) ) ] )
% 0.77/1.29  .
% 0.77/1.29  clause( 698, [ ~( 'less_equal'( divide( divide( a, c ), zero ), zero ) ) ]
% 0.77/1.29     )
% 0.77/1.29  .
% 0.77/1.29  clause( 1555, [] )
% 0.77/1.29  .
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  % SZS output end Refutation
% 0.77/1.29  found a proof!
% 0.77/1.29  
% 0.77/1.29  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.77/1.29  
% 0.77/1.29  initialclauses(
% 0.77/1.29  [ clause( 1557, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.77/1.29  , clause( 1558, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.77/1.29  , clause( 1559, [ 'less_equal'( divide( X, Y ), X ) ] )
% 0.77/1.29  , clause( 1560, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), 
% 0.77/1.29    divide( divide( X, Z ), Y ) ) ] )
% 0.77/1.29  , clause( 1561, [ 'less_equal'( zero, X ) ] )
% 0.77/1.29  , clause( 1562, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( 
% 0.77/1.29    X, Y ) ] )
% 0.77/1.29  , clause( 1563, [ 'less_equal'( X, identity ) ] )
% 0.77/1.29  , clause( 1564, [ 'less_equal'( a, b ) ] )
% 0.77/1.29  , clause( 1565, [ 'less_equal'( b, c ) ] )
% 0.77/1.29  , clause( 1566, [ ~( 'less_equal'( a, c ) ) ] )
% 0.77/1.29  ] ).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  subsumption(
% 0.77/1.29  clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.77/1.29  , clause( 1557, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.77/1.29  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.77/1.29     ), ==>( 1, 1 )] ) ).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  subsumption(
% 0.77/1.29  clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.77/1.29  , clause( 1558, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.77/1.29  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.77/1.29     ), ==>( 1, 1 )] ) ).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  subsumption(
% 0.77/1.29  clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( 
% 0.77/1.29    divide( X, Z ), Y ) ) ] )
% 0.77/1.29  , clause( 1560, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), 
% 0.77/1.29    divide( divide( X, Z ), Y ) ) ] )
% 0.77/1.29  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.77/1.29    permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  subsumption(
% 0.77/1.29  clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.77/1.29  , clause( 1561, [ 'less_equal'( zero, X ) ] )
% 0.77/1.29  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  subsumption(
% 0.77/1.29  clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 0.77/1.29     ) ] )
% 0.77/1.29  , clause( 1562, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( 
% 0.77/1.29    X, Y ) ] )
% 0.77/1.29  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.77/1.29     ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  subsumption(
% 0.77/1.29  clause( 7, [ 'less_equal'( a, b ) ] )
% 0.77/1.29  , clause( 1564, [ 'less_equal'( a, b ) ] )
% 0.77/1.29  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  subsumption(
% 0.77/1.29  clause( 8, [ 'less_equal'( b, c ) ] )
% 0.77/1.29  , clause( 1565, [ 'less_equal'( b, c ) ] )
% 0.77/1.29  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  subsumption(
% 0.77/1.29  clause( 9, [ ~( 'less_equal'( a, c ) ) ] )
% 0.77/1.29  , clause( 1566, [ ~( 'less_equal'( a, c ) ) ] )
% 0.77/1.29  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  eqswap(
% 0.77/1.29  clause( 1586, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.77/1.29  , clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.77/1.29  , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  resolution(
% 0.77/1.29  clause( 1587, [ =( zero, divide( a, b ) ) ] )
% 0.77/1.29  , clause( 1586, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.77/1.29  , 1, clause( 7, [ 'less_equal'( a, b ) ] )
% 0.77/1.29  , 0, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.77/1.29    ).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  eqswap(
% 0.77/1.29  clause( 1588, [ =( divide( a, b ), zero ) ] )
% 0.77/1.29  , clause( 1587, [ =( zero, divide( a, b ) ) ] )
% 0.77/1.29  , 0, substitution( 0, [] )).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  subsumption(
% 0.77/1.29  clause( 10, [ =( divide( a, b ), zero ) ] )
% 0.77/1.29  , clause( 1588, [ =( divide( a, b ), zero ) ] )
% 0.77/1.29  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  eqswap(
% 0.77/1.29  clause( 1589, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.77/1.29  , clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.77/1.29  , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  resolution(
% 0.77/1.29  clause( 1590, [ =( zero, divide( b, c ) ) ] )
% 0.77/1.29  , clause( 1589, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.77/1.29  , 1, clause( 8, [ 'less_equal'( b, c ) ] )
% 0.77/1.29  , 0, substitution( 0, [ :=( X, b ), :=( Y, c )] ), substitution( 1, [] )
% 0.77/1.29    ).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  eqswap(
% 0.77/1.29  clause( 1591, [ =( divide( b, c ), zero ) ] )
% 0.77/1.29  , clause( 1590, [ =( zero, divide( b, c ) ) ] )
% 0.77/1.29  , 0, substitution( 0, [] )).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  subsumption(
% 0.77/1.29  clause( 11, [ =( divide( b, c ), zero ) ] )
% 0.77/1.29  , clause( 1591, [ =( divide( b, c ), zero ) ] )
% 0.77/1.29  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  eqswap(
% 0.77/1.29  clause( 1592, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.77/1.29  , clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.77/1.29  , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.77/1.29  
% 0.77/1.29  
% 0.77/1.29  resolution(
% 0.77/1.29  clause( 1593, [ =( zero, divide( zero, X ) ) ] )
% 0.77/1.29  , clause( 1592, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.77/1.29  , 1, clause( 4, [ 'less_equal'( zeCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------