TSTP Solution File: KRS002-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KRS002-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n024.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 : Sun Jul 17 02:41:55 EDT 2022
% Result : Unsatisfiable 0.42s 1.05s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KRS002-1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n024.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 : Tue Jun 7 07:53:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.05 *** allocated 10000 integers for termspace/termends
% 0.42/1.05 *** allocated 10000 integers for clauses
% 0.42/1.05 *** allocated 10000 integers for justifications
% 0.42/1.05 Bliksem 1.12
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Automatic Strategy Selection
% 0.42/1.05
% 0.42/1.05 Clauses:
% 0.42/1.05 [
% 0.42/1.05 [ e( exist ) ],
% 0.42/1.05 [ s2least( X ), ~( c( X ) ) ],
% 0.42/1.05 [ c( X ), ~( s2least( X ) ) ],
% 0.42/1.05 [ ~( s2least( X ) ), ~( equalish( u1r2( X ), u1r1( X ) ) ) ],
% 0.42/1.05 [ s( X, u1r1( X ) ), ~( s2least( X ) ) ],
% 0.42/1.05 [ s( X, u1r2( X ) ), ~( s2least( X ) ) ],
% 0.42/1.05 [ s2least( X ), equalish( Y, Z ), ~( s( X, Y ) ), ~( s( X, Z ) ) ],
% 0.42/1.05 [ s1most( X ), ~( d( X ) ) ],
% 0.42/1.05 [ d( X ), ~( s1most( X ) ) ],
% 0.42/1.05 [ equalish( X, Y ), ~( s1most( Z ) ), ~( s( Z, X ) ), ~( s( Z, Y ) ) ]
% 0.42/1.05 ,
% 0.42/1.05 [ s1most( X ), ~( equalish( u3r2( X ), u3r1( X ) ) ) ],
% 0.42/1.05 [ s1most( X ), s( X, u3r1( X ) ) ],
% 0.42/1.05 [ s1most( X ), s( X, u3r2( X ) ) ],
% 0.42/1.05 [ r( X, u4r2( X ) ), ~( e( X ) ) ],
% 0.42/1.05 [ d( X ), ~( e( Y ) ), ~( r( Y, X ) ) ],
% 0.42/1.05 [ c( X ), ~( e( Y ) ), ~( r( Y, X ) ) ],
% 0.42/1.05 [ e( X ), ~( c( u4r1( X ) ) ), ~( d( u4r1( X ) ) ), ~( r( X, Y ) ) ]
% 0.42/1.05 ,
% 0.42/1.05 [ e( X ), r( X, u4r1( X ) ), ~( r( X, Y ) ) ]
% 0.42/1.05 ] .
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 percentage equality = 0.000000, percentage horn = 0.777778
% 0.42/1.05 This a non-horn, non-equality problem
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Options Used:
% 0.42/1.05
% 0.42/1.05 useres = 1
% 0.42/1.05 useparamod = 0
% 0.42/1.05 useeqrefl = 0
% 0.42/1.05 useeqfact = 0
% 0.42/1.05 usefactor = 1
% 0.42/1.05 usesimpsplitting = 0
% 0.42/1.05 usesimpdemod = 0
% 0.42/1.05 usesimpres = 3
% 0.42/1.05
% 0.42/1.05 resimpinuse = 1000
% 0.42/1.05 resimpclauses = 20000
% 0.42/1.05 substype = standard
% 0.42/1.05 backwardsubs = 1
% 0.42/1.05 selectoldest = 5
% 0.42/1.05
% 0.42/1.05 litorderings [0] = split
% 0.42/1.05 litorderings [1] = liftord
% 0.42/1.05
% 0.42/1.05 termordering = none
% 0.42/1.05
% 0.42/1.05 litapriori = 1
% 0.42/1.05 termapriori = 0
% 0.42/1.05 litaposteriori = 0
% 0.42/1.05 termaposteriori = 0
% 0.42/1.05 demodaposteriori = 0
% 0.42/1.05 ordereqreflfact = 0
% 0.42/1.05
% 0.42/1.05 litselect = none
% 0.42/1.05
% 0.42/1.05 maxweight = 15
% 0.42/1.05 maxdepth = 30000
% 0.42/1.05 maxlength = 115
% 0.42/1.05 maxnrvars = 195
% 0.42/1.05 excuselevel = 1
% 0.42/1.05 increasemaxweight = 1
% 0.42/1.05
% 0.42/1.05 maxselected = 10000000
% 0.42/1.05 maxnrclauses = 10000000
% 0.42/1.05
% 0.42/1.05 showgenerated = 0
% 0.42/1.05 showkept = 0
% 0.42/1.05 showselected = 0
% 0.42/1.05 showdeleted = 0
% 0.42/1.05 showresimp = 1
% 0.42/1.05 showstatus = 2000
% 0.42/1.05
% 0.42/1.05 prologoutput = 1
% 0.42/1.05 nrgoals = 5000000
% 0.42/1.05 totalproof = 1
% 0.42/1.05
% 0.42/1.05 Symbols occurring in the translation:
% 0.42/1.05
% 0.42/1.05 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.05 . [1, 2] (w:1, o:29, a:1, s:1, b:0),
% 0.42/1.05 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.42/1.05 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.05 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.05 exist [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.42/1.05 e [40, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.42/1.05 s2least [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.42/1.05 c [43, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.42/1.05 u1r2 [44, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.42/1.05 u1r1 [45, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.42/1.05 equalish [46, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.42/1.05 s [47, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.42/1.05 s1most [50, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.42/1.05 d [51, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.42/1.05 u3r2 [52, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.42/1.05 u3r1 [53, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.42/1.05 u4r2 [54, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.42/1.05 r [55, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.42/1.05 u4r1 [56, 1] (w:1, o:27, a:1, s:1, b:0).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Starting Search:
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Bliksems!, er is een bewijs:
% 0.42/1.05 % SZS status Unsatisfiable
% 0.42/1.05 % SZS output start Refutation
% 0.42/1.05
% 0.42/1.05 clause( 0, [ e( exist ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 1, [ s2least( X ), ~( c( X ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 3, [ ~( s2least( X ) ), ~( equalish( u1r2( X ), u1r1( X ) ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 4, [ ~( s2least( X ) ), s( X, u1r1( X ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 5, [ ~( s2least( X ) ), s( X, u1r2( X ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 7, [ ~( d( X ) ), s1most( X ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 9, [ ~( s1most( Z ) ), equalish( X, Y ), ~( s( Z, Y ) ), ~( s( Z, X
% 0.42/1.05 ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 13, [ ~( e( X ) ), r( X, u4r2( X ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 14, [ d( X ), ~( e( Y ) ), ~( r( Y, X ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 15, [ ~( e( Y ) ), c( X ), ~( r( Y, X ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 20, [ ~( e( X ) ), c( u4r2( X ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 21, [ ~( e( X ) ), s2least( u4r2( X ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 22, [ d( u4r2( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 30, [ ~( s1most( X ) ), equalish( Y, u1r1( X ) ), ~( s2least( X ) )
% 0.42/1.05 , ~( s( X, Y ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 36, [ ~( s1most( X ) ), ~( s2least( X ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 37, [ ~( e( X ) ), ~( s1most( u4r2( X ) ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 39, [ ~( e( X ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 40, [] )
% 0.42/1.05 .
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 % SZS output end Refutation
% 0.42/1.05 found a proof!
% 0.42/1.05
% 0.42/1.05 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.05
% 0.42/1.05 initialclauses(
% 0.42/1.05 [ clause( 42, [ e( exist ) ] )
% 0.42/1.05 , clause( 43, [ s2least( X ), ~( c( X ) ) ] )
% 0.42/1.05 , clause( 44, [ c( X ), ~( s2least( X ) ) ] )
% 0.42/1.05 , clause( 45, [ ~( s2least( X ) ), ~( equalish( u1r2( X ), u1r1( X ) ) ) ]
% 0.42/1.05 )
% 0.42/1.05 , clause( 46, [ s( X, u1r1( X ) ), ~( s2least( X ) ) ] )
% 0.42/1.05 , clause( 47, [ s( X, u1r2( X ) ), ~( s2least( X ) ) ] )
% 0.42/1.05 , clause( 48, [ s2least( X ), equalish( Y, Z ), ~( s( X, Y ) ), ~( s( X, Z
% 0.42/1.05 ) ) ] )
% 0.42/1.05 , clause( 49, [ s1most( X ), ~( d( X ) ) ] )
% 0.42/1.05 , clause( 50, [ d( X ), ~( s1most( X ) ) ] )
% 0.42/1.05 , clause( 51, [ equalish( X, Y ), ~( s1most( Z ) ), ~( s( Z, X ) ), ~( s( Z
% 0.42/1.05 , Y ) ) ] )
% 0.42/1.05 , clause( 52, [ s1most( X ), ~( equalish( u3r2( X ), u3r1( X ) ) ) ] )
% 0.42/1.05 , clause( 53, [ s1most( X ), s( X, u3r1( X ) ) ] )
% 0.42/1.05 , clause( 54, [ s1most( X ), s( X, u3r2( X ) ) ] )
% 0.42/1.05 , clause( 55, [ r( X, u4r2( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , clause( 56, [ d( X ), ~( e( Y ) ), ~( r( Y, X ) ) ] )
% 0.42/1.05 , clause( 57, [ c( X ), ~( e( Y ) ), ~( r( Y, X ) ) ] )
% 0.42/1.05 , clause( 58, [ e( X ), ~( c( u4r1( X ) ) ), ~( d( u4r1( X ) ) ), ~( r( X,
% 0.42/1.05 Y ) ) ] )
% 0.42/1.05 , clause( 59, [ e( X ), r( X, u4r1( X ) ), ~( r( X, Y ) ) ] )
% 0.42/1.05 ] ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 0, [ e( exist ) ] )
% 0.42/1.05 , clause( 42, [ e( exist ) ] )
% 0.42/1.05 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 1, [ s2least( X ), ~( c( X ) ) ] )
% 0.42/1.05 , clause( 43, [ s2least( X ), ~( c( X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.42/1.05 1 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 3, [ ~( s2least( X ) ), ~( equalish( u1r2( X ), u1r1( X ) ) ) ] )
% 0.42/1.05 , clause( 45, [ ~( s2least( X ) ), ~( equalish( u1r2( X ), u1r1( X ) ) ) ]
% 0.42/1.05 )
% 0.42/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.42/1.05 1 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 4, [ ~( s2least( X ) ), s( X, u1r1( X ) ) ] )
% 0.42/1.05 , clause( 46, [ s( X, u1r1( X ) ), ~( s2least( X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.05 0 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 5, [ ~( s2least( X ) ), s( X, u1r2( X ) ) ] )
% 0.42/1.05 , clause( 47, [ s( X, u1r2( X ) ), ~( s2least( X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.05 0 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 7, [ ~( d( X ) ), s1most( X ) ] )
% 0.42/1.05 , clause( 49, [ s1most( X ), ~( d( X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.05 0 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 9, [ ~( s1most( Z ) ), equalish( X, Y ), ~( s( Z, Y ) ), ~( s( Z, X
% 0.42/1.05 ) ) ] )
% 0.42/1.05 , clause( 51, [ equalish( X, Y ), ~( s1most( Z ) ), ~( s( Z, X ) ), ~( s( Z
% 0.42/1.05 , Y ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.42/1.05 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2, 3 ), ==>( 3, 2 )] )
% 0.42/1.05 ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 13, [ ~( e( X ) ), r( X, u4r2( X ) ) ] )
% 0.42/1.05 , clause( 55, [ r( X, u4r2( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.05 0 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 14, [ d( X ), ~( e( Y ) ), ~( r( Y, X ) ) ] )
% 0.42/1.05 , clause( 56, [ d( X ), ~( e( Y ) ), ~( r( Y, X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.05 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 15, [ ~( e( Y ) ), c( X ), ~( r( Y, X ) ) ] )
% 0.42/1.05 , clause( 57, [ c( X ), ~( e( Y ) ), ~( r( Y, X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.42/1.05 ), ==>( 1, 0 ), ==>( 2, 2 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 69, [ ~( e( X ) ), c( u4r2( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , clause( 15, [ ~( e( Y ) ), c( X ), ~( r( Y, X ) ) ] )
% 0.42/1.05 , 2, clause( 13, [ ~( e( X ) ), r( X, u4r2( X ) ) ] )
% 0.42/1.05 , 1, substitution( 0, [ :=( X, u4r2( X ) ), :=( Y, X )] ), substitution( 1
% 0.42/1.05 , [ :=( X, X )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 factor(
% 0.42/1.05 clause( 70, [ ~( e( X ) ), c( u4r2( X ) ) ] )
% 0.42/1.05 , clause( 69, [ ~( e( X ) ), c( u4r2( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , 0, 2, substitution( 0, [ :=( X, X )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 20, [ ~( e( X ) ), c( u4r2( X ) ) ] )
% 0.42/1.05 , clause( 70, [ ~( e( X ) ), c( u4r2( X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.42/1.05 1 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 71, [ s2least( u4r2( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , clause( 1, [ s2least( X ), ~( c( X ) ) ] )
% 0.42/1.05 , 1, clause( 20, [ ~( e( X ) ), c( u4r2( X ) ) ] )
% 0.42/1.05 , 1, substitution( 0, [ :=( X, u4r2( X ) )] ), substitution( 1, [ :=( X, X
% 0.42/1.05 )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 21, [ ~( e( X ) ), s2least( u4r2( X ) ) ] )
% 0.42/1.05 , clause( 71, [ s2least( u4r2( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.05 0 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 72, [ d( u4r2( X ) ), ~( e( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , clause( 14, [ d( X ), ~( e( Y ) ), ~( r( Y, X ) ) ] )
% 0.42/1.05 , 2, clause( 13, [ ~( e( X ) ), r( X, u4r2( X ) ) ] )
% 0.42/1.05 , 1, substitution( 0, [ :=( X, u4r2( X ) ), :=( Y, X )] ), substitution( 1
% 0.42/1.05 , [ :=( X, X )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 factor(
% 0.42/1.05 clause( 73, [ d( u4r2( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , clause( 72, [ d( u4r2( X ) ), ~( e( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , 1, 2, substitution( 0, [ :=( X, X )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 22, [ d( u4r2( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , clause( 73, [ d( u4r2( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.42/1.05 1 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 74, [ ~( s1most( X ) ), equalish( Y, u1r1( X ) ), ~( s( X, Y ) ),
% 0.42/1.05 ~( s2least( X ) ) ] )
% 0.42/1.05 , clause( 9, [ ~( s1most( Z ) ), equalish( X, Y ), ~( s( Z, Y ) ), ~( s( Z
% 0.42/1.05 , X ) ) ] )
% 0.42/1.05 , 2, clause( 4, [ ~( s2least( X ) ), s( X, u1r1( X ) ) ] )
% 0.42/1.05 , 1, substitution( 0, [ :=( X, Y ), :=( Y, u1r1( X ) ), :=( Z, X )] ),
% 0.42/1.05 substitution( 1, [ :=( X, X )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 30, [ ~( s1most( X ) ), equalish( Y, u1r1( X ) ), ~( s2least( X ) )
% 0.42/1.05 , ~( s( X, Y ) ) ] )
% 0.42/1.05 , clause( 74, [ ~( s1most( X ) ), equalish( Y, u1r1( X ) ), ~( s( X, Y ) )
% 0.42/1.05 , ~( s2least( X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.05 ), ==>( 1, 1 ), ==>( 2, 3 ), ==>( 3, 2 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 76, [ ~( s1most( X ) ), equalish( u1r2( X ), u1r1( X ) ), ~(
% 0.42/1.05 s2least( X ) ), ~( s2least( X ) ) ] )
% 0.42/1.05 , clause( 30, [ ~( s1most( X ) ), equalish( Y, u1r1( X ) ), ~( s2least( X )
% 0.42/1.05 ), ~( s( X, Y ) ) ] )
% 0.42/1.05 , 3, clause( 5, [ ~( s2least( X ) ), s( X, u1r2( X ) ) ] )
% 0.42/1.05 , 1, substitution( 0, [ :=( X, X ), :=( Y, u1r2( X ) )] ), substitution( 1
% 0.42/1.05 , [ :=( X, X )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 78, [ ~( s2least( X ) ), ~( s1most( X ) ), ~( s2least( X ) ), ~(
% 0.42/1.05 s2least( X ) ) ] )
% 0.42/1.05 , clause( 3, [ ~( s2least( X ) ), ~( equalish( u1r2( X ), u1r1( X ) ) ) ]
% 0.42/1.05 )
% 0.42/1.05 , 1, clause( 76, [ ~( s1most( X ) ), equalish( u1r2( X ), u1r1( X ) ), ~(
% 0.42/1.05 s2least( X ) ), ~( s2least( X ) ) ] )
% 0.42/1.05 , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.42/1.05 ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 factor(
% 0.42/1.05 clause( 79, [ ~( s2least( X ) ), ~( s1most( X ) ), ~( s2least( X ) ) ] )
% 0.42/1.05 , clause( 78, [ ~( s2least( X ) ), ~( s1most( X ) ), ~( s2least( X ) ), ~(
% 0.42/1.05 s2least( X ) ) ] )
% 0.42/1.05 , 0, 2, substitution( 0, [ :=( X, X )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 factor(
% 0.42/1.05 clause( 80, [ ~( s2least( X ) ), ~( s1most( X ) ) ] )
% 0.42/1.05 , clause( 79, [ ~( s2least( X ) ), ~( s1most( X ) ), ~( s2least( X ) ) ] )
% 0.42/1.05 , 0, 2, substitution( 0, [ :=( X, X )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 36, [ ~( s1most( X ) ), ~( s2least( X ) ) ] )
% 0.42/1.05 , clause( 80, [ ~( s2least( X ) ), ~( s1most( X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.05 0 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 81, [ ~( s1most( u4r2( X ) ) ), ~( e( X ) ) ] )
% 0.42/1.05 , clause( 36, [ ~( s1most( X ) ), ~( s2least( X ) ) ] )
% 0.42/1.05 , 1, clause( 21, [ ~( e( X ) ), s2least( u4r2( X ) ) ] )
% 0.42/1.05 , 1, substitution( 0, [ :=( X, u4r2( X ) )] ), substitution( 1, [ :=( X, X
% 0.42/1.05 )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 37, [ ~( e( X ) ), ~( s1most( u4r2( X ) ) ) ] )
% 0.42/1.05 , clause( 81, [ ~( s1most( u4r2( X ) ) ), ~( e( X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.05 0 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 82, [ ~( e( X ) ), ~( d( u4r2( X ) ) ) ] )
% 0.42/1.05 , clause( 37, [ ~( e( X ) ), ~( s1most( u4r2( X ) ) ) ] )
% 0.42/1.05 , 1, clause( 7, [ ~( d( X ) ), s1most( X ) ] )
% 0.42/1.05 , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, u4r2( X )
% 0.42/1.05 )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 83, [ ~( e( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , clause( 82, [ ~( e( X ) ), ~( d( u4r2( X ) ) ) ] )
% 0.42/1.05 , 1, clause( 22, [ d( u4r2( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , 0, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.42/1.05 ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 factor(
% 0.42/1.05 clause( 84, [ ~( e( X ) ) ] )
% 0.42/1.05 , clause( 83, [ ~( e( X ) ), ~( e( X ) ) ] )
% 0.42/1.05 , 0, 1, substitution( 0, [ :=( X, X )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 39, [ ~( e( X ) ) ] )
% 0.42/1.05 , clause( 84, [ ~( e( X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 85, [] )
% 0.42/1.05 , clause( 39, [ ~( e( X ) ) ] )
% 0.42/1.05 , 0, clause( 0, [ e( exist ) ] )
% 0.42/1.05 , 0, substitution( 0, [ :=( X, exist )] ), substitution( 1, [] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 40, [] )
% 0.42/1.05 , clause( 85, [] )
% 0.42/1.05 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 end.
% 0.42/1.05
% 0.42/1.05 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.05
% 0.42/1.05 Memory use:
% 0.42/1.05
% 0.42/1.05 space for terms: 758
% 0.42/1.05 space for clauses: 2197
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 clauses generated: 69
% 0.42/1.05 clauses kept: 41
% 0.42/1.05 clauses selected: 34
% 0.42/1.05 clauses deleted: 0
% 0.42/1.05 clauses inuse deleted: 0
% 0.42/1.05
% 0.42/1.05 subsentry: 44
% 0.42/1.05 literals s-matched: 34
% 0.42/1.05 literals matched: 20
% 0.42/1.05 full subsumption: 0
% 0.42/1.05
% 0.42/1.05 checksum: 278155248
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Bliksem ended
%------------------------------------------------------------------------------