↑ Up

Bliksem---1.12.UNS-Ref.s

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

% Computer : n008.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.30s 1.69s
% Output   : Refutation 1.30s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : HEN006-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n008.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 14:13:08 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 1.30/1.69  *** allocated 10000 integers for termspace/termends
% 1.30/1.69  *** allocated 10000 integers for clauses
% 1.30/1.69  *** allocated 10000 integers for justifications
% 1.30/1.69  Bliksem 1.12
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  Automatic Strategy Selection
% 1.30/1.69  
% 1.30/1.69  Clauses:
% 1.30/1.69  [
% 1.30/1.69     [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ],
% 1.30/1.69     [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ],
% 1.30/1.69     [ 'less_equal'( divide( X, Y ), X ) ],
% 1.30/1.69     [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( divide( 
% 1.30/1.69    X, Z ), Y ) ) ],
% 1.30/1.69     [ 'less_equal'( zero, X ) ],
% 1.30/1.69     [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y ) ],
% 1.30/1.69     [ 'less_equal'( X, identity ) ],
% 1.30/1.69     [ 'less_equal'( divide( a, b ), d ) ],
% 1.30/1.69     [ ~( 'less_equal'( divide( a, d ), b ) ) ]
% 1.30/1.69  ] .
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  percentage equality = 0.230769, percentage horn = 1.000000
% 1.30/1.69  This is a problem with some equality
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  Options Used:
% 1.30/1.69  
% 1.30/1.69  useres =            1
% 1.30/1.69  useparamod =        1
% 1.30/1.69  useeqrefl =         1
% 1.30/1.69  useeqfact =         1
% 1.30/1.69  usefactor =         1
% 1.30/1.69  usesimpsplitting =  0
% 1.30/1.69  usesimpdemod =      5
% 1.30/1.69  usesimpres =        3
% 1.30/1.69  
% 1.30/1.69  resimpinuse      =  1000
% 1.30/1.69  resimpclauses =     20000
% 1.30/1.69  substype =          eqrewr
% 1.30/1.69  backwardsubs =      1
% 1.30/1.69  selectoldest =      5
% 1.30/1.69  
% 1.30/1.69  litorderings [0] =  split
% 1.30/1.69  litorderings [1] =  extend the termordering, first sorting on arguments
% 1.30/1.69  
% 1.30/1.69  termordering =      kbo
% 1.30/1.69  
% 1.30/1.69  litapriori =        0
% 1.30/1.69  termapriori =       1
% 1.30/1.69  litaposteriori =    0
% 1.30/1.69  termaposteriori =   0
% 1.30/1.69  demodaposteriori =  0
% 1.30/1.69  ordereqreflfact =   0
% 1.30/1.69  
% 1.30/1.69  litselect =         negord
% 1.30/1.69  
% 1.30/1.69  maxweight =         15
% 1.30/1.69  maxdepth =          30000
% 1.30/1.69  maxlength =         115
% 1.30/1.69  maxnrvars =         195
% 1.30/1.69  excuselevel =       1
% 1.30/1.69  increasemaxweight = 1
% 1.30/1.69  
% 1.30/1.69  maxselected =       10000000
% 1.30/1.69  maxnrclauses =      10000000
% 1.30/1.69  
% 1.30/1.69  showgenerated =    0
% 1.30/1.69  showkept =         0
% 1.30/1.69  showselected =     0
% 1.30/1.69  showdeleted =      0
% 1.30/1.69  showresimp =       1
% 1.30/1.69  showstatus =       2000
% 1.30/1.69  
% 1.30/1.69  prologoutput =     1
% 1.30/1.69  nrgoals =          5000000
% 1.30/1.69  totalproof =       1
% 1.30/1.69  
% 1.30/1.69  Symbols occurring in the translation:
% 1.30/1.69  
% 1.30/1.69  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 1.30/1.69  .  [1, 2]      (w:1, o:22, a:1, s:1, b:0), 
% 1.30/1.69  !  [4, 1]      (w:0, o:17, a:1, s:1, b:0), 
% 1.30/1.69  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 1.30/1.69  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 1.30/1.69  'less_equal'  [41, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 1.30/1.69  divide  [42, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 1.30/1.69  zero  [43, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 1.30/1.69  identity  [45, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 1.30/1.69  a  [46, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 1.30/1.69  b  [47, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 1.30/1.69  d  [48, 0]      (w:1, o:16, a:1, s:1, b:0).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  Starting Search:
% 1.30/1.69  
% 1.30/1.69  Resimplifying inuse:
% 1.30/1.69  Done
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  Intermediate Status:
% 1.30/1.69  Generated:    17082
% 1.30/1.69  Kept:         2006
% 1.30/1.69  Inuse:        196
% 1.30/1.69  Deleted:      3
% 1.30/1.69  Deletedinuse: 0
% 1.30/1.69  
% 1.30/1.69  Resimplifying inuse:
% 1.30/1.69  Done
% 1.30/1.69  
% 1.30/1.69  Resimplifying inuse:
% 1.30/1.69  Done
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  Bliksems!, er is een bewijs:
% 1.30/1.69  % SZS status Unsatisfiable
% 1.30/1.69  % SZS output start Refutation
% 1.30/1.69  
% 1.30/1.69  clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 2, [ 'less_equal'( divide( X, Y ), X ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( 
% 1.30/1.69    divide( X, Z ), Y ) ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 4, [ 'less_equal'( zero, X ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 1.30/1.69     ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 7, [ 'less_equal'( divide( a, b ), d ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 8, [ ~( 'less_equal'( divide( a, d ), b ) ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 9, [ =( divide( divide( a, b ), d ), zero ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 10, [ =( divide( divide( X, Y ), X ), zero ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 11, [ =( divide( zero, X ), zero ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 15, [ ~( =( divide( divide( a, d ), b ), zero ) ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 19, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 47, [ 'less_equal'( X, Y ), ~( 'less_equal'( X, zero ) ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 51, [ ~( 'less_equal'( divide( divide( X, Y ), Z ), divide( divide( 
% 1.30/1.69    X, Z ), divide( Y, Z ) ) ) ), =( divide( divide( X, Z ), divide( Y, Z ) )
% 1.30/1.69    , divide( divide( X, Y ), Z ) ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 61, [ 'less_equal'( divide( divide( Z, X ), zero ), divide( divide( 
% 1.30/1.69    Z, divide( X, Y ) ), X ) ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 74, [ 'less_equal'( X, Y ), ~( =( divide( X, zero ), zero ) ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 261, [ ~( 'less_equal'( divide( divide( a, d ), b ), zero ) ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 803, [ 'less_equal'( X, Y ), ~( 'less_equal'( divide( X, zero ), 
% 1.30/1.69    zero ) ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 835, [ ~( 'less_equal'( divide( divide( divide( a, d ), b ), zero )
% 1.30/1.69    , zero ) ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 1780, [ =( divide( divide( a, d ), divide( b, d ) ), zero ) ] )
% 1.30/1.69  .
% 1.30/1.69  clause( 3225, [] )
% 1.30/1.69  .
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  % SZS output end Refutation
% 1.30/1.69  found a proof!
% 1.30/1.69  
% 1.30/1.69  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.30/1.69  
% 1.30/1.69  initialclauses(
% 1.30/1.69  [ clause( 3227, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 1.30/1.69  , clause( 3228, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 1.30/1.69  , clause( 3229, [ 'less_equal'( divide( X, Y ), X ) ] )
% 1.30/1.69  , clause( 3230, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), 
% 1.30/1.69    divide( divide( X, Z ), Y ) ) ] )
% 1.30/1.69  , clause( 3231, [ 'less_equal'( zero, X ) ] )
% 1.30/1.69  , clause( 3232, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( 
% 1.30/1.69    X, Y ) ] )
% 1.30/1.69  , clause( 3233, [ 'less_equal'( X, identity ) ] )
% 1.30/1.69  , clause( 3234, [ 'less_equal'( divide( a, b ), d ) ] )
% 1.30/1.69  , clause( 3235, [ ~( 'less_equal'( divide( a, d ), b ) ) ] )
% 1.30/1.69  ] ).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  subsumption(
% 1.30/1.69  clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 1.30/1.69  , clause( 3227, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 1.30/1.69  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.30/1.69     ), ==>( 1, 1 )] ) ).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  subsumption(
% 1.30/1.69  clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 1.30/1.69  , clause( 3228, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 1.30/1.69  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.30/1.69     ), ==>( 1, 1 )] ) ).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  subsumption(
% 1.30/1.69  clause( 2, [ 'less_equal'( divide( X, Y ), X ) ] )
% 1.30/1.69  , clause( 3229, [ 'less_equal'( divide( X, Y ), X ) ] )
% 1.30/1.69  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.30/1.69     )] ) ).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  subsumption(
% 1.30/1.69  clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( 
% 1.30/1.69    divide( X, Z ), Y ) ) ] )
% 1.30/1.69  , clause( 3230, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), 
% 1.30/1.69    divide( divide( X, Z ), Y ) ) ] )
% 1.30/1.69  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 1.30/1.69    permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  subsumption(
% 1.30/1.69  clause( 4, [ 'less_equal'( zero, X ) ] )
% 1.30/1.69  , clause( 3231, [ 'less_equal'( zero, X ) ] )
% 1.30/1.69  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  subsumption(
% 1.30/1.69  clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 1.30/1.69     ) ] )
% 1.30/1.69  , clause( 3232, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( 
% 1.30/1.69    X, Y ) ] )
% 1.30/1.69  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.30/1.69     ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  subsumption(
% 1.30/1.69  clause( 7, [ 'less_equal'( divide( a, b ), d ) ] )
% 1.30/1.69  , clause( 3234, [ 'less_equal'( divide( a, b ), d ) ] )
% 1.30/1.69  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  subsumption(
% 1.30/1.69  clause( 8, [ ~( 'less_equal'( divide( a, d ), b ) ) ] )
% 1.30/1.69  , clause( 3235, [ ~( 'less_equal'( divide( a, d ), b ) ) ] )
% 1.30/1.69  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  eqswap(
% 1.30/1.69  clause( 3254, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 1.30/1.69  , clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 1.30/1.69  , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  resolution(
% 1.30/1.69  clause( 3255, [ =( zero, divide( divide( a, b ), d ) ) ] )
% 1.30/1.69  , clause( 3254, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 1.30/1.69  , 1, clause( 7, [ 'less_equal'( divide( a, b ), d ) ] )
% 1.30/1.69  , 0, substitution( 0, [ :=( X, divide( a, b ) ), :=( Y, d )] ), 
% 1.30/1.69    substitution( 1, [] )).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  eqswap(
% 1.30/1.69  clause( 3256, [ =( divide( divide( a, b ), d ), zero ) ] )
% 1.30/1.69  , clause( 3255, [ =( zero, divide( divide( a, b ), d ) ) ] )
% 1.30/1.69  , 0, substitution( 0, [] )).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  subsumption(
% 1.30/1.69  clause( 9, [ =( divide( divide( a, b ), d ), zero ) ] )
% 1.30/1.69  , clause( 3256, [ =( divide( divide( a, b ), d ), zero ) ] )
% 1.30/1.69  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  eqswap(
% 1.30/1.69  clause( 3257, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 1.30/1.69  , clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 1.30/1.69  , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.30/1.69  
% 1.30/1.69  
% 1.30/1.69  resolution(
% 1.30/1.69  clause( 3258, [ =( zero, divide( divide( X, Y ), X ) ) ] )
% 1.30/1.69  , clause( 3257, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 1.30/1.69  , 1, clause( 2Cputime limit exceeded (core dumped)  (core dumped)
% 300.05/300.40  Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------