%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWX200-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n022.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 : Tue May 5 06:56:47 PM UTC 2026
% Result : Unsatisfiable 0.64s 1.06s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWX200-1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.10 % Command : bliksem %s
% 0.12/0.30 % Computer : n022.cluster.edu
% 0.12/0.30 % Model : x86_64 x86_64
% 0.12/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30 % Memory : 8042.1875MB
% 0.12/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.30 % CPULimit : 300
% 0.12/0.30 % DateTime : Tue May 5 11:15:35 EDT 2026
% 0.12/0.30 % CPUTime :
% 0.64/1.06 *** allocated 10000 integers for termspace/termends
% 0.64/1.06 *** allocated 10000 integers for clauses
% 0.64/1.06 *** allocated 10000 integers for justifications
% 0.64/1.06 Bliksem 1.12
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 Automatic Strategy Selection
% 0.64/1.06
% 0.64/1.06 Clauses:
% 0.64/1.06 [
% 0.64/1.06 [ =( aux( X, Y, Z, T, btrue ), cons( X, merge( Y, cons( Z, T ) ) ) ) ]
% 0.64/1.06 ,
% 0.64/1.06 [ =( aux( X, Y, Z, T, bfalse ), cons( Z, merge( cons( X, Y ), T ) ) ) ]
% 0.64/1.06 ,
% 0.64/1.06 [ =( aux2( X, Y, Z, btrue ), ord( cons( Y, Z ) ) ) ],
% 0.64/1.06 [ =( aux2( X, Y, Z, bfalse ), bfalse ) ],
% 0.64/1.06 [ =( leqNat( z, X ), btrue ) ],
% 0.64/1.06 [ =( leqNat( s( X ), z ), bfalse ) ],
% 0.64/1.06 [ =( leqNat( s( X ), s( Y ) ), leqNat( X, Y ) ) ],
% 0.64/1.06 [ =( merge( nil, X ), X ) ],
% 0.64/1.06 [ =( merge( cons( X, Y ), nil ), cons( X, Y ) ) ],
% 0.64/1.06 [ =( merge( cons( X, Y ), cons( Z, T ) ), aux( X, Y, Z, T, leqNat( X, Z
% 0.64/1.06 ) ) ) ],
% 0.64/1.06 [ =( ord( nil ), btrue ) ],
% 0.64/1.06 [ =( ord( cons( X, nil ) ), btrue ) ],
% 0.64/1.06 [ =( ord( cons( X, cons( Y, Z ) ) ), aux2( X, Y, Z, leqNat( X, Y ) ) ) ]
% 0.64/1.06 ,
% 0.64/1.06 [ =( impl( btrue, X ), X ) ],
% 0.64/1.06 [ =( impl( bfalse, X ), btrue ) ],
% 0.64/1.06 [ =( 'prop_merge_ord_not3'( X, Y ), impl( eq2( ord( X ), btrue ), impl(
% 0.64/1.06 eq2( ord( Y ), bfalse ), eq2( ord( merge( X, Y ) ), btrue ) ) ) ) ],
% 0.64/1.06 [ =( eq2( bfalse, btrue ), bfalse ) ],
% 0.64/1.06 [ =( eq2( btrue, bfalse ), bfalse ) ],
% 0.64/1.06 [ =( eq( s( X ), s( Y ) ), eq( X, Y ) ) ],
% 0.64/1.06 [ =( eq( z, s( X ) ), bfalse ) ],
% 0.64/1.06 [ =( eq( s( X ), z ), bfalse ) ],
% 0.64/1.06 [ =( eq( X, X ), btrue ) ],
% 0.64/1.06 [ =( eq2( X, X ), btrue ) ],
% 0.64/1.06 [ ~( =( eq2( 'prop_merge_ord_not3'( X, Y ), bfalse ), btrue ) ) ]
% 0.64/1.06 ] .
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 percentage equality = 1.000000, percentage horn = 1.000000
% 0.64/1.06 This is a pure equality problem
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 Options Used:
% 0.64/1.06
% 0.64/1.06 useres = 1
% 0.64/1.06 useparamod = 1
% 0.64/1.06 useeqrefl = 1
% 0.64/1.06 useeqfact = 1
% 0.64/1.06 usefactor = 1
% 0.64/1.06 usesimpsplitting = 0
% 0.64/1.06 usesimpdemod = 5
% 0.64/1.06 usesimpres = 3
% 0.64/1.06
% 0.64/1.06 resimpinuse = 1000
% 0.64/1.06 resimpclauses = 20000
% 0.64/1.06 substype = eqrewr
% 0.64/1.06 backwardsubs = 1
% 0.64/1.06 selectoldest = 5
% 0.64/1.06
% 0.64/1.06 litorderings [0] = split
% 0.64/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.64/1.06
% 0.64/1.06 termordering = kbo
% 0.64/1.06
% 0.64/1.06 litapriori = 0
% 0.64/1.06 termapriori = 1
% 0.64/1.06 litaposteriori = 0
% 0.64/1.06 termaposteriori = 0
% 0.64/1.06 demodaposteriori = 0
% 0.64/1.06 ordereqreflfact = 0
% 0.64/1.06
% 0.64/1.06 litselect = negord
% 0.64/1.06
% 0.64/1.06 maxweight = 15
% 0.64/1.06 maxdepth = 30000
% 0.64/1.06 maxlength = 115
% 0.64/1.06 maxnrvars = 195
% 0.64/1.06 excuselevel = 1
% 0.64/1.06 increasemaxweight = 1
% 0.64/1.06
% 0.64/1.06 maxselected = 10000000
% 0.64/1.06 maxnrclauses = 10000000
% 0.64/1.06
% 0.64/1.06 showgenerated = 0
% 0.64/1.06 showkept = 0
% 0.64/1.06 showselected = 0
% 0.64/1.06 showdeleted = 0
% 0.64/1.06 showresimp = 1
% 0.64/1.06 showstatus = 2000
% 0.64/1.06
% 0.64/1.06 prologoutput = 1
% 0.64/1.06 nrgoals = 5000000
% 0.64/1.06 totalproof = 1
% 0.64/1.06
% 0.64/1.06 Symbols occurring in the translation:
% 0.64/1.06
% 0.64/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.64/1.06 . [1, 2] (w:1, o:28, a:1, s:1, b:0),
% 0.64/1.06 ! [4, 1] (w:0, o:21, a:1, s:1, b:0),
% 0.64/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.64/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.64/1.06 btrue [43, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.64/1.06 aux [44, 5] (w:1, o:61, a:1, s:1, b:0),
% 0.64/1.06 cons [45, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.64/1.06 merge [46, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.64/1.06 bfalse [47, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.64/1.06 aux2 [49, 4] (w:1, o:60, a:1, s:1, b:0),
% 0.64/1.06 ord [50, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.64/1.06 z [51, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.64/1.06 leqNat [52, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.64/1.06 s [53, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.64/1.06 nil [55, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.64/1.06 impl [57, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.64/1.06 'prop_merge_ord_not3' [59, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.64/1.06 eq2 [60, 2] (w:1, o:58, a:1, s:1, b:0),
% 0.64/1.06 eq [61, 2] (w:1, o:59, a:1, s:1, b:0).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 Starting Search:
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 Bliksems!, er is een bewijs:
% 0.64/1.06 % SZS status Unsatisfiable
% 0.64/1.06 % SZS output start Refutation
% 0.64/1.06
% 0.64/1.06 clause( 3, [ =( aux2( X, Y, Z, bfalse ), bfalse ) ] )
% 0.64/1.06 .
% 0.64/1.06 clause( 5, [ =( leqNat( s( X ), z ), bfalse ) ] )
% 0.64/1.06 .
% 0.64/1.06 clause( 7, [ =( merge( nil, X ), X ) ] )
% 0.64/1.06 .
% 0.64/1.06 clause( 10, [ =( ord( nil ), btrue ) ] )
% 0.64/1.06 .
% 0.64/1.06 clause( 12, [ =( aux2( X, Y, Z, leqNat( X, Y ) ), ord( cons( X, cons( Y, Z
% 0.64/1.06 ) ) ) ) ] )
% 0.64/1.06 .
% 0.64/1.06 clause( 13, [ =( impl( btrue, X ), X ) ] )
% 0.64/1.06 .
% 0.64/1.06 clause( 15, [ =( impl( eq2( ord( X ), btrue ), impl( eq2( ord( Y ), bfalse
% 0.64/1.06 ), eq2( ord( merge( X, Y ) ), btrue ) ) ), 'prop_merge_ord_not3'( X, Y )
% 0.64/1.06 ) ] )
% 0.64/1.06 .
% 0.64/1.06 clause( 16, [ =( eq2( bfalse, btrue ), bfalse ) ] )
% 0.64/1.06 .
% 0.64/1.06 clause( 22, [ =( eq2( X, X ), btrue ) ] )
% 0.64/1.06 .
% 0.64/1.06 clause( 23, [ ~( =( eq2( 'prop_merge_ord_not3'( X, Y ), bfalse ), btrue ) )
% 0.64/1.06 ] )
% 0.64/1.06 .
% 0.64/1.06 clause( 34, [ =( ord( cons( s( X ), cons( z, Y ) ) ), bfalse ) ] )
% 0.64/1.06 .
% 0.64/1.06 clause( 47, [ =( impl( eq2( ord( X ), bfalse ), eq2( ord( X ), btrue ) ),
% 0.64/1.06 'prop_merge_ord_not3'( nil, X ) ) ] )
% 0.64/1.06 .
% 0.64/1.06 clause( 57, [ =( 'prop_merge_ord_not3'( nil, cons( s( X ), cons( z, Y ) ) )
% 0.64/1.06 , bfalse ) ] )
% 0.64/1.06 .
% 0.64/1.06 clause( 58, [] )
% 0.64/1.06 .
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 % SZS output end Refutation
% 0.64/1.06 found a proof!
% 0.64/1.06
% 0.64/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.64/1.06
% 0.64/1.06 initialclauses(
% 0.64/1.06 [ clause( 60, [ =( aux( X, Y, Z, T, btrue ), cons( X, merge( Y, cons( Z, T
% 0.64/1.06 ) ) ) ) ] )
% 0.64/1.06 , clause( 61, [ =( aux( X, Y, Z, T, bfalse ), cons( Z, merge( cons( X, Y )
% 0.64/1.06 , T ) ) ) ] )
% 0.64/1.06 , clause( 62, [ =( aux2( X, Y, Z, btrue ), ord( cons( Y, Z ) ) ) ] )
% 0.64/1.06 , clause( 63, [ =( aux2( X, Y, Z, bfalse ), bfalse ) ] )
% 0.64/1.06 , clause( 64, [ =( leqNat( z, X ), btrue ) ] )
% 0.64/1.06 , clause( 65, [ =( leqNat( s( X ), z ), bfalse ) ] )
% 0.64/1.06 , clause( 66, [ =( leqNat( s( X ), s( Y ) ), leqNat( X, Y ) ) ] )
% 0.64/1.06 , clause( 67, [ =( merge( nil, X ), X ) ] )
% 0.64/1.06 , clause( 68, [ =( merge( cons( X, Y ), nil ), cons( X, Y ) ) ] )
% 0.64/1.06 , clause( 69, [ =( merge( cons( X, Y ), cons( Z, T ) ), aux( X, Y, Z, T,
% 0.64/1.06 leqNat( X, Z ) ) ) ] )
% 0.64/1.06 , clause( 70, [ =( ord( nil ), btrue ) ] )
% 0.64/1.06 , clause( 71, [ =( ord( cons( X, nil ) ), btrue ) ] )
% 0.64/1.06 , clause( 72, [ =( ord( cons( X, cons( Y, Z ) ) ), aux2( X, Y, Z, leqNat( X
% 0.64/1.06 , Y ) ) ) ] )
% 0.64/1.06 , clause( 73, [ =( impl( btrue, X ), X ) ] )
% 0.64/1.06 , clause( 74, [ =( impl( bfalse, X ), btrue ) ] )
% 0.64/1.06 , clause( 75, [ =( 'prop_merge_ord_not3'( X, Y ), impl( eq2( ord( X ),
% 0.64/1.06 btrue ), impl( eq2( ord( Y ), bfalse ), eq2( ord( merge( X, Y ) ), btrue
% 0.64/1.06 ) ) ) ) ] )
% 0.64/1.06 , clause( 76, [ =( eq2( bfalse, btrue ), bfalse ) ] )
% 0.64/1.06 , clause( 77, [ =( eq2( btrue, bfalse ), bfalse ) ] )
% 0.64/1.06 , clause( 78, [ =( eq( s( X ), s( Y ) ), eq( X, Y ) ) ] )
% 0.64/1.06 , clause( 79, [ =( eq( z, s( X ) ), bfalse ) ] )
% 0.64/1.06 , clause( 80, [ =( eq( s( X ), z ), bfalse ) ] )
% 0.64/1.06 , clause( 81, [ =( eq( X, X ), btrue ) ] )
% 0.64/1.06 , clause( 82, [ =( eq2( X, X ), btrue ) ] )
% 0.64/1.06 , clause( 83, [ ~( =( eq2( 'prop_merge_ord_not3'( X, Y ), bfalse ), btrue )
% 0.64/1.06 ) ] )
% 0.64/1.06 ] ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 3, [ =( aux2( X, Y, Z, bfalse ), bfalse ) ] )
% 0.64/1.06 , clause( 63, [ =( aux2( X, Y, Z, bfalse ), bfalse ) ] )
% 0.64/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.64/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 5, [ =( leqNat( s( X ), z ), bfalse ) ] )
% 0.64/1.06 , clause( 65, [ =( leqNat( s( X ), z ), bfalse ) ] )
% 0.64/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 7, [ =( merge( nil, X ), X ) ] )
% 0.64/1.06 , clause( 67, [ =( merge( nil, X ), X ) ] )
% 0.64/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 10, [ =( ord( nil ), btrue ) ] )
% 0.64/1.06 , clause( 70, [ =( ord( nil ), btrue ) ] )
% 0.64/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 eqswap(
% 0.64/1.06 clause( 125, [ =( aux2( X, Y, Z, leqNat( X, Y ) ), ord( cons( X, cons( Y, Z
% 0.64/1.06 ) ) ) ) ] )
% 0.64/1.06 , clause( 72, [ =( ord( cons( X, cons( Y, Z ) ) ), aux2( X, Y, Z, leqNat( X
% 0.64/1.06 , Y ) ) ) ] )
% 0.64/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 12, [ =( aux2( X, Y, Z, leqNat( X, Y ) ), ord( cons( X, cons( Y, Z
% 0.64/1.06 ) ) ) ) ] )
% 0.64/1.06 , clause( 125, [ =( aux2( X, Y, Z, leqNat( X, Y ) ), ord( cons( X, cons( Y
% 0.64/1.06 , Z ) ) ) ) ] )
% 0.64/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.64/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 13, [ =( impl( btrue, X ), X ) ] )
% 0.64/1.06 , clause( 73, [ =( impl( btrue, X ), X ) ] )
% 0.64/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 eqswap(
% 0.64/1.06 clause( 155, [ =( impl( eq2( ord( X ), btrue ), impl( eq2( ord( Y ), bfalse
% 0.64/1.06 ), eq2( ord( merge( X, Y ) ), btrue ) ) ), 'prop_merge_ord_not3'( X, Y )
% 0.64/1.06 ) ] )
% 0.64/1.06 , clause( 75, [ =( 'prop_merge_ord_not3'( X, Y ), impl( eq2( ord( X ),
% 0.64/1.06 btrue ), impl( eq2( ord( Y ), bfalse ), eq2( ord( merge( X, Y ) ), btrue
% 0.64/1.06 ) ) ) ) ] )
% 0.64/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 15, [ =( impl( eq2( ord( X ), btrue ), impl( eq2( ord( Y ), bfalse
% 0.64/1.06 ), eq2( ord( merge( X, Y ) ), btrue ) ) ), 'prop_merge_ord_not3'( X, Y )
% 0.64/1.06 ) ] )
% 0.64/1.06 , clause( 155, [ =( impl( eq2( ord( X ), btrue ), impl( eq2( ord( Y ),
% 0.64/1.06 bfalse ), eq2( ord( merge( X, Y ) ), btrue ) ) ), 'prop_merge_ord_not3'(
% 0.64/1.06 X, Y ) ) ] )
% 0.64/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.64/1.06 )] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 16, [ =( eq2( bfalse, btrue ), bfalse ) ] )
% 0.64/1.06 , clause( 76, [ =( eq2( bfalse, btrue ), bfalse ) ] )
% 0.64/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 22, [ =( eq2( X, X ), btrue ) ] )
% 0.64/1.06 , clause( 82, [ =( eq2( X, X ), btrue ) ] )
% 0.64/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 23, [ ~( =( eq2( 'prop_merge_ord_not3'( X, Y ), bfalse ), btrue ) )
% 0.64/1.06 ] )
% 0.64/1.06 , clause( 83, [ ~( =( eq2( 'prop_merge_ord_not3'( X, Y ), bfalse ), btrue )
% 0.64/1.06 ) ] )
% 0.64/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.64/1.06 )] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 eqswap(
% 0.64/1.06 clause( 221, [ =( ord( cons( X, cons( Y, Z ) ) ), aux2( X, Y, Z, leqNat( X
% 0.64/1.06 , Y ) ) ) ] )
% 0.64/1.06 , clause( 12, [ =( aux2( X, Y, Z, leqNat( X, Y ) ), ord( cons( X, cons( Y,
% 0.64/1.06 Z ) ) ) ) ] )
% 0.64/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 paramod(
% 0.64/1.06 clause( 223, [ =( ord( cons( s( X ), cons( z, Y ) ) ), aux2( s( X ), z, Y,
% 0.64/1.06 bfalse ) ) ] )
% 0.64/1.06 , clause( 5, [ =( leqNat( s( X ), z ), bfalse ) ] )
% 0.64/1.06 , 0, clause( 221, [ =( ord( cons( X, cons( Y, Z ) ) ), aux2( X, Y, Z,
% 0.64/1.06 leqNat( X, Y ) ) ) ] )
% 0.64/1.06 , 0, 13, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, s( X )
% 0.64/1.06 ), :=( Y, z ), :=( Z, Y )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 paramod(
% 0.64/1.06 clause( 224, [ =( ord( cons( s( X ), cons( z, Y ) ) ), bfalse ) ] )
% 0.64/1.06 , clause( 3, [ =( aux2( X, Y, Z, bfalse ), bfalse ) ] )
% 0.64/1.06 , 0, clause( 223, [ =( ord( cons( s( X ), cons( z, Y ) ) ), aux2( s( X ), z
% 0.64/1.06 , Y, bfalse ) ) ] )
% 0.64/1.06 , 0, 8, substitution( 0, [ :=( X, s( X ) ), :=( Y, z ), :=( Z, Y )] ),
% 0.64/1.06 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 34, [ =( ord( cons( s( X ), cons( z, Y ) ) ), bfalse ) ] )
% 0.64/1.06 , clause( 224, [ =( ord( cons( s( X ), cons( z, Y ) ) ), bfalse ) ] )
% 0.64/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.64/1.06 )] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 eqswap(
% 0.64/1.06 clause( 227, [ =( 'prop_merge_ord_not3'( X, Y ), impl( eq2( ord( X ), btrue
% 0.64/1.06 ), impl( eq2( ord( Y ), bfalse ), eq2( ord( merge( X, Y ) ), btrue ) ) )
% 0.64/1.06 ) ] )
% 0.64/1.06 , clause( 15, [ =( impl( eq2( ord( X ), btrue ), impl( eq2( ord( Y ),
% 0.64/1.06 bfalse ), eq2( ord( merge( X, Y ) ), btrue ) ) ), 'prop_merge_ord_not3'(
% 0.64/1.06 X, Y ) ) ] )
% 0.64/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 paramod(
% 0.64/1.06 clause( 231, [ =( 'prop_merge_ord_not3'( nil, X ), impl( eq2( ord( nil ),
% 0.64/1.06 btrue ), impl( eq2( ord( X ), bfalse ), eq2( ord( X ), btrue ) ) ) ) ] )
% 0.64/1.06 , clause( 7, [ =( merge( nil, X ), X ) ] )
% 0.64/1.06 , 0, clause( 227, [ =( 'prop_merge_ord_not3'( X, Y ), impl( eq2( ord( X ),
% 0.64/1.06 btrue ), impl( eq2( ord( Y ), bfalse ), eq2( ord( merge( X, Y ) ), btrue
% 0.64/1.06 ) ) ) ) ] )
% 0.64/1.06 , 0, 16, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, nil )
% 0.64/1.06 , :=( Y, X )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 paramod(
% 0.64/1.06 clause( 232, [ =( 'prop_merge_ord_not3'( nil, X ), impl( eq2( btrue, btrue
% 0.64/1.06 ), impl( eq2( ord( X ), bfalse ), eq2( ord( X ), btrue ) ) ) ) ] )
% 0.64/1.06 , clause( 10, [ =( ord( nil ), btrue ) ] )
% 0.64/1.06 , 0, clause( 231, [ =( 'prop_merge_ord_not3'( nil, X ), impl( eq2( ord( nil
% 0.64/1.06 ), btrue ), impl( eq2( ord( X ), bfalse ), eq2( ord( X ), btrue ) ) ) )
% 0.64/1.06 ] )
% 0.64/1.06 , 0, 6, substitution( 0, [] ), substitution( 1, [ :=( X, X )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 paramod(
% 0.64/1.06 clause( 233, [ =( 'prop_merge_ord_not3'( nil, X ), impl( btrue, impl( eq2(
% 0.64/1.06 ord( X ), bfalse ), eq2( ord( X ), btrue ) ) ) ) ] )
% 0.64/1.06 , clause( 22, [ =( eq2( X, X ), btrue ) ] )
% 0.64/1.06 , 0, clause( 232, [ =( 'prop_merge_ord_not3'( nil, X ), impl( eq2( btrue,
% 0.64/1.06 btrue ), impl( eq2( ord( X ), bfalse ), eq2( ord( X ), btrue ) ) ) ) ] )
% 0.64/1.06 , 0, 5, substitution( 0, [ :=( X, btrue )] ), substitution( 1, [ :=( X, X )] )
% 0.64/1.06 ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 paramod(
% 0.64/1.06 clause( 234, [ =( 'prop_merge_ord_not3'( nil, X ), impl( eq2( ord( X ),
% 0.64/1.06 bfalse ), eq2( ord( X ), btrue ) ) ) ] )
% 0.64/1.06 , clause( 13, [ =( impl( btrue, X ), X ) ] )
% 0.64/1.06 , 0, clause( 233, [ =( 'prop_merge_ord_not3'( nil, X ), impl( btrue, impl(
% 0.64/1.06 eq2( ord( X ), bfalse ), eq2( ord( X ), btrue ) ) ) ) ] )
% 0.64/1.06 , 0, 4, substitution( 0, [ :=( X, impl( eq2( ord( X ), bfalse ), eq2( ord(
% 0.64/1.06 X ), btrue ) ) )] ), substitution( 1, [ :=( X, X )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 eqswap(
% 0.64/1.06 clause( 235, [ =( impl( eq2( ord( X ), bfalse ), eq2( ord( X ), btrue ) ),
% 0.64/1.06 'prop_merge_ord_not3'( nil, X ) ) ] )
% 0.64/1.06 , clause( 234, [ =( 'prop_merge_ord_not3'( nil, X ), impl( eq2( ord( X ),
% 0.64/1.06 bfalse ), eq2( ord( X ), btrue ) ) ) ] )
% 0.64/1.06 , 0, substitution( 0, [ :=( X, X )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 47, [ =( impl( eq2( ord( X ), bfalse ), eq2( ord( X ), btrue ) ),
% 0.64/1.06 'prop_merge_ord_not3'( nil, X ) ) ] )
% 0.64/1.06 , clause( 235, [ =( impl( eq2( ord( X ), bfalse ), eq2( ord( X ), btrue ) )
% 0.64/1.06 , 'prop_merge_ord_not3'( nil, X ) ) ] )
% 0.64/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 eqswap(
% 0.64/1.06 clause( 237, [ =( 'prop_merge_ord_not3'( nil, X ), impl( eq2( ord( X ),
% 0.64/1.06 bfalse ), eq2( ord( X ), btrue ) ) ) ] )
% 0.64/1.06 , clause( 47, [ =( impl( eq2( ord( X ), bfalse ), eq2( ord( X ), btrue ) )
% 0.64/1.06 , 'prop_merge_ord_not3'( nil, X ) ) ] )
% 0.64/1.06 , 0, substitution( 0, [ :=( X, X )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 paramod(
% 0.64/1.06 clause( 242, [ =( 'prop_merge_ord_not3'( nil, cons( s( X ), cons( z, Y ) )
% 0.64/1.06 ), impl( eq2( ord( cons( s( X ), cons( z, Y ) ) ), bfalse ), eq2( bfalse
% 0.64/1.06 , btrue ) ) ) ] )
% 0.64/1.06 , clause( 34, [ =( ord( cons( s( X ), cons( z, Y ) ) ), bfalse ) ] )
% 0.64/1.06 , 0, clause( 237, [ =( 'prop_merge_ord_not3'( nil, X ), impl( eq2( ord( X )
% 0.64/1.06 , bfalse ), eq2( ord( X ), btrue ) ) ) ] )
% 0.64/1.06 , 0, 20, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.64/1.06 :=( X, cons( s( X ), cons( z, Y ) ) )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 paramod(
% 0.64/1.06 clause( 243, [ =( 'prop_merge_ord_not3'( nil, cons( s( X ), cons( z, Y ) )
% 0.64/1.06 ), impl( eq2( bfalse, bfalse ), eq2( bfalse, btrue ) ) ) ] )
% 0.64/1.06 , clause( 34, [ =( ord( cons( s( X ), cons( z, Y ) ) ), bfalse ) ] )
% 0.64/1.06 , 0, clause( 242, [ =( 'prop_merge_ord_not3'( nil, cons( s( X ), cons( z, Y
% 0.64/1.06 ) ) ), impl( eq2( ord( cons( s( X ), cons( z, Y ) ) ), bfalse ), eq2(
% 0.64/1.06 bfalse, btrue ) ) ) ] )
% 0.64/1.06 , 0, 11, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.64/1.06 :=( X, X ), :=( Y, Y )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 paramod(
% 0.64/1.06 clause( 244, [ =( 'prop_merge_ord_not3'( nil, cons( s( X ), cons( z, Y ) )
% 0.64/1.06 ), impl( btrue, eq2( bfalse, btrue ) ) ) ] )
% 0.64/1.06 , clause( 22, [ =( eq2( X, X ), btrue ) ] )
% 0.64/1.06 , 0, clause( 243, [ =( 'prop_merge_ord_not3'( nil, cons( s( X ), cons( z, Y
% 0.64/1.06 ) ) ), impl( eq2( bfalse, bfalse ), eq2( bfalse, btrue ) ) ) ] )
% 0.64/1.06 , 0, 10, substitution( 0, [ :=( X, bfalse )] ), substitution( 1, [ :=( X, X
% 0.64/1.06 ), :=( Y, Y )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 paramod(
% 0.64/1.06 clause( 245, [ =( 'prop_merge_ord_not3'( nil, cons( s( X ), cons( z, Y ) )
% 0.64/1.06 ), eq2( bfalse, btrue ) ) ] )
% 0.64/1.06 , clause( 13, [ =( impl( btrue, X ), X ) ] )
% 0.64/1.06 , 0, clause( 244, [ =( 'prop_merge_ord_not3'( nil, cons( s( X ), cons( z, Y
% 0.64/1.06 ) ) ), impl( btrue, eq2( bfalse, btrue ) ) ) ] )
% 0.64/1.06 , 0, 9, substitution( 0, [ :=( X, eq2( bfalse, btrue ) )] ), substitution(
% 0.64/1.06 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 paramod(
% 0.64/1.06 clause( 246, [ =( 'prop_merge_ord_not3'( nil, cons( s( X ), cons( z, Y ) )
% 0.64/1.06 ), bfalse ) ] )
% 0.64/1.06 , clause( 16, [ =( eq2( bfalse, btrue ), bfalse ) ] )
% 0.64/1.06 , 0, clause( 245, [ =( 'prop_merge_ord_not3'( nil, cons( s( X ), cons( z, Y
% 0.64/1.06 ) ) ), eq2( bfalse, btrue ) ) ] )
% 0.64/1.06 , 0, 9, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.64/1.06 ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 57, [ =( 'prop_merge_ord_not3'( nil, cons( s( X ), cons( z, Y ) ) )
% 0.64/1.06 , bfalse ) ] )
% 0.64/1.06 , clause( 246, [ =( 'prop_merge_ord_not3'( nil, cons( s( X ), cons( z, Y )
% 0.64/1.06 ) ), bfalse ) ] )
% 0.64/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.64/1.06 )] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 eqswap(
% 0.64/1.06 clause( 249, [ ~( =( btrue, eq2( 'prop_merge_ord_not3'( X, Y ), bfalse ) )
% 0.64/1.06 ) ] )
% 0.64/1.06 , clause( 23, [ ~( =( eq2( 'prop_merge_ord_not3'( X, Y ), bfalse ), btrue )
% 0.64/1.06 ) ] )
% 0.64/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 paramod(
% 0.64/1.06 clause( 251, [ ~( =( btrue, eq2( bfalse, bfalse ) ) ) ] )
% 0.64/1.06 , clause( 57, [ =( 'prop_merge_ord_not3'( nil, cons( s( X ), cons( z, Y ) )
% 0.64/1.06 ), bfalse ) ] )
% 0.64/1.06 , 0, clause( 249, [ ~( =( btrue, eq2( 'prop_merge_ord_not3'( X, Y ), bfalse
% 0.64/1.06 ) ) ) ] )
% 0.64/1.06 , 0, 4, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.64/1.06 :=( X, nil ), :=( Y, cons( s( X ), cons( z, Y ) ) )] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 paramod(
% 0.64/1.06 clause( 252, [ ~( =( btrue, btrue ) ) ] )
% 0.64/1.06 , clause( 22, [ =( eq2( X, X ), btrue ) ] )
% 0.64/1.06 , 0, clause( 251, [ ~( =( btrue, eq2( bfalse, bfalse ) ) ) ] )
% 0.64/1.06 , 0, 3, substitution( 0, [ :=( X, bfalse )] ), substitution( 1, [] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 eqrefl(
% 0.64/1.06 clause( 253, [] )
% 0.64/1.06 , clause( 252, [ ~( =( btrue, btrue ) ) ] )
% 0.64/1.06 , 0, substitution( 0, [] )).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 subsumption(
% 0.64/1.06 clause( 58, [] )
% 0.64/1.06 , clause( 253, [] )
% 0.64/1.06 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 end.
% 0.64/1.06
% 0.64/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.64/1.06
% 0.64/1.06 Memory use:
% 0.64/1.06
% 0.64/1.06 space for terms: 1155
% 0.64/1.06 space for clauses: 7472
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 clauses generated: 210
% 0.64/1.06 clauses kept: 59
% 0.64/1.06 clauses selected: 44
% 0.64/1.06 clauses deleted: 1
% 0.64/1.06 clauses inuse deleted: 0
% 0.64/1.06
% 0.64/1.06 subsentry: 887
% 0.64/1.06 literals s-matched: 436
% 0.64/1.06 literals matched: 436
% 0.64/1.06 full subsumption: 0
% 0.64/1.06
% 0.64/1.06 checksum: -1333982361
% 0.64/1.06
% 0.64/1.06
% 0.64/1.06 Bliksem ended
%------------------------------------------------------------------------------