TSTP Solution File: SWC255-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWC255-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n012.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 Jul 19 19:35:14 EDT 2022
% Result : Unsatisfiable 0.75s 1.13s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC255-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Sat Jun 11 19:52:26 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.75/1.12 *** allocated 10000 integers for termspace/termends
% 0.75/1.12 *** allocated 10000 integers for clauses
% 0.75/1.12 *** allocated 10000 integers for justifications
% 0.75/1.12 Bliksem 1.12
% 0.75/1.12
% 0.75/1.12
% 0.75/1.12 Automatic Strategy Selection
% 0.75/1.12
% 0.75/1.12 Clauses:
% 0.75/1.12 [
% 0.75/1.12 [ equalelemsP( nil ) ],
% 0.75/1.12 [ duplicatefreeP( nil ) ],
% 0.75/1.12 [ strictorderedP( nil ) ],
% 0.75/1.12 [ totalorderedP( nil ) ],
% 0.75/1.12 [ strictorderP( nil ) ],
% 0.75/1.12 [ totalorderP( nil ) ],
% 0.75/1.12 [ cyclefreeP( nil ) ],
% 0.75/1.12 [ ssList( nil ) ],
% 0.75/1.12 [ ssItem( skac3 ) ],
% 0.75/1.12 [ ssItem( skac2 ) ],
% 0.75/1.12 [ ~( singletonP( nil ) ) ],
% 0.75/1.12 [ ssItem( skaf83( X ) ) ],
% 0.75/1.12 [ ssList( skaf82( X ) ) ],
% 0.75/1.12 [ ssList( skaf81( X ) ) ],
% 0.75/1.12 [ ssList( skaf80( X ) ) ],
% 0.75/1.12 [ ssItem( skaf79( X ) ) ],
% 0.75/1.12 [ ssItem( skaf78( X ) ) ],
% 0.75/1.12 [ ssList( skaf77( X ) ) ],
% 0.75/1.12 [ ssList( skaf76( X ) ) ],
% 0.75/1.12 [ ssList( skaf75( X ) ) ],
% 0.75/1.12 [ ssItem( skaf74( X ) ) ],
% 0.75/1.12 [ ssList( skaf73( X ) ) ],
% 0.75/1.12 [ ssList( skaf72( X ) ) ],
% 0.75/1.12 [ ssList( skaf71( X ) ) ],
% 0.75/1.12 [ ssItem( skaf70( X ) ) ],
% 0.75/1.12 [ ssItem( skaf69( X ) ) ],
% 0.75/1.12 [ ssList( skaf68( X ) ) ],
% 0.75/1.12 [ ssList( skaf67( X ) ) ],
% 0.75/1.12 [ ssList( skaf66( X ) ) ],
% 0.75/1.12 [ ssItem( skaf65( X ) ) ],
% 0.75/1.12 [ ssItem( skaf64( X ) ) ],
% 0.75/1.12 [ ssList( skaf63( X ) ) ],
% 0.75/1.12 [ ssList( skaf62( X ) ) ],
% 0.75/1.12 [ ssList( skaf61( X ) ) ],
% 0.75/1.12 [ ssItem( skaf60( X ) ) ],
% 0.75/1.12 [ ssItem( skaf59( X ) ) ],
% 0.75/1.12 [ ssList( skaf58( X ) ) ],
% 0.75/1.12 [ ssList( skaf57( X ) ) ],
% 0.75/1.12 [ ssList( skaf56( X ) ) ],
% 0.75/1.12 [ ssItem( skaf55( X ) ) ],
% 0.75/1.12 [ ssItem( skaf54( X ) ) ],
% 0.75/1.12 [ ssList( skaf53( X ) ) ],
% 0.75/1.12 [ ssList( skaf52( X ) ) ],
% 0.75/1.12 [ ssList( skaf51( X ) ) ],
% 0.75/1.12 [ ssItem( skaf50( X ) ) ],
% 0.75/1.12 [ ssItem( skaf49( X ) ) ],
% 0.75/1.12 [ ssItem( skaf44( X ) ) ],
% 0.75/1.12 [ ssList( skaf48( X, Y ) ) ],
% 0.75/1.12 [ ssList( skaf47( X, Y ) ) ],
% 0.75/1.12 [ ssList( skaf46( X, Y ) ) ],
% 0.75/1.12 [ ssList( skaf45( X, Y ) ) ],
% 0.75/1.12 [ ssList( skaf43( X, Y ) ) ],
% 0.75/1.12 [ ssList( skaf42( X, Y ) ) ],
% 0.75/1.12 [ ~( =( skac3, skac2 ) ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), geq( X, X ) ],
% 0.75/1.12 [ ~( ssList( X ) ), segmentP( X, nil ) ],
% 0.75/1.12 [ ~( ssList( X ) ), segmentP( X, X ) ],
% 0.75/1.12 [ ~( ssList( X ) ), rearsegP( X, nil ) ],
% 0.75/1.12 [ ~( ssList( X ) ), rearsegP( X, X ) ],
% 0.75/1.12 [ ~( ssList( X ) ), frontsegP( X, nil ) ],
% 0.75/1.12 [ ~( ssList( X ) ), frontsegP( X, X ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), leq( X, X ) ],
% 0.75/1.12 [ ~( lt( X, X ) ), ~( ssItem( X ) ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), equalelemsP( cons( X, nil ) ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), strictorderedP( cons( X, nil ) ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), totalorderedP( cons( X, nil ) ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), strictorderP( cons( X, nil ) ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), totalorderP( cons( X, nil ) ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), cyclefreeP( cons( X, nil ) ) ],
% 0.75/1.12 [ ~( memberP( nil, X ) ), ~( ssItem( X ) ) ],
% 0.75/1.12 [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ],
% 0.75/1.12 [ ~( ssList( X ) ), =( app( X, nil ), X ) ],
% 0.75/1.12 [ ~( ssList( X ) ), =( app( nil, X ), X ) ],
% 0.75/1.12 [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ],
% 0.75/1.12 [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ],
% 0.75/1.12 [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ],
% 0.75/1.12 [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ],
% 0.75/1.12 [ ~( =( nil, X ) ), ~( ssList( X ) ), segmentP( nil, X ) ],
% 0.75/1.12 [ ~( segmentP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.75/1.12 [ ~( =( nil, X ) ), ~( ssList( X ) ), rearsegP( nil, X ) ],
% 0.75/1.12 [ ~( rearsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.75/1.12 [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X ) ],
% 0.75/1.12 [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.75/1.12 [ ~( ssList( X ) ), ~( ssList( Y ) ), ssList( app( Y, X ) ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), ~( ssList( Y ) ), ssList( cons( X, Y ) ) ],
% 0.75/1.12 [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf50( X ), skaf49( X ) ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf49( X ), skaf50( X ) ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( =( skaf79( X ), skaf78( X ) ) ), ~( ssList( X ) ), equalelemsP( X )
% 0.75/1.12 ],
% 0.75/1.12 [ ~( lt( skaf69( X ), skaf70( X ) ) ), ~( ssList( X ) ), strictorderedP(
% 0.75/1.12 X ) ],
% 0.75/1.12 [ ~( leq( skaf64( X ), skaf65( X ) ) ), ~( ssList( X ) ), totalorderedP(
% 0.75/1.12 X ) ],
% 0.75/1.12 [ ~( lt( skaf60( X ), skaf59( X ) ) ), ~( ssList( X ) ), strictorderP( X
% 0.75/1.12 ) ],
% 0.75/1.12 [ ~( lt( skaf59( X ), skaf60( X ) ) ), ~( ssList( X ) ), strictorderP( X
% 0.75/1.12 ) ],
% 0.75/1.12 [ ~( leq( skaf55( X ), skaf54( X ) ) ), ~( ssList( X ) ), totalorderP( X
% 0.75/1.12 ) ],
% 0.75/1.12 [ ~( leq( skaf54( X ), skaf55( X ) ) ), ~( ssList( X ) ), totalorderP( X
% 0.75/1.12 ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( tl( cons( X, Y ) ), Y ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( hd( cons( X, Y ) ), X ) ],
% 0.75/1.12 [ ~( =( cons( X, Y ), nil ) ), ~( ssItem( X ) ), ~( ssList( Y ) ) ],
% 0.75/1.12 [ ~( =( cons( X, Y ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y ) ) ],
% 0.75/1.12 [ ~( ssList( X ) ), ~( ssList( Y ) ), neq( Y, X ), =( Y, X ) ],
% 0.75/1.12 [ ~( singletonP( X ) ), ~( ssList( X ) ), =( cons( skaf44( X ), nil ), X
% 0.75/1.12 ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X ) ],
% 0.75/1.12 [ ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( X, Y ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( ssList( X ) ), =( cons( hd( X ), tl( X ) ), X ), =( nil, X ) ],
% 0.75/1.12 [ ~( gt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( Y, X ) ],
% 0.75/1.12 [ ~( lt( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), gt( Y, X ) ],
% 0.75/1.12 [ ~( geq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( Y, X ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( leq( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), geq( Y, X ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( ssList( X ) ), =( cons( skaf83( X ), skaf82( X ) ), X ), =( nil, X
% 0.75/1.12 ) ],
% 0.75/1.12 [ ~( gt( X, Y ) ), ~( gt( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( =( X, Y ) ), ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), strictorderedP(
% 0.75/1.12 cons( Y, X ) ) ],
% 0.75/1.12 [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), totalorderedP(
% 0.75/1.12 cons( Y, X ) ) ],
% 0.75/1.12 [ ~( lt( X, Y ) ), ~( lt( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y ) ),
% 0.75/1.12 singletonP( Y ) ],
% 0.75/1.12 [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( nil
% 0.75/1.12 , X ) ],
% 0.75/1.12 [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( nil
% 0.75/1.12 , Y ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( app( cons( X, nil ), Y ), cons(
% 0.75/1.12 X, Y ) ) ],
% 0.75/1.12 [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Y ), =( X
% 0.75/1.12 , Y ) ],
% 0.75/1.12 [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Y ), =( X
% 0.75/1.12 , Y ) ],
% 0.75/1.12 [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( hd( app( Y, X ) )
% 0.75/1.12 , hd( Y ) ) ],
% 0.75/1.12 [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X )
% 0.75/1.12 ), strictorderedP( Y ), =( nil, Y ) ],
% 0.75/1.12 [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X ) )
% 0.75/1.12 , totalorderedP( Y ), =( nil, Y ) ],
% 0.75/1.12 [ ~( geq( X, Y ) ), ~( geq( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) )
% 0.75/1.12 , =( Y, X ) ],
% 0.75/1.12 [ ~( segmentP( X, Y ) ), ~( segmentP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.75/1.12 ssList( Y ) ), =( Y, X ) ],
% 0.75/1.12 [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.75/1.12 ssList( Y ) ), =( Y, X ) ],
% 0.75/1.12 [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.75/1.12 ssList( Y ) ), =( Y, X ) ],
% 0.75/1.12 [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) )
% 0.75/1.12 , =( Y, X ) ],
% 0.75/1.12 [ ~( rearsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app(
% 0.75/1.12 skaf46( X, Y ), Y ), X ) ],
% 0.75/1.12 [ ~( frontsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app( Y
% 0.75/1.12 , skaf45( X, Y ) ), X ) ],
% 0.75/1.12 [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( tl( app( Y, X ) )
% 0.75/1.12 , app( tl( Y ), X ) ) ],
% 0.75/1.12 [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X )
% 0.75/1.12 ), lt( X, hd( Y ) ), =( nil, Y ) ],
% 0.75/1.12 [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X ) )
% 0.75/1.12 , leq( X, hd( Y ) ), =( nil, Y ) ],
% 0.75/1.12 [ ~( rearsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ), ~( ssList(
% 0.75/1.12 X ) ), rearsegP( app( Z, X ), Y ) ],
% 0.75/1.12 [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ), ~( ssList(
% 0.75/1.12 X ) ), frontsegP( app( X, Z ), Y ) ],
% 0.75/1.12 [ ~( =( X, Y ) ), ~( ssList( Z ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ),
% 0.75/1.12 memberP( cons( Y, Z ), X ) ],
% 0.75/1.12 [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y
% 0.75/1.12 ) ), memberP( cons( Z, X ), Y ) ],
% 0.75/1.12 [ ~( memberP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y
% 0.75/1.12 ) ), memberP( app( X, Z ), Y ) ],
% 0.75/1.12 [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssList( Z ) ), ~( ssItem( Y
% 0.75/1.12 ) ), memberP( app( Z, X ), Y ) ],
% 0.75/1.12 [ ~( ssList( X ) ), equalelemsP( X ), =( app( skaf80( X ), cons( skaf78(
% 0.75/1.12 X ), cons( skaf79( X ), skaf81( X ) ) ) ), X ) ],
% 0.75/1.12 [ ~( =( app( X, Y ), Z ) ), ~( ssList( X ) ), ~( ssList( Y ) ), ~(
% 0.75/1.12 ssList( Z ) ), rearsegP( Z, Y ) ],
% 0.75/1.12 [ ~( =( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), ~(
% 0.75/1.12 ssList( Z ) ), frontsegP( Z, X ) ],
% 0.75/1.12 [ ~( =( nil, X ) ), ~( =( nil, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.75/1.12 , =( app( X, Y ), nil ) ],
% 0.75/1.12 [ ~( gt( X, Y ) ), ~( gt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ),
% 0.75/1.12 ~( ssItem( X ) ), gt( X, Z ) ],
% 0.75/1.12 [ ~( leq( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.75/1.12 , ~( ssItem( X ) ), lt( X, Z ) ],
% 0.75/1.12 [ ~( geq( X, Y ) ), ~( geq( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.75/1.12 , ~( ssItem( X ) ), geq( X, Z ) ],
% 0.75/1.12 [ ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =( app( app( Z,
% 0.75/1.12 Y ), X ), app( Z, app( Y, X ) ) ) ],
% 0.75/1.12 [ ~( =( app( X, Y ), app( X, Z ) ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.75/1.12 , ~( ssList( Z ) ), =( Y, Z ) ],
% 0.75/1.12 [ ~( =( app( X, Y ), app( Z, Y ) ) ), ~( ssList( X ) ), ~( ssList( Y ) )
% 0.75/1.12 , ~( ssList( Z ) ), =( X, Z ) ],
% 0.75/1.12 [ ~( segmentP( X, Y ) ), ~( segmentP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.75/1.12 ssList( Y ) ), ~( ssList( X ) ), segmentP( X, Z ) ],
% 0.75/1.12 [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.75/1.12 ssList( Y ) ), ~( ssList( X ) ), rearsegP( X, Z ) ],
% 0.75/1.12 [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.75/1.12 ssList( Y ) ), ~( ssList( X ) ), frontsegP( X, Z ) ],
% 0.75/1.12 [ ~( lt( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ),
% 0.75/1.12 ~( ssItem( X ) ), lt( X, Z ) ],
% 0.75/1.12 [ ~( leq( X, Y ) ), ~( leq( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.75/1.12 , ~( ssItem( X ) ), leq( X, Z ) ],
% 0.75/1.12 [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =( cons( X, app(
% 0.75/1.12 Y, Z ) ), app( cons( X, Y ), Z ) ) ],
% 0.75/1.12 [ ~( memberP( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ),
% 0.75/1.12 ~( ssItem( Z ) ), memberP( Y, Z ), memberP( X, Z ) ],
% 0.75/1.12 [ ~( leq( X, hd( Y ) ) ), ~( totalorderedP( Y ) ), ~( ssList( Y ) ), ~(
% 0.75/1.12 ssItem( X ) ), totalorderedP( cons( X, Y ) ), =( nil, Y ) ],
% 0.75/1.12 [ ~( lt( X, hd( Y ) ) ), ~( strictorderedP( Y ) ), ~( ssList( Y ) ), ~(
% 0.75/1.12 ssItem( X ) ), strictorderedP( cons( X, Y ) ), =( nil, Y ) ],
% 0.75/1.12 [ ~( memberP( cons( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssItem( X ) ),
% 0.75/1.12 ~( ssItem( Z ) ), memberP( Y, Z ), =( Z, X ) ],
% 0.75/1.12 [ ~( ssList( X ) ), duplicatefreeP( X ), =( app( app( skaf75( X ), cons(
% 0.75/1.12 skaf74( X ), skaf76( X ) ) ), cons( skaf74( X ), skaf77( X ) ) ), X ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( ssList( X ) ), strictorderedP( X ), =( app( app( skaf71( X ), cons(
% 0.75/1.12 skaf69( X ), skaf72( X ) ) ), cons( skaf70( X ), skaf73( X ) ) ), X ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( ssList( X ) ), totalorderedP( X ), =( app( app( skaf66( X ), cons(
% 0.75/1.12 skaf64( X ), skaf67( X ) ) ), cons( skaf65( X ), skaf68( X ) ) ), X ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( ssList( X ) ), strictorderP( X ), =( app( app( skaf61( X ), cons(
% 0.75/1.12 skaf59( X ), skaf62( X ) ) ), cons( skaf60( X ), skaf63( X ) ) ), X ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( ssList( X ) ), totalorderP( X ), =( app( app( skaf56( X ), cons(
% 0.75/1.12 skaf54( X ), skaf57( X ) ) ), cons( skaf55( X ), skaf58( X ) ) ), X ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( ssList( X ) ), cyclefreeP( X ), =( app( app( skaf51( X ), cons(
% 0.75/1.12 skaf49( X ), skaf52( X ) ) ), cons( skaf50( X ), skaf53( X ) ) ), X ) ]
% 0.75/1.12 ,
% 0.75/1.12 [ ~( segmentP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app( app(
% 0.75/1.12 skaf47( X, Y ), Y ), skaf48( Y, X ) ), X ) ],
% 0.75/1.12 [ ~( memberP( X, Y ) ), ~( ssItem( Y ) ), ~( ssList( X ) ), =( app(
% 0.75/1.12 skaf42( X, Y ), cons( Y, skaf43( Y, X ) ) ), X ) ],
% 0.75/1.12 [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ), ~( ssItem( X )
% 0.75/1.12 ), ~( ssList( T ) ), ~( ssList( Y ) ), =( X, Z ) ],
% 0.75/1.12 [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ), ~( ssItem( X )
% 0.75/1.12 ), ~( ssList( T ) ), ~( ssList( Y ) ), =( T, Y ) ],
% 0.75/1.12 [ ~( segmentP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( T ) ), ~( ssList(
% 0.75/1.13 Y ) ), ~( ssList( X ) ), segmentP( app( app( T, X ), Z ), Y ) ],
% 0.75/1.13 [ ~( =( app( app( X, Y ), Z ), T ) ), ~( ssList( Z ) ), ~( ssList( X ) )
% 0.75/1.13 , ~( ssList( Y ) ), ~( ssList( T ) ), segmentP( T, Y ) ],
% 0.75/1.13 [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T ) ), ~(
% 0.75/1.13 ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), frontsegP( Y, T ) ]
% 0.75/1.13 ,
% 0.75/1.13 [ ~( =( app( X, cons( Y, Z ) ), T ) ), ~( ssList( Z ) ), ~( ssList( X )
% 0.75/1.13 ), ~( ssItem( Y ) ), ~( ssList( T ) ), memberP( T, Y ) ],
% 0.75/1.13 [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T ) ), ~(
% 0.75/1.13 ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), =( X, Z ) ],
% 0.75/1.13 [ ~( =( tl( X ), tl( Y ) ) ), ~( =( hd( X ), hd( Y ) ) ), ~( ssList( X )
% 0.75/1.13 ), ~( ssList( Y ) ), =( nil, Y ), =( X, Y ), =( nil, X ) ],
% 0.75/1.13 [ ~( frontsegP( X, Y ) ), ~( =( Z, T ) ), ~( ssList( Y ) ), ~( ssList( X
% 0.75/1.13 ) ), ~( ssItem( T ) ), ~( ssItem( Z ) ), frontsegP( cons( Z, X ), cons(
% 0.75/1.13 T, Y ) ) ],
% 0.75/1.13 [ ~( =( app( app( X, cons( Y, Z ) ), cons( Y, T ) ), U ) ), ~( ssList( T
% 0.75/1.13 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), ~(
% 0.75/1.13 duplicatefreeP( U ) ), ~( ssList( U ) ) ],
% 0.75/1.13 [ ~( =( app( X, cons( Y, cons( Z, T ) ) ), U ) ), ~( ssList( T ) ), ~(
% 0.75/1.13 ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ), ~( equalelemsP( U ) )
% 0.75/1.13 , ~( ssList( U ) ), =( Y, Z ) ],
% 0.75/1.13 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.75/1.13 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.75/1.13 ) ), ~( strictorderedP( W ) ), ~( ssList( W ) ), lt( Y, T ) ],
% 0.75/1.13 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.75/1.13 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.75/1.13 ) ), ~( totalorderedP( W ) ), ~( ssList( W ) ), leq( Y, T ) ],
% 0.75/1.13 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.75/1.13 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.75/1.13 ) ), ~( strictorderP( W ) ), ~( ssList( W ) ), lt( Y, T ), lt( T, Y ) ]
% 0.75/1.13 ,
% 0.75/1.13 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.75/1.13 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.75/1.13 ) ), ~( totalorderP( W ) ), ~( ssList( W ) ), leq( Y, T ), leq( T, Y ) ]
% 0.75/1.13 ,
% 0.75/1.13 [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( =( app( app( Z, cons( X, T ) )
% 0.75/1.13 , cons( Y, U ) ), W ) ), ~( ssList( U ) ), ~( ssList( T ) ), ~( ssList( Z
% 0.75/1.13 ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), ~( cyclefreeP( W ) ), ~( ssList(
% 0.75/1.13 W ) ) ],
% 0.75/1.13 [ ssList( sk1 ) ],
% 0.75/1.13 [ ssList( sk2 ) ],
% 0.75/1.13 [ ssList( sk3 ) ],
% 0.75/1.13 [ ssList( sk4 ) ],
% 0.75/1.13 [ =( sk2, sk4 ) ],
% 0.75/1.13 [ =( sk1, sk3 ) ],
% 0.75/1.13 [ neq( sk2, nil ), neq( sk2, nil ) ],
% 0.75/1.13 [ neq( sk2, nil ), ~( neq( sk4, nil ) ) ],
% 0.75/1.13 [ singletonP( sk3 ), neq( sk2, nil ) ],
% 0.75/1.13 [ ~( singletonP( sk1 ) ), neq( sk2, nil ) ],
% 0.75/1.13 [ singletonP( sk3 ), ~( neq( sk4, nil ) ) ],
% 0.75/1.13 [ ~( singletonP( sk1 ) ), ~( neq( sk4, nil ) ) ]
% 0.75/1.13 ] .
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 percentage equality = 0.159278, percentage horn = 0.834197
% 0.75/1.13 This is a problem with some equality
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 Options Used:
% 0.75/1.13
% 0.75/1.13 useres = 1
% 0.75/1.13 useparamod = 1
% 0.75/1.13 useeqrefl = 1
% 0.75/1.13 useeqfact = 1
% 0.75/1.13 usefactor = 1
% 0.75/1.13 usesimpsplitting = 0
% 0.75/1.13 usesimpdemod = 5
% 0.75/1.13 usesimpres = 3
% 0.75/1.13
% 0.75/1.13 resimpinuse = 1000
% 0.75/1.13 resimpclauses = 20000
% 0.75/1.13 substype = eqrewr
% 0.75/1.13 backwardsubs = 1
% 0.75/1.13 selectoldest = 5
% 0.75/1.13
% 0.75/1.13 litorderings [0] = split
% 0.75/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.75/1.13
% 0.75/1.13 termordering = kbo
% 0.75/1.13
% 0.75/1.13 litapriori = 0
% 0.75/1.13 termapriori = 1
% 0.75/1.13 litaposteriori = 0
% 0.75/1.13 termaposteriori = 0
% 0.75/1.13 demodaposteriori = 0
% 0.75/1.13 ordereqreflfact = 0
% 0.75/1.13
% 0.75/1.13 litselect = negord
% 0.75/1.13
% 0.75/1.13 maxweight = 15
% 0.75/1.13 maxdepth = 30000
% 0.75/1.13 maxlength = 115
% 0.75/1.13 maxnrvars = 195
% 0.75/1.13 excuselevel = 1
% 0.75/1.13 increasemaxweight = 1
% 0.75/1.13
% 0.75/1.13 maxselected = 10000000
% 0.75/1.13 maxnrclauses = 10000000
% 0.75/1.13
% 0.75/1.13 showgenerated = 0
% 0.75/1.13 showkept = 0
% 0.75/1.13 showselected = 0
% 0.75/1.13 showdeleted = 0
% 0.75/1.13 showresimp = 1
% 0.75/1.13 showstatus = 2000
% 0.75/1.13
% 0.75/1.13 prologoutput = 1
% 0.75/1.13 nrgoals = 5000000
% 0.75/1.13 totalproof = 1
% 0.75/1.13
% 0.75/1.13 Symbols occurring in the translation:
% 0.75/1.13
% 0.75/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.75/1.13 . [1, 2] (w:1, o:75, a:1, s:1, b:0),
% 0.75/1.13 ! [4, 1] (w:0, o:22, a:1, s:1, b:0),
% 0.75/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.13 nil [39, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.75/1.13 equalelemsP [40, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.75/1.13 duplicatefreeP [41, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.75/1.13 strictorderedP [42, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.75/1.13 totalorderedP [43, 1] (w:1, o:71, a:1, s:1, b:0),
% 0.75/1.13 strictorderP [44, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.75/1.13 totalorderP [45, 1] (w:1, o:72, a:1, s:1, b:0),
% 0.75/1.13 cyclefreeP [46, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.75/1.13 ssList [47, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.75/1.13 skac3 [48, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.75/1.13 ssItem [49, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.75/1.13 skac2 [50, 0] (w:1, o:5, a:1, s:1, b:0),
% 0.75/1.13 singletonP [51, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.75/1.13 skaf83 [53, 1] (w:1, o:70, a:1, s:1, b:0),
% 0.75/1.13 skaf82 [54, 1] (w:1, o:69, a:1, s:1, b:0),
% 0.75/1.13 skaf81 [55, 1] (w:1, o:68, a:1, s:1, b:0),
% 0.75/1.13 skaf80 [56, 1] (w:1, o:67, a:1, s:1, b:0),
% 0.75/1.13 skaf79 [57, 1] (w:1, o:66, a:1, s:1, b:0),
% 0.75/1.13 skaf78 [58, 1] (w:1, o:65, a:1, s:1, b:0),
% 0.75/1.13 skaf77 [59, 1] (w:1, o:64, a:1, s:1, b:0),
% 0.75/1.13 skaf76 [60, 1] (w:1, o:63, a:1, s:1, b:0),
% 0.75/1.13 skaf75 [61, 1] (w:1, o:62, a:1, s:1, b:0),
% 0.75/1.13 skaf74 [62, 1] (w:1, o:61, a:1, s:1, b:0),
% 0.75/1.13 skaf73 [63, 1] (w:1, o:60, a:1, s:1, b:0),
% 0.75/1.13 skaf72 [64, 1] (w:1, o:59, a:1, s:1, b:0),
% 0.75/1.13 skaf71 [65, 1] (w:1, o:58, a:1, s:1, b:0),
% 0.75/1.13 skaf70 [66, 1] (w:1, o:57, a:1, s:1, b:0),
% 0.75/1.13 skaf69 [67, 1] (w:1, o:56, a:1, s:1, b:0),
% 0.75/1.13 skaf68 [68, 1] (w:1, o:55, a:1, s:1, b:0),
% 0.75/1.13 skaf67 [69, 1] (w:1, o:54, a:1, s:1, b:0),
% 0.75/1.13 skaf66 [70, 1] (w:1, o:53, a:1, s:1, b:0),
% 0.75/1.13 skaf65 [71, 1] (w:1, o:52, a:1, s:1, b:0),
% 0.75/1.13 skaf64 [72, 1] (w:1, o:51, a:1, s:1, b:0),
% 0.75/1.13 skaf63 [73, 1] (w:1, o:50, a:1, s:1, b:0),
% 0.75/1.13 skaf62 [74, 1] (w:1, o:49, a:1, s:1, b:0),
% 0.75/1.13 skaf61 [75, 1] (w:1, o:48, a:1, s:1, b:0),
% 0.75/1.13 skaf60 [76, 1] (w:1, o:47, a:1, s:1, b:0),
% 0.75/1.13 skaf59 [77, 1] (w:1, o:46, a:1, s:1, b:0),
% 0.75/1.13 skaf58 [78, 1] (w:1, o:45, a:1, s:1, b:0),
% 0.75/1.13 skaf57 [79, 1] (w:1, o:44, a:1, s:1, b:0),
% 0.75/1.13 skaf56 [80, 1] (w:1, o:43, a:1, s:1, b:0),
% 0.75/1.13 skaf55 [81, 1] (w:1, o:42, a:1, s:1, b:0),
% 0.75/1.13 skaf54 [82, 1] (w:1, o:41, a:1, s:1, b:0),
% 0.75/1.13 skaf53 [83, 1] (w:1, o:40, a:1, s:1, b:0),
% 0.75/1.13 skaf52 [84, 1] (w:1, o:39, a:1, s:1, b:0),
% 0.75/1.13 skaf51 [85, 1] (w:1, o:38, a:1, s:1, b:0),
% 0.75/1.13 skaf50 [86, 1] (w:1, o:37, a:1, s:1, b:0),
% 0.75/1.13 skaf49 [87, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.75/1.13 skaf44 [88, 1] (w:1, o:36, a:1, s:1, b:0),
% 0.75/1.13 skaf48 [90, 2] (w:1, o:104, a:1, s:1, b:0),
% 0.75/1.13 skaf47 [91, 2] (w:1, o:103, a:1, s:1, b:0),
% 0.75/1.13 skaf46 [92, 2] (w:1, o:102, a:1, s:1, b:0),
% 0.75/1.13 skaf45 [93, 2] (w:1, o:101, a:1, s:1, b:0),
% 0.75/1.13 skaf43 [94, 2] (w:1, o:106, a:1, s:1, b:0),
% 0.75/1.13 skaf42 [95, 2] (w:1, o:105, a:1, s:1, b:0),
% 0.75/1.13 geq [96, 2] (w:1, o:108, a:1, s:1, b:0),
% 0.75/1.13 segmentP [97, 2] (w:1, o:109, a:1, s:1, b:0),
% 0.75/1.13 rearsegP [98, 2] (w:1, o:100, a:1, s:1, b:0),
% 0.75/1.13 frontsegP [99, 2] (w:1, o:107, a:1, s:1, b:0),
% 0.75/1.13 leq [100, 2] (w:1, o:110, a:1, s:1, b:0),
% 0.75/1.13 lt [101, 2] (w:1, o:111, a:1, s:1, b:0),
% 0.75/1.13 cons [102, 2] (w:1, o:112, a:1, s:1, b:0),
% 0.75/1.13 memberP [103, 2] (w:1, o:113, a:1, s:1, b:0),
% 0.75/1.13 app [104, 2] (w:1, o:114, a:1, s:1, b:0),
% 0.75/1.13 tl [105, 1] (w:1, o:73, a:1, s:1, b:0),
% 0.75/1.13 hd [106, 1] (w:1, o:74, a:1, s:1, b:0),
% 0.75/1.13 neq [107, 2] (w:1, o:115, a:1, s:1, b:0),
% 0.75/1.13 gt [108, 2] (w:1, o:116, a:1, s:1, b:0),
% 0.75/1.13 sk1 [113, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.75/1.13 sk2 [114, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.75/1.13 sk3 [115, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.75/1.13 sk4 [116, 0] (w:1, o:10, a:1, s:1, b:0).
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 Starting Search:
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 Bliksems!, er is een bewijs:
% 0.75/1.13 % SZS status Unsatisfiable
% 0.75/1.13 % SZS output start Refutation
% 0.75/1.13
% 0.75/1.13 clause( 186, [ =( sk4, sk2 ) ] )
% 0.75/1.13 .
% 0.75/1.13 clause( 187, [ =( sk3, sk1 ) ] )
% 0.75/1.13 .
% 0.75/1.13 clause( 188, [ neq( sk2, nil ) ] )
% 0.75/1.13 .
% 0.75/1.13 clause( 189, [ singletonP( sk1 ) ] )
% 0.75/1.13 .
% 0.75/1.13 clause( 190, [ ~( neq( sk2, nil ) ) ] )
% 0.75/1.13 .
% 0.75/1.13 clause( 315, [] )
% 0.75/1.13 .
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 % SZS output end Refutation
% 0.75/1.13 found a proof!
% 0.75/1.13
% 0.75/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.75/1.13
% 0.75/1.13 initialclauses(
% 0.75/1.13 [ clause( 317, [ equalelemsP( nil ) ] )
% 0.75/1.13 , clause( 318, [ duplicatefreeP( nil ) ] )
% 0.75/1.13 , clause( 319, [ strictorderedP( nil ) ] )
% 0.75/1.13 , clause( 320, [ totalorderedP( nil ) ] )
% 0.75/1.13 , clause( 321, [ strictorderP( nil ) ] )
% 0.75/1.13 , clause( 322, [ totalorderP( nil ) ] )
% 0.75/1.13 , clause( 323, [ cyclefreeP( nil ) ] )
% 0.75/1.13 , clause( 324, [ ssList( nil ) ] )
% 0.75/1.13 , clause( 325, [ ssItem( skac3 ) ] )
% 0.75/1.13 , clause( 326, [ ssItem( skac2 ) ] )
% 0.75/1.13 , clause( 327, [ ~( singletonP( nil ) ) ] )
% 0.75/1.13 , clause( 328, [ ssItem( skaf83( X ) ) ] )
% 0.75/1.13 , clause( 329, [ ssList( skaf82( X ) ) ] )
% 0.75/1.13 , clause( 330, [ ssList( skaf81( X ) ) ] )
% 0.75/1.13 , clause( 331, [ ssList( skaf80( X ) ) ] )
% 0.75/1.13 , clause( 332, [ ssItem( skaf79( X ) ) ] )
% 0.75/1.13 , clause( 333, [ ssItem( skaf78( X ) ) ] )
% 0.75/1.13 , clause( 334, [ ssList( skaf77( X ) ) ] )
% 0.75/1.13 , clause( 335, [ ssList( skaf76( X ) ) ] )
% 0.75/1.13 , clause( 336, [ ssList( skaf75( X ) ) ] )
% 0.75/1.13 , clause( 337, [ ssItem( skaf74( X ) ) ] )
% 0.75/1.13 , clause( 338, [ ssList( skaf73( X ) ) ] )
% 0.75/1.13 , clause( 339, [ ssList( skaf72( X ) ) ] )
% 0.75/1.13 , clause( 340, [ ssList( skaf71( X ) ) ] )
% 0.75/1.13 , clause( 341, [ ssItem( skaf70( X ) ) ] )
% 0.75/1.13 , clause( 342, [ ssItem( skaf69( X ) ) ] )
% 0.75/1.13 , clause( 343, [ ssList( skaf68( X ) ) ] )
% 0.75/1.13 , clause( 344, [ ssList( skaf67( X ) ) ] )
% 0.75/1.13 , clause( 345, [ ssList( skaf66( X ) ) ] )
% 0.75/1.13 , clause( 346, [ ssItem( skaf65( X ) ) ] )
% 0.75/1.13 , clause( 347, [ ssItem( skaf64( X ) ) ] )
% 0.75/1.13 , clause( 348, [ ssList( skaf63( X ) ) ] )
% 0.75/1.13 , clause( 349, [ ssList( skaf62( X ) ) ] )
% 0.75/1.13 , clause( 350, [ ssList( skaf61( X ) ) ] )
% 0.75/1.13 , clause( 351, [ ssItem( skaf60( X ) ) ] )
% 0.75/1.13 , clause( 352, [ ssItem( skaf59( X ) ) ] )
% 0.75/1.13 , clause( 353, [ ssList( skaf58( X ) ) ] )
% 0.75/1.13 , clause( 354, [ ssList( skaf57( X ) ) ] )
% 0.75/1.13 , clause( 355, [ ssList( skaf56( X ) ) ] )
% 0.75/1.13 , clause( 356, [ ssItem( skaf55( X ) ) ] )
% 0.75/1.13 , clause( 357, [ ssItem( skaf54( X ) ) ] )
% 0.75/1.13 , clause( 358, [ ssList( skaf53( X ) ) ] )
% 0.75/1.13 , clause( 359, [ ssList( skaf52( X ) ) ] )
% 0.75/1.13 , clause( 360, [ ssList( skaf51( X ) ) ] )
% 0.75/1.13 , clause( 361, [ ssItem( skaf50( X ) ) ] )
% 0.75/1.13 , clause( 362, [ ssItem( skaf49( X ) ) ] )
% 0.75/1.13 , clause( 363, [ ssItem( skaf44( X ) ) ] )
% 0.75/1.13 , clause( 364, [ ssList( skaf48( X, Y ) ) ] )
% 0.75/1.13 , clause( 365, [ ssList( skaf47( X, Y ) ) ] )
% 0.75/1.13 , clause( 366, [ ssList( skaf46( X, Y ) ) ] )
% 0.75/1.13 , clause( 367, [ ssList( skaf45( X, Y ) ) ] )
% 0.75/1.13 , clause( 368, [ ssList( skaf43( X, Y ) ) ] )
% 0.75/1.13 , clause( 369, [ ssList( skaf42( X, Y ) ) ] )
% 0.75/1.13 , clause( 370, [ ~( =( skac3, skac2 ) ) ] )
% 0.75/1.13 , clause( 371, [ ~( ssItem( X ) ), geq( X, X ) ] )
% 0.75/1.13 , clause( 372, [ ~( ssList( X ) ), segmentP( X, nil ) ] )
% 0.75/1.13 , clause( 373, [ ~( ssList( X ) ), segmentP( X, X ) ] )
% 0.75/1.13 , clause( 374, [ ~( ssList( X ) ), rearsegP( X, nil ) ] )
% 0.75/1.13 , clause( 375, [ ~( ssList( X ) ), rearsegP( X, X ) ] )
% 0.75/1.13 , clause( 376, [ ~( ssList( X ) ), frontsegP( X, nil ) ] )
% 0.75/1.13 , clause( 377, [ ~( ssList( X ) ), frontsegP( X, X ) ] )
% 0.75/1.13 , clause( 378, [ ~( ssItem( X ) ), leq( X, X ) ] )
% 0.75/1.13 , clause( 379, [ ~( lt( X, X ) ), ~( ssItem( X ) ) ] )
% 0.75/1.13 , clause( 380, [ ~( ssItem( X ) ), equalelemsP( cons( X, nil ) ) ] )
% 0.75/1.13 , clause( 381, [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ] )
% 0.75/1.13 , clause( 382, [ ~( ssItem( X ) ), strictorderedP( cons( X, nil ) ) ] )
% 0.75/1.13 , clause( 383, [ ~( ssItem( X ) ), totalorderedP( cons( X, nil ) ) ] )
% 0.75/1.13 , clause( 384, [ ~( ssItem( X ) ), strictorderP( cons( X, nil ) ) ] )
% 0.75/1.13 , clause( 385, [ ~( ssItem( X ) ), totalorderP( cons( X, nil ) ) ] )
% 0.75/1.13 , clause( 386, [ ~( ssItem( X ) ), cyclefreeP( cons( X, nil ) ) ] )
% 0.75/1.13 , clause( 387, [ ~( memberP( nil, X ) ), ~( ssItem( X ) ) ] )
% 0.75/1.13 , clause( 388, [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ] )
% 0.75/1.13 , clause( 389, [ ~( ssList( X ) ), =( app( X, nil ), X ) ] )
% 0.75/1.13 , clause( 390, [ ~( ssList( X ) ), =( app( nil, X ), X ) ] )
% 0.75/1.13 , clause( 391, [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ] )
% 0.75/1.13 , clause( 392, [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ] )
% 0.75/1.13 , clause( 393, [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ] )
% 0.75/1.13 , clause( 394, [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ] )
% 0.75/1.13 , clause( 395, [ ~( =( nil, X ) ), ~( ssList( X ) ), segmentP( nil, X ) ]
% 0.75/1.13 )
% 0.75/1.13 , clause( 396, [ ~( segmentP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 0.75/1.13 )
% 0.75/1.13 , clause( 397, [ ~( =( nil, X ) ), ~( ssList( X ) ), rearsegP( nil, X ) ]
% 0.75/1.13 )
% 0.75/1.13 , clause( 398, [ ~( rearsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 0.75/1.13 )
% 0.75/1.13 , clause( 399, [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X ) ]
% 0.75/1.13 )
% 0.75/1.13 , clause( 400, [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 0.75/1.13 )
% 0.75/1.13 , clause( 401, [ ~( ssList( X ) ), ~( ssList( Y ) ), ssList( app( Y, X ) )
% 0.75/1.13 ] )
% 0.75/1.13 , clause( 402, [ ~( ssItem( X ) ), ~( ssList( Y ) ), ssList( cons( X, Y ) )
% 0.75/1.13 ] )
% 0.75/1.13 , clause( 403, [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf50( X ),
% 0.75/1.13 skaf49( X ) ) ] )
% 0.75/1.13 , clause( 404, [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf49( X ),
% 0.75/1.13 skaf50( X ) ) ] )
% 0.75/1.13 , clause( 405, [ ~( =( skaf79( X ), skaf78( X ) ) ), ~( ssList( X ) ),
% 0.75/1.13 equalelemsP( X ) ] )
% 0.75/1.13 , clause( 406, [ ~( lt( skaf69( X ), skaf70( X ) ) ), ~( ssList( X ) ),
% 0.75/1.13 strictorderedP( X ) ] )
% 0.75/1.13 , clause( 407, [ ~( leq( skaf64( X ), skaf65( X ) ) ), ~( ssList( X ) ),
% 0.75/1.13 totalorderedP( X ) ] )
% 0.75/1.13 , clause( 408, [ ~( lt( skaf60( X ), skaf59( X ) ) ), ~( ssList( X ) ),
% 0.75/1.13 strictorderP( X ) ] )
% 0.75/1.13 , clause( 409, [ ~( lt( skaf59( X ), skaf60( X ) ) ), ~( ssList( X ) ),
% 0.75/1.13 strictorderP( X ) ] )
% 0.75/1.13 , clause( 410, [ ~( leq( skaf55( X ), skaf54( X ) ) ), ~( ssList( X ) ),
% 0.75/1.13 totalorderP( X ) ] )
% 0.75/1.13 , clause( 411, [ ~( leq( skaf54( X ), skaf55( X ) ) ), ~( ssList( X ) ),
% 0.75/1.13 totalorderP( X ) ] )
% 0.75/1.13 , clause( 412, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( tl( cons( X, Y ) )
% 0.75/1.13 , Y ) ] )
% 0.75/1.13 , clause( 413, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( hd( cons( X, Y ) )
% 0.75/1.13 , X ) ] )
% 0.75/1.13 , clause( 414, [ ~( =( cons( X, Y ), nil ) ), ~( ssItem( X ) ), ~( ssList(
% 0.75/1.13 Y ) ) ] )
% 0.75/1.13 , clause( 415, [ ~( =( cons( X, Y ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y
% 0.75/1.13 ) ) ] )
% 0.75/1.13 , clause( 416, [ ~( ssList( X ) ), ~( ssList( Y ) ), neq( Y, X ), =( Y, X )
% 0.75/1.13 ] )
% 0.75/1.13 , clause( 417, [ ~( singletonP( X ) ), ~( ssList( X ) ), =( cons( skaf44( X
% 0.75/1.13 ), nil ), X ) ] )
% 0.75/1.13 , clause( 418, [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X )
% 0.75/1.13 ] )
% 0.75/1.13 , clause( 419, [ ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq(
% 0.75/1.13 X, Y ) ] )
% 0.75/1.13 , clause( 420, [ ~( ssList( X ) ), =( cons( hd( X ), tl( X ) ), X ), =( nil
% 0.75/1.13 , X ) ] )
% 0.75/1.13 , clause( 421, [ ~( gt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( Y
% 0.75/1.13 , X ) ] )
% 0.75/1.13 , clause( 422, [ ~( lt( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), gt( Y
% 0.75/1.13 , X ) ] )
% 0.75/1.13 , clause( 423, [ ~( geq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq(
% 0.75/1.13 Y, X ) ] )
% 0.75/1.13 , clause( 424, [ ~( leq( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), geq(
% 0.75/1.13 Y, X ) ] )
% 0.75/1.13 , clause( 425, [ ~( ssList( X ) ), =( cons( skaf83( X ), skaf82( X ) ), X )
% 0.75/1.13 , =( nil, X ) ] )
% 0.75/1.13 , clause( 426, [ ~( gt( X, Y ) ), ~( gt( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.75/1.13 ssItem( Y ) ) ] )
% 0.75/1.13 , clause( 427, [ ~( =( X, Y ) ), ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~(
% 0.75/1.13 ssItem( X ) ) ] )
% 0.75/1.13 , clause( 428, [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 0.75/1.13 strictorderedP( cons( Y, X ) ) ] )
% 0.75/1.13 , clause( 429, [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 0.75/1.13 totalorderedP( cons( Y, X ) ) ] )
% 0.75/1.13 , clause( 430, [ ~( lt( X, Y ) ), ~( lt( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.75/1.13 ssItem( Y ) ) ] )
% 0.75/1.13 , clause( 431, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssList( Y ) ), ~(
% 0.75/1.13 ssList( X ) ) ] )
% 0.75/1.13 , clause( 432, [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList(
% 0.75/1.13 Y ) ), singletonP( Y ) ] )
% 0.75/1.13 , clause( 433, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~(
% 0.75/1.13 ssItem( X ) ) ] )
% 0.75/1.13 , clause( 434, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X
% 0.75/1.13 ) ), =( nil, X ) ] )
% 0.75/1.13 , clause( 435, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X
% 0.75/1.13 ) ), =( nil, Y ) ] )
% 0.75/1.13 , clause( 436, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( app( cons( X, nil )
% 0.75/1.13 , Y ), cons( X, Y ) ) ] )
% 0.75/1.13 , clause( 437, [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 0.75/1.13 X, Y ), =( X, Y ) ] )
% 0.75/1.13 , clause( 438, [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 0.75/1.13 X, Y ), =( X, Y ) ] )
% 0.75/1.13 , clause( 439, [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( hd(
% 0.75/1.13 app( Y, X ) ), hd( Y ) ) ] )
% 0.75/1.13 , clause( 440, [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~(
% 0.75/1.13 ssItem( X ) ), strictorderedP( Y ), =( nil, Y ) ] )
% 0.75/1.13 , clause( 441, [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~(
% 0.75/1.13 ssItem( X ) ), totalorderedP( Y ), =( nil, Y ) ] )
% 0.75/1.13 , clause( 442, [ ~( geq( X, Y ) ), ~( geq( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.75/1.13 ssItem( Y ) ), =( Y, X ) ] )
% 0.75/1.13 , clause( 443, [ ~( segmentP( X, Y ) ), ~( segmentP( Y, X ) ), ~( ssList( X
% 0.75/1.13 ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.75/1.13 , clause( 444, [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, X ) ), ~( ssList( X
% 0.75/1.13 ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.75/1.13 , clause( 445, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~( ssList(
% 0.75/1.13 X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.75/1.13 , clause( 446, [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.75/1.13 ssItem( Y ) ), =( Y, X ) ] )
% 0.75/1.13 , clause( 447, [ ~( rearsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.75/1.13 , =( app( skaf46( X, Y ), Y ), X ) ] )
% 0.75/1.13 , clause( 448, [ ~( frontsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.75/1.13 , =( app( Y, skaf45( X, Y ) ), X ) ] )
% 0.75/1.13 , clause( 449, [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( tl(
% 0.75/1.13 app( Y, X ) ), app( tl( Y ), X ) ) ] )
% 0.75/1.13 , clause( 450, [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~(
% 0.75/1.13 ssItem( X ) ), lt( X, hd( Y ) ), =( nil, Y ) ] )
% 0.75/1.13 , clause( 451, [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~(
% 0.75/1.13 ssItem( X ) ), leq( X, hd( Y ) ), =( nil, Y ) ] )
% 0.75/1.13 , clause( 452, [ ~( rearsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) )
% 0.75/1.13 , ~( ssList( X ) ), rearsegP( app( Z, X ), Y ) ] )
% 0.75/1.13 , clause( 453, [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) )
% 0.75/1.13 , ~( ssList( X ) ), frontsegP( app( X, Z ), Y ) ] )
% 0.75/1.13 , clause( 454, [ ~( =( X, Y ) ), ~( ssList( Z ) ), ~( ssItem( Y ) ), ~(
% 0.75/1.13 ssItem( X ) ), memberP( cons( Y, Z ), X ) ] )
% 0.75/1.13 , clause( 455, [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssItem( Z ) ),
% 0.75/1.13 ~( ssItem( Y ) ), memberP( cons( Z, X ), Y ) ] )
% 0.75/1.13 , clause( 456, [ ~( memberP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( X ) ),
% 0.75/1.13 ~( ssItem( Y ) ), memberP( app( X, Z ), Y ) ] )
% 0.75/1.13 , clause( 457, [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssList( Z ) ),
% 0.75/1.13 ~( ssItem( Y ) ), memberP( app( Z, X ), Y ) ] )
% 0.75/1.13 , clause( 458, [ ~( ssList( X ) ), equalelemsP( X ), =( app( skaf80( X ),
% 0.75/1.13 cons( skaf78( X ), cons( skaf79( X ), skaf81( X ) ) ) ), X ) ] )
% 0.75/1.13 , clause( 459, [ ~( =( app( X, Y ), Z ) ), ~( ssList( X ) ), ~( ssList( Y )
% 0.75/1.13 ), ~( ssList( Z ) ), rearsegP( Z, Y ) ] )
% 0.75/1.13 , clause( 460, [ ~( =( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X )
% 0.75/1.13 ), ~( ssList( Z ) ), frontsegP( Z, X ) ] )
% 0.75/1.13 , clause( 461, [ ~( =( nil, X ) ), ~( =( nil, Y ) ), ~( ssList( Y ) ), ~(
% 0.75/1.13 ssList( X ) ), =( app( X, Y ), nil ) ] )
% 0.75/1.13 , clause( 462, [ ~( gt( X, Y ) ), ~( gt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.75/1.13 ssItem( Y ) ), ~( ssItem( X ) ), gt( X, Z ) ] )
% 0.75/1.13 , clause( 463, [ ~( leq( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.75/1.13 ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Z ) ] )
% 0.75/1.13 , clause( 464, [ ~( geq( X, Y ) ), ~( geq( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.75/1.13 ssItem( Y ) ), ~( ssItem( X ) ), geq( X, Z ) ] )
% 0.75/1.13 , clause( 465, [ ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =(
% 0.75/1.13 app( app( Z, Y ), X ), app( Z, app( Y, X ) ) ) ] )
% 0.75/1.13 , clause( 466, [ ~( =( app( X, Y ), app( X, Z ) ) ), ~( ssList( Y ) ), ~(
% 0.75/1.13 ssList( X ) ), ~( ssList( Z ) ), =( Y, Z ) ] )
% 0.75/1.13 , clause( 467, [ ~( =( app( X, Y ), app( Z, Y ) ) ), ~( ssList( X ) ), ~(
% 0.75/1.13 ssList( Y ) ), ~( ssList( Z ) ), =( X, Z ) ] )
% 0.75/1.13 , clause( 468, [ ~( segmentP( X, Y ) ), ~( segmentP( Y, Z ) ), ~( ssList( Z
% 0.75/1.13 ) ), ~( ssList( Y ) ), ~( ssList( X ) ), segmentP( X, Z ) ] )
% 0.75/1.13 , clause( 469, [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, Z ) ), ~( ssList( Z
% 0.75/1.13 ) ), ~( ssList( Y ) ), ~( ssList( X ) ), rearsegP( X, Z ) ] )
% 0.75/1.13 , clause( 470, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, Z ) ), ~( ssList(
% 0.75/1.13 Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), frontsegP( X, Z ) ] )
% 0.75/1.13 , clause( 471, [ ~( lt( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.75/1.13 ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Z ) ] )
% 0.75/1.13 , clause( 472, [ ~( leq( X, Y ) ), ~( leq( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.75/1.13 ssItem( Y ) ), ~( ssItem( X ) ), leq( X, Z ) ] )
% 0.75/1.13 , clause( 473, [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =(
% 0.75/1.13 cons( X, app( Y, Z ) ), app( cons( X, Y ), Z ) ) ] )
% 0.75/1.13 , clause( 474, [ ~( memberP( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~(
% 0.75/1.13 ssList( X ) ), ~( ssItem( Z ) ), memberP( Y, Z ), memberP( X, Z ) ] )
% 0.75/1.13 , clause( 475, [ ~( leq( X, hd( Y ) ) ), ~( totalorderedP( Y ) ), ~( ssList(
% 0.75/1.13 Y ) ), ~( ssItem( X ) ), totalorderedP( cons( X, Y ) ), =( nil, Y ) ] )
% 0.75/1.13 , clause( 476, [ ~( lt( X, hd( Y ) ) ), ~( strictorderedP( Y ) ), ~( ssList(
% 0.75/1.13 Y ) ), ~( ssItem( X ) ), strictorderedP( cons( X, Y ) ), =( nil, Y ) ] )
% 0.75/1.13 , clause( 477, [ ~( memberP( cons( X, Y ), Z ) ), ~( ssList( Y ) ), ~(
% 0.75/1.13 ssItem( X ) ), ~( ssItem( Z ) ), memberP( Y, Z ), =( Z, X ) ] )
% 0.75/1.13 , clause( 478, [ ~( ssList( X ) ), duplicatefreeP( X ), =( app( app( skaf75(
% 0.75/1.13 X ), cons( skaf74( X ), skaf76( X ) ) ), cons( skaf74( X ), skaf77( X ) )
% 0.75/1.13 ), X ) ] )
% 0.75/1.13 , clause( 479, [ ~( ssList( X ) ), strictorderedP( X ), =( app( app( skaf71(
% 0.75/1.13 X ), cons( skaf69( X ), skaf72( X ) ) ), cons( skaf70( X ), skaf73( X ) )
% 0.75/1.13 ), X ) ] )
% 0.75/1.13 , clause( 480, [ ~( ssList( X ) ), totalorderedP( X ), =( app( app( skaf66(
% 0.75/1.13 X ), cons( skaf64( X ), skaf67( X ) ) ), cons( skaf65( X ), skaf68( X ) )
% 0.75/1.13 ), X ) ] )
% 0.75/1.13 , clause( 481, [ ~( ssList( X ) ), strictorderP( X ), =( app( app( skaf61(
% 0.75/1.13 X ), cons( skaf59( X ), skaf62( X ) ) ), cons( skaf60( X ), skaf63( X ) )
% 0.75/1.13 ), X ) ] )
% 0.75/1.13 , clause( 482, [ ~( ssList( X ) ), totalorderP( X ), =( app( app( skaf56( X
% 0.75/1.13 ), cons( skaf54( X ), skaf57( X ) ) ), cons( skaf55( X ), skaf58( X ) )
% 0.75/1.13 ), X ) ] )
% 0.75/1.13 , clause( 483, [ ~( ssList( X ) ), cyclefreeP( X ), =( app( app( skaf51( X
% 0.75/1.13 ), cons( skaf49( X ), skaf52( X ) ) ), cons( skaf50( X ), skaf53( X ) )
% 0.75/1.13 ), X ) ] )
% 0.75/1.13 , clause( 484, [ ~( segmentP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.75/1.13 , =( app( app( skaf47( X, Y ), Y ), skaf48( Y, X ) ), X ) ] )
% 0.75/1.13 , clause( 485, [ ~( memberP( X, Y ) ), ~( ssItem( Y ) ), ~( ssList( X ) ),
% 0.75/1.13 =( app( skaf42( X, Y ), cons( Y, skaf43( Y, X ) ) ), X ) ] )
% 0.75/1.13 , clause( 486, [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ),
% 0.75/1.13 ~( ssItem( X ) ), ~( ssList( T ) ), ~( ssList( Y ) ), =( X, Z ) ] )
% 0.75/1.13 , clause( 487, [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ),
% 0.75/1.13 ~( ssItem( X ) ), ~( ssList( T ) ), ~( ssList( Y ) ), =( T, Y ) ] )
% 0.75/1.13 , clause( 488, [ ~( segmentP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( T ) )
% 0.75/1.13 , ~( ssList( Y ) ), ~( ssList( X ) ), segmentP( app( app( T, X ), Z ), Y
% 0.75/1.13 ) ] )
% 0.75/1.13 , clause( 489, [ ~( =( app( app( X, Y ), Z ), T ) ), ~( ssList( Z ) ), ~(
% 0.75/1.13 ssList( X ) ), ~( ssList( Y ) ), ~( ssList( T ) ), segmentP( T, Y ) ] )
% 0.75/1.13 , clause( 490, [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T
% 0.75/1.13 ) ), ~( ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), frontsegP( Y
% 0.75/1.13 , T ) ] )
% 0.75/1.13 , clause( 491, [ ~( =( app( X, cons( Y, Z ) ), T ) ), ~( ssList( Z ) ), ~(
% 0.75/1.13 ssList( X ) ), ~( ssItem( Y ) ), ~( ssList( T ) ), memberP( T, Y ) ] )
% 0.75/1.13 , clause( 492, [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T
% 0.75/1.13 ) ), ~( ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), =( X, Z ) ]
% 0.75/1.13 )
% 0.75/1.13 , clause( 493, [ ~( =( tl( X ), tl( Y ) ) ), ~( =( hd( X ), hd( Y ) ) ),
% 0.75/1.13 ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( X, Y ), =( nil, X ) ]
% 0.75/1.13 )
% 0.75/1.13 , clause( 494, [ ~( frontsegP( X, Y ) ), ~( =( Z, T ) ), ~( ssList( Y ) ),
% 0.75/1.13 ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Z ) ), frontsegP( cons( Z
% 0.75/1.13 , X ), cons( T, Y ) ) ] )
% 0.75/1.13 , clause( 495, [ ~( =( app( app( X, cons( Y, Z ) ), cons( Y, T ) ), U ) ),
% 0.75/1.13 ~( ssList( T ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 0.75/1.13 ~( duplicatefreeP( U ) ), ~( ssList( U ) ) ] )
% 0.75/1.13 , clause( 496, [ ~( =( app( X, cons( Y, cons( Z, T ) ) ), U ) ), ~( ssList(
% 0.75/1.13 T ) ), ~( ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ), ~(
% 0.75/1.13 equalelemsP( U ) ), ~( ssList( U ) ), =( Y, Z ) ] )
% 0.75/1.13 , clause( 497, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ),
% 0.75/1.13 ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ),
% 0.75/1.13 ~( ssItem( Y ) ), ~( strictorderedP( W ) ), ~( ssList( W ) ), lt( Y, T )
% 0.75/1.13 ] )
% 0.75/1.13 , clause( 498, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ),
% 0.75/1.13 ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ),
% 0.79/1.20 ~( ssItem( Y ) ), ~( totalorderedP( W ) ), ~( ssList( W ) ), leq( Y, T )
% 0.79/1.20 ] )
% 0.79/1.20 , clause( 499, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ),
% 0.79/1.20 ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ),
% 0.79/1.20 ~( ssItem( Y ) ), ~( strictorderP( W ) ), ~( ssList( W ) ), lt( Y, T ),
% 0.79/1.20 lt( T, Y ) ] )
% 0.79/1.20 , clause( 500, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ),
% 0.79/1.20 ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ),
% 0.79/1.20 ~( ssItem( Y ) ), ~( totalorderP( W ) ), ~( ssList( W ) ), leq( Y, T ),
% 0.79/1.20 leq( T, Y ) ] )
% 0.79/1.20 , clause( 501, [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( =( app( app( Z,
% 0.79/1.20 cons( X, T ) ), cons( Y, U ) ), W ) ), ~( ssList( U ) ), ~( ssList( T ) )
% 0.79/1.20 , ~( ssList( Z ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), ~( cyclefreeP( W
% 0.79/1.20 ) ), ~( ssList( W ) ) ] )
% 0.79/1.20 , clause( 502, [ ssList( sk1 ) ] )
% 0.79/1.20 , clause( 503, [ ssList( sk2 ) ] )
% 0.79/1.20 , clause( 504, [ ssList( sk3 ) ] )
% 0.79/1.20 , clause( 505, [ ssList( sk4 ) ] )
% 0.79/1.20 , clause( 506, [ =( sk2, sk4 ) ] )
% 0.79/1.20 , clause( 507, [ =( sk1, sk3 ) ] )
% 0.79/1.20 , clause( 508, [ neq( sk2, nil ), neq( sk2, nil ) ] )
% 0.79/1.20 , clause( 509, [ neq( sk2, nil ), ~( neq( sk4, nil ) ) ] )
% 0.79/1.20 , clause( 510, [ singletonP( sk3 ), neq( sk2, nil ) ] )
% 0.79/1.20 , clause( 511, [ ~( singletonP( sk1 ) ), neq( sk2, nil ) ] )
% 0.79/1.20 , clause( 512, [ singletonP( sk3 ), ~( neq( sk4, nil ) ) ] )
% 0.79/1.20 , clause( 513, [ ~( singletonP( sk1 ) ), ~( neq( sk4, nil ) ) ] )
% 0.79/1.20 ] ).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 eqswap(
% 0.79/1.20 clause( 1271, [ =( sk4, sk2 ) ] )
% 0.79/1.20 , clause( 506, [ =( sk2, sk4 ) ] )
% 0.79/1.20 , 0, substitution( 0, [] )).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 subsumption(
% 0.79/1.20 clause( 186, [ =( sk4, sk2 ) ] )
% 0.79/1.20 , clause( 1271, [ =( sk4, sk2 ) ] )
% 0.79/1.20 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 eqswap(
% 0.79/1.20 clause( 2030, [ =( sk3, sk1 ) ] )
% 0.79/1.20 , clause( 507, [ =( sk1, sk3 ) ] )
% 0.79/1.20 , 0, substitution( 0, [] )).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 subsumption(
% 0.79/1.20 clause( 187, [ =( sk3, sk1 ) ] )
% 0.79/1.20 , clause( 2030, [ =( sk3, sk1 ) ] )
% 0.79/1.20 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 factor(
% 0.79/1.20 clause( 2796, [ neq( sk2, nil ) ] )
% 0.79/1.20 , clause( 508, [ neq( sk2, nil ), neq( sk2, nil ) ] )
% 0.79/1.20 , 0, 1, substitution( 0, [] )).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 subsumption(
% 0.79/1.20 clause( 188, [ neq( sk2, nil ) ] )
% 0.79/1.20 , clause( 2796, [ neq( sk2, nil ) ] )
% 0.79/1.20 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 paramod(
% 0.79/1.20 clause( 3959, [ singletonP( sk1 ), ~( neq( sk4, nil ) ) ] )
% 0.79/1.20 , clause( 187, [ =( sk3, sk1 ) ] )
% 0.79/1.20 , 0, clause( 512, [ singletonP( sk3 ), ~( neq( sk4, nil ) ) ] )
% 0.79/1.20 , 0, 1, substitution( 0, [] ), substitution( 1, [] )).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 paramod(
% 0.79/1.20 clause( 3960, [ ~( neq( sk2, nil ) ), singletonP( sk1 ) ] )
% 0.79/1.20 , clause( 186, [ =( sk4, sk2 ) ] )
% 0.79/1.20 , 0, clause( 3959, [ singletonP( sk1 ), ~( neq( sk4, nil ) ) ] )
% 0.79/1.20 , 1, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 resolution(
% 0.79/1.20 clause( 3961, [ singletonP( sk1 ) ] )
% 0.79/1.20 , clause( 3960, [ ~( neq( sk2, nil ) ), singletonP( sk1 ) ] )
% 0.79/1.20 , 0, clause( 188, [ neq( sk2, nil ) ] )
% 0.79/1.20 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 subsumption(
% 0.79/1.20 clause( 189, [ singletonP( sk1 ) ] )
% 0.79/1.20 , clause( 3961, [ singletonP( sk1 ) ] )
% 0.79/1.20 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 paramod(
% 0.79/1.20 clause( 4930, [ ~( neq( sk2, nil ) ), ~( singletonP( sk1 ) ) ] )
% 0.79/1.20 , clause( 186, [ =( sk4, sk2 ) ] )
% 0.79/1.20 , 0, clause( 513, [ ~( singletonP( sk1 ) ), ~( neq( sk4, nil ) ) ] )
% 0.79/1.20 , 1, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 resolution(
% 0.79/1.20 clause( 4931, [ ~( neq( sk2, nil ) ) ] )
% 0.79/1.20 , clause( 4930, [ ~( neq( sk2, nil ) ), ~( singletonP( sk1 ) ) ] )
% 0.79/1.20 , 1, clause( 189, [ singletonP( sk1 ) ] )
% 0.79/1.20 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 subsumption(
% 0.79/1.20 clause( 190, [ ~( neq( sk2, nil ) ) ] )
% 0.79/1.20 , clause( 4931, [ ~( neq( sk2, nil ) ) ] )
% 0.79/1.20 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 resolution(
% 0.79/1.20 clause( 4932, [] )
% 0.79/1.20 , clause( 190, [ ~( neq( sk2, nil ) ) ] )
% 0.79/1.20 , 0, clause( 188, [ neq( sk2, nil ) ] )
% 0.79/1.20 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 subsumption(
% 0.79/1.20 clause( 315, [] )
% 0.79/1.20 , clause( 4932, [] )
% 0.79/1.20 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 end.
% 0.79/1.20
% 0.79/1.20 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.79/1.20
% 0.79/1.20 Memory use:
% 0.79/1.20
% 0.79/1.20 space for terms: 11235
% 0.79/1.20 space for clauses: 17609
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 clauses generated: 753
% 0.79/1.20 clauses kept: 316
% 0.79/1.20 clauses selected: 14
% 0.79/1.20 clauses deleted: 3
% 0.79/1.20 clauses inuse deleted: 0
% 0.79/1.20
% 0.79/1.20 subsentry: 63696
% 0.79/1.20 literals s-matched: 38162
% 0.79/1.20 literals matched: 13806
% 0.79/1.20 full subsumption: 10395
% 0.79/1.20
% 0.79/1.20 checksum: -431218216
% 0.79/1.20
% 0.79/1.20
% 0.79/1.20 Bliksem ended
%------------------------------------------------------------------------------