%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWX199-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n009.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 14.04s 14.48s
% Output : Refutation 14.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWX199-1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : bliksem %s
% 0.16/0.33 % Computer : n009.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % DateTime : Tue May 5 11:12:55 EDT 2026
% 0.16/0.33 % CPUTime :
% 14.04/14.48 *** allocated 10000 integers for termspace/termends
% 14.04/14.48 *** allocated 10000 integers for clauses
% 14.04/14.48 *** allocated 10000 integers for justifications
% 14.04/14.48 Bliksem 1.12
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 Automatic Strategy Selection
% 14.04/14.48
% 14.04/14.48 Clauses:
% 14.04/14.48 [
% 14.04/14.48 [ =( aux( X, Y, Z, T, btrue ), cons( X, merge( Y, cons( Z, T ) ) ) ) ]
% 14.04/14.48 ,
% 14.04/14.48 [ =( aux( X, Y, Z, T, bfalse ), cons( Z, merge( cons( X, Y ), T ) ) ) ]
% 14.04/14.48 ,
% 14.04/14.48 [ =( leqNat( z, X ), btrue ) ],
% 14.04/14.48 [ =( leqNat( s( X ), z ), bfalse ) ],
% 14.04/14.48 [ =( leqNat( s( X ), s( Y ) ), leqNat( X, Y ) ) ],
% 14.04/14.48 [ =( merge( nil, X ), X ) ],
% 14.04/14.48 [ =( merge( cons( X, Y ), nil ), cons( X, Y ) ) ],
% 14.04/14.48 [ =( merge( cons( X, Y ), cons( Z, T ) ), aux( X, Y, Z, T, leqNat( X, Z
% 14.04/14.48 ) ) ) ],
% 14.04/14.48 [ =( impl( btrue, X ), X ) ],
% 14.04/14.48 [ =( impl( bfalse, X ), btrue ) ],
% 14.04/14.48 [ =( 'prop_merge_comm'( X, Y, Z ), impl( eq( merge( X, Y ), merge( Y, X
% 14.04/14.48 ) ), impl( eq( merge( X, Z ), merge( Z, X ) ), eq( merge( Y, Z ), merge(
% 14.04/14.48 Z, Y ) ) ) ) ) ],
% 14.04/14.48 [ =( eq3( bfalse, btrue ), bfalse ) ],
% 14.04/14.48 [ =( eq3( btrue, bfalse ), bfalse ) ],
% 14.04/14.48 [ =( eq2( s( X ), s( Y ) ), eq2( X, Y ) ) ],
% 14.04/14.48 [ =( eq2( z, s( X ) ), bfalse ) ],
% 14.04/14.48 [ =( eq2( s( X ), z ), bfalse ) ],
% 14.04/14.48 [ =( eq( X, X ), btrue ) ],
% 14.04/14.48 [ =( eq2( X, X ), btrue ) ],
% 14.04/14.48 [ =( eq3( X, X ), btrue ) ],
% 14.04/14.48 [ ~( =( eq2( X, Y ), bfalse ) ), =( eq( cons( X, Z ), cons( Y, T ) ),
% 14.04/14.48 bfalse ) ],
% 14.04/14.48 [ ~( =( eq2( X, Y ), btrue ) ), =( eq( cons( X, Z ), cons( Y, T ) ), eq(
% 14.04/14.48 Z, T ) ) ],
% 14.04/14.48 [ =( eq( nil, cons( X, Y ) ), bfalse ) ],
% 14.04/14.48 [ =( eq( cons( X, Y ), nil ), bfalse ) ],
% 14.04/14.48 [ ~( =( eq3( 'prop_merge_comm'( X, Y, Z ), bfalse ), btrue ) ) ]
% 14.04/14.48 ] .
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 percentage equality = 1.000000, percentage horn = 1.000000
% 14.04/14.48 This is a pure equality problem
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 Options Used:
% 14.04/14.48
% 14.04/14.48 useres = 1
% 14.04/14.48 useparamod = 1
% 14.04/14.48 useeqrefl = 1
% 14.04/14.48 useeqfact = 1
% 14.04/14.48 usefactor = 1
% 14.04/14.48 usesimpsplitting = 0
% 14.04/14.48 usesimpdemod = 5
% 14.04/14.48 usesimpres = 3
% 14.04/14.48
% 14.04/14.48 resimpinuse = 1000
% 14.04/14.48 resimpclauses = 20000
% 14.04/14.48 substype = eqrewr
% 14.04/14.48 backwardsubs = 1
% 14.04/14.48 selectoldest = 5
% 14.04/14.48
% 14.04/14.48 litorderings [0] = split
% 14.04/14.48 litorderings [1] = extend the termordering, first sorting on arguments
% 14.04/14.48
% 14.04/14.48 termordering = kbo
% 14.04/14.48
% 14.04/14.48 litapriori = 0
% 14.04/14.48 termapriori = 1
% 14.04/14.48 litaposteriori = 0
% 14.04/14.48 termaposteriori = 0
% 14.04/14.48 demodaposteriori = 0
% 14.04/14.48 ordereqreflfact = 0
% 14.04/14.48
% 14.04/14.48 litselect = negord
% 14.04/14.48
% 14.04/14.48 maxweight = 15
% 14.04/14.48 maxdepth = 30000
% 14.04/14.48 maxlength = 115
% 14.04/14.48 maxnrvars = 195
% 14.04/14.48 excuselevel = 1
% 14.04/14.48 increasemaxweight = 1
% 14.04/14.48
% 14.04/14.48 maxselected = 10000000
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48
% 14.04/14.48 showgenerated = 0
% 14.04/14.48 showkept = 0
% 14.04/14.48 showselected = 0
% 14.04/14.48 showdeleted = 0
% 14.04/14.48 showresimp = 1
% 14.04/14.48 showstatus = 2000
% 14.04/14.48
% 14.04/14.48 prologoutput = 1
% 14.04/14.48 nrgoals = 5000000
% 14.04/14.48 totalproof = 1
% 14.04/14.48
% 14.04/14.48 Symbols occurring in the translation:
% 14.04/14.48
% 14.04/14.48 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 14.04/14.48 . [1, 2] (w:1, o:28, a:1, s:1, b:0),
% 14.04/14.48 ! [4, 1] (w:0, o:22, a:1, s:1, b:0),
% 14.04/14.48 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 14.04/14.48 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 14.04/14.48 btrue [43, 0] (w:1, o:16, a:1, s:1, b:0),
% 14.04/14.48 aux [44, 5] (w:1, o:61, a:1, s:1, b:0),
% 14.04/14.48 cons [45, 2] (w:1, o:53, a:1, s:1, b:0),
% 14.04/14.48 merge [46, 2] (w:1, o:55, a:1, s:1, b:0),
% 14.04/14.48 bfalse [47, 0] (w:1, o:17, a:1, s:1, b:0),
% 14.04/14.48 z [48, 0] (w:1, o:18, a:1, s:1, b:0),
% 14.04/14.48 leqNat [50, 2] (w:1, o:54, a:1, s:1, b:0),
% 14.04/14.48 s [51, 1] (w:1, o:27, a:1, s:1, b:0),
% 14.04/14.48 nil [53, 0] (w:1, o:20, a:1, s:1, b:0),
% 14.04/14.48 impl [55, 2] (w:1, o:56, a:1, s:1, b:0),
% 14.04/14.48 'prop_merge_comm' [57, 3] (w:1, o:60, a:1, s:1, b:0),
% 14.04/14.48 eq [58, 2] (w:1, o:57, a:1, s:1, b:0),
% 14.04/14.48 eq3 [59, 2] (w:1, o:59, a:1, s:1, b:0),
% 14.04/14.48 eq2 [60, 2] (w:1, o:58, a:1, s:1, b:0).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 15
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 1705
% 14.04/14.48 Kept: 114
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 16
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 16
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 2059
% 14.04/14.48 Kept: 134
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 17
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 17
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 2104
% 14.04/14.48 Kept: 137
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 18
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 18
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 2750
% 14.04/14.48 Kept: 163
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 19
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 19
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 2964
% 14.04/14.48 Kept: 168
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 20
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 20
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 3768
% 14.04/14.48 Kept: 193
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 21
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 21
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 6827
% 14.04/14.48 Kept: 311
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 22
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 22
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 9056
% 14.04/14.48 Kept: 381
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 23
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 23
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 19501
% 14.04/14.48 Kept: 728
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 24
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 24
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 31127
% 14.04/14.48 Kept: 1000
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 25
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 25
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 43749
% 14.04/14.48 Kept: 1865
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 26
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 Intermediate Status:
% 14.04/14.48 Generated: 18188
% 14.04/14.48 Kept: 2003
% 14.04/14.48 Inuse: 669
% 14.04/14.48 Deleted: 97
% 14.04/14.48 Deletedinuse: 11
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 26
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 72959
% 14.04/14.48 Kept: 2625
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 27
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 Intermediate Status:
% 14.04/14.48 Generated: 14583
% 14.04/14.48 Kept: 2001
% 14.04/14.48 Inuse: 568
% 14.04/14.48 Deleted: 90
% 14.04/14.48 Deletedinuse: 11
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 Intermediate Status:
% 14.04/14.48 Generated: 42674
% 14.04/14.48 Kept: 4001
% 14.04/14.48 Inuse: 1423
% 14.04/14.48 Deleted: 193
% 14.04/14.48 Deletedinuse: 31
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 27
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 141861
% 14.04/14.48 Kept: 4579
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 28
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 Intermediate Status:
% 14.04/14.48 Generated: 15021
% 14.04/14.48 Kept: 2004
% 14.04/14.48 Inuse: 546
% 14.04/14.48 Deleted: 96
% 14.04/14.48 Deletedinuse: 11
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 Intermediate Status:
% 14.04/14.48 Generated: 28423
% 14.04/14.48 Kept: 4006
% 14.04/14.48 Inuse: 990
% 14.04/14.48 Deleted: 149
% 14.04/14.48 Deletedinuse: 31
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 Intermediate Status:
% 14.04/14.48 Generated: 71251
% 14.04/14.48 Kept: 6006
% 14.04/14.48 Inuse: 2014
% 14.04/14.48 Deleted: 300
% 14.04/14.48 Deletedinuse: 34
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Failed to find proof!
% 14.04/14.48 maxweight = 28
% 14.04/14.48 maxnrclauses = 10000000
% 14.04/14.48 Generated: 263885
% 14.04/14.48 Kept: 6958
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 The strategy used was not complete!
% 14.04/14.48
% 14.04/14.48 Increased maxweight to 29
% 14.04/14.48
% 14.04/14.48 Starting Search:
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 Intermediate Status:
% 14.04/14.48 Generated: 14940
% 14.04/14.48 Kept: 2076
% 14.04/14.48 Inuse: 549
% 14.04/14.48 Deleted: 98
% 14.04/14.48 Deletedinuse: 11
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 Intermediate Status:
% 14.04/14.48 Generated: 26509
% 14.04/14.48 Kept: 4077
% 14.04/14.48 Inuse: 934
% 14.04/14.48 Deleted: 149
% 14.04/14.48 Deletedinuse: 31
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48 Resimplifying inuse:
% 14.04/14.48 Done
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 Bliksems!, er is een bewijs:
% 14.04/14.48 % SZS status Unsatisfiable
% 14.04/14.48 % SZS output start Refutation
% 14.04/14.48
% 14.04/14.48 clause( 0, [ =( cons( X, merge( Y, cons( Z, T ) ) ), aux( X, Y, Z, T, btrue
% 14.04/14.48 ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 2, [ =( leqNat( z, X ), btrue ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 4, [ =( leqNat( s( X ), s( Y ) ), leqNat( X, Y ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 5, [ =( merge( nil, X ), X ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 6, [ =( merge( cons( X, Y ), nil ), cons( X, Y ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 7, [ =( aux( X, Y, Z, T, leqNat( X, Z ) ), merge( cons( X, Y ),
% 14.04/14.48 cons( Z, T ) ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 8, [ =( impl( btrue, X ), X ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 10, [ =( impl( eq( merge( X, Y ), merge( Y, X ) ), impl( eq( merge(
% 14.04/14.48 X, Z ), merge( Z, X ) ), eq( merge( Y, Z ), merge( Z, Y ) ) ) ),
% 14.04/14.48 'prop_merge_comm'( X, Y, Z ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 15, [ =( eq2( s( X ), z ), bfalse ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 16, [ =( eq( X, X ), btrue ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 17, [ =( eq2( X, X ), btrue ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 18, [ =( eq3( X, X ), btrue ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 19, [ ~( =( eq2( X, Y ), bfalse ) ), =( eq( cons( X, Z ), cons( Y,
% 14.04/14.48 T ) ), bfalse ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 20, [ ~( =( eq2( X, Y ), btrue ) ), =( eq( cons( X, Z ), cons( Y, T
% 14.04/14.48 ) ), eq( Z, T ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 23, [ ~( =( eq3( 'prop_merge_comm'( X, Y, Z ), bfalse ), btrue ) )
% 14.04/14.48 ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 37, [ =( aux( s( X ), Z, s( Y ), T, leqNat( X, Y ) ), merge( cons(
% 14.04/14.48 s( X ), Z ), cons( s( Y ), T ) ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 39, [ =( merge( cons( z, Y ), cons( X, Z ) ), aux( z, Y, X, Z,
% 14.04/14.48 btrue ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 46, [ =( impl( eq( X, merge( X, nil ) ), impl( eq( Y, merge( Y, nil
% 14.04/14.48 ) ), eq( merge( X, Y ), merge( Y, X ) ) ) ), 'prop_merge_comm'( nil, X,
% 14.04/14.48 Y ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 58, [ =( eq( cons( s( X ), Y ), cons( z, Z ) ), bfalse ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 66, [ =( eq( cons( X, Y ), cons( X, Z ) ), eq( Y, Z ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 96, [ =( eq( cons( s( T ), U ), aux( z, X, Y, Z, btrue ) ), bfalse
% 14.04/14.48 ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 99, [ =( eq( aux( X, Y, Z, T, btrue ), cons( X, U ) ), eq( merge( Y
% 14.04/14.48 , cons( Z, T ) ), U ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 114, [ =( merge( cons( s( z ), Y ), cons( s( X ), Z ) ), aux( s( z
% 14.04/14.48 ), Y, s( X ), Z, btrue ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 355, [ =( eq( aux( X, U, W, V0, btrue ), aux( X, Y, Z, T, btrue ) )
% 14.04/14.48 , eq( merge( U, cons( W, V0 ) ), merge( Y, cons( Z, T ) ) ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 359, [ =( eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s( Y
% 14.04/14.48 ), Z ), cons( s( z ), X ) ) ), 'prop_merge_comm'( nil, cons( s( z ), X )
% 14.04/14.48 , cons( s( Y ), Z ) ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 1849, [ =( eq( merge( Y, cons( s( z ), X ) ), merge( X, cons( s( z
% 14.04/14.48 ), Y ) ) ), 'prop_merge_comm'( nil, cons( s( z ), Y ), cons( s( z ), X )
% 14.04/14.48 ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 5182, [ =( eq( cons( s( z ), X ), merge( X, cons( s( z ), nil ) ) )
% 14.04/14.48 , 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s( z ), X ) ) ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 5202, [ =( 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s( z
% 14.04/14.48 ), cons( z, X ) ) ), bfalse ) ] )
% 14.04/14.48 .
% 14.04/14.48 clause( 5207, [] )
% 14.04/14.48 .
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 % SZS output end Refutation
% 14.04/14.48 found a proof!
% 14.04/14.48
% 14.04/14.48 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 14.04/14.48
% 14.04/14.48 initialclauses(
% 14.04/14.48 [ clause( 5209, [ =( aux( X, Y, Z, T, btrue ), cons( X, merge( Y, cons( Z,
% 14.04/14.48 T ) ) ) ) ] )
% 14.04/14.48 , clause( 5210, [ =( aux( X, Y, Z, T, bfalse ), cons( Z, merge( cons( X, Y
% 14.04/14.48 ), T ) ) ) ] )
% 14.04/14.48 , clause( 5211, [ =( leqNat( z, X ), btrue ) ] )
% 14.04/14.48 , clause( 5212, [ =( leqNat( s( X ), z ), bfalse ) ] )
% 14.04/14.48 , clause( 5213, [ =( leqNat( s( X ), s( Y ) ), leqNat( X, Y ) ) ] )
% 14.04/14.48 , clause( 5214, [ =( merge( nil, X ), X ) ] )
% 14.04/14.48 , clause( 5215, [ =( merge( cons( X, Y ), nil ), cons( X, Y ) ) ] )
% 14.04/14.48 , clause( 5216, [ =( merge( cons( X, Y ), cons( Z, T ) ), aux( X, Y, Z, T,
% 14.04/14.48 leqNat( X, Z ) ) ) ] )
% 14.04/14.48 , clause( 5217, [ =( impl( btrue, X ), X ) ] )
% 14.04/14.48 , clause( 5218, [ =( impl( bfalse, X ), btrue ) ] )
% 14.04/14.48 , clause( 5219, [ =( 'prop_merge_comm'( X, Y, Z ), impl( eq( merge( X, Y )
% 14.04/14.48 , merge( Y, X ) ), impl( eq( merge( X, Z ), merge( Z, X ) ), eq( merge( Y
% 14.04/14.48 , Z ), merge( Z, Y ) ) ) ) ) ] )
% 14.04/14.48 , clause( 5220, [ =( eq3( bfalse, btrue ), bfalse ) ] )
% 14.04/14.48 , clause( 5221, [ =( eq3( btrue, bfalse ), bfalse ) ] )
% 14.04/14.48 , clause( 5222, [ =( eq2( s( X ), s( Y ) ), eq2( X, Y ) ) ] )
% 14.04/14.48 , clause( 5223, [ =( eq2( z, s( X ) ), bfalse ) ] )
% 14.04/14.48 , clause( 5224, [ =( eq2( s( X ), z ), bfalse ) ] )
% 14.04/14.48 , clause( 5225, [ =( eq( X, X ), btrue ) ] )
% 14.04/14.48 , clause( 5226, [ =( eq2( X, X ), btrue ) ] )
% 14.04/14.48 , clause( 5227, [ =( eq3( X, X ), btrue ) ] )
% 14.04/14.48 , clause( 5228, [ ~( =( eq2( X, Y ), bfalse ) ), =( eq( cons( X, Z ), cons(
% 14.04/14.48 Y, T ) ), bfalse ) ] )
% 14.04/14.48 , clause( 5229, [ ~( =( eq2( X, Y ), btrue ) ), =( eq( cons( X, Z ), cons(
% 14.04/14.48 Y, T ) ), eq( Z, T ) ) ] )
% 14.04/14.48 , clause( 5230, [ =( eq( nil, cons( X, Y ) ), bfalse ) ] )
% 14.04/14.48 , clause( 5231, [ =( eq( cons( X, Y ), nil ), bfalse ) ] )
% 14.04/14.48 , clause( 5232, [ ~( =( eq3( 'prop_merge_comm'( X, Y, Z ), bfalse ), btrue
% 14.04/14.48 ) ) ] )
% 14.04/14.48 ] ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5233, [ =( cons( X, merge( Y, cons( Z, T ) ) ), aux( X, Y, Z, T,
% 14.04/14.48 btrue ) ) ] )
% 14.04/14.48 , clause( 5209, [ =( aux( X, Y, Z, T, btrue ), cons( X, merge( Y, cons( Z,
% 14.04/14.48 T ) ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 14.04/14.48 ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 0, [ =( cons( X, merge( Y, cons( Z, T ) ) ), aux( X, Y, Z, T, btrue
% 14.04/14.48 ) ) ] )
% 14.04/14.48 , clause( 5233, [ =( cons( X, merge( Y, cons( Z, T ) ) ), aux( X, Y, Z, T,
% 14.04/14.48 btrue ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 14.04/14.48 permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 2, [ =( leqNat( z, X ), btrue ) ] )
% 14.04/14.48 , clause( 5211, [ =( leqNat( z, X ), btrue ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 4, [ =( leqNat( s( X ), s( Y ) ), leqNat( X, Y ) ) ] )
% 14.04/14.48 , clause( 5213, [ =( leqNat( s( X ), s( Y ) ), leqNat( X, Y ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 14.04/14.48 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 5, [ =( merge( nil, X ), X ) ] )
% 14.04/14.48 , clause( 5214, [ =( merge( nil, X ), X ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 6, [ =( merge( cons( X, Y ), nil ), cons( X, Y ) ) ] )
% 14.04/14.48 , clause( 5215, [ =( merge( cons( X, Y ), nil ), cons( X, Y ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 14.04/14.48 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5262, [ =( aux( X, Y, Z, T, leqNat( X, Z ) ), merge( cons( X, Y ),
% 14.04/14.48 cons( Z, T ) ) ) ] )
% 14.04/14.48 , clause( 5216, [ =( merge( cons( X, Y ), cons( Z, T ) ), aux( X, Y, Z, T,
% 14.04/14.48 leqNat( X, Z ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 14.04/14.48 ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 7, [ =( aux( X, Y, Z, T, leqNat( X, Z ) ), merge( cons( X, Y ),
% 14.04/14.48 cons( Z, T ) ) ) ] )
% 14.04/14.48 , clause( 5262, [ =( aux( X, Y, Z, T, leqNat( X, Z ) ), merge( cons( X, Y )
% 14.04/14.48 , cons( Z, T ) ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 14.04/14.48 permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 8, [ =( impl( btrue, X ), X ) ] )
% 14.04/14.48 , clause( 5217, [ =( impl( btrue, X ), X ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5282, [ =( impl( eq( merge( X, Y ), merge( Y, X ) ), impl( eq(
% 14.04/14.48 merge( X, Z ), merge( Z, X ) ), eq( merge( Y, Z ), merge( Z, Y ) ) ) ),
% 14.04/14.48 'prop_merge_comm'( X, Y, Z ) ) ] )
% 14.04/14.48 , clause( 5219, [ =( 'prop_merge_comm'( X, Y, Z ), impl( eq( merge( X, Y )
% 14.04/14.48 , merge( Y, X ) ), impl( eq( merge( X, Z ), merge( Z, X ) ), eq( merge( Y
% 14.04/14.48 , Z ), merge( Z, Y ) ) ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 10, [ =( impl( eq( merge( X, Y ), merge( Y, X ) ), impl( eq( merge(
% 14.04/14.48 X, Z ), merge( Z, X ) ), eq( merge( Y, Z ), merge( Z, Y ) ) ) ),
% 14.04/14.48 'prop_merge_comm'( X, Y, Z ) ) ] )
% 14.04/14.48 , clause( 5282, [ =( impl( eq( merge( X, Y ), merge( Y, X ) ), impl( eq(
% 14.04/14.48 merge( X, Z ), merge( Z, X ) ), eq( merge( Y, Z ), merge( Z, Y ) ) ) ),
% 14.04/14.48 'prop_merge_comm'( X, Y, Z ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 14.04/14.48 permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 15, [ =( eq2( s( X ), z ), bfalse ) ] )
% 14.04/14.48 , clause( 5224, [ =( eq2( s( X ), z ), bfalse ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 16, [ =( eq( X, X ), btrue ) ] )
% 14.04/14.48 , clause( 5225, [ =( eq( X, X ), btrue ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 17, [ =( eq2( X, X ), btrue ) ] )
% 14.04/14.48 , clause( 5226, [ =( eq2( X, X ), btrue ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 18, [ =( eq3( X, X ), btrue ) ] )
% 14.04/14.48 , clause( 5227, [ =( eq3( X, X ), btrue ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 19, [ ~( =( eq2( X, Y ), bfalse ) ), =( eq( cons( X, Z ), cons( Y,
% 14.04/14.48 T ) ), bfalse ) ] )
% 14.04/14.48 , clause( 5228, [ ~( =( eq2( X, Y ), bfalse ) ), =( eq( cons( X, Z ), cons(
% 14.04/14.48 Y, T ) ), bfalse ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 14.04/14.48 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 20, [ ~( =( eq2( X, Y ), btrue ) ), =( eq( cons( X, Z ), cons( Y, T
% 14.04/14.48 ) ), eq( Z, T ) ) ] )
% 14.04/14.48 , clause( 5229, [ ~( =( eq2( X, Y ), btrue ) ), =( eq( cons( X, Z ), cons(
% 14.04/14.48 Y, T ) ), eq( Z, T ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 14.04/14.48 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 23, [ ~( =( eq3( 'prop_merge_comm'( X, Y, Z ), bfalse ), btrue ) )
% 14.04/14.48 ] )
% 14.04/14.48 , clause( 5232, [ ~( =( eq3( 'prop_merge_comm'( X, Y, Z ), bfalse ), btrue
% 14.04/14.48 ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 14.04/14.48 permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5429, [ =( merge( cons( X, Y ), cons( Z, T ) ), aux( X, Y, Z, T,
% 14.04/14.48 leqNat( X, Z ) ) ) ] )
% 14.04/14.48 , clause( 7, [ =( aux( X, Y, Z, T, leqNat( X, Z ) ), merge( cons( X, Y ),
% 14.04/14.48 cons( Z, T ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 14.04/14.48 ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5430, [ =( merge( cons( s( X ), Y ), cons( s( Z ), T ) ), aux( s( X
% 14.04/14.48 ), Y, s( Z ), T, leqNat( X, Z ) ) ) ] )
% 14.04/14.48 , clause( 4, [ =( leqNat( s( X ), s( Y ) ), leqNat( X, Y ) ) ] )
% 14.04/14.48 , 0, clause( 5429, [ =( merge( cons( X, Y ), cons( Z, T ) ), aux( X, Y, Z,
% 14.04/14.48 T, leqNat( X, Z ) ) ) ] )
% 14.04/14.48 , 0, 17, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [
% 14.04/14.48 :=( X, s( X ) ), :=( Y, Y ), :=( Z, s( Z ) ), :=( T, T )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5431, [ =( aux( s( X ), Y, s( Z ), T, leqNat( X, Z ) ), merge( cons(
% 14.04/14.48 s( X ), Y ), cons( s( Z ), T ) ) ) ] )
% 14.04/14.48 , clause( 5430, [ =( merge( cons( s( X ), Y ), cons( s( Z ), T ) ), aux( s(
% 14.04/14.48 X ), Y, s( Z ), T, leqNat( X, Z ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 14.04/14.48 ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 37, [ =( aux( s( X ), Z, s( Y ), T, leqNat( X, Y ) ), merge( cons(
% 14.04/14.48 s( X ), Z ), cons( s( Y ), T ) ) ) ] )
% 14.04/14.48 , clause( 5431, [ =( aux( s( X ), Y, s( Z ), T, leqNat( X, Z ) ), merge(
% 14.04/14.48 cons( s( X ), Y ), cons( s( Z ), T ) ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y ), :=( T, T )] ),
% 14.04/14.48 permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5433, [ =( merge( cons( X, Y ), cons( Z, T ) ), aux( X, Y, Z, T,
% 14.04/14.48 leqNat( X, Z ) ) ) ] )
% 14.04/14.48 , clause( 7, [ =( aux( X, Y, Z, T, leqNat( X, Z ) ), merge( cons( X, Y ),
% 14.04/14.48 cons( Z, T ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 14.04/14.48 ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5434, [ =( merge( cons( z, X ), cons( Y, Z ) ), aux( z, X, Y, Z,
% 14.04/14.48 btrue ) ) ] )
% 14.04/14.48 , clause( 2, [ =( leqNat( z, X ), btrue ) ] )
% 14.04/14.48 , 0, clause( 5433, [ =( merge( cons( X, Y ), cons( Z, T ) ), aux( X, Y, Z,
% 14.04/14.48 T, leqNat( X, Z ) ) ) ] )
% 14.04/14.48 , 0, 13, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, z ),
% 14.04/14.48 :=( Y, X ), :=( Z, Y ), :=( T, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 39, [ =( merge( cons( z, Y ), cons( X, Z ) ), aux( z, Y, X, Z,
% 14.04/14.48 btrue ) ) ] )
% 14.04/14.48 , clause( 5434, [ =( merge( cons( z, X ), cons( Y, Z ) ), aux( z, X, Y, Z,
% 14.04/14.48 btrue ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] ),
% 14.04/14.48 permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5437, [ =( 'prop_merge_comm'( X, Y, Z ), impl( eq( merge( X, Y ),
% 14.04/14.48 merge( Y, X ) ), impl( eq( merge( X, Z ), merge( Z, X ) ), eq( merge( Y,
% 14.04/14.48 Z ), merge( Z, Y ) ) ) ) ) ] )
% 14.04/14.48 , clause( 10, [ =( impl( eq( merge( X, Y ), merge( Y, X ) ), impl( eq(
% 14.04/14.48 merge( X, Z ), merge( Z, X ) ), eq( merge( Y, Z ), merge( Z, Y ) ) ) ),
% 14.04/14.48 'prop_merge_comm'( X, Y, Z ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5441, [ =( 'prop_merge_comm'( nil, X, Y ), impl( eq( merge( nil, X
% 14.04/14.48 ), merge( X, nil ) ), impl( eq( Y, merge( Y, nil ) ), eq( merge( X, Y )
% 14.04/14.48 , merge( Y, X ) ) ) ) ) ] )
% 14.04/14.48 , clause( 5, [ =( merge( nil, X ), X ) ] )
% 14.04/14.48 , 0, clause( 5437, [ =( 'prop_merge_comm'( X, Y, Z ), impl( eq( merge( X, Y
% 14.04/14.48 ), merge( Y, X ) ), impl( eq( merge( X, Z ), merge( Z, X ) ), eq( merge(
% 14.04/14.48 Y, Z ), merge( Z, Y ) ) ) ) ) ] )
% 14.04/14.48 , 0, 15, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, nil )
% 14.04/14.48 , :=( Y, X ), :=( Z, Y )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5454, [ =( 'prop_merge_comm'( nil, X, Y ), impl( eq( X, merge( X,
% 14.04/14.48 nil ) ), impl( eq( Y, merge( Y, nil ) ), eq( merge( X, Y ), merge( Y, X )
% 14.04/14.48 ) ) ) ) ] )
% 14.04/14.48 , clause( 5, [ =( merge( nil, X ), X ) ] )
% 14.04/14.48 , 0, clause( 5441, [ =( 'prop_merge_comm'( nil, X, Y ), impl( eq( merge(
% 14.04/14.48 nil, X ), merge( X, nil ) ), impl( eq( Y, merge( Y, nil ) ), eq( merge( X
% 14.04/14.48 , Y ), merge( Y, X ) ) ) ) ) ] )
% 14.04/14.48 , 0, 7, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ),
% 14.04/14.48 :=( Y, Y )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5455, [ =( impl( eq( X, merge( X, nil ) ), impl( eq( Y, merge( Y,
% 14.04/14.48 nil ) ), eq( merge( X, Y ), merge( Y, X ) ) ) ), 'prop_merge_comm'( nil,
% 14.04/14.48 X, Y ) ) ] )
% 14.04/14.48 , clause( 5454, [ =( 'prop_merge_comm'( nil, X, Y ), impl( eq( X, merge( X
% 14.04/14.48 , nil ) ), impl( eq( Y, merge( Y, nil ) ), eq( merge( X, Y ), merge( Y, X
% 14.04/14.48 ) ) ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 46, [ =( impl( eq( X, merge( X, nil ) ), impl( eq( Y, merge( Y, nil
% 14.04/14.48 ) ), eq( merge( X, Y ), merge( Y, X ) ) ) ), 'prop_merge_comm'( nil, X,
% 14.04/14.48 Y ) ) ] )
% 14.04/14.48 , clause( 5455, [ =( impl( eq( X, merge( X, nil ) ), impl( eq( Y, merge( Y
% 14.04/14.48 , nil ) ), eq( merge( X, Y ), merge( Y, X ) ) ) ), 'prop_merge_comm'( nil
% 14.04/14.48 , X, Y ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 14.04/14.48 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5456, [ ~( =( bfalse, eq2( X, Y ) ) ), =( eq( cons( X, Z ), cons( Y
% 14.04/14.48 , T ) ), bfalse ) ] )
% 14.04/14.48 , clause( 19, [ ~( =( eq2( X, Y ), bfalse ) ), =( eq( cons( X, Z ), cons( Y
% 14.04/14.48 , T ) ), bfalse ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 14.04/14.48 ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5459, [ =( bfalse, eq2( s( X ), z ) ) ] )
% 14.04/14.48 , clause( 15, [ =( eq2( s( X ), z ), bfalse ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 resolution(
% 14.04/14.48 clause( 5460, [ =( eq( cons( s( X ), Y ), cons( z, Z ) ), bfalse ) ] )
% 14.04/14.48 , clause( 5456, [ ~( =( bfalse, eq2( X, Y ) ) ), =( eq( cons( X, Z ), cons(
% 14.04/14.48 Y, T ) ), bfalse ) ] )
% 14.04/14.48 , 0, clause( 5459, [ =( bfalse, eq2( s( X ), z ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, s( X ) ), :=( Y, z ), :=( Z, Y ), :=( T, Z )] )
% 14.04/14.48 , substitution( 1, [ :=( X, X )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 58, [ =( eq( cons( s( X ), Y ), cons( z, Z ) ), bfalse ) ] )
% 14.04/14.48 , clause( 5460, [ =( eq( cons( s( X ), Y ), cons( z, Z ) ), bfalse ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 14.04/14.48 permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5462, [ ~( =( btrue, eq2( X, Y ) ) ), =( eq( cons( X, Z ), cons( Y
% 14.04/14.48 , T ) ), eq( Z, T ) ) ] )
% 14.04/14.48 , clause( 20, [ ~( =( eq2( X, Y ), btrue ) ), =( eq( cons( X, Z ), cons( Y
% 14.04/14.48 , T ) ), eq( Z, T ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 14.04/14.48 ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5465, [ =( btrue, eq2( X, X ) ) ] )
% 14.04/14.48 , clause( 17, [ =( eq2( X, X ), btrue ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 resolution(
% 14.04/14.48 clause( 5466, [ =( eq( cons( X, Y ), cons( X, Z ) ), eq( Y, Z ) ) ] )
% 14.04/14.48 , clause( 5462, [ ~( =( btrue, eq2( X, Y ) ) ), =( eq( cons( X, Z ), cons(
% 14.04/14.48 Y, T ) ), eq( Z, T ) ) ] )
% 14.04/14.48 , 0, clause( 5465, [ =( btrue, eq2( X, X ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, Y ), :=( T, Z )] ),
% 14.04/14.48 substitution( 1, [ :=( X, X )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 66, [ =( eq( cons( X, Y ), cons( X, Z ) ), eq( Y, Z ) ) ] )
% 14.04/14.48 , clause( 5466, [ =( eq( cons( X, Y ), cons( X, Z ) ), eq( Y, Z ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 14.04/14.48 permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5469, [ =( bfalse, eq( cons( s( X ), Y ), cons( z, Z ) ) ) ] )
% 14.04/14.48 , clause( 58, [ =( eq( cons( s( X ), Y ), cons( z, Z ) ), bfalse ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5471, [ =( bfalse, eq( cons( s( X ), Y ), aux( z, Z, T, U, btrue )
% 14.04/14.48 ) ) ] )
% 14.04/14.48 , clause( 0, [ =( cons( X, merge( Y, cons( Z, T ) ) ), aux( X, Y, Z, T,
% 14.04/14.48 btrue ) ) ] )
% 14.04/14.48 , 0, clause( 5469, [ =( bfalse, eq( cons( s( X ), Y ), cons( z, Z ) ) ) ]
% 14.04/14.48 )
% 14.04/14.48 , 0, 7, substitution( 0, [ :=( X, z ), :=( Y, Z ), :=( Z, T ), :=( T, U )] )
% 14.04/14.48 , substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, merge( Z, cons( T, U
% 14.04/14.48 ) ) )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5473, [ =( eq( cons( s( X ), Y ), aux( z, Z, T, U, btrue ) ),
% 14.04/14.48 bfalse ) ] )
% 14.04/14.48 , clause( 5471, [ =( bfalse, eq( cons( s( X ), Y ), aux( z, Z, T, U, btrue
% 14.04/14.48 ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ),
% 14.04/14.48 :=( U, U )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 96, [ =( eq( cons( s( T ), U ), aux( z, X, Y, Z, btrue ) ), bfalse
% 14.04/14.48 ) ] )
% 14.04/14.48 , clause( 5473, [ =( eq( cons( s( X ), Y ), aux( z, Z, T, U, btrue ) ),
% 14.04/14.48 bfalse ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, T ), :=( Y, U ), :=( Z, X ), :=( T, Y ), :=( U
% 14.04/14.48 , Z )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5475, [ =( eq( Y, Z ), eq( cons( X, Y ), cons( X, Z ) ) ) ] )
% 14.04/14.48 , clause( 66, [ =( eq( cons( X, Y ), cons( X, Z ) ), eq( Y, Z ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5476, [ =( eq( merge( X, cons( Y, Z ) ), T ), eq( aux( U, X, Y, Z,
% 14.04/14.48 btrue ), cons( U, T ) ) ) ] )
% 14.04/14.48 , clause( 0, [ =( cons( X, merge( Y, cons( Z, T ) ) ), aux( X, Y, Z, T,
% 14.04/14.48 btrue ) ) ] )
% 14.04/14.48 , 0, clause( 5475, [ =( eq( Y, Z ), eq( cons( X, Y ), cons( X, Z ) ) ) ] )
% 14.04/14.48 , 0, 9, substitution( 0, [ :=( X, U ), :=( Y, X ), :=( Z, Y ), :=( T, Z )] )
% 14.04/14.48 , substitution( 1, [ :=( X, U ), :=( Y, merge( X, cons( Y, Z ) ) ), :=( Z
% 14.04/14.48 , T )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5478, [ =( eq( aux( U, X, Y, Z, btrue ), cons( U, T ) ), eq( merge(
% 14.04/14.48 X, cons( Y, Z ) ), T ) ) ] )
% 14.04/14.48 , clause( 5476, [ =( eq( merge( X, cons( Y, Z ) ), T ), eq( aux( U, X, Y, Z
% 14.04/14.48 , btrue ), cons( U, T ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ),
% 14.04/14.48 :=( U, U )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 99, [ =( eq( aux( X, Y, Z, T, btrue ), cons( X, U ) ), eq( merge( Y
% 14.04/14.48 , cons( Z, T ) ), U ) ) ] )
% 14.04/14.48 , clause( 5478, [ =( eq( aux( U, X, Y, Z, btrue ), cons( U, T ) ), eq(
% 14.04/14.48 merge( X, cons( Y, Z ) ), T ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T, U ), :=( U
% 14.04/14.48 , X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5481, [ =( merge( cons( s( X ), Y ), cons( s( Z ), T ) ), aux( s( X
% 14.04/14.48 ), Y, s( Z ), T, leqNat( X, Z ) ) ) ] )
% 14.04/14.48 , clause( 37, [ =( aux( s( X ), Z, s( Y ), T, leqNat( X, Y ) ), merge( cons(
% 14.04/14.48 s( X ), Z ), cons( s( Y ), T ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y ), :=( T, T )] )
% 14.04/14.48 ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5482, [ =( merge( cons( s( z ), X ), cons( s( Y ), Z ) ), aux( s( z
% 14.04/14.48 ), X, s( Y ), Z, btrue ) ) ] )
% 14.04/14.48 , clause( 2, [ =( leqNat( z, X ), btrue ) ] )
% 14.04/14.48 , 0, clause( 5481, [ =( merge( cons( s( X ), Y ), cons( s( Z ), T ) ), aux(
% 14.04/14.48 s( X ), Y, s( Z ), T, leqNat( X, Z ) ) ) ] )
% 14.04/14.48 , 0, 17, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, z ),
% 14.04/14.48 :=( Y, X ), :=( Z, Y ), :=( T, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 114, [ =( merge( cons( s( z ), Y ), cons( s( X ), Z ) ), aux( s( z
% 14.04/14.48 ), Y, s( X ), Z, btrue ) ) ] )
% 14.04/14.48 , clause( 5482, [ =( merge( cons( s( z ), X ), cons( s( Y ), Z ) ), aux( s(
% 14.04/14.48 z ), X, s( Y ), Z, btrue ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] ),
% 14.04/14.48 permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5485, [ =( eq( merge( Y, cons( Z, T ) ), U ), eq( aux( X, Y, Z, T,
% 14.04/14.48 btrue ), cons( X, U ) ) ) ] )
% 14.04/14.48 , clause( 99, [ =( eq( aux( X, Y, Z, T, btrue ), cons( X, U ) ), eq( merge(
% 14.04/14.48 Y, cons( Z, T ) ), U ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ),
% 14.04/14.48 :=( U, U )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5487, [ =( eq( merge( X, cons( Y, Z ) ), merge( T, cons( U, W ) ) )
% 14.04/14.48 , eq( aux( V0, X, Y, Z, btrue ), aux( V0, T, U, W, btrue ) ) ) ] )
% 14.04/14.48 , clause( 0, [ =( cons( X, merge( Y, cons( Z, T ) ) ), aux( X, Y, Z, T,
% 14.04/14.48 btrue ) ) ] )
% 14.04/14.48 , 0, clause( 5485, [ =( eq( merge( Y, cons( Z, T ) ), U ), eq( aux( X, Y, Z
% 14.04/14.48 , T, btrue ), cons( X, U ) ) ) ] )
% 14.04/14.48 , 0, 19, substitution( 0, [ :=( X, V0 ), :=( Y, T ), :=( Z, U ), :=( T, W )] )
% 14.04/14.48 , substitution( 1, [ :=( X, V0 ), :=( Y, X ), :=( Z, Y ), :=( T, Z ),
% 14.04/14.48 :=( U, merge( T, cons( U, W ) ) )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5489, [ =( eq( aux( V0, X, Y, Z, btrue ), aux( V0, T, U, W, btrue )
% 14.04/14.48 ), eq( merge( X, cons( Y, Z ) ), merge( T, cons( U, W ) ) ) ) ] )
% 14.04/14.48 , clause( 5487, [ =( eq( merge( X, cons( Y, Z ) ), merge( T, cons( U, W ) )
% 14.04/14.48 ), eq( aux( V0, X, Y, Z, btrue ), aux( V0, T, U, W, btrue ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ),
% 14.04/14.48 :=( U, U ), :=( W, W ), :=( V0, V0 )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 355, [ =( eq( aux( X, U, W, V0, btrue ), aux( X, Y, Z, T, btrue ) )
% 14.04/14.48 , eq( merge( U, cons( W, V0 ) ), merge( Y, cons( Z, T ) ) ) ) ] )
% 14.04/14.48 , clause( 5489, [ =( eq( aux( V0, X, Y, Z, btrue ), aux( V0, T, U, W, btrue
% 14.04/14.48 ) ), eq( merge( X, cons( Y, Z ) ), merge( T, cons( U, W ) ) ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, U ), :=( Y, W ), :=( Z, V0 ), :=( T, Y ), :=( U
% 14.04/14.48 , Z ), :=( W, T ), :=( V0, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5491, [ =( 'prop_merge_comm'( nil, X, Y ), impl( eq( X, merge( X,
% 14.04/14.48 nil ) ), impl( eq( Y, merge( Y, nil ) ), eq( merge( X, Y ), merge( Y, X )
% 14.04/14.48 ) ) ) ) ] )
% 14.04/14.48 , clause( 46, [ =( impl( eq( X, merge( X, nil ) ), impl( eq( Y, merge( Y,
% 14.04/14.48 nil ) ), eq( merge( X, Y ), merge( Y, X ) ) ) ), 'prop_merge_comm'( nil,
% 14.04/14.48 X, Y ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5498, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( Y )
% 14.04/14.48 , Z ) ), impl( eq( cons( s( z ), X ), merge( cons( s( z ), X ), nil ) ),
% 14.04/14.48 impl( eq( cons( s( Y ), Z ), merge( cons( s( Y ), Z ), nil ) ), eq( aux(
% 14.04/14.48 s( z ), X, s( Y ), Z, btrue ), merge( cons( s( Y ), Z ), cons( s( z ), X
% 14.04/14.48 ) ) ) ) ) ) ] )
% 14.04/14.48 , clause( 114, [ =( merge( cons( s( z ), Y ), cons( s( X ), Z ) ), aux( s(
% 14.04/14.48 z ), Y, s( X ), Z, btrue ) ) ] )
% 14.04/14.48 , 0, clause( 5491, [ =( 'prop_merge_comm'( nil, X, Y ), impl( eq( X, merge(
% 14.04/14.48 X, nil ) ), impl( eq( Y, merge( Y, nil ) ), eq( merge( X, Y ), merge( Y,
% 14.04/14.48 X ) ) ) ) ) ] )
% 14.04/14.48 , 0, 36, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] ),
% 14.04/14.48 substitution( 1, [ :=( X, cons( s( z ), X ) ), :=( Y, cons( s( Y ), Z ) )] )
% 14.04/14.48 ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5523, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( Y )
% 14.04/14.48 , Z ) ), impl( eq( cons( s( z ), X ), merge( cons( s( z ), X ), nil ) ),
% 14.04/14.48 impl( eq( cons( s( Y ), Z ), cons( s( Y ), Z ) ), eq( aux( s( z ), X, s(
% 14.04/14.48 Y ), Z, btrue ), merge( cons( s( Y ), Z ), cons( s( z ), X ) ) ) ) ) ) ]
% 14.04/14.48 )
% 14.04/14.48 , clause( 6, [ =( merge( cons( X, Y ), nil ), cons( X, Y ) ) ] )
% 14.04/14.48 , 0, clause( 5498, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s(
% 14.04/14.48 Y ), Z ) ), impl( eq( cons( s( z ), X ), merge( cons( s( z ), X ), nil )
% 14.04/14.48 ), impl( eq( cons( s( Y ), Z ), merge( cons( s( Y ), Z ), nil ) ), eq(
% 14.04/14.48 aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s( Y ), Z ), cons( s( z
% 14.04/14.48 ), X ) ) ) ) ) ) ] )
% 14.04/14.48 , 0, 29, substitution( 0, [ :=( X, s( Y ) ), :=( Y, Z )] ), substitution( 1
% 14.04/14.48 , [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5525, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( Y )
% 14.04/14.48 , Z ) ), impl( eq( cons( s( z ), X ), merge( cons( s( z ), X ), nil ) ),
% 14.04/14.48 impl( btrue, eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s( Y )
% 14.04/14.48 , Z ), cons( s( z ), X ) ) ) ) ) ) ] )
% 14.04/14.48 , clause( 16, [ =( eq( X, X ), btrue ) ] )
% 14.04/14.48 , 0, clause( 5523, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s(
% 14.04/14.48 Y ), Z ) ), impl( eq( cons( s( z ), X ), merge( cons( s( z ), X ), nil )
% 14.04/14.48 ), impl( eq( cons( s( Y ), Z ), cons( s( Y ), Z ) ), eq( aux( s( z ), X
% 14.04/14.48 , s( Y ), Z, btrue ), merge( cons( s( Y ), Z ), cons( s( z ), X ) ) ) ) )
% 14.04/14.48 ) ] )
% 14.04/14.48 , 0, 24, substitution( 0, [ :=( X, cons( s( Y ), Z ) )] ), substitution( 1
% 14.04/14.48 , [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5526, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( Y )
% 14.04/14.48 , Z ) ), impl( eq( cons( s( z ), X ), merge( cons( s( z ), X ), nil ) ),
% 14.04/14.48 eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s( Y ), Z ), cons( s(
% 14.04/14.48 z ), X ) ) ) ) ) ] )
% 14.04/14.48 , clause( 8, [ =( impl( btrue, X ), X ) ] )
% 14.04/14.48 , 0, clause( 5525, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s(
% 14.04/14.48 Y ), Z ) ), impl( eq( cons( s( z ), X ), merge( cons( s( z ), X ), nil )
% 14.04/14.48 ), impl( btrue, eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s(
% 14.04/14.48 Y ), Z ), cons( s( z ), X ) ) ) ) ) ) ] )
% 14.04/14.48 , 0, 23, substitution( 0, [ :=( X, eq( aux( s( z ), X, s( Y ), Z, btrue ),
% 14.04/14.48 merge( cons( s( Y ), Z ), cons( s( z ), X ) ) ) )] ), substitution( 1, [
% 14.04/14.48 :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5527, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( Y )
% 14.04/14.48 , Z ) ), impl( eq( cons( s( z ), X ), cons( s( z ), X ) ), eq( aux( s( z
% 14.04/14.48 ), X, s( Y ), Z, btrue ), merge( cons( s( Y ), Z ), cons( s( z ), X ) )
% 14.04/14.48 ) ) ) ] )
% 14.04/14.48 , clause( 6, [ =( merge( cons( X, Y ), nil ), cons( X, Y ) ) ] )
% 14.04/14.48 , 0, clause( 5526, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s(
% 14.04/14.48 Y ), Z ) ), impl( eq( cons( s( z ), X ), merge( cons( s( z ), X ), nil )
% 14.04/14.48 ), eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s( Y ), Z ),
% 14.04/14.48 cons( s( z ), X ) ) ) ) ) ] )
% 14.04/14.48 , 0, 17, substitution( 0, [ :=( X, s( z ) ), :=( Y, X )] ), substitution( 1
% 14.04/14.48 , [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5528, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( Y )
% 14.04/14.48 , Z ) ), impl( btrue, eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons(
% 14.04/14.48 s( Y ), Z ), cons( s( z ), X ) ) ) ) ) ] )
% 14.04/14.48 , clause( 16, [ =( eq( X, X ), btrue ) ] )
% 14.04/14.48 , 0, clause( 5527, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s(
% 14.04/14.48 Y ), Z ) ), impl( eq( cons( s( z ), X ), cons( s( z ), X ) ), eq( aux( s(
% 14.04/14.48 z ), X, s( Y ), Z, btrue ), merge( cons( s( Y ), Z ), cons( s( z ), X ) )
% 14.04/14.48 ) ) ) ] )
% 14.04/14.48 , 0, 12, substitution( 0, [ :=( X, cons( s( z ), X ) )] ), substitution( 1
% 14.04/14.48 , [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5529, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( Y )
% 14.04/14.48 , Z ) ), eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s( Y ), Z )
% 14.04/14.48 , cons( s( z ), X ) ) ) ) ] )
% 14.04/14.48 , clause( 8, [ =( impl( btrue, X ), X ) ] )
% 14.04/14.48 , 0, clause( 5528, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s(
% 14.04/14.48 Y ), Z ) ), impl( btrue, eq( aux( s( z ), X, s( Y ), Z, btrue ), merge(
% 14.04/14.48 cons( s( Y ), Z ), cons( s( z ), X ) ) ) ) ) ] )
% 14.04/14.48 , 0, 11, substitution( 0, [ :=( X, eq( aux( s( z ), X, s( Y ), Z, btrue ),
% 14.04/14.48 merge( cons( s( Y ), Z ), cons( s( z ), X ) ) ) )] ), substitution( 1, [
% 14.04/14.48 :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5530, [ =( eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s(
% 14.04/14.48 Y ), Z ), cons( s( z ), X ) ) ), 'prop_merge_comm'( nil, cons( s( z ), X
% 14.04/14.48 ), cons( s( Y ), Z ) ) ) ] )
% 14.04/14.48 , clause( 5529, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( Y
% 14.04/14.48 ), Z ) ), eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s( Y ), Z
% 14.04/14.48 ), cons( s( z ), X ) ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 359, [ =( eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s( Y
% 14.04/14.48 ), Z ), cons( s( z ), X ) ) ), 'prop_merge_comm'( nil, cons( s( z ), X )
% 14.04/14.48 , cons( s( Y ), Z ) ) ) ] )
% 14.04/14.48 , clause( 5530, [ =( eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s(
% 14.04/14.48 Y ), Z ), cons( s( z ), X ) ) ), 'prop_merge_comm'( nil, cons( s( z ), X
% 14.04/14.48 ), cons( s( Y ), Z ) ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 14.04/14.48 permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5532, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( Y )
% 14.04/14.48 , Z ) ), eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s( Y ), Z )
% 14.04/14.48 , cons( s( z ), X ) ) ) ) ] )
% 14.04/14.48 , clause( 359, [ =( eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s(
% 14.04/14.48 Y ), Z ), cons( s( z ), X ) ) ), 'prop_merge_comm'( nil, cons( s( z ), X
% 14.04/14.48 ), cons( s( Y ), Z ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5534, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( z )
% 14.04/14.48 , Y ) ), eq( aux( s( z ), X, s( z ), Y, btrue ), aux( s( z ), Y, s( z ),
% 14.04/14.48 X, btrue ) ) ) ] )
% 14.04/14.48 , clause( 114, [ =( merge( cons( s( z ), Y ), cons( s( X ), Z ) ), aux( s(
% 14.04/14.48 z ), Y, s( X ), Z, btrue ) ) ] )
% 14.04/14.48 , 0, clause( 5532, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s(
% 14.04/14.48 Y ), Z ) ), eq( aux( s( z ), X, s( Y ), Z, btrue ), merge( cons( s( Y ),
% 14.04/14.48 Z ), cons( s( z ), X ) ) ) ) ] )
% 14.04/14.48 , 0, 20, substitution( 0, [ :=( X, z ), :=( Y, Y ), :=( Z, X )] ),
% 14.04/14.48 substitution( 1, [ :=( X, X ), :=( Y, z ), :=( Z, Y )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5535, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( z )
% 14.04/14.48 , Y ) ), eq( merge( X, cons( s( z ), Y ) ), merge( Y, cons( s( z ), X ) )
% 14.04/14.48 ) ) ] )
% 14.04/14.48 , clause( 355, [ =( eq( aux( X, U, W, V0, btrue ), aux( X, Y, Z, T, btrue )
% 14.04/14.48 ), eq( merge( U, cons( W, V0 ) ), merge( Y, cons( Z, T ) ) ) ) ] )
% 14.04/14.48 , 0, clause( 5534, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s(
% 14.04/14.48 z ), Y ) ), eq( aux( s( z ), X, s( z ), Y, btrue ), aux( s( z ), Y, s( z
% 14.04/14.48 ), X, btrue ) ) ) ] )
% 14.04/14.48 , 0, 11, substitution( 0, [ :=( X, s( z ) ), :=( Y, Y ), :=( Z, s( z ) ),
% 14.04/14.48 :=( T, X ), :=( U, X ), :=( W, s( z ) ), :=( V0, Y )] ), substitution( 1
% 14.04/14.48 , [ :=( X, X ), :=( Y, Y )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5536, [ =( eq( merge( X, cons( s( z ), Y ) ), merge( Y, cons( s( z
% 14.04/14.48 ), X ) ) ), 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( z ), Y )
% 14.04/14.48 ) ) ] )
% 14.04/14.48 , clause( 5535, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( z
% 14.04/14.48 ), Y ) ), eq( merge( X, cons( s( z ), Y ) ), merge( Y, cons( s( z ), X )
% 14.04/14.48 ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 1849, [ =( eq( merge( Y, cons( s( z ), X ) ), merge( X, cons( s( z
% 14.04/14.48 ), Y ) ) ), 'prop_merge_comm'( nil, cons( s( z ), Y ), cons( s( z ), X )
% 14.04/14.48 ) ) ] )
% 14.04/14.48 , clause( 5536, [ =( eq( merge( X, cons( s( z ), Y ) ), merge( Y, cons( s(
% 14.04/14.48 z ), X ) ) ), 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( z ), Y
% 14.04/14.48 ) ) ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 14.04/14.48 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5538, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s( z )
% 14.04/14.48 , Y ) ), eq( merge( X, cons( s( z ), Y ) ), merge( Y, cons( s( z ), X ) )
% 14.04/14.48 ) ) ] )
% 14.04/14.48 , clause( 1849, [ =( eq( merge( Y, cons( s( z ), X ) ), merge( X, cons( s(
% 14.04/14.48 z ), Y ) ) ), 'prop_merge_comm'( nil, cons( s( z ), Y ), cons( s( z ), X
% 14.04/14.48 ) ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5539, [ =( 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s( z
% 14.04/14.48 ), X ) ), eq( cons( s( z ), X ), merge( X, cons( s( z ), nil ) ) ) ) ]
% 14.04/14.48 )
% 14.04/14.48 , clause( 5, [ =( merge( nil, X ), X ) ] )
% 14.04/14.48 , 0, clause( 5538, [ =( 'prop_merge_comm'( nil, cons( s( z ), X ), cons( s(
% 14.04/14.48 z ), Y ) ), eq( merge( X, cons( s( z ), Y ) ), merge( Y, cons( s( z ), X
% 14.04/14.48 ) ) ) ) ] )
% 14.04/14.48 , 0, 12, substitution( 0, [ :=( X, cons( s( z ), X ) )] ), substitution( 1
% 14.04/14.48 , [ :=( X, nil ), :=( Y, X )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5541, [ =( eq( cons( s( z ), X ), merge( X, cons( s( z ), nil ) ) )
% 14.04/14.48 , 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s( z ), X ) ) ) ] )
% 14.04/14.48 , clause( 5539, [ =( 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s(
% 14.04/14.48 z ), X ) ), eq( cons( s( z ), X ), merge( X, cons( s( z ), nil ) ) ) ) ]
% 14.04/14.48 )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 5182, [ =( eq( cons( s( z ), X ), merge( X, cons( s( z ), nil ) ) )
% 14.04/14.48 , 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s( z ), X ) ) ) ] )
% 14.04/14.48 , clause( 5541, [ =( eq( cons( s( z ), X ), merge( X, cons( s( z ), nil ) )
% 14.04/14.48 ), 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s( z ), X ) ) ) ]
% 14.04/14.48 )
% 14.04/14.48 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5544, [ =( 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s( z
% 14.04/14.48 ), X ) ), eq( cons( s( z ), X ), merge( X, cons( s( z ), nil ) ) ) ) ]
% 14.04/14.48 )
% 14.04/14.48 , clause( 5182, [ =( eq( cons( s( z ), X ), merge( X, cons( s( z ), nil ) )
% 14.04/14.48 ), 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s( z ), X ) ) ) ]
% 14.04/14.48 )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5546, [ =( 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s( z
% 14.04/14.48 ), cons( z, X ) ) ), eq( cons( s( z ), cons( z, X ) ), aux( z, X, s( z )
% 14.04/14.48 , nil, btrue ) ) ) ] )
% 14.04/14.48 , clause( 39, [ =( merge( cons( z, Y ), cons( X, Z ) ), aux( z, Y, X, Z,
% 14.04/14.48 btrue ) ) ] )
% 14.04/14.48 , 0, clause( 5544, [ =( 'prop_merge_comm'( nil, cons( s( z ), nil ), cons(
% 14.04/14.48 s( z ), X ) ), eq( cons( s( z ), X ), merge( X, cons( s( z ), nil ) ) ) )
% 14.04/14.48 ] )
% 14.04/14.48 , 0, 20, substitution( 0, [ :=( X, s( z ) ), :=( Y, X ), :=( Z, nil )] ),
% 14.04/14.48 substitution( 1, [ :=( X, cons( z, X ) )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5547, [ =( 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s( z
% 14.04/14.48 ), cons( z, X ) ) ), bfalse ) ] )
% 14.04/14.48 , clause( 96, [ =( eq( cons( s( T ), U ), aux( z, X, Y, Z, btrue ) ),
% 14.04/14.48 bfalse ) ] )
% 14.04/14.48 , 0, clause( 5546, [ =( 'prop_merge_comm'( nil, cons( s( z ), nil ), cons(
% 14.04/14.48 s( z ), cons( z, X ) ) ), eq( cons( s( z ), cons( z, X ) ), aux( z, X, s(
% 14.04/14.48 z ), nil, btrue ) ) ) ] )
% 14.04/14.48 , 0, 13, substitution( 0, [ :=( X, X ), :=( Y, s( z ) ), :=( Z, nil ), :=(
% 14.04/14.48 T, z ), :=( U, cons( z, X ) )] ), substitution( 1, [ :=( X, X )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 5202, [ =( 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s( z
% 14.04/14.48 ), cons( z, X ) ) ), bfalse ) ] )
% 14.04/14.48 , clause( 5547, [ =( 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s(
% 14.04/14.48 z ), cons( z, X ) ) ), bfalse ) ] )
% 14.04/14.48 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqswap(
% 14.04/14.48 clause( 5550, [ ~( =( btrue, eq3( 'prop_merge_comm'( X, Y, Z ), bfalse ) )
% 14.04/14.48 ) ] )
% 14.04/14.48 , clause( 23, [ ~( =( eq3( 'prop_merge_comm'( X, Y, Z ), bfalse ), btrue )
% 14.04/14.48 ) ] )
% 14.04/14.48 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5552, [ ~( =( btrue, eq3( bfalse, bfalse ) ) ) ] )
% 14.04/14.48 , clause( 5202, [ =( 'prop_merge_comm'( nil, cons( s( z ), nil ), cons( s(
% 14.04/14.48 z ), cons( z, X ) ) ), bfalse ) ] )
% 14.04/14.48 , 0, clause( 5550, [ ~( =( btrue, eq3( 'prop_merge_comm'( X, Y, Z ), bfalse
% 14.04/14.48 ) ) ) ] )
% 14.04/14.48 , 0, 4, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, nil ),
% 14.04/14.48 :=( Y, cons( s( z ), nil ) ), :=( Z, cons( s( z ), cons( z, X ) ) )] )
% 14.04/14.48 ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 paramod(
% 14.04/14.48 clause( 5553, [ ~( =( btrue, btrue ) ) ] )
% 14.04/14.48 , clause( 18, [ =( eq3( X, X ), btrue ) ] )
% 14.04/14.48 , 0, clause( 5552, [ ~( =( btrue, eq3( bfalse, bfalse ) ) ) ] )
% 14.04/14.48 , 0, 3, substitution( 0, [ :=( X, bfalse )] ), substitution( 1, [] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 eqrefl(
% 14.04/14.48 clause( 5554, [] )
% 14.04/14.48 , clause( 5553, [ ~( =( btrue, btrue ) ) ] )
% 14.04/14.48 , 0, substitution( 0, [] )).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 subsumption(
% 14.04/14.48 clause( 5207, [] )
% 14.04/14.48 , clause( 5554, [] )
% 14.04/14.48 , substitution( 0, [] ), permutation( 0, [] ) ).
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 end.
% 14.04/14.48
% 14.04/14.48 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 14.04/14.48
% 14.04/14.48 Memory use:
% 14.04/14.48
% 14.04/14.48 space for terms: 133486
% 14.04/14.48 space for clauses: 907100
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 clauses generated: 36437
% 14.04/14.48 clauses kept: 5208
% 14.04/14.48 clauses selected: 1180
% 14.04/14.48 clauses deleted: 169
% 14.04/14.48 clauses inuse deleted: 40
% 14.04/14.48
% 14.04/14.48 subsentry: 5558
% 14.04/14.48 literals s-matched: 4547
% 14.04/14.48 literals matched: 4547
% 14.04/14.48 full subsumption: 7
% 14.04/14.48
% 14.04/14.48 checksum: 1626056395
% 14.04/14.48
% 14.04/14.48
% 14.04/14.48 Bliksem ended
%------------------------------------------------------------------------------