TSTP Solution File: HEN008-4 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : HEN008-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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:08 EDT 2022
% Result : Unsatisfiable 0.72s 1.09s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : HEN008-4 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n010.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 13:13:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.09 *** allocated 10000 integers for termspace/termends
% 0.72/1.09 *** allocated 10000 integers for clauses
% 0.72/1.09 *** allocated 10000 integers for justifications
% 0.72/1.09 Bliksem 1.12
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Automatic Strategy Selection
% 0.72/1.09
% 0.72/1.09 Clauses:
% 0.72/1.09 [
% 0.72/1.09 [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ],
% 0.72/1.09 [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ],
% 0.72/1.09 [ 'less_equal'( divide( X, Y ), X ) ],
% 0.72/1.09 [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( divide(
% 0.72/1.09 X, Z ), Y ) ) ],
% 0.72/1.09 [ 'less_equal'( zero, X ) ],
% 0.72/1.09 [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y ) ],
% 0.72/1.09 [ 'less_equal'( X, identity ) ],
% 0.72/1.09 [ =( divide( X, identity ), zero ) ],
% 0.72/1.09 [ =( divide( zero, X ), zero ) ],
% 0.72/1.09 [ =( divide( X, X ), zero ) ],
% 0.72/1.09 [ =( divide( a, zero ), a ) ],
% 0.72/1.09 [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, Z ) ), 'less_equal'( X
% 0.72/1.09 , Z ) ],
% 0.72/1.09 [ ~( 'less_equal'( divide( X, Y ), Z ) ), 'less_equal'( divide( X, Z ),
% 0.72/1.09 Y ) ],
% 0.72/1.09 [ ~( 'less_equal'( X, Y ) ), 'less_equal'( divide( Z, Y ), divide( Z, X
% 0.72/1.09 ) ) ],
% 0.72/1.09 [ 'less_equal'( a, b ) ],
% 0.72/1.09 [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ]
% 0.72/1.09 ] .
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 percentage equality = 0.291667, percentage horn = 1.000000
% 0.72/1.09 This is a problem with some equality
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Options Used:
% 0.72/1.09
% 0.72/1.09 useres = 1
% 0.72/1.09 useparamod = 1
% 0.72/1.09 useeqrefl = 1
% 0.72/1.09 useeqfact = 1
% 0.72/1.09 usefactor = 1
% 0.72/1.09 usesimpsplitting = 0
% 0.72/1.09 usesimpdemod = 5
% 0.72/1.09 usesimpres = 3
% 0.72/1.09
% 0.72/1.09 resimpinuse = 1000
% 0.72/1.09 resimpclauses = 20000
% 0.72/1.09 substype = eqrewr
% 0.72/1.09 backwardsubs = 1
% 0.72/1.09 selectoldest = 5
% 0.72/1.09
% 0.72/1.09 litorderings [0] = split
% 0.72/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.72/1.09
% 0.72/1.09 termordering = kbo
% 0.72/1.09
% 0.72/1.09 litapriori = 0
% 0.72/1.09 termapriori = 1
% 0.72/1.09 litaposteriori = 0
% 0.72/1.09 termaposteriori = 0
% 0.72/1.09 demodaposteriori = 0
% 0.72/1.09 ordereqreflfact = 0
% 0.72/1.09
% 0.72/1.09 litselect = negord
% 0.72/1.09
% 0.72/1.09 maxweight = 15
% 0.72/1.09 maxdepth = 30000
% 0.72/1.09 maxlength = 115
% 0.72/1.09 maxnrvars = 195
% 0.72/1.09 excuselevel = 1
% 0.72/1.09 increasemaxweight = 1
% 0.72/1.09
% 0.72/1.09 maxselected = 10000000
% 0.72/1.09 maxnrclauses = 10000000
% 0.72/1.09
% 0.72/1.09 showgenerated = 0
% 0.72/1.09 showkept = 0
% 0.72/1.09 showselected = 0
% 0.72/1.09 showdeleted = 0
% 0.72/1.09 showresimp = 1
% 0.72/1.09 showstatus = 2000
% 0.72/1.09
% 0.72/1.09 prologoutput = 1
% 0.72/1.09 nrgoals = 5000000
% 0.72/1.09 totalproof = 1
% 0.72/1.09
% 0.72/1.09 Symbols occurring in the translation:
% 0.72/1.09
% 0.72/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.09 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.72/1.09 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.72/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.09 'less_equal' [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.72/1.09 divide [42, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.72/1.09 zero [43, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.72/1.09 identity [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.72/1.09 a [46, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.72/1.09 b [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.72/1.09 c [48, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Starting Search:
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Bliksems!, er is een bewijs:
% 0.72/1.09 % SZS status Unsatisfiable
% 0.72/1.09 % SZS output start Refutation
% 0.72/1.09
% 0.72/1.09 clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.72/1.09 .
% 0.72/1.09 clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.72/1.09 .
% 0.72/1.09 clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide(
% 0.72/1.09 divide( X, Z ), Y ) ) ] )
% 0.72/1.09 .
% 0.72/1.09 clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.72/1.09 .
% 0.72/1.09 clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 0.72/1.09 ) ] )
% 0.72/1.09 .
% 0.72/1.09 clause( 8, [ =( divide( zero, X ), zero ) ] )
% 0.72/1.09 .
% 0.72/1.09 clause( 14, [ 'less_equal'( a, b ) ] )
% 0.72/1.09 .
% 0.72/1.09 clause( 15, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.72/1.09 .
% 0.72/1.09 clause( 17, [ =( divide( a, b ), zero ) ] )
% 0.72/1.09 .
% 0.72/1.09 clause( 26, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ), zero
% 0.72/1.09 ) ] )
% 0.72/1.09 .
% 0.72/1.09 clause( 34, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ] )
% 0.72/1.09 .
% 0.72/1.09 clause( 44, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.72/1.09 .
% 0.72/1.09 clause( 318, [ =( divide( divide( a, X ), divide( b, X ) ), zero ) ] )
% 0.72/1.09 .
% 0.72/1.09 clause( 527, [] )
% 0.72/1.09 .
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 % SZS output end Refutation
% 0.72/1.09 found a proof!
% 0.72/1.09
% 0.72/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.72/1.09
% 0.72/1.09 initialclauses(
% 0.72/1.09 [ clause( 529, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.72/1.09 , clause( 530, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.72/1.09 , clause( 531, [ 'less_equal'( divide( X, Y ), X ) ] )
% 0.72/1.09 , clause( 532, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ),
% 0.72/1.09 divide( divide( X, Z ), Y ) ) ] )
% 0.72/1.09 , clause( 533, [ 'less_equal'( zero, X ) ] )
% 0.72/1.09 , clause( 534, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X
% 0.72/1.09 , Y ) ] )
% 0.72/1.09 , clause( 535, [ 'less_equal'( X, identity ) ] )
% 0.72/1.09 , clause( 536, [ =( divide( X, identity ), zero ) ] )
% 0.72/1.09 , clause( 537, [ =( divide( zero, X ), zero ) ] )
% 0.72/1.09 , clause( 538, [ =( divide( X, X ), zero ) ] )
% 0.72/1.09 , clause( 539, [ =( divide( a, zero ), a ) ] )
% 0.72/1.09 , clause( 540, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, Z ) ),
% 0.72/1.09 'less_equal'( X, Z ) ] )
% 0.72/1.09 , clause( 541, [ ~( 'less_equal'( divide( X, Y ), Z ) ), 'less_equal'(
% 0.72/1.09 divide( X, Z ), Y ) ] )
% 0.72/1.09 , clause( 542, [ ~( 'less_equal'( X, Y ) ), 'less_equal'( divide( Z, Y ),
% 0.72/1.09 divide( Z, X ) ) ] )
% 0.72/1.09 , clause( 543, [ 'less_equal'( a, b ) ] )
% 0.72/1.09 , clause( 544, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.72/1.09 ] ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.72/1.09 , clause( 529, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.72/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.09 ), ==>( 1, 1 )] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.72/1.09 , clause( 530, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.72/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.09 ), ==>( 1, 1 )] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide(
% 0.72/1.09 divide( X, Z ), Y ) ) ] )
% 0.72/1.09 , clause( 532, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ),
% 0.72/1.09 divide( divide( X, Z ), Y ) ) ] )
% 0.72/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.72/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.72/1.09 , clause( 533, [ 'less_equal'( zero, X ) ] )
% 0.72/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 0.72/1.09 ) ] )
% 0.72/1.09 , clause( 534, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X
% 0.72/1.09 , Y ) ] )
% 0.72/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.09 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 8, [ =( divide( zero, X ), zero ) ] )
% 0.72/1.09 , clause( 537, [ =( divide( zero, X ), zero ) ] )
% 0.72/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 14, [ 'less_equal'( a, b ) ] )
% 0.72/1.09 , clause( 543, [ 'less_equal'( a, b ) ] )
% 0.72/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 15, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.72/1.09 , clause( 544, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.72/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 eqswap(
% 0.72/1.09 clause( 576, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.72/1.09 , clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.72/1.09 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 resolution(
% 0.72/1.09 clause( 577, [ =( zero, divide( a, b ) ) ] )
% 0.72/1.09 , clause( 576, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.72/1.09 , 1, clause( 14, [ 'less_equal'( a, b ) ] )
% 0.72/1.09 , 0, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.72/1.09 ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 eqswap(
% 0.72/1.09 clause( 578, [ =( divide( a, b ), zero ) ] )
% 0.72/1.09 , clause( 577, [ =( zero, divide( a, b ) ) ] )
% 0.72/1.09 , 0, substitution( 0, [] )).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 17, [ =( divide( a, b ), zero ) ] )
% 0.72/1.09 , clause( 578, [ =( divide( a, b ), zero ) ] )
% 0.72/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 paramod(
% 0.72/1.09 clause( 583, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ),
% 0.72/1.09 divide( zero, X ) ) ] )
% 0.72/1.09 , clause( 17, [ =( divide( a, b ), zero ) ] )
% 0.72/1.09 , 0, clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ),
% 0.72/1.09 divide( divide( X, Z ), Y ) ) ] )
% 0.72/1.09 , 0, 9, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, X ),
% 0.72/1.09 :=( Z, b )] )).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 paramod(
% 0.72/1.09 clause( 584, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ), zero
% 0.72/1.09 ) ] )
% 0.72/1.09 , clause( 8, [ =( divide( zero, X ), zero ) ] )
% 0.72/1.09 , 0, clause( 583, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) )
% 0.72/1.09 , divide( zero, X ) ) ] )
% 0.72/1.09 , 0, 8, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.72/1.09 ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 26, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ), zero
% 0.72/1.09 ) ] )
% 0.72/1.09 , clause( 584, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ),
% 0.72/1.09 zero ) ] )
% 0.72/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 eqswap(
% 0.72/1.09 clause( 585, [ ~( =( zero, divide( X, Y ) ) ), 'less_equal'( X, Y ) ] )
% 0.72/1.09 , clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.72/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 resolution(
% 0.72/1.09 clause( 586, [ ~( =( zero, divide( divide( a, c ), divide( b, c ) ) ) ) ]
% 0.72/1.09 )
% 0.72/1.09 , clause( 15, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.72/1.09 , 0, clause( 585, [ ~( =( zero, divide( X, Y ) ) ), 'less_equal'( X, Y ) ]
% 0.72/1.09 )
% 0.72/1.09 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, divide( a, c ) ),
% 0.72/1.09 :=( Y, divide( b, c ) )] )).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 eqswap(
% 0.72/1.09 clause( 587, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ]
% 0.72/1.09 )
% 0.72/1.09 , clause( 586, [ ~( =( zero, divide( divide( a, c ), divide( b, c ) ) ) ) ]
% 0.72/1.09 )
% 0.72/1.09 , 0, substitution( 0, [] )).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 34, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ] )
% 0.72/1.09 , clause( 587, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ]
% 0.72/1.09 )
% 0.72/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 resolution(
% 0.72/1.09 clause( 588, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.72/1.09 , clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X,
% 0.72/1.09 Y ) ] )
% 0.72/1.09 , 0, clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.72/1.09 , 0, substitution( 0, [ :=( X, zero ), :=( Y, X )] ), substitution( 1, [
% 0.72/1.09 :=( X, X )] )).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 44, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.72/1.09 , clause( 588, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.72/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.72/1.09 1 )] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 eqswap(
% 0.72/1.09 clause( 590, [ =( X, zero ), ~( 'less_equal'( X, zero ) ) ] )
% 0.72/1.09 , clause( 44, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.72/1.09 , 1, substitution( 0, [ :=( X, X )] )).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 resolution(
% 0.72/1.09 clause( 591, [ =( divide( divide( a, X ), divide( b, X ) ), zero ) ] )
% 0.72/1.09 , clause( 590, [ =( X, zero ), ~( 'less_equal'( X, zero ) ) ] )
% 0.72/1.09 , 1, clause( 26, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ),
% 0.72/1.09 zero ) ] )
% 0.72/1.09 , 0, substitution( 0, [ :=( X, divide( divide( a, X ), divide( b, X ) ) )] )
% 0.72/1.09 , substitution( 1, [ :=( X, X )] )).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 318, [ =( divide( divide( a, X ), divide( b, X ) ), zero ) ] )
% 0.72/1.09 , clause( 591, [ =( divide( divide( a, X ), divide( b, X ) ), zero ) ] )
% 0.72/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 paramod(
% 0.72/1.09 clause( 595, [ ~( =( zero, zero ) ) ] )
% 0.72/1.09 , clause( 318, [ =( divide( divide( a, X ), divide( b, X ) ), zero ) ] )
% 0.72/1.09 , 0, clause( 34, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) )
% 0.72/1.09 ] )
% 0.72/1.09 , 0, 2, substitution( 0, [ :=( X, c )] ), substitution( 1, [] )).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 eqrefl(
% 0.72/1.09 clause( 596, [] )
% 0.72/1.09 , clause( 595, [ ~( =( zero, zero ) ) ] )
% 0.72/1.09 , 0, substitution( 0, [] )).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 subsumption(
% 0.72/1.09 clause( 527, [] )
% 0.72/1.09 , clause( 596, [] )
% 0.72/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 end.
% 0.72/1.09
% 0.72/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.72/1.09
% 0.72/1.09 Memory use:
% 0.72/1.09
% 0.72/1.09 space for terms: 6330
% 0.72/1.09 space for clauses: 31111
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 clauses generated: 2902
% 0.72/1.09 clauses kept: 528
% 0.72/1.09 clauses selected: 100
% 0.72/1.09 clauses deleted: 6
% 0.72/1.09 clauses inuse deleted: 0
% 0.72/1.09
% 0.72/1.09 subsentry: 6302
% 0.72/1.09 literals s-matched: 3777
% 0.72/1.09 literals matched: 3775
% 0.72/1.09 full subsumption: 690
% 0.72/1.09
% 0.72/1.09 checksum: -715060676
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Bliksem ended
%------------------------------------------------------------------------------