↑ Up

Bliksem---1.12.UNS-Ref.s

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

% Computer : n011.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.72s 1.26s
% Output   : Refutation 0.72s
% Verified : 
% SZS Type : -

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