%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWX207-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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:48 PM UTC 2026
% Result : Unsatisfiable 1.94s 2.31s
% Output : Refutation 1.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWX207-1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : bliksem %s
% 0.14/0.33 % Computer : n021.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % DateTime : Tue May 5 11:36:55 EDT 2026
% 0.14/0.33 % CPUTime :
% 1.94/2.31 *** allocated 10000 integers for termspace/termends
% 1.94/2.31 *** allocated 10000 integers for clauses
% 1.94/2.31 *** allocated 10000 integers for justifications
% 1.94/2.31 Bliksem 1.12
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Automatic Strategy Selection
% 1.94/2.31
% 1.94/2.31 Clauses:
% 1.94/2.31 [
% 1.94/2.31 [ =( impl( btrue, X ), X ) ],
% 1.94/2.31 [ =( impl( bfalse, X ), btrue ) ],
% 1.94/2.31 [ =( append( nil, X ), X ) ],
% 1.94/2.31 [ =( append( cons( X, Y ), Z ), cons( X, append( Y, Z ) ) ) ],
% 1.94/2.31 [ =( linP( aP( X ) ), append( cons( a, nil ), append( linP( X ), cons( a
% 1.94/2.31 , nil ) ) ) ) ],
% 1.94/2.31 [ =( linP( bP( X ) ), append( cons( b, nil ), append( linP( X ), cons( b
% 1.94/2.31 , nil ) ) ) ) ],
% 1.94/2.31 [ =( linP( pA ), cons( a, nil ) ) ],
% 1.94/2.31 [ =( linP( pB ), cons( b, nil ) ) ],
% 1.94/2.31 [ =( linP( pE ), nil ) ],
% 1.94/2.31 [ =( linC( c2( X, Y ) ), append( linP( X ), linP( Y ) ) ) ],
% 1.94/2.31 [ =( unambig( X, Y ), impl( eq( linC( X ), linC( Y ) ), eq4( X, Y ) ) )
% 1.94/2.31 ],
% 1.94/2.31 [ =( eq2( a, b ), bfalse ) ],
% 1.94/2.31 [ =( eq2( b, a ), bfalse ) ],
% 1.94/2.31 [ =( eq3( pA, pB ), bfalse ) ],
% 1.94/2.31 [ =( eq3( pA, pE ), bfalse ) ],
% 1.94/2.31 [ =( eq3( pB, pA ), bfalse ) ],
% 1.94/2.31 [ =( eq3( pB, pE ), bfalse ) ],
% 1.94/2.31 [ =( eq3( pE, pA ), bfalse ) ],
% 1.94/2.31 [ =( eq3( pE, pB ), bfalse ) ],
% 1.94/2.31 [ =( eq5( bfalse, btrue ), bfalse ) ],
% 1.94/2.31 [ =( eq5( btrue, bfalse ), bfalse ) ],
% 1.94/2.31 [ =( eq3( aP( X ), aP( Y ) ), eq3( X, Y ) ) ],
% 1.94/2.31 [ =( eq3( bP( X ), bP( Y ) ), eq3( X, Y ) ) ],
% 1.94/2.31 [ =( eq3( aP( X ), bP( Y ) ), bfalse ) ],
% 1.94/2.31 [ =( eq3( aP( X ), pA ), bfalse ) ],
% 1.94/2.31 [ =( eq3( aP( X ), pB ), bfalse ) ],
% 1.94/2.31 [ =( eq3( aP( X ), pE ), bfalse ) ],
% 1.94/2.31 [ =( eq3( bP( X ), aP( Y ) ), bfalse ) ],
% 1.94/2.31 [ =( eq3( bP( X ), pA ), bfalse ) ],
% 1.94/2.31 [ =( eq3( bP( X ), pB ), bfalse ) ],
% 1.94/2.31 [ =( eq3( bP( X ), pE ), bfalse ) ],
% 1.94/2.31 [ =( eq3( pA, aP( X ) ), bfalse ) ],
% 1.94/2.31 [ =( eq3( pA, bP( X ) ), bfalse ) ],
% 1.94/2.31 [ =( eq3( pB, aP( X ) ), bfalse ) ],
% 1.94/2.31 [ =( eq3( pB, bP( X ) ), bfalse ) ],
% 1.94/2.31 [ =( eq3( pE, aP( X ) ), bfalse ) ],
% 1.94/2.31 [ =( eq3( pE, bP( X ) ), bfalse ) ],
% 1.94/2.31 [ ~( =( eq3( X, Y ), bfalse ) ), =( eq4( c2( X, Z ), c2( Y, T ) ),
% 1.94/2.31 bfalse ) ],
% 1.94/2.31 [ ~( =( eq3( X, Y ), btrue ) ), =( eq4( c2( X, Z ), c2( Y, T ) ), eq3( Z
% 1.94/2.31 , T ) ) ],
% 1.94/2.31 [ =( eq( X, X ), btrue ) ],
% 1.94/2.31 [ =( eq2( X, X ), btrue ) ],
% 1.94/2.31 [ =( eq3( X, X ), btrue ) ],
% 1.94/2.31 [ =( eq4( X, X ), btrue ) ],
% 1.94/2.31 [ =( eq5( X, X ), btrue ) ],
% 1.94/2.31 [ ~( =( eq2( X, Y ), bfalse ) ), =( eq( cons( X, Z ), cons( Y, T ) ),
% 1.94/2.31 bfalse ) ],
% 1.94/2.31 [ ~( =( eq2( X, Y ), btrue ) ), =( eq( cons( X, Z ), cons( Y, T ) ), eq(
% 1.94/2.31 Z, T ) ) ],
% 1.94/2.31 [ =( eq( nil, cons( X, Y ) ), bfalse ) ],
% 1.94/2.31 [ =( eq( cons( X, Y ), nil ), bfalse ) ],
% 1.94/2.31 [ ~( =( eq5( unambig( X, Y ), bfalse ), btrue ) ) ]
% 1.94/2.31 ] .
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 percentage equality = 1.000000, percentage horn = 1.000000
% 1.94/2.31 This is a pure equality problem
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Options Used:
% 1.94/2.31
% 1.94/2.31 useres = 1
% 1.94/2.31 useparamod = 1
% 1.94/2.31 useeqrefl = 1
% 1.94/2.31 useeqfact = 1
% 1.94/2.31 usefactor = 1
% 1.94/2.31 usesimpsplitting = 0
% 1.94/2.31 usesimpdemod = 5
% 1.94/2.31 usesimpres = 3
% 1.94/2.31
% 1.94/2.31 resimpinuse = 1000
% 1.94/2.31 resimpclauses = 20000
% 1.94/2.31 substype = eqrewr
% 1.94/2.31 backwardsubs = 1
% 1.94/2.31 selectoldest = 5
% 1.94/2.31
% 1.94/2.31 litorderings [0] = split
% 1.94/2.31 litorderings [1] = extend the termordering, first sorting on arguments
% 1.94/2.31
% 1.94/2.31 termordering = kbo
% 1.94/2.31
% 1.94/2.31 litapriori = 0
% 1.94/2.31 termapriori = 1
% 1.94/2.31 litaposteriori = 0
% 1.94/2.31 termaposteriori = 0
% 1.94/2.31 demodaposteriori = 0
% 1.94/2.31 ordereqreflfact = 0
% 1.94/2.31
% 1.94/2.31 litselect = negord
% 1.94/2.31
% 1.94/2.31 maxweight = 15
% 1.94/2.31 maxdepth = 30000
% 1.94/2.31 maxlength = 115
% 1.94/2.31 maxnrvars = 195
% 1.94/2.31 excuselevel = 1
% 1.94/2.31 increasemaxweight = 1
% 1.94/2.31
% 1.94/2.31 maxselected = 10000000
% 1.94/2.31 maxnrclauses = 10000000
% 1.94/2.31
% 1.94/2.31 showgenerated = 0
% 1.94/2.31 showkept = 0
% 1.94/2.31 showselected = 0
% 1.94/2.31 showdeleted = 0
% 1.94/2.31 showresimp = 1
% 1.94/2.31 showstatus = 2000
% 1.94/2.31
% 1.94/2.31 prologoutput = 1
% 1.94/2.31 nrgoals = 5000000
% 1.94/2.31 totalproof = 1
% 1.94/2.31
% 1.94/2.31 Symbols occurring in the translation:
% 1.94/2.31
% 1.94/2.31 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.94/2.31 . [1, 2] (w:1, o:33, a:1, s:1, b:0),
% 1.94/2.31 ! [4, 1] (w:0, o:24, a:1, s:1, b:0),
% 1.94/2.31 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.94/2.31 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.94/2.31 btrue [39, 0] (w:1, o:10, a:1, s:1, b:0),
% 1.94/2.31 impl [41, 2] (w:1, o:58, a:1, s:1, b:0),
% 1.94/2.31 bfalse [42, 0] (w:1, o:13, a:1, s:1, b:0),
% 1.94/2.31 nil [43, 0] (w:1, o:14, a:1, s:1, b:0),
% 1.94/2.31 append [45, 2] (w:1, o:59, a:1, s:1, b:0),
% 1.94/2.31 cons [48, 2] (w:1, o:60, a:1, s:1, b:0),
% 1.94/2.31 aP [50, 1] (w:1, o:29, a:1, s:1, b:0),
% 1.94/2.31 linP [51, 1] (w:1, o:30, a:1, s:1, b:0),
% 1.94/2.31 a [52, 0] (w:1, o:9, a:1, s:1, b:0),
% 1.94/2.31 bP [53, 1] (w:1, o:31, a:1, s:1, b:0),
% 1.94/2.31 b [54, 0] (w:1, o:20, a:1, s:1, b:0),
% 1.94/2.31 pA [55, 0] (w:1, o:21, a:1, s:1, b:0),
% 1.94/2.31 pB [56, 0] (w:1, o:22, a:1, s:1, b:0),
% 1.94/2.31 pE [57, 0] (w:1, o:23, a:1, s:1, b:0),
% 1.94/2.31 c2 [58, 2] (w:1, o:61, a:1, s:1, b:0),
% 1.94/2.31 linC [59, 1] (w:1, o:32, a:1, s:1, b:0),
% 1.94/2.31 unambig [61, 2] (w:1, o:62, a:1, s:1, b:0),
% 1.94/2.31 eq [62, 2] (w:1, o:63, a:1, s:1, b:0),
% 1.94/2.31 eq4 [63, 2] (w:1, o:65, a:1, s:1, b:0),
% 1.94/2.31 eq2 [64, 2] (w:1, o:66, a:1, s:1, b:0),
% 1.94/2.31 eq3 [65, 2] (w:1, o:64, a:1, s:1, b:0),
% 1.94/2.31 eq5 [66, 2] (w:1, o:67, a:1, s:1, b:0).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Starting Search:
% 1.94/2.31
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31 Failed to find proof!
% 1.94/2.31 maxweight = 15
% 1.94/2.31 maxnrclauses = 10000000
% 1.94/2.31 Generated: 16597
% 1.94/2.31 Kept: 1312
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 The strategy used was not complete!
% 1.94/2.31
% 1.94/2.31 Increased maxweight to 16
% 1.94/2.31
% 1.94/2.31 Starting Search:
% 1.94/2.31
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Intermediate Status:
% 1.94/2.31 Generated: 17284
% 1.94/2.31 Kept: 2001
% 1.94/2.31 Inuse: 1102
% 1.94/2.31 Deleted: 233
% 1.94/2.31 Deletedinuse: 4
% 1.94/2.31
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Intermediate Status:
% 1.94/2.31 Generated: 47584
% 1.94/2.31 Kept: 4002
% 1.94/2.31 Inuse: 2882
% 1.94/2.31 Deleted: 1308
% 1.94/2.31 Deletedinuse: 255
% 1.94/2.31
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31 Failed to find proof!
% 1.94/2.31 maxweight = 16
% 1.94/2.31 maxnrclauses = 10000000
% 1.94/2.31 Generated: 49052
% 1.94/2.31 Kept: 4086
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 The strategy used was not complete!
% 1.94/2.31
% 1.94/2.31 Increased maxweight to 17
% 1.94/2.31
% 1.94/2.31 Starting Search:
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Bliksems!, er is een bewijs:
% 1.94/2.31 % SZS status Unsatisfiable
% 1.94/2.31 % SZS output start Refutation
% 1.94/2.31
% 1.94/2.31 clause( 0, [ =( impl( btrue, X ), X ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 2, [ =( append( nil, X ), X ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 3, [ =( cons( X, append( Y, Z ) ), append( cons( X, Y ), Z ) ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 6, [ =( cons( a, nil ), linP( pA ) ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 8, [ =( linP( pE ), nil ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 9, [ =( append( linP( X ), linP( Y ) ), linC( c2( X, Y ) ) ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 10, [ =( impl( eq( linC( X ), linC( Y ) ), eq4( X, Y ) ), unambig(
% 1.94/2.31 X, Y ) ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 17, [ =( eq3( pE, pA ), bfalse ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 37, [ ~( =( eq3( X, Y ), bfalse ) ), =( eq4( c2( X, Z ), c2( Y, T )
% 1.94/2.31 ), bfalse ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 39, [ =( eq( X, X ), btrue ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 43, [ =( eq5( X, X ), btrue ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 48, [ ~( =( eq5( unambig( X, Y ), bfalse ), btrue ) ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 49, [ =( append( cons( Y, nil ), X ), cons( Y, X ) ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 53, [ =( linC( c2( pE, X ) ), linP( X ) ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 63, [ =( impl( eq( linP( X ), linC( Y ) ), eq4( c2( pE, X ), Y ) )
% 1.94/2.31 , unambig( c2( pE, X ), Y ) ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 65, [ =( append( linP( pA ), X ), cons( a, X ) ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 68, [ =( cons( a, linP( X ) ), linC( c2( pA, X ) ) ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 90, [ =( eq4( c2( pE, X ), c2( pA, Y ) ), bfalse ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 154, [ =( linC( c2( pA, pE ) ), linP( pA ) ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 168, [ =( unambig( c2( pE, X ), c2( pA, pE ) ), impl( eq( linP( X )
% 1.94/2.31 , linP( pA ) ), bfalse ) ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 474, [ ~( =( eq5( impl( eq( linP( X ), linP( pA ) ), bfalse ),
% 1.94/2.31 bfalse ), btrue ) ) ] )
% 1.94/2.31 .
% 1.94/2.31 clause( 475, [] )
% 1.94/2.31 .
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 % SZS output end Refutation
% 1.94/2.31 found a proof!
% 1.94/2.31
% 1.94/2.31 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.94/2.31
% 1.94/2.31 initialclauses(
% 1.94/2.31 [ clause( 477, [ =( impl( btrue, X ), X ) ] )
% 1.94/2.31 , clause( 478, [ =( impl( bfalse, X ), btrue ) ] )
% 1.94/2.31 , clause( 479, [ =( append( nil, X ), X ) ] )
% 1.94/2.31 , clause( 480, [ =( append( cons( X, Y ), Z ), cons( X, append( Y, Z ) ) )
% 1.94/2.31 ] )
% 1.94/2.31 , clause( 481, [ =( linP( aP( X ) ), append( cons( a, nil ), append( linP(
% 1.94/2.31 X ), cons( a, nil ) ) ) ) ] )
% 1.94/2.31 , clause( 482, [ =( linP( bP( X ) ), append( cons( b, nil ), append( linP(
% 1.94/2.31 X ), cons( b, nil ) ) ) ) ] )
% 1.94/2.31 , clause( 483, [ =( linP( pA ), cons( a, nil ) ) ] )
% 1.94/2.31 , clause( 484, [ =( linP( pB ), cons( b, nil ) ) ] )
% 1.94/2.31 , clause( 485, [ =( linP( pE ), nil ) ] )
% 1.94/2.31 , clause( 486, [ =( linC( c2( X, Y ) ), append( linP( X ), linP( Y ) ) ) ]
% 1.94/2.31 )
% 1.94/2.31 , clause( 487, [ =( unambig( X, Y ), impl( eq( linC( X ), linC( Y ) ), eq4(
% 1.94/2.31 X, Y ) ) ) ] )
% 1.94/2.31 , clause( 488, [ =( eq2( a, b ), bfalse ) ] )
% 1.94/2.31 , clause( 489, [ =( eq2( b, a ), bfalse ) ] )
% 1.94/2.31 , clause( 490, [ =( eq3( pA, pB ), bfalse ) ] )
% 1.94/2.31 , clause( 491, [ =( eq3( pA, pE ), bfalse ) ] )
% 1.94/2.31 , clause( 492, [ =( eq3( pB, pA ), bfalse ) ] )
% 1.94/2.31 , clause( 493, [ =( eq3( pB, pE ), bfalse ) ] )
% 1.94/2.31 , clause( 494, [ =( eq3( pE, pA ), bfalse ) ] )
% 1.94/2.31 , clause( 495, [ =( eq3( pE, pB ), bfalse ) ] )
% 1.94/2.31 , clause( 496, [ =( eq5( bfalse, btrue ), bfalse ) ] )
% 1.94/2.31 , clause( 497, [ =( eq5( btrue, bfalse ), bfalse ) ] )
% 1.94/2.31 , clause( 498, [ =( eq3( aP( X ), aP( Y ) ), eq3( X, Y ) ) ] )
% 1.94/2.31 , clause( 499, [ =( eq3( bP( X ), bP( Y ) ), eq3( X, Y ) ) ] )
% 1.94/2.31 , clause( 500, [ =( eq3( aP( X ), bP( Y ) ), bfalse ) ] )
% 1.94/2.31 , clause( 501, [ =( eq3( aP( X ), pA ), bfalse ) ] )
% 1.94/2.31 , clause( 502, [ =( eq3( aP( X ), pB ), bfalse ) ] )
% 1.94/2.31 , clause( 503, [ =( eq3( aP( X ), pE ), bfalse ) ] )
% 1.94/2.31 , clause( 504, [ =( eq3( bP( X ), aP( Y ) ), bfalse ) ] )
% 1.94/2.31 , clause( 505, [ =( eq3( bP( X ), pA ), bfalse ) ] )
% 1.94/2.31 , clause( 506, [ =( eq3( bP( X ), pB ), bfalse ) ] )
% 1.94/2.31 , clause( 507, [ =( eq3( bP( X ), pE ), bfalse ) ] )
% 1.94/2.31 , clause( 508, [ =( eq3( pA, aP( X ) ), bfalse ) ] )
% 1.94/2.31 , clause( 509, [ =( eq3( pA, bP( X ) ), bfalse ) ] )
% 1.94/2.31 , clause( 510, [ =( eq3( pB, aP( X ) ), bfalse ) ] )
% 1.94/2.31 , clause( 511, [ =( eq3( pB, bP( X ) ), bfalse ) ] )
% 1.94/2.31 , clause( 512, [ =( eq3( pE, aP( X ) ), bfalse ) ] )
% 1.94/2.31 , clause( 513, [ =( eq3( pE, bP( X ) ), bfalse ) ] )
% 1.94/2.31 , clause( 514, [ ~( =( eq3( X, Y ), bfalse ) ), =( eq4( c2( X, Z ), c2( Y,
% 1.94/2.31 T ) ), bfalse ) ] )
% 1.94/2.31 , clause( 515, [ ~( =( eq3( X, Y ), btrue ) ), =( eq4( c2( X, Z ), c2( Y, T
% 1.94/2.31 ) ), eq3( Z, T ) ) ] )
% 1.94/2.31 , clause( 516, [ =( eq( X, X ), btrue ) ] )
% 1.94/2.31 , clause( 517, [ =( eq2( X, X ), btrue ) ] )
% 1.94/2.31 , clause( 518, [ =( eq3( X, X ), btrue ) ] )
% 1.94/2.31 , clause( 519, [ =( eq4( X, X ), btrue ) ] )
% 1.94/2.31 , clause( 520, [ =( eq5( X, X ), btrue ) ] )
% 1.94/2.31 , clause( 521, [ ~( =( eq2( X, Y ), bfalse ) ), =( eq( cons( X, Z ), cons(
% 1.94/2.31 Y, T ) ), bfalse ) ] )
% 1.94/2.31 , clause( 522, [ ~( =( eq2( X, Y ), btrue ) ), =( eq( cons( X, Z ), cons( Y
% 1.94/2.31 , T ) ), eq( Z, T ) ) ] )
% 1.94/2.31 , clause( 523, [ =( eq( nil, cons( X, Y ) ), bfalse ) ] )
% 1.94/2.31 , clause( 524, [ =( eq( cons( X, Y ), nil ), bfalse ) ] )
% 1.94/2.31 , clause( 525, [ ~( =( eq5( unambig( X, Y ), bfalse ), btrue ) ) ] )
% 1.94/2.31 ] ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 0, [ =( impl( btrue, X ), X ) ] )
% 1.94/2.31 , clause( 477, [ =( impl( btrue, X ), X ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 2, [ =( append( nil, X ), X ) ] )
% 1.94/2.31 , clause( 479, [ =( append( nil, X ), X ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 533, [ =( cons( X, append( Y, Z ) ), append( cons( X, Y ), Z ) ) ]
% 1.94/2.31 )
% 1.94/2.31 , clause( 480, [ =( append( cons( X, Y ), Z ), cons( X, append( Y, Z ) ) )
% 1.94/2.31 ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 3, [ =( cons( X, append( Y, Z ) ), append( cons( X, Y ), Z ) ) ] )
% 1.94/2.31 , clause( 533, [ =( cons( X, append( Y, Z ) ), append( cons( X, Y ), Z ) )
% 1.94/2.31 ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.94/2.31 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 540, [ =( cons( a, nil ), linP( pA ) ) ] )
% 1.94/2.31 , clause( 483, [ =( linP( pA ), cons( a, nil ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 6, [ =( cons( a, nil ), linP( pA ) ) ] )
% 1.94/2.31 , clause( 540, [ =( cons( a, nil ), linP( pA ) ) ] )
% 1.94/2.31 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 8, [ =( linP( pE ), nil ) ] )
% 1.94/2.31 , clause( 485, [ =( linP( pE ), nil ) ] )
% 1.94/2.31 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 559, [ =( append( linP( X ), linP( Y ) ), linC( c2( X, Y ) ) ) ] )
% 1.94/2.31 , clause( 486, [ =( linC( c2( X, Y ) ), append( linP( X ), linP( Y ) ) ) ]
% 1.94/2.31 )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 9, [ =( append( linP( X ), linP( Y ) ), linC( c2( X, Y ) ) ) ] )
% 1.94/2.31 , clause( 559, [ =( append( linP( X ), linP( Y ) ), linC( c2( X, Y ) ) ) ]
% 1.94/2.31 )
% 1.94/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.94/2.31 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 570, [ =( impl( eq( linC( X ), linC( Y ) ), eq4( X, Y ) ), unambig(
% 1.94/2.31 X, Y ) ) ] )
% 1.94/2.31 , clause( 487, [ =( unambig( X, Y ), impl( eq( linC( X ), linC( Y ) ), eq4(
% 1.94/2.31 X, Y ) ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 10, [ =( impl( eq( linC( X ), linC( Y ) ), eq4( X, Y ) ), unambig(
% 1.94/2.31 X, Y ) ) ] )
% 1.94/2.31 , clause( 570, [ =( impl( eq( linC( X ), linC( Y ) ), eq4( X, Y ) ),
% 1.94/2.31 unambig( X, Y ) ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.94/2.31 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 17, [ =( eq3( pE, pA ), bfalse ) ] )
% 1.94/2.31 , clause( 494, [ =( eq3( pE, pA ), bfalse ) ] )
% 1.94/2.31 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 37, [ ~( =( eq3( X, Y ), bfalse ) ), =( eq4( c2( X, Z ), c2( Y, T )
% 1.94/2.31 ), bfalse ) ] )
% 1.94/2.31 , clause( 514, [ ~( =( eq3( X, Y ), bfalse ) ), =( eq4( c2( X, Z ), c2( Y,
% 1.94/2.31 T ) ), bfalse ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.94/2.31 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 39, [ =( eq( X, X ), btrue ) ] )
% 1.94/2.31 , clause( 516, [ =( eq( X, X ), btrue ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 43, [ =( eq5( X, X ), btrue ) ] )
% 1.94/2.31 , clause( 520, [ =( eq5( X, X ), btrue ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 48, [ ~( =( eq5( unambig( X, Y ), bfalse ), btrue ) ) ] )
% 1.94/2.31 , clause( 525, [ ~( =( eq5( unambig( X, Y ), bfalse ), btrue ) ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.94/2.31 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 779, [ =( append( cons( X, Y ), Z ), cons( X, append( Y, Z ) ) ) ]
% 1.94/2.31 )
% 1.94/2.31 , clause( 3, [ =( cons( X, append( Y, Z ) ), append( cons( X, Y ), Z ) ) ]
% 1.94/2.31 )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 780, [ =( append( cons( X, nil ), Y ), cons( X, Y ) ) ] )
% 1.94/2.31 , clause( 2, [ =( append( nil, X ), X ) ] )
% 1.94/2.31 , 0, clause( 779, [ =( append( cons( X, Y ), Z ), cons( X, append( Y, Z ) )
% 1.94/2.31 ) ] )
% 1.94/2.31 , 0, 8, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X ),
% 1.94/2.31 :=( Y, nil ), :=( Z, Y )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 49, [ =( append( cons( Y, nil ), X ), cons( Y, X ) ) ] )
% 1.94/2.31 , clause( 780, [ =( append( cons( X, nil ), Y ), cons( X, Y ) ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 1.94/2.31 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 783, [ =( linC( c2( X, Y ) ), append( linP( X ), linP( Y ) ) ) ] )
% 1.94/2.31 , clause( 9, [ =( append( linP( X ), linP( Y ) ), linC( c2( X, Y ) ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 785, [ =( linC( c2( pE, X ) ), append( nil, linP( X ) ) ) ] )
% 1.94/2.31 , clause( 8, [ =( linP( pE ), nil ) ] )
% 1.94/2.31 , 0, clause( 783, [ =( linC( c2( X, Y ) ), append( linP( X ), linP( Y ) ) )
% 1.94/2.31 ] )
% 1.94/2.31 , 0, 6, substitution( 0, [] ), substitution( 1, [ :=( X, pE ), :=( Y, X )] )
% 1.94/2.31 ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 787, [ =( linC( c2( pE, X ) ), linP( X ) ) ] )
% 1.94/2.31 , clause( 2, [ =( append( nil, X ), X ) ] )
% 1.94/2.31 , 0, clause( 785, [ =( linC( c2( pE, X ) ), append( nil, linP( X ) ) ) ] )
% 1.94/2.31 , 0, 5, substitution( 0, [ :=( X, linP( X ) )] ), substitution( 1, [ :=( X
% 1.94/2.31 , X )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 53, [ =( linC( c2( pE, X ) ), linP( X ) ) ] )
% 1.94/2.31 , clause( 787, [ =( linC( c2( pE, X ) ), linP( X ) ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 790, [ =( unambig( X, Y ), impl( eq( linC( X ), linC( Y ) ), eq4( X
% 1.94/2.31 , Y ) ) ) ] )
% 1.94/2.31 , clause( 10, [ =( impl( eq( linC( X ), linC( Y ) ), eq4( X, Y ) ), unambig(
% 1.94/2.31 X, Y ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 791, [ =( unambig( c2( pE, X ), Y ), impl( eq( linP( X ), linC( Y )
% 1.94/2.31 ), eq4( c2( pE, X ), Y ) ) ) ] )
% 1.94/2.31 , clause( 53, [ =( linC( c2( pE, X ) ), linP( X ) ) ] )
% 1.94/2.31 , 0, clause( 790, [ =( unambig( X, Y ), impl( eq( linC( X ), linC( Y ) ),
% 1.94/2.31 eq4( X, Y ) ) ) ] )
% 1.94/2.31 , 0, 8, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, c2( pE
% 1.94/2.31 , X ) ), :=( Y, Y )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 793, [ =( impl( eq( linP( X ), linC( Y ) ), eq4( c2( pE, X ), Y ) )
% 1.94/2.31 , unambig( c2( pE, X ), Y ) ) ] )
% 1.94/2.31 , clause( 791, [ =( unambig( c2( pE, X ), Y ), impl( eq( linP( X ), linC( Y
% 1.94/2.31 ) ), eq4( c2( pE, X ), Y ) ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 63, [ =( impl( eq( linP( X ), linC( Y ) ), eq4( c2( pE, X ), Y ) )
% 1.94/2.31 , unambig( c2( pE, X ), Y ) ) ] )
% 1.94/2.31 , clause( 793, [ =( impl( eq( linP( X ), linC( Y ) ), eq4( c2( pE, X ), Y )
% 1.94/2.31 ), unambig( c2( pE, X ), Y ) ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.94/2.31 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 796, [ =( cons( X, Y ), append( cons( X, nil ), Y ) ) ] )
% 1.94/2.31 , clause( 49, [ =( append( cons( Y, nil ), X ), cons( Y, X ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 799, [ =( cons( a, X ), append( linP( pA ), X ) ) ] )
% 1.94/2.31 , clause( 6, [ =( cons( a, nil ), linP( pA ) ) ] )
% 1.94/2.31 , 0, clause( 796, [ =( cons( X, Y ), append( cons( X, nil ), Y ) ) ] )
% 1.94/2.31 , 0, 5, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, X )] )
% 1.94/2.31 ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 804, [ =( append( linP( pA ), X ), cons( a, X ) ) ] )
% 1.94/2.31 , clause( 799, [ =( cons( a, X ), append( linP( pA ), X ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 65, [ =( append( linP( pA ), X ), cons( a, X ) ) ] )
% 1.94/2.31 , clause( 804, [ =( append( linP( pA ), X ), cons( a, X ) ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 805, [ =( cons( a, X ), append( linP( pA ), X ) ) ] )
% 1.94/2.31 , clause( 65, [ =( append( linP( pA ), X ), cons( a, X ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 807, [ =( cons( a, linP( X ) ), linC( c2( pA, X ) ) ) ] )
% 1.94/2.31 , clause( 9, [ =( append( linP( X ), linP( Y ) ), linC( c2( X, Y ) ) ) ] )
% 1.94/2.31 , 0, clause( 805, [ =( cons( a, X ), append( linP( pA ), X ) ) ] )
% 1.94/2.31 , 0, 5, substitution( 0, [ :=( X, pA ), :=( Y, X )] ), substitution( 1, [
% 1.94/2.31 :=( X, linP( X ) )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 68, [ =( cons( a, linP( X ) ), linC( c2( pA, X ) ) ) ] )
% 1.94/2.31 , clause( 807, [ =( cons( a, linP( X ) ), linC( c2( pA, X ) ) ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 809, [ ~( =( bfalse, eq3( X, Y ) ) ), =( eq4( c2( X, Z ), c2( Y, T
% 1.94/2.31 ) ), bfalse ) ] )
% 1.94/2.31 , clause( 37, [ ~( =( eq3( X, Y ), bfalse ) ), =( eq4( c2( X, Z ), c2( Y, T
% 1.94/2.31 ) ), bfalse ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 1.94/2.31 ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 812, [ =( bfalse, eq3( pE, pA ) ) ] )
% 1.94/2.31 , clause( 17, [ =( eq3( pE, pA ), bfalse ) ] )
% 1.94/2.31 , 0, substitution( 0, [] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 resolution(
% 1.94/2.31 clause( 813, [ =( eq4( c2( pE, X ), c2( pA, Y ) ), bfalse ) ] )
% 1.94/2.31 , clause( 809, [ ~( =( bfalse, eq3( X, Y ) ) ), =( eq4( c2( X, Z ), c2( Y,
% 1.94/2.31 T ) ), bfalse ) ] )
% 1.94/2.31 , 0, clause( 812, [ =( bfalse, eq3( pE, pA ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, pE ), :=( Y, pA ), :=( Z, X ), :=( T, Y )] )
% 1.94/2.31 , substitution( 1, [] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 90, [ =( eq4( c2( pE, X ), c2( pA, Y ) ), bfalse ) ] )
% 1.94/2.31 , clause( 813, [ =( eq4( c2( pE, X ), c2( pA, Y ) ), bfalse ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.94/2.31 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 816, [ =( linC( c2( pA, X ) ), cons( a, linP( X ) ) ) ] )
% 1.94/2.31 , clause( 68, [ =( cons( a, linP( X ) ), linC( c2( pA, X ) ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 818, [ =( linC( c2( pA, pE ) ), cons( a, nil ) ) ] )
% 1.94/2.31 , clause( 8, [ =( linP( pE ), nil ) ] )
% 1.94/2.31 , 0, clause( 816, [ =( linC( c2( pA, X ) ), cons( a, linP( X ) ) ) ] )
% 1.94/2.31 , 0, 7, substitution( 0, [] ), substitution( 1, [ :=( X, pE )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 819, [ =( linC( c2( pA, pE ) ), linP( pA ) ) ] )
% 1.94/2.31 , clause( 6, [ =( cons( a, nil ), linP( pA ) ) ] )
% 1.94/2.31 , 0, clause( 818, [ =( linC( c2( pA, pE ) ), cons( a, nil ) ) ] )
% 1.94/2.31 , 0, 5, substitution( 0, [] ), substitution( 1, [] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 154, [ =( linC( c2( pA, pE ) ), linP( pA ) ) ] )
% 1.94/2.31 , clause( 819, [ =( linC( c2( pA, pE ) ), linP( pA ) ) ] )
% 1.94/2.31 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 822, [ =( unambig( c2( pE, X ), Y ), impl( eq( linP( X ), linC( Y )
% 1.94/2.31 ), eq4( c2( pE, X ), Y ) ) ) ] )
% 1.94/2.31 , clause( 63, [ =( impl( eq( linP( X ), linC( Y ) ), eq4( c2( pE, X ), Y )
% 1.94/2.31 ), unambig( c2( pE, X ), Y ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 824, [ =( unambig( c2( pE, X ), c2( pA, pE ) ), impl( eq( linP( X )
% 1.94/2.31 , linP( pA ) ), eq4( c2( pE, X ), c2( pA, pE ) ) ) ) ] )
% 1.94/2.31 , clause( 154, [ =( linC( c2( pA, pE ) ), linP( pA ) ) ] )
% 1.94/2.31 , 0, clause( 822, [ =( unambig( c2( pE, X ), Y ), impl( eq( linP( X ), linC(
% 1.94/2.31 Y ) ), eq4( c2( pE, X ), Y ) ) ) ] )
% 1.94/2.31 , 0, 12, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, c2(
% 1.94/2.31 pA, pE ) )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 825, [ =( unambig( c2( pE, X ), c2( pA, pE ) ), impl( eq( linP( X )
% 1.94/2.31 , linP( pA ) ), bfalse ) ) ] )
% 1.94/2.31 , clause( 90, [ =( eq4( c2( pE, X ), c2( pA, Y ) ), bfalse ) ] )
% 1.94/2.31 , 0, clause( 824, [ =( unambig( c2( pE, X ), c2( pA, pE ) ), impl( eq( linP(
% 1.94/2.31 X ), linP( pA ) ), eq4( c2( pE, X ), c2( pA, pE ) ) ) ) ] )
% 1.94/2.31 , 0, 14, substitution( 0, [ :=( X, X ), :=( Y, pE )] ), substitution( 1, [
% 1.94/2.31 :=( X, X )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 168, [ =( unambig( c2( pE, X ), c2( pA, pE ) ), impl( eq( linP( X )
% 1.94/2.31 , linP( pA ) ), bfalse ) ) ] )
% 1.94/2.31 , clause( 825, [ =( unambig( c2( pE, X ), c2( pA, pE ) ), impl( eq( linP( X
% 1.94/2.31 ), linP( pA ) ), bfalse ) ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 828, [ ~( =( btrue, eq5( unambig( X, Y ), bfalse ) ) ) ] )
% 1.94/2.31 , clause( 48, [ ~( =( eq5( unambig( X, Y ), bfalse ), btrue ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 829, [ ~( =( btrue, eq5( impl( eq( linP( X ), linP( pA ) ), bfalse
% 1.94/2.31 ), bfalse ) ) ) ] )
% 1.94/2.31 , clause( 168, [ =( unambig( c2( pE, X ), c2( pA, pE ) ), impl( eq( linP( X
% 1.94/2.31 ), linP( pA ) ), bfalse ) ) ] )
% 1.94/2.31 , 0, clause( 828, [ ~( =( btrue, eq5( unambig( X, Y ), bfalse ) ) ) ] )
% 1.94/2.31 , 0, 4, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, c2( pE
% 1.94/2.31 , X ) ), :=( Y, c2( pA, pE ) )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 830, [ ~( =( eq5( impl( eq( linP( X ), linP( pA ) ), bfalse ),
% 1.94/2.31 bfalse ), btrue ) ) ] )
% 1.94/2.31 , clause( 829, [ ~( =( btrue, eq5( impl( eq( linP( X ), linP( pA ) ),
% 1.94/2.31 bfalse ), bfalse ) ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 474, [ ~( =( eq5( impl( eq( linP( X ), linP( pA ) ), bfalse ),
% 1.94/2.31 bfalse ), btrue ) ) ] )
% 1.94/2.31 , clause( 830, [ ~( =( eq5( impl( eq( linP( X ), linP( pA ) ), bfalse ),
% 1.94/2.31 bfalse ), btrue ) ) ] )
% 1.94/2.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqswap(
% 1.94/2.31 clause( 832, [ ~( =( btrue, eq5( impl( eq( linP( X ), linP( pA ) ), bfalse
% 1.94/2.31 ), bfalse ) ) ) ] )
% 1.94/2.31 , clause( 474, [ ~( =( eq5( impl( eq( linP( X ), linP( pA ) ), bfalse ),
% 1.94/2.31 bfalse ), btrue ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [ :=( X, X )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 835, [ ~( =( btrue, eq5( impl( btrue, bfalse ), bfalse ) ) ) ] )
% 1.94/2.31 , clause( 39, [ =( eq( X, X ), btrue ) ] )
% 1.94/2.31 , 0, clause( 832, [ ~( =( btrue, eq5( impl( eq( linP( X ), linP( pA ) ),
% 1.94/2.31 bfalse ), bfalse ) ) ) ] )
% 1.94/2.31 , 0, 5, substitution( 0, [ :=( X, linP( pA ) )] ), substitution( 1, [ :=( X
% 1.94/2.31 , pA )] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 836, [ ~( =( btrue, eq5( bfalse, bfalse ) ) ) ] )
% 1.94/2.31 , clause( 0, [ =( impl( btrue, X ), X ) ] )
% 1.94/2.31 , 0, clause( 835, [ ~( =( btrue, eq5( impl( btrue, bfalse ), bfalse ) ) ) ]
% 1.94/2.31 )
% 1.94/2.31 , 0, 4, substitution( 0, [ :=( X, bfalse )] ), substitution( 1, [] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 paramod(
% 1.94/2.31 clause( 837, [ ~( =( btrue, btrue ) ) ] )
% 1.94/2.31 , clause( 43, [ =( eq5( X, X ), btrue ) ] )
% 1.94/2.31 , 0, clause( 836, [ ~( =( btrue, eq5( bfalse, bfalse ) ) ) ] )
% 1.94/2.31 , 0, 3, substitution( 0, [ :=( X, bfalse )] ), substitution( 1, [] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 eqrefl(
% 1.94/2.31 clause( 838, [] )
% 1.94/2.31 , clause( 837, [ ~( =( btrue, btrue ) ) ] )
% 1.94/2.31 , 0, substitution( 0, [] )).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 subsumption(
% 1.94/2.31 clause( 475, [] )
% 1.94/2.31 , clause( 838, [] )
% 1.94/2.31 , substitution( 0, [] ), permutation( 0, [] ) ).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 end.
% 1.94/2.31
% 1.94/2.31 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.94/2.31
% 1.94/2.31 Memory use:
% 1.94/2.31
% 1.94/2.31 space for terms: 6437
% 1.94/2.31 space for clauses: 46948
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 clauses generated: 2895
% 1.94/2.31 clauses kept: 476
% 1.94/2.31 clauses selected: 287
% 1.94/2.31 clauses deleted: 20
% 1.94/2.31 clauses inuse deleted: 0
% 1.94/2.31
% 1.94/2.31 subsentry: 2353
% 1.94/2.31 literals s-matched: 1330
% 1.94/2.31 literals matched: 1330
% 1.94/2.31 full subsumption: 1
% 1.94/2.31
% 1.94/2.31 checksum: -868966920
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Bliksem ended
%------------------------------------------------------------------------------