TSTP Solution File: HEN008-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : HEN008-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n012.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.65s 1.06s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : HEN008-3 : TPTP v8.1.0. Released v1.0.0.
% 0.09/0.11 % Command : bliksem %s
% 0.12/0.32 % Computer : n012.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % DateTime : Fri Jul 1 13:05:02 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.65/1.06 *** allocated 10000 integers for termspace/termends
% 0.65/1.06 *** allocated 10000 integers for clauses
% 0.65/1.06 *** allocated 10000 integers for justifications
% 0.65/1.06 Bliksem 1.12
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 Automatic Strategy Selection
% 0.65/1.06
% 0.65/1.06 Clauses:
% 0.65/1.06 [
% 0.65/1.06 [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ],
% 0.65/1.06 [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ],
% 0.65/1.06 [ 'less_equal'( divide( X, Y ), X ) ],
% 0.65/1.06 [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( divide(
% 0.65/1.06 X, Z ), Y ) ) ],
% 0.65/1.06 [ 'less_equal'( zero, X ) ],
% 0.65/1.06 [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y ) ],
% 0.65/1.06 [ 'less_equal'( X, identity ) ],
% 0.65/1.06 [ 'less_equal'( a, b ) ],
% 0.65/1.06 [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ]
% 0.65/1.06 ] .
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 percentage equality = 0.230769, percentage horn = 1.000000
% 0.65/1.06 This is a problem with some equality
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 Options Used:
% 0.65/1.06
% 0.65/1.06 useres = 1
% 0.65/1.06 useparamod = 1
% 0.65/1.06 useeqrefl = 1
% 0.65/1.06 useeqfact = 1
% 0.65/1.06 usefactor = 1
% 0.65/1.06 usesimpsplitting = 0
% 0.65/1.06 usesimpdemod = 5
% 0.65/1.06 usesimpres = 3
% 0.65/1.06
% 0.65/1.06 resimpinuse = 1000
% 0.65/1.06 resimpclauses = 20000
% 0.65/1.06 substype = eqrewr
% 0.65/1.06 backwardsubs = 1
% 0.65/1.06 selectoldest = 5
% 0.65/1.06
% 0.65/1.06 litorderings [0] = split
% 0.65/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.65/1.06
% 0.65/1.06 termordering = kbo
% 0.65/1.06
% 0.65/1.06 litapriori = 0
% 0.65/1.06 termapriori = 1
% 0.65/1.06 litaposteriori = 0
% 0.65/1.06 termaposteriori = 0
% 0.65/1.06 demodaposteriori = 0
% 0.65/1.06 ordereqreflfact = 0
% 0.65/1.06
% 0.65/1.06 litselect = negord
% 0.65/1.06
% 0.65/1.06 maxweight = 15
% 0.65/1.06 maxdepth = 30000
% 0.65/1.06 maxlength = 115
% 0.65/1.06 maxnrvars = 195
% 0.65/1.06 excuselevel = 1
% 0.65/1.06 increasemaxweight = 1
% 0.65/1.06
% 0.65/1.06 maxselected = 10000000
% 0.65/1.06 maxnrclauses = 10000000
% 0.65/1.06
% 0.65/1.06 showgenerated = 0
% 0.65/1.06 showkept = 0
% 0.65/1.06 showselected = 0
% 0.65/1.06 showdeleted = 0
% 0.65/1.06 showresimp = 1
% 0.65/1.06 showstatus = 2000
% 0.65/1.06
% 0.65/1.06 prologoutput = 1
% 0.65/1.06 nrgoals = 5000000
% 0.65/1.06 totalproof = 1
% 0.65/1.06
% 0.65/1.06 Symbols occurring in the translation:
% 0.65/1.06
% 0.65/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.65/1.06 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.65/1.06 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.65/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.65/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.65/1.06 'less_equal' [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.65/1.06 divide [42, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.65/1.06 zero [43, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.65/1.06 identity [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.65/1.06 a [46, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.65/1.06 b [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.65/1.06 c [48, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 Starting Search:
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 Bliksems!, er is een bewijs:
% 0.65/1.06 % SZS status Unsatisfiable
% 0.65/1.06 % SZS output start Refutation
% 0.65/1.06
% 0.65/1.06 clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.65/1.06 .
% 0.65/1.06 clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.65/1.06 .
% 0.65/1.06 clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide(
% 0.65/1.06 divide( X, Z ), Y ) ) ] )
% 0.65/1.06 .
% 0.65/1.06 clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.65/1.06 .
% 0.65/1.06 clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 0.65/1.06 ) ] )
% 0.65/1.06 .
% 0.65/1.06 clause( 7, [ 'less_equal'( a, b ) ] )
% 0.65/1.06 .
% 0.65/1.06 clause( 8, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.65/1.06 .
% 0.65/1.06 clause( 10, [ =( divide( a, b ), zero ) ] )
% 0.65/1.06 .
% 0.65/1.06 clause( 11, [ =( divide( zero, X ), zero ) ] )
% 0.65/1.06 .
% 0.65/1.06 clause( 16, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ] )
% 0.65/1.06 .
% 0.65/1.06 clause( 22, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.65/1.06 .
% 0.65/1.06 clause( 62, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ), zero
% 0.65/1.06 ) ] )
% 0.65/1.06 .
% 0.65/1.06 clause( 254, [] )
% 0.65/1.06 .
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 % SZS output end Refutation
% 0.65/1.06 found a proof!
% 0.65/1.06
% 0.65/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.65/1.06
% 0.65/1.06 initialclauses(
% 0.65/1.06 [ clause( 256, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.65/1.06 , clause( 257, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.65/1.06 , clause( 258, [ 'less_equal'( divide( X, Y ), X ) ] )
% 0.65/1.06 , clause( 259, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ),
% 0.65/1.06 divide( divide( X, Z ), Y ) ) ] )
% 0.65/1.06 , clause( 260, [ 'less_equal'( zero, X ) ] )
% 0.65/1.06 , clause( 261, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X
% 0.65/1.06 , Y ) ] )
% 0.65/1.06 , clause( 262, [ 'less_equal'( X, identity ) ] )
% 0.65/1.06 , clause( 263, [ 'less_equal'( a, b ) ] )
% 0.65/1.06 , clause( 264, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.65/1.06 ] ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 subsumption(
% 0.65/1.06 clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.65/1.06 , clause( 256, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.65/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.65/1.06 ), ==>( 1, 1 )] ) ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 subsumption(
% 0.65/1.06 clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.65/1.06 , clause( 257, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.65/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.65/1.06 ), ==>( 1, 1 )] ) ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 subsumption(
% 0.65/1.06 clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide(
% 0.65/1.06 divide( X, Z ), Y ) ) ] )
% 0.65/1.06 , clause( 259, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ),
% 0.65/1.06 divide( divide( X, Z ), Y ) ) ] )
% 0.65/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.65/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 subsumption(
% 0.65/1.06 clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.65/1.06 , clause( 260, [ 'less_equal'( zero, X ) ] )
% 0.65/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 subsumption(
% 0.65/1.06 clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 0.65/1.06 ) ] )
% 0.65/1.06 , clause( 261, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X
% 0.65/1.06 , Y ) ] )
% 0.65/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.65/1.06 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 subsumption(
% 0.65/1.06 clause( 7, [ 'less_equal'( a, b ) ] )
% 0.65/1.06 , clause( 263, [ 'less_equal'( a, b ) ] )
% 0.65/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 subsumption(
% 0.65/1.06 clause( 8, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.65/1.06 , clause( 264, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.65/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 eqswap(
% 0.65/1.06 clause( 281, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.65/1.06 , clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.65/1.06 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 resolution(
% 0.65/1.06 clause( 282, [ =( zero, divide( a, b ) ) ] )
% 0.65/1.06 , clause( 281, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.65/1.06 , 1, clause( 7, [ 'less_equal'( a, b ) ] )
% 0.65/1.06 , 0, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.65/1.06 ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 eqswap(
% 0.65/1.06 clause( 283, [ =( divide( a, b ), zero ) ] )
% 0.65/1.06 , clause( 282, [ =( zero, divide( a, b ) ) ] )
% 0.65/1.06 , 0, substitution( 0, [] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 subsumption(
% 0.65/1.06 clause( 10, [ =( divide( a, b ), zero ) ] )
% 0.65/1.06 , clause( 283, [ =( divide( a, b ), zero ) ] )
% 0.65/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 eqswap(
% 0.65/1.06 clause( 284, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.65/1.06 , clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.65/1.06 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 resolution(
% 0.65/1.06 clause( 285, [ =( zero, divide( zero, X ) ) ] )
% 0.65/1.06 , clause( 284, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.65/1.06 , 1, clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.65/1.06 , 0, substitution( 0, [ :=( X, zero ), :=( Y, X )] ), substitution( 1, [
% 0.65/1.06 :=( X, X )] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 eqswap(
% 0.65/1.06 clause( 286, [ =( divide( zero, X ), zero ) ] )
% 0.65/1.06 , clause( 285, [ =( zero, divide( zero, X ) ) ] )
% 0.65/1.06 , 0, substitution( 0, [ :=( X, X )] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 subsumption(
% 0.65/1.06 clause( 11, [ =( divide( zero, X ), zero ) ] )
% 0.65/1.06 , clause( 286, [ =( divide( zero, X ), zero ) ] )
% 0.65/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 eqswap(
% 0.65/1.06 clause( 287, [ ~( =( zero, divide( X, Y ) ) ), 'less_equal'( X, Y ) ] )
% 0.65/1.06 , clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.65/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 resolution(
% 0.65/1.06 clause( 288, [ ~( =( zero, divide( divide( a, c ), divide( b, c ) ) ) ) ]
% 0.65/1.06 )
% 0.65/1.06 , clause( 8, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.65/1.06 , 0, clause( 287, [ ~( =( zero, divide( X, Y ) ) ), 'less_equal'( X, Y ) ]
% 0.65/1.06 )
% 0.65/1.06 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, divide( a, c ) ),
% 0.65/1.06 :=( Y, divide( b, c ) )] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 eqswap(
% 0.65/1.06 clause( 289, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ]
% 0.65/1.06 )
% 0.65/1.06 , clause( 288, [ ~( =( zero, divide( divide( a, c ), divide( b, c ) ) ) ) ]
% 0.65/1.06 )
% 0.65/1.06 , 0, substitution( 0, [] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 subsumption(
% 0.65/1.06 clause( 16, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ] )
% 0.65/1.06 , clause( 289, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ]
% 0.65/1.06 )
% 0.65/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 resolution(
% 0.65/1.06 clause( 290, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.65/1.06 , clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X,
% 0.65/1.06 Y ) ] )
% 0.65/1.06 , 0, clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.65/1.06 , 0, substitution( 0, [ :=( X, zero ), :=( Y, X )] ), substitution( 1, [
% 0.65/1.06 :=( X, X )] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 subsumption(
% 0.65/1.06 clause( 22, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.65/1.06 , clause( 290, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.65/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.65/1.06 1 )] ) ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 paramod(
% 0.65/1.06 clause( 296, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ),
% 0.65/1.06 divide( zero, X ) ) ] )
% 0.65/1.06 , clause( 10, [ =( divide( a, b ), zero ) ] )
% 0.65/1.06 , 0, clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ),
% 0.65/1.06 divide( divide( X, Z ), Y ) ) ] )
% 0.65/1.06 , 0, 9, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, X ),
% 0.65/1.06 :=( Z, b )] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 paramod(
% 0.65/1.06 clause( 297, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ), zero
% 0.65/1.06 ) ] )
% 0.65/1.06 , clause( 11, [ =( divide( zero, X ), zero ) ] )
% 0.65/1.06 , 0, clause( 296, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) )
% 0.65/1.06 , divide( zero, X ) ) ] )
% 0.65/1.06 , 0, 8, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.65/1.06 ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 subsumption(
% 0.65/1.06 clause( 62, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ), zero
% 0.65/1.06 ) ] )
% 0.65/1.06 , clause( 297, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ),
% 0.65/1.06 zero ) ] )
% 0.65/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 eqswap(
% 0.65/1.06 clause( 298, [ =( X, zero ), ~( 'less_equal'( X, zero ) ) ] )
% 0.65/1.06 , clause( 22, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.65/1.06 , 1, substitution( 0, [ :=( X, X )] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 eqswap(
% 0.65/1.06 clause( 299, [ ~( =( zero, divide( divide( a, c ), divide( b, c ) ) ) ) ]
% 0.65/1.06 )
% 0.65/1.06 , clause( 16, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ]
% 0.65/1.06 )
% 0.65/1.06 , 0, substitution( 0, [] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 paramod(
% 0.65/1.06 clause( 301, [ ~( =( zero, zero ) ), ~( 'less_equal'( divide( divide( a, c
% 0.65/1.06 ), divide( b, c ) ), zero ) ) ] )
% 0.65/1.06 , clause( 298, [ =( X, zero ), ~( 'less_equal'( X, zero ) ) ] )
% 0.65/1.06 , 0, clause( 299, [ ~( =( zero, divide( divide( a, c ), divide( b, c ) ) )
% 0.65/1.06 ) ] )
% 0.65/1.06 , 0, 3, substitution( 0, [ :=( X, divide( divide( a, c ), divide( b, c ) )
% 0.65/1.06 )] ), substitution( 1, [] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 eqrefl(
% 0.65/1.06 clause( 433, [ ~( 'less_equal'( divide( divide( a, c ), divide( b, c ) ),
% 0.65/1.06 zero ) ) ] )
% 0.65/1.06 , clause( 301, [ ~( =( zero, zero ) ), ~( 'less_equal'( divide( divide( a,
% 0.65/1.06 c ), divide( b, c ) ), zero ) ) ] )
% 0.65/1.06 , 0, substitution( 0, [] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 resolution(
% 0.65/1.06 clause( 434, [] )
% 0.65/1.06 , clause( 433, [ ~( 'less_equal'( divide( divide( a, c ), divide( b, c ) )
% 0.65/1.06 , zero ) ) ] )
% 0.65/1.06 , 0, clause( 62, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ),
% 0.65/1.06 zero ) ] )
% 0.65/1.06 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, c )] )).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 subsumption(
% 0.65/1.06 clause( 254, [] )
% 0.65/1.06 , clause( 434, [] )
% 0.65/1.06 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 end.
% 0.65/1.06
% 0.65/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.65/1.06
% 0.65/1.06 Memory use:
% 0.65/1.06
% 0.65/1.06 space for terms: 3341
% 0.65/1.06 space for clauses: 14257
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 clauses generated: 885
% 0.65/1.06 clauses kept: 255
% 0.65/1.06 clauses selected: 41
% 0.65/1.06 clauses deleted: 2
% 0.65/1.06 clauses inuse deleted: 0
% 0.65/1.06
% 0.65/1.06 subsentry: 2098
% 0.65/1.06 literals s-matched: 1253
% 0.65/1.06 literals matched: 1252
% 0.65/1.06 full subsumption: 105
% 0.65/1.06
% 0.65/1.06 checksum: 2127899908
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 Bliksem ended
%------------------------------------------------------------------------------