TSTP Solution File: HEN006-4 by Bliksem---1.12

View Problem - Process Solution

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

% Computer : n028.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:04 EDT 2022

% Result   : Unsatisfiable 1.47s 1.83s
% Output   : Refutation 1.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : HEN006-4 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : bliksem %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % DateTime : Fri Jul  1 14:53:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.47/1.83  *** allocated 10000 integers for termspace/termends
% 1.47/1.83  *** allocated 10000 integers for clauses
% 1.47/1.83  *** allocated 10000 integers for justifications
% 1.47/1.83  Bliksem 1.12
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  Automatic Strategy Selection
% 1.47/1.83  
% 1.47/1.83  Clauses:
% 1.47/1.83  [
% 1.47/1.83     [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ],
% 1.47/1.83     [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ],
% 1.47/1.83     [ 'less_equal'( divide( X, Y ), X ) ],
% 1.47/1.83     [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( divide( 
% 1.47/1.83    X, Z ), Y ) ) ],
% 1.47/1.83     [ 'less_equal'( zero, X ) ],
% 1.47/1.83     [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y ) ],
% 1.47/1.83     [ 'less_equal'( X, identity ) ],
% 1.47/1.83     [ =( divide( X, identity ), zero ) ],
% 1.47/1.83     [ =( divide( zero, X ), zero ) ],
% 1.47/1.83     [ =( divide( X, X ), zero ) ],
% 1.47/1.83     [ =( divide( a, zero ), a ) ],
% 1.47/1.83     [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, Z ) ), 'less_equal'( X
% 1.47/1.83    , Z ) ],
% 1.47/1.83     [ 'less_equal'( divide( a, b ), d ) ],
% 1.47/1.83     [ ~( 'less_equal'( divide( a, d ), b ) ) ]
% 1.47/1.83  ] .
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  percentage equality = 0.350000, percentage horn = 1.000000
% 1.47/1.83  This is a problem with some equality
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  Options Used:
% 1.47/1.83  
% 1.47/1.83  useres =            1
% 1.47/1.83  useparamod =        1
% 1.47/1.83  useeqrefl =         1
% 1.47/1.83  useeqfact =         1
% 1.47/1.83  usefactor =         1
% 1.47/1.83  usesimpsplitting =  0
% 1.47/1.83  usesimpdemod =      5
% 1.47/1.83  usesimpres =        3
% 1.47/1.83  
% 1.47/1.83  resimpinuse      =  1000
% 1.47/1.83  resimpclauses =     20000
% 1.47/1.83  substype =          eqrewr
% 1.47/1.83  backwardsubs =      1
% 1.47/1.83  selectoldest =      5
% 1.47/1.83  
% 1.47/1.83  litorderings [0] =  split
% 1.47/1.83  litorderings [1] =  extend the termordering, first sorting on arguments
% 1.47/1.83  
% 1.47/1.83  termordering =      kbo
% 1.47/1.83  
% 1.47/1.83  litapriori =        0
% 1.47/1.83  termapriori =       1
% 1.47/1.83  litaposteriori =    0
% 1.47/1.83  termaposteriori =   0
% 1.47/1.83  demodaposteriori =  0
% 1.47/1.83  ordereqreflfact =   0
% 1.47/1.83  
% 1.47/1.83  litselect =         negord
% 1.47/1.83  
% 1.47/1.83  maxweight =         15
% 1.47/1.83  maxdepth =          30000
% 1.47/1.83  maxlength =         115
% 1.47/1.83  maxnrvars =         195
% 1.47/1.83  excuselevel =       1
% 1.47/1.83  increasemaxweight = 1
% 1.47/1.83  
% 1.47/1.83  maxselected =       10000000
% 1.47/1.83  maxnrclauses =      10000000
% 1.47/1.83  
% 1.47/1.83  showgenerated =    0
% 1.47/1.83  showkept =         0
% 1.47/1.83  showselected =     0
% 1.47/1.83  showdeleted =      0
% 1.47/1.83  showresimp =       1
% 1.47/1.83  showstatus =       2000
% 1.47/1.83  
% 1.47/1.83  prologoutput =     1
% 1.47/1.83  nrgoals =          5000000
% 1.47/1.83  totalproof =       1
% 1.47/1.83  
% 1.47/1.83  Symbols occurring in the translation:
% 1.47/1.83  
% 1.47/1.83  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 1.47/1.83  .  [1, 2]      (w:1, o:22, a:1, s:1, b:0), 
% 1.47/1.83  !  [4, 1]      (w:0, o:17, a:1, s:1, b:0), 
% 1.47/1.83  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 1.47/1.83  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 1.47/1.83  'less_equal'  [41, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 1.47/1.83  divide  [42, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 1.47/1.83  zero  [43, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 1.47/1.83  identity  [45, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 1.47/1.83  a  [46, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 1.47/1.83  b  [47, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 1.47/1.83  d  [48, 0]      (w:1, o:16, a:1, s:1, b:0).
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  Starting Search:
% 1.47/1.83  
% 1.47/1.83  Resimplifying inuse:
% 1.47/1.83  Done
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  Intermediate Status:
% 1.47/1.83  Generated:    15003
% 1.47/1.83  Kept:         2019
% 1.47/1.83  Inuse:        198
% 1.47/1.83  Deleted:      22
% 1.47/1.83  Deletedinuse: 10
% 1.47/1.83  
% 1.47/1.83  Resimplifying inuse:
% 1.47/1.83  Done
% 1.47/1.83  
% 1.47/1.83  Resimplifying inuse:
% 1.47/1.83  Done
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  Intermediate Status:
% 1.47/1.83  Generated:    43515
% 1.47/1.83  Kept:         4023
% 1.47/1.83  Inuse:        298
% 1.47/1.83  Deleted:      41
% 1.47/1.83  Deletedinuse: 11
% 1.47/1.83  
% 1.47/1.83  Resimplifying inuse:
% 1.47/1.83  Done
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  Bliksems!, er is een bewijs:
% 1.47/1.83  % SZS status Unsatisfiable
% 1.47/1.83  % SZS output start Refutation
% 1.47/1.83  
% 1.47/1.83  clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 2, [ 'less_equal'( divide( X, Y ), X ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( 
% 1.47/1.83    divide( X, Z ), Y ) ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 4, [ 'less_equal'( zero, X ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 1.47/1.83     ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 9, [ =( divide( X, X ), zero ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 11, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, Z ) ), 
% 1.47/1.83    'less_equal'( X, Z ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 12, [ 'less_equal'( divide( a, b ), d ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 13, [ ~( 'less_equal'( divide( a, d ), b ) ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 16, [ =( divide( divide( a, b ), d ), zero ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 19, [ 'less_equal'( X, X ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 57, [ ~( =( Z, zero ) ), 'less_equal'( X, Y ), ~( 'less_equal'( 
% 1.47/1.83    divide( X, Y ), Z ) ), ~( 'less_equal'( Z, divide( X, Y ) ) ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 73, [ 'less_equal'( X, Y ), ~( 'less_equal'( divide( X, Y ), zero )
% 1.47/1.83     ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 93, [ ~( 'less_equal'( divide( divide( X, Y ), Z ), T ) ), 
% 1.47/1.83    'less_equal'( divide( divide( X, Z ), divide( Y, Z ) ), T ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 103, [ ~( 'less_equal'( X, divide( Y, Z ) ) ), 'less_equal'( X, Y )
% 1.47/1.83     ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 1059, [ ~( 'less_equal'( divide( a, d ), divide( b, X ) ) ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 1323, [ ~( 'less_equal'( divide( divide( a, d ), divide( b, X ) ), 
% 1.47/1.83    zero ) ) ] )
% 1.47/1.83  .
% 1.47/1.83  clause( 5017, [] )
% 1.47/1.83  .
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  % SZS output end Refutation
% 1.47/1.83  found a proof!
% 1.47/1.83  
% 1.47/1.83  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.47/1.83  
% 1.47/1.83  initialclauses(
% 1.47/1.83  [ clause( 5019, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 1.47/1.83  , clause( 5020, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 1.47/1.83  , clause( 5021, [ 'less_equal'( divide( X, Y ), X ) ] )
% 1.47/1.83  , clause( 5022, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), 
% 1.47/1.83    divide( divide( X, Z ), Y ) ) ] )
% 1.47/1.83  , clause( 5023, [ 'less_equal'( zero, X ) ] )
% 1.47/1.83  , clause( 5024, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( 
% 1.47/1.83    X, Y ) ] )
% 1.47/1.83  , clause( 5025, [ 'less_equal'( X, identity ) ] )
% 1.47/1.83  , clause( 5026, [ =( divide( X, identity ), zero ) ] )
% 1.47/1.83  , clause( 5027, [ =( divide( zero, X ), zero ) ] )
% 1.47/1.83  , clause( 5028, [ =( divide( X, X ), zero ) ] )
% 1.47/1.83  , clause( 5029, [ =( divide( a, zero ), a ) ] )
% 1.47/1.83  , clause( 5030, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, Z ) ), 
% 1.47/1.83    'less_equal'( X, Z ) ] )
% 1.47/1.83  , clause( 5031, [ 'less_equal'( divide( a, b ), d ) ] )
% 1.47/1.83  , clause( 5032, [ ~( 'less_equal'( divide( a, d ), b ) ) ] )
% 1.47/1.83  ] ).
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  subsumption(
% 1.47/1.83  clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 1.47/1.83  , clause( 5019, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 1.47/1.83  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.47/1.83     ), ==>( 1, 1 )] ) ).
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  subsumption(
% 1.47/1.83  clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 1.47/1.83  , clause( 5020, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 1.47/1.83  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.47/1.83     ), ==>( 1, 1 )] ) ).
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  subsumption(
% 1.47/1.83  clause( 2, [ 'less_equal'( divide( X, Y ), X ) ] )
% 1.47/1.83  , clause( 5021, [ 'less_equal'( divide( X, Y ), X ) ] )
% 1.47/1.83  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.47/1.83     )] ) ).
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  subsumption(
% 1.47/1.83  clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( 
% 1.47/1.83    divide( X, Z ), Y ) ) ] )
% 1.47/1.83  , clause( 5022, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), 
% 1.47/1.83    divide( divide( X, Z ), Y ) ) ] )
% 1.47/1.83  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 1.47/1.83    permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  subsumption(
% 1.47/1.83  clause( 4, [ 'less_equal'( zero, X ) ] )
% 1.47/1.83  , clause( 5023, [ 'less_equal'( zero, X ) ] )
% 1.47/1.83  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  subsumption(
% 1.47/1.83  clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 1.47/1.83     ) ] )
% 1.47/1.83  , clause( 5024, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( 
% 1.47/1.83    X, Y ) ] )
% 1.47/1.83  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.47/1.83     ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  subsumption(
% 1.47/1.83  clause( 9, [ =( divide( X, X ), zero ) ] )
% 1.47/1.83  , clause( 5028, [ =( divide( X, X ), zero ) ] )
% 1.47/1.83  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  subsumption(
% 1.47/1.83  clause( 11, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, Z ) ), 
% 1.47/1.83    'less_equal'( X, Z ) ] )
% 1.47/1.83  , clause( 5030, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, Z ) ), 
% 1.47/1.83    'less_equal'( X, Z ) ] )
% 1.47/1.83  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 1.47/1.83    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  subsumption(
% 1.47/1.83  clause( 12, [ 'less_equal'( divide( a, b ), d ) ] )
% 1.47/1.83  , clause( 5031, [ 'less_equal'( divide( a, b ), d ) ] )
% 1.47/1.83  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  subsumption(
% 1.47/1.83  clause( 13, [ ~( 'less_equal'( divide( a, d ), b ) ) ] )
% 1.47/1.83  , clause( 5032, [ ~( 'less_equal'( divide( a, d ), b ) ) ] )
% 1.47/1.83  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  eqswap(
% 1.47/1.83  clause( 5075, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 1.47/1.83  , clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 1.47/1.83  , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.47/1.83  
% 1.47/1.83  
% 1.47/1.83  resolution(
% 1.47/1.83  clause( 5076, [ =( zero, diCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------