TSTP Solution File: SWV009-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n006.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 : Wed Jul 20 16:22:08 EDT 2022
% Result : Unsatisfiable 0.46s 1.12s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : bliksem %s
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % DateTime : Thu Jun 16 00:06:56 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.46/1.12 *** allocated 10000 integers for termspace/termends
% 0.46/1.12 *** allocated 10000 integers for clauses
% 0.46/1.12 *** allocated 10000 integers for justifications
% 0.46/1.12 Bliksem 1.12
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 Automatic Strategy Selection
% 0.46/1.12
% 0.46/1.12 Clauses:
% 0.46/1.12 [
% 0.46/1.12 [ 'less_or_equal'( X, Y ), less( Y, X ) ],
% 0.46/1.12 [ less( j, i ) ],
% 0.46/1.12 [ 'less_or_equal'( m, p ) ],
% 0.46/1.12 [ 'less_or_equal'( p, q ) ],
% 0.46/1.12 [ 'less_or_equal'( q, n ) ],
% 0.46/1.12 [ ~( 'less_or_equal'( m, X ) ), ~( less( X, i ) ), ~( less( j, Y ) ),
% 0.46/1.12 ~( 'less_or_equal'( Y, n ) ), 'less_or_equal'( a( X ), a( Y ) ) ],
% 0.46/1.12 [ ~( 'less_or_equal'( m, X ) ), ~( 'less_or_equal'( X, Y ) ), ~(
% 0.46/1.12 'less_or_equal'( Y, j ) ), 'less_or_equal'( a( X ), a( Y ) ) ],
% 0.46/1.12 [ ~( 'less_or_equal'( i, X ) ), ~( 'less_or_equal'( X, Y ) ), ~(
% 0.46/1.12 'less_or_equal'( Y, n ) ), 'less_or_equal'( a( X ), a( Y ) ) ],
% 0.46/1.12 [ ~( 'less_or_equal'( a( p ), a( q ) ) ) ]
% 0.46/1.12 ] .
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 percentage equality = 0.000000, percentage horn = 0.888889
% 0.46/1.12 This a non-horn, non-equality problem
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 Options Used:
% 0.46/1.12
% 0.46/1.12 useres = 1
% 0.46/1.12 useparamod = 0
% 0.46/1.12 useeqrefl = 0
% 0.46/1.12 useeqfact = 0
% 0.46/1.12 usefactor = 1
% 0.46/1.12 usesimpsplitting = 0
% 0.46/1.12 usesimpdemod = 0
% 0.46/1.12 usesimpres = 3
% 0.46/1.12
% 0.46/1.12 resimpinuse = 1000
% 0.46/1.12 resimpclauses = 20000
% 0.46/1.12 substype = standard
% 0.46/1.12 backwardsubs = 1
% 0.46/1.12 selectoldest = 5
% 0.46/1.12
% 0.46/1.12 litorderings [0] = split
% 0.46/1.12 litorderings [1] = liftord
% 0.46/1.12
% 0.46/1.12 termordering = none
% 0.46/1.12
% 0.46/1.12 litapriori = 1
% 0.46/1.12 termapriori = 0
% 0.46/1.12 litaposteriori = 0
% 0.46/1.12 termaposteriori = 0
% 0.46/1.12 demodaposteriori = 0
% 0.46/1.12 ordereqreflfact = 0
% 0.46/1.12
% 0.46/1.12 litselect = none
% 0.46/1.12
% 0.46/1.12 maxweight = 15
% 0.46/1.12 maxdepth = 30000
% 0.46/1.12 maxlength = 115
% 0.46/1.12 maxnrvars = 195
% 0.46/1.12 excuselevel = 1
% 0.46/1.12 increasemaxweight = 1
% 0.46/1.12
% 0.46/1.12 maxselected = 10000000
% 0.46/1.12 maxnrclauses = 10000000
% 0.46/1.12
% 0.46/1.12 showgenerated = 0
% 0.46/1.12 showkept = 0
% 0.46/1.12 showselected = 0
% 0.46/1.12 showdeleted = 0
% 0.46/1.12 showresimp = 1
% 0.46/1.12 showstatus = 2000
% 0.46/1.12
% 0.46/1.12 prologoutput = 1
% 0.46/1.12 nrgoals = 5000000
% 0.46/1.12 totalproof = 1
% 0.46/1.12
% 0.46/1.12 Symbols occurring in the translation:
% 0.46/1.12
% 0.46/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.46/1.12 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.46/1.12 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.46/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.12 'less_or_equal' [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.46/1.12 less [42, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.46/1.12 j [43, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.46/1.12 i [44, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.46/1.12 m [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.46/1.12 p [46, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.46/1.12 q [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.46/1.12 n [48, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.46/1.12 a [49, 1] (w:1, o:22, a:1, s:1, b:0).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 Starting Search:
% 0.46/1.12
% 0.46/1.12 Resimplifying inuse:
% 0.46/1.12 Done
% 0.46/1.12
% 0.46/1.12 Failed to find proof!
% 0.46/1.12 maxweight = 15
% 0.46/1.12 maxnrclauses = 10000000
% 0.46/1.12 Generated: 220
% 0.46/1.12 Kept: 41
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 The strategy used was not complete!
% 0.46/1.12
% 0.46/1.12 Increased maxweight to 16
% 0.46/1.12
% 0.46/1.12 Starting Search:
% 0.46/1.12
% 0.46/1.12 Resimplifying inuse:
% 0.46/1.12 Done
% 0.46/1.12
% 0.46/1.12 Failed to find proof!
% 0.46/1.12 maxweight = 16
% 0.46/1.12 maxnrclauses = 10000000
% 0.46/1.12 Generated: 220
% 0.46/1.12 Kept: 41
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 The strategy used was not complete!
% 0.46/1.12
% 0.46/1.12 Increased maxweight to 17
% 0.46/1.12
% 0.46/1.12 Starting Search:
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 Bliksems!, er is een bewijs:
% 0.46/1.12 % SZS status Unsatisfiable
% 0.46/1.12 % SZS output start Refutation
% 0.46/1.12
% 0.46/1.12 clause( 0, [ 'less_or_equal'( X, Y ), less( Y, X ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 2, [ 'less_or_equal'( m, p ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 3, [ 'less_or_equal'( p, q ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 4, [ 'less_or_equal'( q, n ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 5, [ ~( 'less_or_equal'( m, X ) ), ~( 'less_or_equal'( Y, n ) ),
% 0.46/1.12 'less_or_equal'( a( X ), a( Y ) ), ~( less( j, Y ) ), ~( less( X, i ) ) ]
% 0.46/1.12 )
% 0.46/1.12 .
% 0.46/1.12 clause( 6, [ ~( 'less_or_equal'( Y, j ) ), 'less_or_equal'( a( X ), a( Y )
% 0.46/1.12 ), ~( 'less_or_equal'( X, Y ) ), ~( 'less_or_equal'( m, X ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 7, [ ~( 'less_or_equal'( Y, n ) ), 'less_or_equal'( a( X ), a( Y )
% 0.46/1.12 ), ~( 'less_or_equal'( X, Y ) ), ~( 'less_or_equal'( i, X ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 8, [ ~( 'less_or_equal'( a( p ), a( q ) ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 17, [ ~( 'less_or_equal'( m, X ) ), ~( 'less_or_equal'( Y, n ) ),
% 0.46/1.12 'less_or_equal'( a( X ), a( Y ) ), 'less_or_equal'( Y, j ), ~( less( X, i
% 0.46/1.12 ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 24, [ ~( 'less_or_equal'( i, p ) ), ~( 'less_or_equal'( p, q ) ) ]
% 0.46/1.12 )
% 0.46/1.12 .
% 0.46/1.12 clause( 31, [ ~( 'less_or_equal'( q, j ) ), ~( 'less_or_equal'( m, p ) ) ]
% 0.46/1.12 )
% 0.46/1.12 .
% 0.46/1.12 clause( 35, [ ~( 'less_or_equal'( q, j ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 36, [ ~( 'less_or_equal'( i, p ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 37, [ 'less_or_equal'( i, X ), ~( 'less_or_equal'( Y, n ) ),
% 0.46/1.12 'less_or_equal'( Y, j ), ~( 'less_or_equal'( m, X ) ), 'less_or_equal'( a(
% 0.46/1.12 X ), a( Y ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 42, [ 'less_or_equal'( q, j ), ~( 'less_or_equal'( m, p ) ), ~(
% 0.46/1.12 'less_or_equal'( q, n ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 44, [] )
% 0.46/1.12 .
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 % SZS output end Refutation
% 0.46/1.12 found a proof!
% 0.46/1.12
% 0.46/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.12
% 0.46/1.12 initialclauses(
% 0.46/1.12 [ clause( 46, [ 'less_or_equal'( X, Y ), less( Y, X ) ] )
% 0.46/1.12 , clause( 47, [ less( j, i ) ] )
% 0.46/1.12 , clause( 48, [ 'less_or_equal'( m, p ) ] )
% 0.46/1.12 , clause( 49, [ 'less_or_equal'( p, q ) ] )
% 0.46/1.12 , clause( 50, [ 'less_or_equal'( q, n ) ] )
% 0.46/1.12 , clause( 51, [ ~( 'less_or_equal'( m, X ) ), ~( less( X, i ) ), ~( less( j
% 0.46/1.12 , Y ) ), ~( 'less_or_equal'( Y, n ) ), 'less_or_equal'( a( X ), a( Y ) )
% 0.46/1.12 ] )
% 0.46/1.12 , clause( 52, [ ~( 'less_or_equal'( m, X ) ), ~( 'less_or_equal'( X, Y ) )
% 0.46/1.12 , ~( 'less_or_equal'( Y, j ) ), 'less_or_equal'( a( X ), a( Y ) ) ] )
% 0.46/1.12 , clause( 53, [ ~( 'less_or_equal'( i, X ) ), ~( 'less_or_equal'( X, Y ) )
% 0.46/1.12 , ~( 'less_or_equal'( Y, n ) ), 'less_or_equal'( a( X ), a( Y ) ) ] )
% 0.46/1.12 , clause( 54, [ ~( 'less_or_equal'( a( p ), a( q ) ) ) ] )
% 0.46/1.12 ] ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 0, [ 'less_or_equal'( X, Y ), less( Y, X ) ] )
% 0.46/1.12 , clause( 46, [ 'less_or_equal'( X, Y ), less( Y, X ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.12 ), ==>( 1, 1 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 2, [ 'less_or_equal'( m, p ) ] )
% 0.46/1.12 , clause( 48, [ 'less_or_equal'( m, p ) ] )
% 0.46/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 3, [ 'less_or_equal'( p, q ) ] )
% 0.46/1.12 , clause( 49, [ 'less_or_equal'( p, q ) ] )
% 0.46/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 4, [ 'less_or_equal'( q, n ) ] )
% 0.46/1.12 , clause( 50, [ 'less_or_equal'( q, n ) ] )
% 0.46/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 5, [ ~( 'less_or_equal'( m, X ) ), ~( 'less_or_equal'( Y, n ) ),
% 0.46/1.12 'less_or_equal'( a( X ), a( Y ) ), ~( less( j, Y ) ), ~( less( X, i ) ) ]
% 0.46/1.12 )
% 0.46/1.12 , clause( 51, [ ~( 'less_or_equal'( m, X ) ), ~( less( X, i ) ), ~( less( j
% 0.46/1.12 , Y ) ), ~( 'less_or_equal'( Y, n ) ), 'less_or_equal'( a( X ), a( Y ) )
% 0.46/1.12 ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.12 ), ==>( 1, 4 ), ==>( 2, 3 ), ==>( 3, 1 ), ==>( 4, 2 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 6, [ ~( 'less_or_equal'( Y, j ) ), 'less_or_equal'( a( X ), a( Y )
% 0.46/1.12 ), ~( 'less_or_equal'( X, Y ) ), ~( 'less_or_equal'( m, X ) ) ] )
% 0.46/1.12 , clause( 52, [ ~( 'less_or_equal'( m, X ) ), ~( 'less_or_equal'( X, Y ) )
% 0.46/1.12 , ~( 'less_or_equal'( Y, j ) ), 'less_or_equal'( a( X ), a( Y ) ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 3
% 0.46/1.12 ), ==>( 1, 2 ), ==>( 2, 0 ), ==>( 3, 1 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 7, [ ~( 'less_or_equal'( Y, n ) ), 'less_or_equal'( a( X ), a( Y )
% 0.46/1.12 ), ~( 'less_or_equal'( X, Y ) ), ~( 'less_or_equal'( i, X ) ) ] )
% 0.46/1.12 , clause( 53, [ ~( 'less_or_equal'( i, X ) ), ~( 'less_or_equal'( X, Y ) )
% 0.46/1.12 , ~( 'less_or_equal'( Y, n ) ), 'less_or_equal'( a( X ), a( Y ) ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 3
% 0.46/1.12 ), ==>( 1, 2 ), ==>( 2, 0 ), ==>( 3, 1 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 8, [ ~( 'less_or_equal'( a( p ), a( q ) ) ) ] )
% 0.46/1.12 , clause( 54, [ ~( 'less_or_equal'( a( p ), a( q ) ) ) ] )
% 0.46/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 80, [ ~( 'less_or_equal'( m, X ) ), ~( 'less_or_equal'( Y, n ) ),
% 0.46/1.12 'less_or_equal'( a( X ), a( Y ) ), ~( less( X, i ) ), 'less_or_equal'( Y
% 0.46/1.12 , j ) ] )
% 0.46/1.12 , clause( 5, [ ~( 'less_or_equal'( m, X ) ), ~( 'less_or_equal'( Y, n ) ),
% 0.46/1.12 'less_or_equal'( a( X ), a( Y ) ), ~( less( j, Y ) ), ~( less( X, i ) ) ]
% 0.46/1.12 )
% 0.46/1.12 , 3, clause( 0, [ 'less_or_equal'( X, Y ), less( Y, X ) ] )
% 0.46/1.12 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.46/1.12 , Y ), :=( Y, j )] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 17, [ ~( 'less_or_equal'( m, X ) ), ~( 'less_or_equal'( Y, n ) ),
% 0.46/1.12 'less_or_equal'( a( X ), a( Y ) ), 'less_or_equal'( Y, j ), ~( less( X, i
% 0.46/1.12 ) ) ] )
% 0.46/1.12 , clause( 80, [ ~( 'less_or_equal'( m, X ) ), ~( 'less_or_equal'( Y, n ) )
% 0.46/1.12 , 'less_or_equal'( a( X ), a( Y ) ), ~( less( X, i ) ), 'less_or_equal'(
% 0.46/1.12 Y, j ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.12 ), ==>( 1, 1 ), ==>( 2, 2 ), ==>( 3, 4 ), ==>( 4, 3 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 86, [ ~( 'less_or_equal'( q, n ) ), ~( 'less_or_equal'( p, q ) ),
% 0.46/1.12 ~( 'less_or_equal'( i, p ) ) ] )
% 0.46/1.12 , clause( 8, [ ~( 'less_or_equal'( a( p ), a( q ) ) ) ] )
% 0.46/1.12 , 0, clause( 7, [ ~( 'less_or_equal'( Y, n ) ), 'less_or_equal'( a( X ), a(
% 0.46/1.12 Y ) ), ~( 'less_or_equal'( X, Y ) ), ~( 'less_or_equal'( i, X ) ) ] )
% 0.46/1.12 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, q )] )
% 0.46/1.12 ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 87, [ ~( 'less_or_equal'( p, q ) ), ~( 'less_or_equal'( i, p ) ) ]
% 0.46/1.12 )
% 0.46/1.12 , clause( 86, [ ~( 'less_or_equal'( q, n ) ), ~( 'less_or_equal'( p, q ) )
% 0.46/1.12 , ~( 'less_or_equal'( i, p ) ) ] )
% 0.46/1.12 , 0, clause( 4, [ 'less_or_equal'( q, n ) ] )
% 0.46/1.12 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 24, [ ~( 'less_or_equal'( i, p ) ), ~( 'less_or_equal'( p, q ) ) ]
% 0.46/1.12 )
% 0.46/1.12 , clause( 87, [ ~( 'less_or_equal'( p, q ) ), ~( 'less_or_equal'( i, p ) )
% 0.46/1.12 ] )
% 0.46/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.46/1.12 ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 88, [ ~( 'less_or_equal'( q, j ) ), ~( 'less_or_equal'( p, q ) ),
% 0.46/1.12 ~( 'less_or_equal'( m, p ) ) ] )
% 0.46/1.12 , clause( 8, [ ~( 'less_or_equal'( a( p ), a( q ) ) ) ] )
% 0.46/1.12 , 0, clause( 6, [ ~( 'less_or_equal'( Y, j ) ), 'less_or_equal'( a( X ), a(
% 0.46/1.12 Y ) ), ~( 'less_or_equal'( X, Y ) ), ~( 'less_or_equal'( m, X ) ) ] )
% 0.46/1.12 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, q )] )
% 0.46/1.12 ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 89, [ ~( 'less_or_equal'( q, j ) ), ~( 'less_or_equal'( m, p ) ) ]
% 0.46/1.12 )
% 0.46/1.12 , clause( 88, [ ~( 'less_or_equal'( q, j ) ), ~( 'less_or_equal'( p, q ) )
% 0.46/1.12 , ~( 'less_or_equal'( m, p ) ) ] )
% 0.46/1.12 , 1, clause( 3, [ 'less_or_equal'( p, q ) ] )
% 0.46/1.12 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 31, [ ~( 'less_or_equal'( q, j ) ), ~( 'less_or_equal'( m, p ) ) ]
% 0.46/1.12 )
% 0.46/1.12 , clause( 89, [ ~( 'less_or_equal'( q, j ) ), ~( 'less_or_equal'( m, p ) )
% 0.46/1.12 ] )
% 0.46/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] )
% 0.46/1.12 ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 90, [ ~( 'less_or_equal'( q, j ) ) ] )
% 0.46/1.12 , clause( 31, [ ~( 'less_or_equal'( q, j ) ), ~( 'less_or_equal'( m, p ) )
% 0.46/1.12 ] )
% 0.46/1.12 , 1, clause( 2, [ 'less_or_equal'( m, p ) ] )
% 0.46/1.12 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 35, [ ~( 'less_or_equal'( q, j ) ) ] )
% 0.46/1.12 , clause( 90, [ ~( 'less_or_equal'( q, j ) ) ] )
% 0.46/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 91, [ ~( 'less_or_equal'( i, p ) ) ] )
% 0.46/1.12 , clause( 24, [ ~( 'less_or_equal'( i, p ) ), ~( 'less_or_equal'( p, q ) )
% 0.46/1.12 ] )
% 0.46/1.12 , 1, clause( 3, [ 'less_or_equal'( p, q ) ] )
% 0.46/1.12 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 36, [ ~( 'less_or_equal'( i, p ) ) ] )
% 0.46/1.12 , clause( 91, [ ~( 'less_or_equal'( i, p ) ) ] )
% 0.46/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 94, [ ~( 'less_or_equal'( m, X ) ), ~( 'less_or_equal'( Y, n ) ),
% 0.46/1.12 'less_or_equal'( a( X ), a( Y ) ), 'less_or_equal'( Y, j ),
% 0.46/1.12 'less_or_equal'( i, X ) ] )
% 0.46/1.12 , clause( 17, [ ~( 'less_or_equal'( m, X ) ), ~( 'less_or_equal'( Y, n ) )
% 0.46/1.12 , 'less_or_equal'( a( X ), a( Y ) ), 'less_or_equal'( Y, j ), ~( less( X
% 0.46/1.12 , i ) ) ] )
% 0.46/1.12 , 4, clause( 0, [ 'less_or_equal'( X, Y ), less( Y, X ) ] )
% 0.46/1.12 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.46/1.12 , i ), :=( Y, X )] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 37, [ 'less_or_equal'( i, X ), ~( 'less_or_equal'( Y, n ) ),
% 0.46/1.12 'less_or_equal'( Y, j ), ~( 'less_or_equal'( m, X ) ), 'less_or_equal'( a(
% 0.46/1.12 X ), a( Y ) ) ] )
% 0.46/1.12 , clause( 94, [ ~( 'less_or_equal'( m, X ) ), ~( 'less_or_equal'( Y, n ) )
% 0.46/1.12 , 'less_or_equal'( a( X ), a( Y ) ), 'less_or_equal'( Y, j ),
% 0.46/1.12 'less_or_equal'( i, X ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 3
% 0.46/1.12 ), ==>( 1, 1 ), ==>( 2, 4 ), ==>( 3, 2 ), ==>( 4, 0 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 97, [ 'less_or_equal'( i, p ), ~( 'less_or_equal'( q, n ) ),
% 0.46/1.12 'less_or_equal'( q, j ), ~( 'less_or_equal'( m, p ) ) ] )
% 0.46/1.12 , clause( 8, [ ~( 'less_or_equal'( a( p ), a( q ) ) ) ] )
% 0.46/1.12 , 0, clause( 37, [ 'less_or_equal'( i, X ), ~( 'less_or_equal'( Y, n ) ),
% 0.46/1.12 'less_or_equal'( Y, j ), ~( 'less_or_equal'( m, X ) ), 'less_or_equal'( a(
% 0.46/1.12 X ), a( Y ) ) ] )
% 0.46/1.12 , 4, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, q )] )
% 0.46/1.12 ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 98, [ ~( 'less_or_equal'( q, n ) ), 'less_or_equal'( q, j ), ~(
% 0.46/1.12 'less_or_equal'( m, p ) ) ] )
% 0.46/1.12 , clause( 36, [ ~( 'less_or_equal'( i, p ) ) ] )
% 0.46/1.12 , 0, clause( 97, [ 'less_or_equal'( i, p ), ~( 'less_or_equal'( q, n ) ),
% 0.46/1.12 'less_or_equal'( q, j ), ~( 'less_or_equal'( m, p ) ) ] )
% 0.46/1.12 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 42, [ 'less_or_equal'( q, j ), ~( 'less_or_equal'( m, p ) ), ~(
% 0.46/1.12 'less_or_equal'( q, n ) ) ] )
% 0.46/1.12 , clause( 98, [ ~( 'less_or_equal'( q, n ) ), 'less_or_equal'( q, j ), ~(
% 0.46/1.12 'less_or_equal'( m, p ) ) ] )
% 0.46/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 2 ), ==>( 1, 0 ), ==>( 2
% 0.46/1.12 , 1 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 99, [ ~( 'less_or_equal'( m, p ) ), ~( 'less_or_equal'( q, n ) ) ]
% 0.46/1.12 )
% 0.46/1.12 , clause( 35, [ ~( 'less_or_equal'( q, j ) ) ] )
% 0.46/1.12 , 0, clause( 42, [ 'less_or_equal'( q, j ), ~( 'less_or_equal'( m, p ) ),
% 0.46/1.12 ~( 'less_or_equal'( q, n ) ) ] )
% 0.46/1.12 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 100, [ ~( 'less_or_equal'( q, n ) ) ] )
% 0.46/1.12 , clause( 99, [ ~( 'less_or_equal'( m, p ) ), ~( 'less_or_equal'( q, n ) )
% 0.46/1.12 ] )
% 0.46/1.12 , 0, clause( 2, [ 'less_or_equal'( m, p ) ] )
% 0.46/1.12 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 101, [] )
% 0.46/1.12 , clause( 100, [ ~( 'less_or_equal'( q, n ) ) ] )
% 0.46/1.12 , 0, clause( 4, [ 'less_or_equal'( q, n ) ] )
% 0.46/1.12 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 44, [] )
% 0.46/1.12 , clause( 101, [] )
% 0.46/1.12 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 end.
% 0.46/1.12
% 0.46/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.12
% 0.46/1.12 Memory use:
% 0.46/1.12
% 0.46/1.12 space for terms: 840
% 0.46/1.12 space for clauses: 2246
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 clauses generated: 113
% 0.46/1.12 clauses kept: 45
% 0.46/1.12 clauses selected: 35
% 0.46/1.12 clauses deleted: 4
% 0.46/1.12 clauses inuse deleted: 0
% 0.46/1.12
% 0.46/1.12 subsentry: 117
% 0.46/1.12 literals s-matched: 37
% 0.46/1.12 literals matched: 37
% 0.46/1.12 full subsumption: 24
% 0.46/1.12
% 0.46/1.12 checksum: -325805488
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 Bliksem ended
%------------------------------------------------------------------------------