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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : HEN012-3 : 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:14 EDT 2022

% Result   : Unsatisfiable 0.40s 1.06s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : -

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