TSTP Solution File: SWV001-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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:06 EDT 2022
% Result : Unsatisfiable 0.71s 1.12s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n023.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 : Tue Jun 14 23:40:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.71/1.12 *** allocated 10000 integers for termspace/termends
% 0.71/1.12 *** allocated 10000 integers for clauses
% 0.71/1.12 *** allocated 10000 integers for justifications
% 0.71/1.12 Bliksem 1.12
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 Automatic Strategy Selection
% 0.71/1.12
% 0.71/1.12 Clauses:
% 0.71/1.12 [
% 0.71/1.12 [ ~( equalish( X, Y ) ), ~( 'less_or_equalish'( X, Z ) ),
% 0.71/1.12 'less_or_equalish'( Y, Z ) ],
% 0.71/1.12 [ ~( equalish( X, Y ) ), ~( 'less_or_equalish'( Z, X ) ),
% 0.71/1.12 'less_or_equalish'( Z, Y ) ],
% 0.71/1.12 [ ~( q1( X, Y, Z ) ), ~( 'less_or_equalish'( X, Y ) ), q2( X, Y, Z ) ]
% 0.71/1.12 ,
% 0.71/1.12 [ ~( q1( X, Y, Z ) ), 'less_or_equalish'( X, Y ), q3( X, Y, Z ) ],
% 0.71/1.12 [ ~( q2( X, Y, Z ) ), q4( X, Y, Y ) ],
% 0.71/1.12 [ ~( q3( X, Y, Z ) ), q4( X, Y, X ) ],
% 0.71/1.12 [ 'less_or_equalish'( X, X ) ],
% 0.71/1.12 [ ~( 'less_or_equalish'( X, Y ) ), ~( 'less_or_equalish'( Y, X ) ),
% 0.71/1.12 equalish( X, Y ) ],
% 0.71/1.12 [ ~( 'less_or_equalish'( X, Y ) ), ~( 'less_or_equalish'( Y, Z ) ),
% 0.71/1.12 'less_or_equalish'( X, Z ) ],
% 0.71/1.12 [ 'less_or_equalish'( X, Y ), 'less_or_equalish'( Y, X ) ],
% 0.71/1.12 [ 'less_or_equalish'( X, Y ), ~( equalish( X, Y ) ) ],
% 0.71/1.12 [ q1( a, b, c ) ],
% 0.71/1.12 [ ~( q4( a, b, X ) ), ~( 'less_or_equalish'( a, X ) ), ~(
% 0.71/1.12 'less_or_equalish'( b, X ) ), ~( 'less_or_equalish'( X, a ) ) ],
% 0.71/1.12 [ ~( q4( a, b, X ) ), ~( 'less_or_equalish'( a, X ) ), ~(
% 0.71/1.12 'less_or_equalish'( b, X ) ), ~( 'less_or_equalish'( X, b ) ) ]
% 0.71/1.12 ] .
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 percentage equality = 0.000000, percentage horn = 0.857143
% 0.71/1.12 This a non-horn, non-equality problem
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 Options Used:
% 0.71/1.12
% 0.71/1.12 useres = 1
% 0.71/1.12 useparamod = 0
% 0.71/1.12 useeqrefl = 0
% 0.71/1.12 useeqfact = 0
% 0.71/1.12 usefactor = 1
% 0.71/1.12 usesimpsplitting = 0
% 0.71/1.12 usesimpdemod = 0
% 0.71/1.12 usesimpres = 3
% 0.71/1.12
% 0.71/1.12 resimpinuse = 1000
% 0.71/1.12 resimpclauses = 20000
% 0.71/1.12 substype = standard
% 0.71/1.12 backwardsubs = 1
% 0.71/1.12 selectoldest = 5
% 0.71/1.12
% 0.71/1.12 litorderings [0] = split
% 0.71/1.12 litorderings [1] = liftord
% 0.71/1.12
% 0.71/1.12 termordering = none
% 0.71/1.12
% 0.71/1.12 litapriori = 1
% 0.71/1.12 termapriori = 0
% 0.71/1.12 litaposteriori = 0
% 0.71/1.12 termaposteriori = 0
% 0.71/1.12 demodaposteriori = 0
% 0.71/1.12 ordereqreflfact = 0
% 0.71/1.12
% 0.71/1.12 litselect = none
% 0.71/1.12
% 0.71/1.12 maxweight = 15
% 0.71/1.12 maxdepth = 30000
% 0.71/1.12 maxlength = 115
% 0.71/1.12 maxnrvars = 195
% 0.71/1.12 excuselevel = 1
% 0.71/1.12 increasemaxweight = 1
% 0.71/1.12
% 0.71/1.12 maxselected = 10000000
% 0.71/1.12 maxnrclauses = 10000000
% 0.71/1.12
% 0.71/1.12 showgenerated = 0
% 0.71/1.12 showkept = 0
% 0.71/1.12 showselected = 0
% 0.71/1.12 showdeleted = 0
% 0.71/1.12 showresimp = 1
% 0.71/1.12 showstatus = 2000
% 0.71/1.12
% 0.71/1.12 prologoutput = 1
% 0.71/1.12 nrgoals = 5000000
% 0.71/1.12 totalproof = 1
% 0.71/1.12
% 0.71/1.12 Symbols occurring in the translation:
% 0.71/1.12
% 0.71/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.12 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.12 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.71/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.12 equalish [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.71/1.12 'less_or_equalish' [43, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.71/1.12 q1 [44, 3] (w:1, o:48, a:1, s:1, b:0),
% 0.71/1.12 q2 [45, 3] (w:1, o:49, a:1, s:1, b:0),
% 0.71/1.12 q3 [46, 3] (w:1, o:50, a:1, s:1, b:0),
% 0.71/1.12 q4 [47, 3] (w:1, o:51, a:1, s:1, b:0),
% 0.71/1.12 a [48, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.71/1.12 b [49, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.71/1.12 c [50, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 Starting Search:
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 Bliksems!, er is een bewijs:
% 0.71/1.12 % SZS status Unsatisfiable
% 0.71/1.12 % SZS output start Refutation
% 0.71/1.12
% 0.71/1.12 clause( 2, [ ~( 'less_or_equalish'( X, Y ) ), ~( q1( X, Y, Z ) ), q2( X, Y
% 0.71/1.12 , Z ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 3, [ 'less_or_equalish'( X, Y ), ~( q1( X, Y, Z ) ), q3( X, Y, Z )
% 0.71/1.12 ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 4, [ ~( q2( X, Y, Z ) ), q4( X, Y, Y ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 5, [ ~( q3( X, Y, Z ) ), q4( X, Y, X ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 6, [ 'less_or_equalish'( X, X ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 8, [ ~( 'less_or_equalish'( Y, Z ) ), 'less_or_equalish'( X, Z ),
% 0.71/1.12 ~( 'less_or_equalish'( X, Y ) ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 9, [ 'less_or_equalish'( Y, X ), 'less_or_equalish'( X, Y ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 11, [ q1( a, b, c ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 12, [ ~( 'less_or_equalish'( a, X ) ), ~( 'less_or_equalish'( b, X
% 0.71/1.12 ) ), ~( 'less_or_equalish'( X, a ) ), ~( q4( a, b, X ) ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 13, [ ~( 'less_or_equalish'( a, X ) ), ~( 'less_or_equalish'( b, X
% 0.71/1.12 ) ), ~( 'less_or_equalish'( X, b ) ), ~( q4( a, b, X ) ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 16, [ ~( 'less_or_equalish'( a, b ) ), ~( q4( a, b, b ) ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 27, [ ~( 'less_or_equalish'( a, b ) ), ~( q2( a, b, X ) ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 32, [ ~( 'less_or_equalish'( a, b ) ), ~( q1( a, b, X ) ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 33, [ ~( 'less_or_equalish'( a, b ) ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 39, [ 'less_or_equalish'( b, a ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 77, [ ~( 'less_or_equalish'( a, X ) ), 'less_or_equalish'( b, X ) ]
% 0.71/1.12 )
% 0.71/1.12 .
% 0.71/1.12 clause( 110, [ ~( 'less_or_equalish'( a, X ) ), ~( 'less_or_equalish'( X, a
% 0.71/1.12 ) ), ~( q4( a, b, X ) ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 111, [ ~( q4( a, b, a ) ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 112, [ ~( q3( a, b, X ) ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 113, [ ~( q1( a, b, X ) ) ] )
% 0.71/1.12 .
% 0.71/1.12 clause( 114, [] )
% 0.71/1.12 .
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 % SZS output end Refutation
% 0.71/1.12 found a proof!
% 0.71/1.12
% 0.71/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.12
% 0.71/1.12 initialclauses(
% 0.71/1.12 [ clause( 116, [ ~( equalish( X, Y ) ), ~( 'less_or_equalish'( X, Z ) ),
% 0.71/1.12 'less_or_equalish'( Y, Z ) ] )
% 0.71/1.12 , clause( 117, [ ~( equalish( X, Y ) ), ~( 'less_or_equalish'( Z, X ) ),
% 0.71/1.12 'less_or_equalish'( Z, Y ) ] )
% 0.71/1.12 , clause( 118, [ ~( q1( X, Y, Z ) ), ~( 'less_or_equalish'( X, Y ) ), q2( X
% 0.71/1.12 , Y, Z ) ] )
% 0.71/1.12 , clause( 119, [ ~( q1( X, Y, Z ) ), 'less_or_equalish'( X, Y ), q3( X, Y,
% 0.71/1.12 Z ) ] )
% 0.71/1.12 , clause( 120, [ ~( q2( X, Y, Z ) ), q4( X, Y, Y ) ] )
% 0.71/1.12 , clause( 121, [ ~( q3( X, Y, Z ) ), q4( X, Y, X ) ] )
% 0.71/1.12 , clause( 122, [ 'less_or_equalish'( X, X ) ] )
% 0.71/1.12 , clause( 123, [ ~( 'less_or_equalish'( X, Y ) ), ~( 'less_or_equalish'( Y
% 0.71/1.12 , X ) ), equalish( X, Y ) ] )
% 0.71/1.12 , clause( 124, [ ~( 'less_or_equalish'( X, Y ) ), ~( 'less_or_equalish'( Y
% 0.71/1.12 , Z ) ), 'less_or_equalish'( X, Z ) ] )
% 0.71/1.12 , clause( 125, [ 'less_or_equalish'( X, Y ), 'less_or_equalish'( Y, X ) ]
% 0.71/1.12 )
% 0.71/1.12 , clause( 126, [ 'less_or_equalish'( X, Y ), ~( equalish( X, Y ) ) ] )
% 0.71/1.12 , clause( 127, [ q1( a, b, c ) ] )
% 0.71/1.12 , clause( 128, [ ~( q4( a, b, X ) ), ~( 'less_or_equalish'( a, X ) ), ~(
% 0.71/1.12 'less_or_equalish'( b, X ) ), ~( 'less_or_equalish'( X, a ) ) ] )
% 0.71/1.12 , clause( 129, [ ~( q4( a, b, X ) ), ~( 'less_or_equalish'( a, X ) ), ~(
% 0.71/1.12 'less_or_equalish'( b, X ) ), ~( 'less_or_equalish'( X, b ) ) ] )
% 0.71/1.12 ] ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 2, [ ~( 'less_or_equalish'( X, Y ) ), ~( q1( X, Y, Z ) ), q2( X, Y
% 0.71/1.12 , Z ) ] )
% 0.71/1.12 , clause( 118, [ ~( q1( X, Y, Z ) ), ~( 'less_or_equalish'( X, Y ) ), q2( X
% 0.71/1.12 , Y, Z ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.12 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2, 2 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 3, [ 'less_or_equalish'( X, Y ), ~( q1( X, Y, Z ) ), q3( X, Y, Z )
% 0.71/1.12 ] )
% 0.71/1.12 , clause( 119, [ ~( q1( X, Y, Z ) ), 'less_or_equalish'( X, Y ), q3( X, Y,
% 0.71/1.12 Z ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.12 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2, 2 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 4, [ ~( q2( X, Y, Z ) ), q4( X, Y, Y ) ] )
% 0.71/1.12 , clause( 120, [ ~( q2( X, Y, Z ) ), q4( X, Y, Y ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.12 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 5, [ ~( q3( X, Y, Z ) ), q4( X, Y, X ) ] )
% 0.71/1.12 , clause( 121, [ ~( q3( X, Y, Z ) ), q4( X, Y, X ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.12 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 6, [ 'less_or_equalish'( X, X ) ] )
% 0.71/1.12 , clause( 122, [ 'less_or_equalish'( X, X ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 8, [ ~( 'less_or_equalish'( Y, Z ) ), 'less_or_equalish'( X, Z ),
% 0.71/1.12 ~( 'less_or_equalish'( X, Y ) ) ] )
% 0.71/1.12 , clause( 124, [ ~( 'less_or_equalish'( X, Y ) ), ~( 'less_or_equalish'( Y
% 0.71/1.12 , Z ) ), 'less_or_equalish'( X, Z ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.12 permutation( 0, [ ==>( 0, 2 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 9, [ 'less_or_equalish'( Y, X ), 'less_or_equalish'( X, Y ) ] )
% 0.71/1.12 , clause( 125, [ 'less_or_equalish'( X, Y ), 'less_or_equalish'( Y, X ) ]
% 0.71/1.12 )
% 0.71/1.12 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.12 ), ==>( 1, 1 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 11, [ q1( a, b, c ) ] )
% 0.71/1.12 , clause( 127, [ q1( a, b, c ) ] )
% 0.71/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 12, [ ~( 'less_or_equalish'( a, X ) ), ~( 'less_or_equalish'( b, X
% 0.71/1.12 ) ), ~( 'less_or_equalish'( X, a ) ), ~( q4( a, b, X ) ) ] )
% 0.71/1.12 , clause( 128, [ ~( q4( a, b, X ) ), ~( 'less_or_equalish'( a, X ) ), ~(
% 0.71/1.12 'less_or_equalish'( b, X ) ), ~( 'less_or_equalish'( X, a ) ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 3 ), ==>( 1,
% 0.71/1.12 0 ), ==>( 2, 1 ), ==>( 3, 2 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 13, [ ~( 'less_or_equalish'( a, X ) ), ~( 'less_or_equalish'( b, X
% 0.71/1.12 ) ), ~( 'less_or_equalish'( X, b ) ), ~( q4( a, b, X ) ) ] )
% 0.71/1.12 , clause( 129, [ ~( q4( a, b, X ) ), ~( 'less_or_equalish'( a, X ) ), ~(
% 0.71/1.12 'less_or_equalish'( b, X ) ), ~( 'less_or_equalish'( X, b ) ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 3 ), ==>( 1,
% 0.71/1.12 0 ), ==>( 2, 1 ), ==>( 3, 2 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 factor(
% 0.71/1.12 clause( 147, [ ~( 'less_or_equalish'( a, b ) ), ~( 'less_or_equalish'( b, b
% 0.71/1.12 ) ), ~( q4( a, b, b ) ) ] )
% 0.71/1.12 , clause( 13, [ ~( 'less_or_equalish'( a, X ) ), ~( 'less_or_equalish'( b,
% 0.71/1.12 X ) ), ~( 'less_or_equalish'( X, b ) ), ~( q4( a, b, X ) ) ] )
% 0.71/1.12 , 1, 2, substitution( 0, [ :=( X, b )] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 resolution(
% 0.71/1.12 clause( 148, [ ~( 'less_or_equalish'( a, b ) ), ~( q4( a, b, b ) ) ] )
% 0.71/1.12 , clause( 147, [ ~( 'less_or_equalish'( a, b ) ), ~( 'less_or_equalish'( b
% 0.71/1.12 , b ) ), ~( q4( a, b, b ) ) ] )
% 0.71/1.12 , 1, clause( 6, [ 'less_or_equalish'( X, X ) ] )
% 0.71/1.12 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, b )] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 16, [ ~( 'less_or_equalish'( a, b ) ), ~( q4( a, b, b ) ) ] )
% 0.71/1.12 , clause( 148, [ ~( 'less_or_equalish'( a, b ) ), ~( q4( a, b, b ) ) ] )
% 0.71/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] )
% 0.71/1.12 ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 resolution(
% 0.71/1.12 clause( 149, [ ~( 'less_or_equalish'( a, b ) ), ~( q2( a, b, X ) ) ] )
% 0.71/1.12 , clause( 16, [ ~( 'less_or_equalish'( a, b ) ), ~( q4( a, b, b ) ) ] )
% 0.71/1.12 , 1, clause( 4, [ ~( q2( X, Y, Z ) ), q4( X, Y, Y ) ] )
% 0.71/1.12 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.71/1.12 Z, X )] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 27, [ ~( 'less_or_equalish'( a, b ) ), ~( q2( a, b, X ) ) ] )
% 0.71/1.12 , clause( 149, [ ~( 'less_or_equalish'( a, b ) ), ~( q2( a, b, X ) ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.71/1.12 1 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 resolution(
% 0.71/1.12 clause( 150, [ ~( 'less_or_equalish'( a, b ) ), ~( 'less_or_equalish'( a, b
% 0.71/1.12 ) ), ~( q1( a, b, X ) ) ] )
% 0.71/1.12 , clause( 27, [ ~( 'less_or_equalish'( a, b ) ), ~( q2( a, b, X ) ) ] )
% 0.71/1.12 , 1, clause( 2, [ ~( 'less_or_equalish'( X, Y ) ), ~( q1( X, Y, Z ) ), q2(
% 0.71/1.12 X, Y, Z ) ] )
% 0.71/1.12 , 2, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, a ), :=( Y
% 0.71/1.12 , b ), :=( Z, X )] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 factor(
% 0.71/1.12 clause( 151, [ ~( 'less_or_equalish'( a, b ) ), ~( q1( a, b, X ) ) ] )
% 0.71/1.12 , clause( 150, [ ~( 'less_or_equalish'( a, b ) ), ~( 'less_or_equalish'( a
% 0.71/1.12 , b ) ), ~( q1( a, b, X ) ) ] )
% 0.71/1.12 , 0, 1, substitution( 0, [ :=( X, X )] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 32, [ ~( 'less_or_equalish'( a, b ) ), ~( q1( a, b, X ) ) ] )
% 0.71/1.12 , clause( 151, [ ~( 'less_or_equalish'( a, b ) ), ~( q1( a, b, X ) ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.71/1.12 1 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 resolution(
% 0.71/1.12 clause( 152, [ ~( 'less_or_equalish'( a, b ) ) ] )
% 0.71/1.12 , clause( 32, [ ~( 'less_or_equalish'( a, b ) ), ~( q1( a, b, X ) ) ] )
% 0.71/1.12 , 1, clause( 11, [ q1( a, b, c ) ] )
% 0.71/1.12 , 0, substitution( 0, [ :=( X, c )] ), substitution( 1, [] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 33, [ ~( 'less_or_equalish'( a, b ) ) ] )
% 0.71/1.12 , clause( 152, [ ~( 'less_or_equalish'( a, b ) ) ] )
% 0.71/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 resolution(
% 0.71/1.12 clause( 153, [ 'less_or_equalish'( b, a ) ] )
% 0.71/1.12 , clause( 33, [ ~( 'less_or_equalish'( a, b ) ) ] )
% 0.71/1.12 , 0, clause( 9, [ 'less_or_equalish'( Y, X ), 'less_or_equalish'( X, Y ) ]
% 0.71/1.12 )
% 0.71/1.12 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, b ), :=( Y, a )] )
% 0.71/1.12 ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 39, [ 'less_or_equalish'( b, a ) ] )
% 0.71/1.12 , clause( 153, [ 'less_or_equalish'( b, a ) ] )
% 0.71/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 resolution(
% 0.71/1.12 clause( 155, [ ~( 'less_or_equalish'( a, X ) ), 'less_or_equalish'( b, X )
% 0.71/1.12 ] )
% 0.71/1.12 , clause( 8, [ ~( 'less_or_equalish'( Y, Z ) ), 'less_or_equalish'( X, Z )
% 0.71/1.12 , ~( 'less_or_equalish'( X, Y ) ) ] )
% 0.71/1.12 , 2, clause( 39, [ 'less_or_equalish'( b, a ) ] )
% 0.71/1.12 , 0, substitution( 0, [ :=( X, b ), :=( Y, a ), :=( Z, X )] ),
% 0.71/1.12 substitution( 1, [] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 77, [ ~( 'less_or_equalish'( a, X ) ), 'less_or_equalish'( b, X ) ]
% 0.71/1.12 )
% 0.71/1.12 , clause( 155, [ ~( 'less_or_equalish'( a, X ) ), 'less_or_equalish'( b, X
% 0.71/1.12 ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.71/1.12 1 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 resolution(
% 0.71/1.12 clause( 159, [ ~( 'less_or_equalish'( a, X ) ), ~( 'less_or_equalish'( X, a
% 0.71/1.12 ) ), ~( q4( a, b, X ) ), ~( 'less_or_equalish'( a, X ) ) ] )
% 0.71/1.12 , clause( 12, [ ~( 'less_or_equalish'( a, X ) ), ~( 'less_or_equalish'( b,
% 0.71/1.12 X ) ), ~( 'less_or_equalish'( X, a ) ), ~( q4( a, b, X ) ) ] )
% 0.71/1.12 , 1, clause( 77, [ ~( 'less_or_equalish'( a, X ) ), 'less_or_equalish'( b,
% 0.71/1.12 X ) ] )
% 0.71/1.12 , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.71/1.12 ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 factor(
% 0.71/1.12 clause( 161, [ ~( 'less_or_equalish'( a, X ) ), ~( 'less_or_equalish'( X, a
% 0.71/1.12 ) ), ~( q4( a, b, X ) ) ] )
% 0.71/1.12 , clause( 159, [ ~( 'less_or_equalish'( a, X ) ), ~( 'less_or_equalish'( X
% 0.71/1.12 , a ) ), ~( q4( a, b, X ) ), ~( 'less_or_equalish'( a, X ) ) ] )
% 0.71/1.12 , 0, 3, substitution( 0, [ :=( X, X )] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 110, [ ~( 'less_or_equalish'( a, X ) ), ~( 'less_or_equalish'( X, a
% 0.71/1.12 ) ), ~( q4( a, b, X ) ) ] )
% 0.71/1.12 , clause( 161, [ ~( 'less_or_equalish'( a, X ) ), ~( 'less_or_equalish'( X
% 0.71/1.12 , a ) ), ~( q4( a, b, X ) ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.71/1.12 1 ), ==>( 2, 2 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 factor(
% 0.71/1.12 clause( 163, [ ~( 'less_or_equalish'( a, a ) ), ~( q4( a, b, a ) ) ] )
% 0.71/1.12 , clause( 110, [ ~( 'less_or_equalish'( a, X ) ), ~( 'less_or_equalish'( X
% 0.71/1.12 , a ) ), ~( q4( a, b, X ) ) ] )
% 0.71/1.12 , 0, 1, substitution( 0, [ :=( X, a )] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 resolution(
% 0.71/1.12 clause( 164, [ ~( q4( a, b, a ) ) ] )
% 0.71/1.12 , clause( 163, [ ~( 'less_or_equalish'( a, a ) ), ~( q4( a, b, a ) ) ] )
% 0.71/1.12 , 0, clause( 6, [ 'less_or_equalish'( X, X ) ] )
% 0.71/1.12 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 111, [ ~( q4( a, b, a ) ) ] )
% 0.71/1.12 , clause( 164, [ ~( q4( a, b, a ) ) ] )
% 0.71/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 resolution(
% 0.71/1.12 clause( 165, [ ~( q3( a, b, X ) ) ] )
% 0.71/1.12 , clause( 111, [ ~( q4( a, b, a ) ) ] )
% 0.71/1.12 , 0, clause( 5, [ ~( q3( X, Y, Z ) ), q4( X, Y, X ) ] )
% 0.71/1.12 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.71/1.12 Z, X )] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 112, [ ~( q3( a, b, X ) ) ] )
% 0.71/1.12 , clause( 165, [ ~( q3( a, b, X ) ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 resolution(
% 0.71/1.12 clause( 166, [ 'less_or_equalish'( a, b ), ~( q1( a, b, X ) ) ] )
% 0.71/1.12 , clause( 112, [ ~( q3( a, b, X ) ) ] )
% 0.71/1.12 , 0, clause( 3, [ 'less_or_equalish'( X, Y ), ~( q1( X, Y, Z ) ), q3( X, Y
% 0.71/1.12 , Z ) ] )
% 0.71/1.12 , 2, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, a ), :=( Y
% 0.71/1.12 , b ), :=( Z, X )] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 resolution(
% 0.71/1.12 clause( 167, [ ~( q1( a, b, X ) ) ] )
% 0.71/1.12 , clause( 33, [ ~( 'less_or_equalish'( a, b ) ) ] )
% 0.71/1.12 , 0, clause( 166, [ 'less_or_equalish'( a, b ), ~( q1( a, b, X ) ) ] )
% 0.71/1.12 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, X )] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 113, [ ~( q1( a, b, X ) ) ] )
% 0.71/1.12 , clause( 167, [ ~( q1( a, b, X ) ) ] )
% 0.71/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 resolution(
% 0.71/1.12 clause( 168, [] )
% 0.71/1.12 , clause( 113, [ ~( q1( a, b, X ) ) ] )
% 0.71/1.12 , 0, clause( 11, [ q1( a, b, c ) ] )
% 0.71/1.12 , 0, substitution( 0, [ :=( X, c )] ), substitution( 1, [] )).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 subsumption(
% 0.71/1.12 clause( 114, [] )
% 0.71/1.12 , clause( 168, [] )
% 0.71/1.12 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 end.
% 0.71/1.12
% 0.71/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.12
% 0.71/1.12 Memory use:
% 0.71/1.12
% 0.71/1.12 space for terms: 1584
% 0.71/1.12 space for clauses: 4836
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 clauses generated: 268
% 0.71/1.12 clauses kept: 115
% 0.71/1.12 clauses selected: 38
% 0.71/1.12 clauses deleted: 1
% 0.71/1.12 clauses inuse deleted: 0
% 0.71/1.12
% 0.71/1.12 subsentry: 1720
% 0.71/1.12 literals s-matched: 1205
% 0.71/1.12 literals matched: 1205
% 0.71/1.12 full subsumption: 614
% 0.71/1.12
% 0.71/1.12 checksum: -270554882
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 Bliksem ended
%------------------------------------------------------------------------------