TSTP Solution File: SWC349-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWC349-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Tue Jul 19 19:36:06 EDT 2022
% Result : Unsatisfiable 0.71s 1.11s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC349-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Sun Jun 12 09:20:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.11 *** allocated 10000 integers for termspace/termends
% 0.71/1.11 *** allocated 10000 integers for clauses
% 0.71/1.11 *** allocated 10000 integers for justifications
% 0.71/1.11 Bliksem 1.12
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Automatic Strategy Selection
% 0.71/1.11
% 0.71/1.11 Clauses:
% 0.71/1.11 [
% 0.71/1.11 [ equalelemsP( nil ) ],
% 0.71/1.11 [ duplicatefreeP( nil ) ],
% 0.71/1.11 [ strictorderedP( nil ) ],
% 0.71/1.11 [ totalorderedP( nil ) ],
% 0.71/1.11 [ strictorderP( nil ) ],
% 0.71/1.11 [ totalorderP( nil ) ],
% 0.71/1.11 [ cyclefreeP( nil ) ],
% 0.71/1.11 [ ssList( nil ) ],
% 0.71/1.11 [ ssItem( skac3 ) ],
% 0.71/1.11 [ ssItem( skac2 ) ],
% 0.71/1.11 [ ~( singletonP( nil ) ) ],
% 0.71/1.11 [ ssItem( skaf83( X ) ) ],
% 0.71/1.11 [ ssList( skaf82( X ) ) ],
% 0.71/1.11 [ ssList( skaf81( X ) ) ],
% 0.71/1.11 [ ssList( skaf80( X ) ) ],
% 0.71/1.11 [ ssItem( skaf79( X ) ) ],
% 0.71/1.11 [ ssItem( skaf78( X ) ) ],
% 0.71/1.11 [ ssList( skaf77( X ) ) ],
% 0.71/1.11 [ ssList( skaf76( X ) ) ],
% 0.71/1.11 [ ssList( skaf75( X ) ) ],
% 0.71/1.11 [ ssItem( skaf74( X ) ) ],
% 0.71/1.11 [ ssList( skaf73( X ) ) ],
% 0.71/1.11 [ ssList( skaf72( X ) ) ],
% 0.71/1.11 [ ssList( skaf71( X ) ) ],
% 0.71/1.11 [ ssItem( skaf70( X ) ) ],
% 0.71/1.11 [ ssItem( skaf69( X ) ) ],
% 0.71/1.11 [ ssList( skaf68( X ) ) ],
% 0.71/1.11 [ ssList( skaf67( X ) ) ],
% 0.71/1.11 [ ssList( skaf66( X ) ) ],
% 0.71/1.11 [ ssItem( skaf65( X ) ) ],
% 0.71/1.11 [ ssItem( skaf64( X ) ) ],
% 0.71/1.11 [ ssList( skaf63( X ) ) ],
% 0.71/1.11 [ ssList( skaf62( X ) ) ],
% 0.71/1.11 [ ssList( skaf61( X ) ) ],
% 0.71/1.11 [ ssItem( skaf60( X ) ) ],
% 0.71/1.11 [ ssItem( skaf59( X ) ) ],
% 0.71/1.11 [ ssList( skaf58( X ) ) ],
% 0.71/1.11 [ ssList( skaf57( X ) ) ],
% 0.71/1.11 [ ssList( skaf56( X ) ) ],
% 0.71/1.11 [ ssItem( skaf55( X ) ) ],
% 0.71/1.11 [ ssItem( skaf54( X ) ) ],
% 0.71/1.11 [ ssList( skaf53( X ) ) ],
% 0.71/1.11 [ ssList( skaf52( X ) ) ],
% 0.71/1.11 [ ssList( skaf51( X ) ) ],
% 0.71/1.11 [ ssItem( skaf50( X ) ) ],
% 0.71/1.11 [ ssItem( skaf49( X ) ) ],
% 0.71/1.11 [ ssItem( skaf44( X ) ) ],
% 0.71/1.11 [ ssList( skaf48( X, Y ) ) ],
% 0.71/1.11 [ ssList( skaf47( X, Y ) ) ],
% 0.71/1.11 [ ssList( skaf46( X, Y ) ) ],
% 0.71/1.11 [ ssList( skaf45( X, Y ) ) ],
% 0.71/1.11 [ ssList( skaf43( X, Y ) ) ],
% 0.71/1.11 [ ssList( skaf42( X, Y ) ) ],
% 0.71/1.11 [ ~( =( skac3, skac2 ) ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), geq( X, X ) ],
% 0.71/1.11 [ ~( ssList( X ) ), segmentP( X, nil ) ],
% 0.71/1.11 [ ~( ssList( X ) ), segmentP( X, X ) ],
% 0.71/1.11 [ ~( ssList( X ) ), rearsegP( X, nil ) ],
% 0.71/1.11 [ ~( ssList( X ) ), rearsegP( X, X ) ],
% 0.71/1.11 [ ~( ssList( X ) ), frontsegP( X, nil ) ],
% 0.71/1.11 [ ~( ssList( X ) ), frontsegP( X, X ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), leq( X, X ) ],
% 0.71/1.11 [ ~( lt( X, X ) ), ~( ssItem( X ) ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), equalelemsP( cons( X, nil ) ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), strictorderedP( cons( X, nil ) ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), totalorderedP( cons( X, nil ) ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), strictorderP( cons( X, nil ) ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), totalorderP( cons( X, nil ) ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), cyclefreeP( cons( X, nil ) ) ],
% 0.71/1.11 [ ~( memberP( nil, X ) ), ~( ssItem( X ) ) ],
% 0.71/1.11 [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ],
% 0.71/1.11 [ ~( ssList( X ) ), =( app( X, nil ), X ) ],
% 0.71/1.11 [ ~( ssList( X ) ), =( app( nil, X ), X ) ],
% 0.71/1.11 [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ],
% 0.71/1.11 [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ],
% 0.71/1.11 [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ],
% 0.71/1.11 [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ],
% 0.71/1.11 [ ~( =( nil, X ) ), ~( ssList( X ) ), segmentP( nil, X ) ],
% 0.71/1.11 [ ~( segmentP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.71/1.11 [ ~( =( nil, X ) ), ~( ssList( X ) ), rearsegP( nil, X ) ],
% 0.71/1.11 [ ~( rearsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.71/1.11 [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X ) ],
% 0.71/1.11 [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.71/1.11 [ ~( ssList( X ) ), ~( ssList( Y ) ), ssList( app( Y, X ) ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), ~( ssList( Y ) ), ssList( cons( X, Y ) ) ],
% 0.71/1.11 [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf50( X ), skaf49( X ) ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf49( X ), skaf50( X ) ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( =( skaf79( X ), skaf78( X ) ) ), ~( ssList( X ) ), equalelemsP( X )
% 0.71/1.11 ],
% 0.71/1.11 [ ~( lt( skaf69( X ), skaf70( X ) ) ), ~( ssList( X ) ), strictorderedP(
% 0.71/1.11 X ) ],
% 0.71/1.11 [ ~( leq( skaf64( X ), skaf65( X ) ) ), ~( ssList( X ) ), totalorderedP(
% 0.71/1.11 X ) ],
% 0.71/1.11 [ ~( lt( skaf60( X ), skaf59( X ) ) ), ~( ssList( X ) ), strictorderP( X
% 0.71/1.11 ) ],
% 0.71/1.11 [ ~( lt( skaf59( X ), skaf60( X ) ) ), ~( ssList( X ) ), strictorderP( X
% 0.71/1.11 ) ],
% 0.71/1.11 [ ~( leq( skaf55( X ), skaf54( X ) ) ), ~( ssList( X ) ), totalorderP( X
% 0.71/1.11 ) ],
% 0.71/1.11 [ ~( leq( skaf54( X ), skaf55( X ) ) ), ~( ssList( X ) ), totalorderP( X
% 0.71/1.11 ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( tl( cons( X, Y ) ), Y ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( hd( cons( X, Y ) ), X ) ],
% 0.71/1.11 [ ~( =( cons( X, Y ), nil ) ), ~( ssItem( X ) ), ~( ssList( Y ) ) ],
% 0.71/1.11 [ ~( =( cons( X, Y ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y ) ) ],
% 0.71/1.11 [ ~( ssList( X ) ), ~( ssList( Y ) ), neq( Y, X ), =( Y, X ) ],
% 0.71/1.11 [ ~( singletonP( X ) ), ~( ssList( X ) ), =( cons( skaf44( X ), nil ), X
% 0.71/1.11 ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X ) ],
% 0.71/1.11 [ ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( X, Y ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( ssList( X ) ), =( cons( hd( X ), tl( X ) ), X ), =( nil, X ) ],
% 0.71/1.11 [ ~( gt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( Y, X ) ],
% 0.71/1.11 [ ~( lt( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), gt( Y, X ) ],
% 0.71/1.11 [ ~( geq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( Y, X ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( leq( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), geq( Y, X ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( ssList( X ) ), =( cons( skaf83( X ), skaf82( X ) ), X ), =( nil, X
% 0.71/1.11 ) ],
% 0.71/1.11 [ ~( gt( X, Y ) ), ~( gt( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( =( X, Y ) ), ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), strictorderedP(
% 0.71/1.11 cons( Y, X ) ) ],
% 0.71/1.11 [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), totalorderedP(
% 0.71/1.11 cons( Y, X ) ) ],
% 0.71/1.11 [ ~( lt( X, Y ) ), ~( lt( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y ) ),
% 0.71/1.11 singletonP( Y ) ],
% 0.71/1.11 [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( nil
% 0.71/1.11 , X ) ],
% 0.71/1.11 [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( nil
% 0.71/1.11 , Y ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( app( cons( X, nil ), Y ), cons(
% 0.71/1.11 X, Y ) ) ],
% 0.71/1.11 [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Y ), =( X
% 0.71/1.11 , Y ) ],
% 0.71/1.11 [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Y ), =( X
% 0.71/1.11 , Y ) ],
% 0.71/1.11 [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( hd( app( Y, X ) )
% 0.71/1.11 , hd( Y ) ) ],
% 0.71/1.11 [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X )
% 0.71/1.11 ), strictorderedP( Y ), =( nil, Y ) ],
% 0.71/1.11 [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X ) )
% 0.71/1.11 , totalorderedP( Y ), =( nil, Y ) ],
% 0.71/1.11 [ ~( geq( X, Y ) ), ~( geq( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) )
% 0.71/1.11 , =( Y, X ) ],
% 0.71/1.11 [ ~( segmentP( X, Y ) ), ~( segmentP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.71/1.11 ssList( Y ) ), =( Y, X ) ],
% 0.71/1.11 [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.71/1.11 ssList( Y ) ), =( Y, X ) ],
% 0.71/1.11 [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.71/1.11 ssList( Y ) ), =( Y, X ) ],
% 0.71/1.11 [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) )
% 0.71/1.11 , =( Y, X ) ],
% 0.71/1.11 [ ~( rearsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app(
% 0.71/1.11 skaf46( X, Y ), Y ), X ) ],
% 0.71/1.11 [ ~( frontsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app( Y
% 0.71/1.11 , skaf45( X, Y ) ), X ) ],
% 0.71/1.11 [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( tl( app( Y, X ) )
% 0.71/1.11 , app( tl( Y ), X ) ) ],
% 0.71/1.11 [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X )
% 0.71/1.11 ), lt( X, hd( Y ) ), =( nil, Y ) ],
% 0.71/1.11 [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X ) )
% 0.71/1.11 , leq( X, hd( Y ) ), =( nil, Y ) ],
% 0.71/1.11 [ ~( rearsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ), ~( ssList(
% 0.71/1.11 X ) ), rearsegP( app( Z, X ), Y ) ],
% 0.71/1.11 [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ), ~( ssList(
% 0.71/1.11 X ) ), frontsegP( app( X, Z ), Y ) ],
% 0.71/1.11 [ ~( =( X, Y ) ), ~( ssList( Z ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ),
% 0.71/1.11 memberP( cons( Y, Z ), X ) ],
% 0.71/1.11 [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y
% 0.71/1.11 ) ), memberP( cons( Z, X ), Y ) ],
% 0.71/1.11 [ ~( memberP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y
% 0.71/1.11 ) ), memberP( app( X, Z ), Y ) ],
% 0.71/1.11 [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssList( Z ) ), ~( ssItem( Y
% 0.71/1.11 ) ), memberP( app( Z, X ), Y ) ],
% 0.71/1.11 [ ~( ssList( X ) ), equalelemsP( X ), =( app( skaf80( X ), cons( skaf78(
% 0.71/1.11 X ), cons( skaf79( X ), skaf81( X ) ) ) ), X ) ],
% 0.71/1.11 [ ~( =( app( X, Y ), Z ) ), ~( ssList( X ) ), ~( ssList( Y ) ), ~(
% 0.71/1.11 ssList( Z ) ), rearsegP( Z, Y ) ],
% 0.71/1.11 [ ~( =( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), ~(
% 0.71/1.11 ssList( Z ) ), frontsegP( Z, X ) ],
% 0.71/1.11 [ ~( =( nil, X ) ), ~( =( nil, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.71/1.11 , =( app( X, Y ), nil ) ],
% 0.71/1.11 [ ~( gt( X, Y ) ), ~( gt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ),
% 0.71/1.11 ~( ssItem( X ) ), gt( X, Z ) ],
% 0.71/1.11 [ ~( leq( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.71/1.11 , ~( ssItem( X ) ), lt( X, Z ) ],
% 0.71/1.11 [ ~( geq( X, Y ) ), ~( geq( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.71/1.11 , ~( ssItem( X ) ), geq( X, Z ) ],
% 0.71/1.11 [ ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =( app( app( Z,
% 0.71/1.11 Y ), X ), app( Z, app( Y, X ) ) ) ],
% 0.71/1.11 [ ~( =( app( X, Y ), app( X, Z ) ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.71/1.11 , ~( ssList( Z ) ), =( Y, Z ) ],
% 0.71/1.11 [ ~( =( app( X, Y ), app( Z, Y ) ) ), ~( ssList( X ) ), ~( ssList( Y ) )
% 0.71/1.11 , ~( ssList( Z ) ), =( X, Z ) ],
% 0.71/1.11 [ ~( segmentP( X, Y ) ), ~( segmentP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.71/1.11 ssList( Y ) ), ~( ssList( X ) ), segmentP( X, Z ) ],
% 0.71/1.11 [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.71/1.11 ssList( Y ) ), ~( ssList( X ) ), rearsegP( X, Z ) ],
% 0.71/1.11 [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.71/1.11 ssList( Y ) ), ~( ssList( X ) ), frontsegP( X, Z ) ],
% 0.71/1.11 [ ~( lt( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ),
% 0.71/1.11 ~( ssItem( X ) ), lt( X, Z ) ],
% 0.71/1.11 [ ~( leq( X, Y ) ), ~( leq( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.71/1.11 , ~( ssItem( X ) ), leq( X, Z ) ],
% 0.71/1.11 [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =( cons( X, app(
% 0.71/1.11 Y, Z ) ), app( cons( X, Y ), Z ) ) ],
% 0.71/1.11 [ ~( memberP( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ),
% 0.71/1.11 ~( ssItem( Z ) ), memberP( Y, Z ), memberP( X, Z ) ],
% 0.71/1.11 [ ~( leq( X, hd( Y ) ) ), ~( totalorderedP( Y ) ), ~( ssList( Y ) ), ~(
% 0.71/1.11 ssItem( X ) ), totalorderedP( cons( X, Y ) ), =( nil, Y ) ],
% 0.71/1.11 [ ~( lt( X, hd( Y ) ) ), ~( strictorderedP( Y ) ), ~( ssList( Y ) ), ~(
% 0.71/1.11 ssItem( X ) ), strictorderedP( cons( X, Y ) ), =( nil, Y ) ],
% 0.71/1.11 [ ~( memberP( cons( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssItem( X ) ),
% 0.71/1.11 ~( ssItem( Z ) ), memberP( Y, Z ), =( Z, X ) ],
% 0.71/1.11 [ ~( ssList( X ) ), duplicatefreeP( X ), =( app( app( skaf75( X ), cons(
% 0.71/1.11 skaf74( X ), skaf76( X ) ) ), cons( skaf74( X ), skaf77( X ) ) ), X ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( ssList( X ) ), strictorderedP( X ), =( app( app( skaf71( X ), cons(
% 0.71/1.11 skaf69( X ), skaf72( X ) ) ), cons( skaf70( X ), skaf73( X ) ) ), X ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( ssList( X ) ), totalorderedP( X ), =( app( app( skaf66( X ), cons(
% 0.71/1.11 skaf64( X ), skaf67( X ) ) ), cons( skaf65( X ), skaf68( X ) ) ), X ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( ssList( X ) ), strictorderP( X ), =( app( app( skaf61( X ), cons(
% 0.71/1.11 skaf59( X ), skaf62( X ) ) ), cons( skaf60( X ), skaf63( X ) ) ), X ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( ssList( X ) ), totalorderP( X ), =( app( app( skaf56( X ), cons(
% 0.71/1.11 skaf54( X ), skaf57( X ) ) ), cons( skaf55( X ), skaf58( X ) ) ), X ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( ssList( X ) ), cyclefreeP( X ), =( app( app( skaf51( X ), cons(
% 0.71/1.11 skaf49( X ), skaf52( X ) ) ), cons( skaf50( X ), skaf53( X ) ) ), X ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( segmentP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app( app(
% 0.71/1.11 skaf47( X, Y ), Y ), skaf48( Y, X ) ), X ) ],
% 0.71/1.11 [ ~( memberP( X, Y ) ), ~( ssItem( Y ) ), ~( ssList( X ) ), =( app(
% 0.71/1.11 skaf42( X, Y ), cons( Y, skaf43( Y, X ) ) ), X ) ],
% 0.71/1.11 [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ), ~( ssItem( X )
% 0.71/1.11 ), ~( ssList( T ) ), ~( ssList( Y ) ), =( X, Z ) ],
% 0.71/1.11 [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ), ~( ssItem( X )
% 0.71/1.11 ), ~( ssList( T ) ), ~( ssList( Y ) ), =( T, Y ) ],
% 0.71/1.11 [ ~( segmentP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( T ) ), ~( ssList(
% 0.71/1.11 Y ) ), ~( ssList( X ) ), segmentP( app( app( T, X ), Z ), Y ) ],
% 0.71/1.11 [ ~( =( app( app( X, Y ), Z ), T ) ), ~( ssList( Z ) ), ~( ssList( X ) )
% 0.71/1.11 , ~( ssList( Y ) ), ~( ssList( T ) ), segmentP( T, Y ) ],
% 0.71/1.11 [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T ) ), ~(
% 0.71/1.11 ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), frontsegP( Y, T ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( =( app( X, cons( Y, Z ) ), T ) ), ~( ssList( Z ) ), ~( ssList( X )
% 0.71/1.11 ), ~( ssItem( Y ) ), ~( ssList( T ) ), memberP( T, Y ) ],
% 0.71/1.11 [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T ) ), ~(
% 0.71/1.11 ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), =( X, Z ) ],
% 0.71/1.11 [ ~( =( tl( X ), tl( Y ) ) ), ~( =( hd( X ), hd( Y ) ) ), ~( ssList( X )
% 0.71/1.11 ), ~( ssList( Y ) ), =( nil, Y ), =( X, Y ), =( nil, X ) ],
% 0.71/1.11 [ ~( frontsegP( X, Y ) ), ~( =( Z, T ) ), ~( ssList( Y ) ), ~( ssList( X
% 0.71/1.11 ) ), ~( ssItem( T ) ), ~( ssItem( Z ) ), frontsegP( cons( Z, X ), cons(
% 0.71/1.11 T, Y ) ) ],
% 0.71/1.11 [ ~( =( app( app( X, cons( Y, Z ) ), cons( Y, T ) ), U ) ), ~( ssList( T
% 0.71/1.11 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), ~(
% 0.71/1.11 duplicatefreeP( U ) ), ~( ssList( U ) ) ],
% 0.71/1.11 [ ~( =( app( X, cons( Y, cons( Z, T ) ) ), U ) ), ~( ssList( T ) ), ~(
% 0.71/1.11 ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ), ~( equalelemsP( U ) )
% 0.71/1.11 , ~( ssList( U ) ), =( Y, Z ) ],
% 0.71/1.11 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.71/1.11 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.71/1.11 ) ), ~( strictorderedP( W ) ), ~( ssList( W ) ), lt( Y, T ) ],
% 0.71/1.11 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.71/1.11 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.71/1.11 ) ), ~( totalorderedP( W ) ), ~( ssList( W ) ), leq( Y, T ) ],
% 0.71/1.11 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.71/1.11 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.71/1.11 ) ), ~( strictorderP( W ) ), ~( ssList( W ) ), lt( Y, T ), lt( T, Y ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.71/1.11 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.71/1.11 ) ), ~( totalorderP( W ) ), ~( ssList( W ) ), leq( Y, T ), leq( T, Y ) ]
% 0.71/1.11 ,
% 0.71/1.11 [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( =( app( app( Z, cons( X, T ) )
% 0.71/1.11 , cons( Y, U ) ), W ) ), ~( ssList( U ) ), ~( ssList( T ) ), ~( ssList( Z
% 0.71/1.11 ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), ~( cyclefreeP( W ) ), ~( ssList(
% 0.71/1.11 W ) ) ],
% 0.71/1.11 [ ssList( sk1 ) ],
% 0.71/1.11 [ ssList( sk2 ) ],
% 0.71/1.11 [ ssList( sk3 ) ],
% 0.71/1.11 [ ssList( sk4 ) ],
% 0.71/1.11 [ =( nil, sk3 ) ],
% 0.71/1.11 [ =( sk2, sk4 ) ],
% 0.71/1.11 [ =( sk1, sk3 ) ],
% 0.71/1.11 [ neq( sk2, nil ) ],
% 0.71/1.11 [ ~( frontsegP( sk2, sk1 ) ) ]
% 0.71/1.11 ] .
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 percentage equality = 0.162791, percentage horn = 0.842932
% 0.71/1.11 This is a problem with some equality
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Options Used:
% 0.71/1.11
% 0.71/1.11 useres = 1
% 0.71/1.11 useparamod = 1
% 0.71/1.11 useeqrefl = 1
% 0.71/1.11 useeqfact = 1
% 0.71/1.11 usefactor = 1
% 0.71/1.11 usesimpsplitting = 0
% 0.71/1.11 usesimpdemod = 5
% 0.71/1.11 usesimpres = 3
% 0.71/1.11
% 0.71/1.11 resimpinuse = 1000
% 0.71/1.11 resimpclauses = 20000
% 0.71/1.11 substype = eqrewr
% 0.71/1.11 backwardsubs = 1
% 0.71/1.11 selectoldest = 5
% 0.71/1.11
% 0.71/1.11 litorderings [0] = split
% 0.71/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.11
% 0.71/1.11 termordering = kbo
% 0.71/1.11
% 0.71/1.11 litapriori = 0
% 0.71/1.11 termapriori = 1
% 0.71/1.11 litaposteriori = 0
% 0.71/1.11 termaposteriori = 0
% 0.71/1.11 demodaposteriori = 0
% 0.71/1.11 ordereqreflfact = 0
% 0.71/1.11
% 0.71/1.11 litselect = negord
% 0.71/1.11
% 0.71/1.11 maxweight = 15
% 0.71/1.11 maxdepth = 30000
% 0.71/1.11 maxlength = 115
% 0.71/1.11 maxnrvars = 195
% 0.71/1.11 excuselevel = 1
% 0.71/1.11 increasemaxweight = 1
% 0.71/1.11
% 0.71/1.11 maxselected = 10000000
% 0.71/1.11 maxnrclauses = 10000000
% 0.71/1.11
% 0.71/1.11 showgenerated = 0
% 0.71/1.11 showkept = 0
% 0.71/1.11 showselected = 0
% 0.71/1.11 showdeleted = 0
% 0.71/1.11 showresimp = 1
% 0.71/1.11 showstatus = 2000
% 0.71/1.11
% 0.71/1.11 prologoutput = 1
% 0.71/1.11 nrgoals = 5000000
% 0.71/1.11 totalproof = 1
% 0.71/1.11
% 0.71/1.11 Symbols occurring in the translation:
% 0.71/1.11
% 0.71/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.11 . [1, 2] (w:1, o:75, a:1, s:1, b:0),
% 0.71/1.11 ! [4, 1] (w:0, o:22, a:1, s:1, b:0),
% 0.71/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.11 nil [39, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.71/1.11 equalelemsP [40, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.71/1.11 duplicatefreeP [41, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.71/1.11 strictorderedP [42, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.71/1.11 totalorderedP [43, 1] (w:1, o:71, a:1, s:1, b:0),
% 0.71/1.11 strictorderP [44, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.71/1.11 totalorderP [45, 1] (w:1, o:72, a:1, s:1, b:0),
% 0.71/1.11 cyclefreeP [46, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.71/1.11 ssList [47, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.71/1.11 skac3 [48, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.71/1.11 ssItem [49, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.71/1.11 skac2 [50, 0] (w:1, o:5, a:1, s:1, b:0),
% 0.71/1.11 singletonP [51, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.71/1.11 skaf83 [53, 1] (w:1, o:70, a:1, s:1, b:0),
% 0.71/1.11 skaf82 [54, 1] (w:1, o:69, a:1, s:1, b:0),
% 0.71/1.11 skaf81 [55, 1] (w:1, o:68, a:1, s:1, b:0),
% 0.71/1.11 skaf80 [56, 1] (w:1, o:67, a:1, s:1, b:0),
% 0.71/1.11 skaf79 [57, 1] (w:1, o:66, a:1, s:1, b:0),
% 0.71/1.11 skaf78 [58, 1] (w:1, o:65, a:1, s:1, b:0),
% 0.71/1.11 skaf77 [59, 1] (w:1, o:64, a:1, s:1, b:0),
% 0.71/1.11 skaf76 [60, 1] (w:1, o:63, a:1, s:1, b:0),
% 0.71/1.11 skaf75 [61, 1] (w:1, o:62, a:1, s:1, b:0),
% 0.71/1.11 skaf74 [62, 1] (w:1, o:61, a:1, s:1, b:0),
% 0.71/1.11 skaf73 [63, 1] (w:1, o:60, a:1, s:1, b:0),
% 0.71/1.11 skaf72 [64, 1] (w:1, o:59, a:1, s:1, b:0),
% 0.71/1.11 skaf71 [65, 1] (w:1, o:58, a:1, s:1, b:0),
% 0.71/1.11 skaf70 [66, 1] (w:1, o:57, a:1, s:1, b:0),
% 0.71/1.11 skaf69 [67, 1] (w:1, o:56, a:1, s:1, b:0),
% 0.71/1.11 skaf68 [68, 1] (w:1, o:55, a:1, s:1, b:0),
% 0.71/1.11 skaf67 [69, 1] (w:1, o:54, a:1, s:1, b:0),
% 0.71/1.11 skaf66 [70, 1] (w:1, o:53, a:1, s:1, b:0),
% 0.71/1.11 skaf65 [71, 1] (w:1, o:52, a:1, s:1, b:0),
% 0.71/1.11 skaf64 [72, 1] (w:1, o:51, a:1, s:1, b:0),
% 0.71/1.11 skaf63 [73, 1] (w:1, o:50, a:1, s:1, b:0),
% 0.71/1.11 skaf62 [74, 1] (w:1, o:49, a:1, s:1, b:0),
% 0.71/1.11 skaf61 [75, 1] (w:1, o:48, a:1, s:1, b:0),
% 0.71/1.11 skaf60 [76, 1] (w:1, o:47, a:1, s:1, b:0),
% 0.71/1.11 skaf59 [77, 1] (w:1, o:46, a:1, s:1, b:0),
% 0.71/1.11 skaf58 [78, 1] (w:1, o:45, a:1, s:1, b:0),
% 0.71/1.11 skaf57 [79, 1] (w:1, o:44, a:1, s:1, b:0),
% 0.71/1.11 skaf56 [80, 1] (w:1, o:43, a:1, s:1, b:0),
% 0.71/1.11 skaf55 [81, 1] (w:1, o:42, a:1, s:1, b:0),
% 0.71/1.11 skaf54 [82, 1] (w:1, o:41, a:1, s:1, b:0),
% 0.71/1.11 skaf53 [83, 1] (w:1, o:40, a:1, s:1, b:0),
% 0.71/1.11 skaf52 [84, 1] (w:1, o:39, a:1, s:1, b:0),
% 0.71/1.11 skaf51 [85, 1] (w:1, o:38, a:1, s:1, b:0),
% 0.71/1.11 skaf50 [86, 1] (w:1, o:37, a:1, s:1, b:0),
% 0.71/1.11 skaf49 [87, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.71/1.11 skaf44 [88, 1] (w:1, o:36, a:1, s:1, b:0),
% 0.71/1.11 skaf48 [90, 2] (w:1, o:104, a:1, s:1, b:0),
% 0.71/1.11 skaf47 [91, 2] (w:1, o:103, a:1, s:1, b:0),
% 0.71/1.11 skaf46 [92, 2] (w:1, o:102, a:1, s:1, b:0),
% 0.71/1.11 skaf45 [93, 2] (w:1, o:101, a:1, s:1, b:0),
% 0.71/1.11 skaf43 [94, 2] (w:1, o:106, a:1, s:1, b:0),
% 0.71/1.11 skaf42 [95, 2] (w:1, o:105, a:1, s:1, b:0),
% 0.71/1.11 geq [96, 2] (w:1, o:108, a:1, s:1, b:0),
% 0.71/1.11 segmentP [97, 2] (w:1, o:109, a:1, s:1, b:0),
% 0.71/1.11 rearsegP [98, 2] (w:1, o:100, a:1, s:1, b:0),
% 0.71/1.11 frontsegP [99, 2] (w:1, o:107, a:1, s:1, b:0),
% 0.71/1.11 leq [100, 2] (w:1, o:110, a:1, s:1, b:0),
% 0.71/1.11 lt [101, 2] (w:1, o:111, a:1, s:1, b:0),
% 0.71/1.11 cons [102, 2] (w:1, o:112, a:1, s:1, b:0),
% 0.71/1.11 memberP [103, 2] (w:1, o:113, a:1, s:1, b:0),
% 0.71/1.11 app [104, 2] (w:1, o:114, a:1, s:1, b:0),
% 0.71/1.11 tl [105, 1] (w:1, o:73, a:1, s:1, b:0),
% 0.71/1.11 hd [106, 1] (w:1, o:74, a:1, s:1, b:0),
% 0.71/1.11 neq [107, 2] (w:1, o:115, a:1, s:1, b:0),
% 0.71/1.11 gt [108, 2] (w:1, o:116, a:1, s:1, b:0),
% 0.71/1.11 sk1 [113, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.71/1.11 sk2 [114, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.71/1.11 sk3 [115, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.71/1.11 sk4 [116, 0] (w:1, o:10, a:1, s:1, b:0).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Starting Search:
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Bliksems!, er is een bewijs:
% 0.71/1.11 % SZS status Unsatisfiable
% 0.71/1.11 % SZS output start Refutation
% 0.71/1.11
% 0.71/1.11 clause( 59, [ ~( ssList( X ) ), frontsegP( X, nil ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 183, [ ssList( sk2 ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 186, [ =( nil, sk3 ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 188, [ =( sk3, sk1 ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 190, [ ~( frontsegP( sk2, sk1 ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 326, [ =( nil, sk1 ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 447, [ ~( ssList( X ) ), frontsegP( X, sk1 ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 537, [] )
% 0.71/1.11 .
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 % SZS output end Refutation
% 0.71/1.11 found a proof!
% 0.71/1.11
% 0.71/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.11
% 0.71/1.11 initialclauses(
% 0.71/1.11 [ clause( 539, [ equalelemsP( nil ) ] )
% 0.71/1.11 , clause( 540, [ duplicatefreeP( nil ) ] )
% 0.71/1.11 , clause( 541, [ strictorderedP( nil ) ] )
% 0.71/1.11 , clause( 542, [ totalorderedP( nil ) ] )
% 0.71/1.11 , clause( 543, [ strictorderP( nil ) ] )
% 0.71/1.11 , clause( 544, [ totalorderP( nil ) ] )
% 0.71/1.11 , clause( 545, [ cyclefreeP( nil ) ] )
% 0.71/1.11 , clause( 546, [ ssList( nil ) ] )
% 0.71/1.11 , clause( 547, [ ssItem( skac3 ) ] )
% 0.71/1.11 , clause( 548, [ ssItem( skac2 ) ] )
% 0.71/1.11 , clause( 549, [ ~( singletonP( nil ) ) ] )
% 0.71/1.11 , clause( 550, [ ssItem( skaf83( X ) ) ] )
% 0.71/1.11 , clause( 551, [ ssList( skaf82( X ) ) ] )
% 0.71/1.11 , clause( 552, [ ssList( skaf81( X ) ) ] )
% 0.71/1.11 , clause( 553, [ ssList( skaf80( X ) ) ] )
% 0.71/1.11 , clause( 554, [ ssItem( skaf79( X ) ) ] )
% 0.71/1.11 , clause( 555, [ ssItem( skaf78( X ) ) ] )
% 0.71/1.11 , clause( 556, [ ssList( skaf77( X ) ) ] )
% 0.71/1.11 , clause( 557, [ ssList( skaf76( X ) ) ] )
% 0.71/1.11 , clause( 558, [ ssList( skaf75( X ) ) ] )
% 0.71/1.11 , clause( 559, [ ssItem( skaf74( X ) ) ] )
% 0.71/1.11 , clause( 560, [ ssList( skaf73( X ) ) ] )
% 0.71/1.11 , clause( 561, [ ssList( skaf72( X ) ) ] )
% 0.71/1.11 , clause( 562, [ ssList( skaf71( X ) ) ] )
% 0.71/1.11 , clause( 563, [ ssItem( skaf70( X ) ) ] )
% 0.71/1.11 , clause( 564, [ ssItem( skaf69( X ) ) ] )
% 0.71/1.11 , clause( 565, [ ssList( skaf68( X ) ) ] )
% 0.71/1.11 , clause( 566, [ ssList( skaf67( X ) ) ] )
% 0.71/1.11 , clause( 567, [ ssList( skaf66( X ) ) ] )
% 0.71/1.11 , clause( 568, [ ssItem( skaf65( X ) ) ] )
% 0.71/1.11 , clause( 569, [ ssItem( skaf64( X ) ) ] )
% 0.71/1.11 , clause( 570, [ ssList( skaf63( X ) ) ] )
% 0.71/1.11 , clause( 571, [ ssList( skaf62( X ) ) ] )
% 0.71/1.11 , clause( 572, [ ssList( skaf61( X ) ) ] )
% 0.71/1.11 , clause( 573, [ ssItem( skaf60( X ) ) ] )
% 0.71/1.11 , clause( 574, [ ssItem( skaf59( X ) ) ] )
% 0.71/1.11 , clause( 575, [ ssList( skaf58( X ) ) ] )
% 0.71/1.11 , clause( 576, [ ssList( skaf57( X ) ) ] )
% 0.71/1.11 , clause( 577, [ ssList( skaf56( X ) ) ] )
% 0.71/1.11 , clause( 578, [ ssItem( skaf55( X ) ) ] )
% 0.71/1.11 , clause( 579, [ ssItem( skaf54( X ) ) ] )
% 0.71/1.11 , clause( 580, [ ssList( skaf53( X ) ) ] )
% 0.71/1.11 , clause( 581, [ ssList( skaf52( X ) ) ] )
% 0.71/1.11 , clause( 582, [ ssList( skaf51( X ) ) ] )
% 0.71/1.11 , clause( 583, [ ssItem( skaf50( X ) ) ] )
% 0.71/1.11 , clause( 584, [ ssItem( skaf49( X ) ) ] )
% 0.71/1.11 , clause( 585, [ ssItem( skaf44( X ) ) ] )
% 0.71/1.11 , clause( 586, [ ssList( skaf48( X, Y ) ) ] )
% 0.71/1.11 , clause( 587, [ ssList( skaf47( X, Y ) ) ] )
% 0.71/1.11 , clause( 588, [ ssList( skaf46( X, Y ) ) ] )
% 0.71/1.11 , clause( 589, [ ssList( skaf45( X, Y ) ) ] )
% 0.71/1.11 , clause( 590, [ ssList( skaf43( X, Y ) ) ] )
% 0.71/1.11 , clause( 591, [ ssList( skaf42( X, Y ) ) ] )
% 0.71/1.11 , clause( 592, [ ~( =( skac3, skac2 ) ) ] )
% 0.71/1.11 , clause( 593, [ ~( ssItem( X ) ), geq( X, X ) ] )
% 0.71/1.11 , clause( 594, [ ~( ssList( X ) ), segmentP( X, nil ) ] )
% 0.71/1.11 , clause( 595, [ ~( ssList( X ) ), segmentP( X, X ) ] )
% 0.71/1.11 , clause( 596, [ ~( ssList( X ) ), rearsegP( X, nil ) ] )
% 0.71/1.11 , clause( 597, [ ~( ssList( X ) ), rearsegP( X, X ) ] )
% 0.71/1.11 , clause( 598, [ ~( ssList( X ) ), frontsegP( X, nil ) ] )
% 0.71/1.11 , clause( 599, [ ~( ssList( X ) ), frontsegP( X, X ) ] )
% 0.71/1.11 , clause( 600, [ ~( ssItem( X ) ), leq( X, X ) ] )
% 0.71/1.11 , clause( 601, [ ~( lt( X, X ) ), ~( ssItem( X ) ) ] )
% 0.71/1.11 , clause( 602, [ ~( ssItem( X ) ), equalelemsP( cons( X, nil ) ) ] )
% 0.71/1.11 , clause( 603, [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ] )
% 0.71/1.11 , clause( 604, [ ~( ssItem( X ) ), strictorderedP( cons( X, nil ) ) ] )
% 0.71/1.11 , clause( 605, [ ~( ssItem( X ) ), totalorderedP( cons( X, nil ) ) ] )
% 0.71/1.11 , clause( 606, [ ~( ssItem( X ) ), strictorderP( cons( X, nil ) ) ] )
% 0.71/1.11 , clause( 607, [ ~( ssItem( X ) ), totalorderP( cons( X, nil ) ) ] )
% 0.71/1.11 , clause( 608, [ ~( ssItem( X ) ), cyclefreeP( cons( X, nil ) ) ] )
% 0.71/1.11 , clause( 609, [ ~( memberP( nil, X ) ), ~( ssItem( X ) ) ] )
% 0.71/1.11 , clause( 610, [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ] )
% 0.71/1.11 , clause( 611, [ ~( ssList( X ) ), =( app( X, nil ), X ) ] )
% 0.71/1.11 , clause( 612, [ ~( ssList( X ) ), =( app( nil, X ), X ) ] )
% 0.71/1.11 , clause( 613, [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ] )
% 0.71/1.11 , clause( 614, [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ] )
% 0.71/1.11 , clause( 615, [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ] )
% 0.71/1.11 , clause( 616, [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ] )
% 0.71/1.11 , clause( 617, [ ~( =( nil, X ) ), ~( ssList( X ) ), segmentP( nil, X ) ]
% 0.71/1.11 )
% 0.71/1.11 , clause( 618, [ ~( segmentP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 0.71/1.11 )
% 0.71/1.11 , clause( 619, [ ~( =( nil, X ) ), ~( ssList( X ) ), rearsegP( nil, X ) ]
% 0.71/1.11 )
% 0.71/1.11 , clause( 620, [ ~( rearsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 0.71/1.11 )
% 0.71/1.11 , clause( 621, [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X ) ]
% 0.71/1.11 )
% 0.71/1.11 , clause( 622, [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 0.71/1.11 )
% 0.71/1.11 , clause( 623, [ ~( ssList( X ) ), ~( ssList( Y ) ), ssList( app( Y, X ) )
% 0.71/1.11 ] )
% 0.71/1.11 , clause( 624, [ ~( ssItem( X ) ), ~( ssList( Y ) ), ssList( cons( X, Y ) )
% 0.71/1.11 ] )
% 0.71/1.11 , clause( 625, [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf50( X ),
% 0.71/1.11 skaf49( X ) ) ] )
% 0.71/1.11 , clause( 626, [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf49( X ),
% 0.71/1.11 skaf50( X ) ) ] )
% 0.71/1.11 , clause( 627, [ ~( =( skaf79( X ), skaf78( X ) ) ), ~( ssList( X ) ),
% 0.71/1.11 equalelemsP( X ) ] )
% 0.71/1.11 , clause( 628, [ ~( lt( skaf69( X ), skaf70( X ) ) ), ~( ssList( X ) ),
% 0.71/1.11 strictorderedP( X ) ] )
% 0.71/1.11 , clause( 629, [ ~( leq( skaf64( X ), skaf65( X ) ) ), ~( ssList( X ) ),
% 0.71/1.11 totalorderedP( X ) ] )
% 0.71/1.11 , clause( 630, [ ~( lt( skaf60( X ), skaf59( X ) ) ), ~( ssList( X ) ),
% 0.71/1.11 strictorderP( X ) ] )
% 0.71/1.11 , clause( 631, [ ~( lt( skaf59( X ), skaf60( X ) ) ), ~( ssList( X ) ),
% 0.71/1.11 strictorderP( X ) ] )
% 0.71/1.11 , clause( 632, [ ~( leq( skaf55( X ), skaf54( X ) ) ), ~( ssList( X ) ),
% 0.71/1.11 totalorderP( X ) ] )
% 0.71/1.11 , clause( 633, [ ~( leq( skaf54( X ), skaf55( X ) ) ), ~( ssList( X ) ),
% 0.71/1.11 totalorderP( X ) ] )
% 0.71/1.11 , clause( 634, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( tl( cons( X, Y ) )
% 0.71/1.11 , Y ) ] )
% 0.71/1.11 , clause( 635, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( hd( cons( X, Y ) )
% 0.71/1.11 , X ) ] )
% 0.71/1.11 , clause( 636, [ ~( =( cons( X, Y ), nil ) ), ~( ssItem( X ) ), ~( ssList(
% 0.71/1.11 Y ) ) ] )
% 0.71/1.11 , clause( 637, [ ~( =( cons( X, Y ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y
% 0.71/1.11 ) ) ] )
% 0.71/1.11 , clause( 638, [ ~( ssList( X ) ), ~( ssList( Y ) ), neq( Y, X ), =( Y, X )
% 0.71/1.11 ] )
% 0.71/1.11 , clause( 639, [ ~( singletonP( X ) ), ~( ssList( X ) ), =( cons( skaf44( X
% 0.71/1.11 ), nil ), X ) ] )
% 0.71/1.11 , clause( 640, [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X )
% 0.71/1.11 ] )
% 0.71/1.11 , clause( 641, [ ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq(
% 0.71/1.11 X, Y ) ] )
% 0.71/1.11 , clause( 642, [ ~( ssList( X ) ), =( cons( hd( X ), tl( X ) ), X ), =( nil
% 0.71/1.11 , X ) ] )
% 0.71/1.11 , clause( 643, [ ~( gt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( Y
% 0.71/1.11 , X ) ] )
% 0.71/1.11 , clause( 644, [ ~( lt( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), gt( Y
% 0.71/1.11 , X ) ] )
% 0.71/1.11 , clause( 645, [ ~( geq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq(
% 0.71/1.11 Y, X ) ] )
% 0.71/1.11 , clause( 646, [ ~( leq( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), geq(
% 0.71/1.11 Y, X ) ] )
% 0.71/1.11 , clause( 647, [ ~( ssList( X ) ), =( cons( skaf83( X ), skaf82( X ) ), X )
% 0.71/1.11 , =( nil, X ) ] )
% 0.71/1.11 , clause( 648, [ ~( gt( X, Y ) ), ~( gt( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.71/1.11 ssItem( Y ) ) ] )
% 0.71/1.11 , clause( 649, [ ~( =( X, Y ) ), ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~(
% 0.71/1.11 ssItem( X ) ) ] )
% 0.71/1.11 , clause( 650, [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 0.71/1.11 strictorderedP( cons( Y, X ) ) ] )
% 0.71/1.11 , clause( 651, [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 0.71/1.11 totalorderedP( cons( Y, X ) ) ] )
% 0.71/1.11 , clause( 652, [ ~( lt( X, Y ) ), ~( lt( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.71/1.11 ssItem( Y ) ) ] )
% 0.71/1.11 , clause( 653, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssList( Y ) ), ~(
% 0.71/1.11 ssList( X ) ) ] )
% 0.71/1.11 , clause( 654, [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList(
% 0.71/1.11 Y ) ), singletonP( Y ) ] )
% 0.71/1.11 , clause( 655, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~(
% 0.71/1.11 ssItem( X ) ) ] )
% 0.71/1.11 , clause( 656, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X
% 0.71/1.11 ) ), =( nil, X ) ] )
% 0.71/1.11 , clause( 657, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X
% 0.71/1.11 ) ), =( nil, Y ) ] )
% 0.71/1.11 , clause( 658, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( app( cons( X, nil )
% 0.71/1.11 , Y ), cons( X, Y ) ) ] )
% 0.71/1.11 , clause( 659, [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 0.71/1.11 X, Y ), =( X, Y ) ] )
% 0.71/1.11 , clause( 660, [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 0.71/1.11 X, Y ), =( X, Y ) ] )
% 0.71/1.11 , clause( 661, [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( hd(
% 0.71/1.11 app( Y, X ) ), hd( Y ) ) ] )
% 0.71/1.11 , clause( 662, [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~(
% 0.71/1.11 ssItem( X ) ), strictorderedP( Y ), =( nil, Y ) ] )
% 0.71/1.11 , clause( 663, [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~(
% 0.71/1.11 ssItem( X ) ), totalorderedP( Y ), =( nil, Y ) ] )
% 0.71/1.11 , clause( 664, [ ~( geq( X, Y ) ), ~( geq( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.71/1.11 ssItem( Y ) ), =( Y, X ) ] )
% 0.71/1.11 , clause( 665, [ ~( segmentP( X, Y ) ), ~( segmentP( Y, X ) ), ~( ssList( X
% 0.71/1.11 ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.71/1.11 , clause( 666, [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, X ) ), ~( ssList( X
% 0.71/1.11 ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.71/1.11 , clause( 667, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~( ssList(
% 0.71/1.11 X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.71/1.11 , clause( 668, [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.71/1.11 ssItem( Y ) ), =( Y, X ) ] )
% 0.71/1.11 , clause( 669, [ ~( rearsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.71/1.11 , =( app( skaf46( X, Y ), Y ), X ) ] )
% 0.71/1.11 , clause( 670, [ ~( frontsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.71/1.11 , =( app( Y, skaf45( X, Y ) ), X ) ] )
% 0.71/1.11 , clause( 671, [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( tl(
% 0.71/1.11 app( Y, X ) ), app( tl( Y ), X ) ) ] )
% 0.71/1.11 , clause( 672, [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~(
% 0.71/1.11 ssItem( X ) ), lt( X, hd( Y ) ), =( nil, Y ) ] )
% 0.71/1.11 , clause( 673, [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~(
% 0.71/1.11 ssItem( X ) ), leq( X, hd( Y ) ), =( nil, Y ) ] )
% 0.71/1.11 , clause( 674, [ ~( rearsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) )
% 0.71/1.11 , ~( ssList( X ) ), rearsegP( app( Z, X ), Y ) ] )
% 0.71/1.11 , clause( 675, [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) )
% 0.71/1.11 , ~( ssList( X ) ), frontsegP( app( X, Z ), Y ) ] )
% 0.71/1.11 , clause( 676, [ ~( =( X, Y ) ), ~( ssList( Z ) ), ~( ssItem( Y ) ), ~(
% 0.71/1.11 ssItem( X ) ), memberP( cons( Y, Z ), X ) ] )
% 0.71/1.11 , clause( 677, [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssItem( Z ) ),
% 0.71/1.11 ~( ssItem( Y ) ), memberP( cons( Z, X ), Y ) ] )
% 0.71/1.11 , clause( 678, [ ~( memberP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( X ) ),
% 0.71/1.11 ~( ssItem( Y ) ), memberP( app( X, Z ), Y ) ] )
% 0.71/1.11 , clause( 679, [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssList( Z ) ),
% 0.71/1.11 ~( ssItem( Y ) ), memberP( app( Z, X ), Y ) ] )
% 0.71/1.11 , clause( 680, [ ~( ssList( X ) ), equalelemsP( X ), =( app( skaf80( X ),
% 0.71/1.11 cons( skaf78( X ), cons( skaf79( X ), skaf81( X ) ) ) ), X ) ] )
% 0.71/1.11 , clause( 681, [ ~( =( app( X, Y ), Z ) ), ~( ssList( X ) ), ~( ssList( Y )
% 0.71/1.11 ), ~( ssList( Z ) ), rearsegP( Z, Y ) ] )
% 0.71/1.11 , clause( 682, [ ~( =( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X )
% 0.71/1.11 ), ~( ssList( Z ) ), frontsegP( Z, X ) ] )
% 0.71/1.11 , clause( 683, [ ~( =( nil, X ) ), ~( =( nil, Y ) ), ~( ssList( Y ) ), ~(
% 0.71/1.11 ssList( X ) ), =( app( X, Y ), nil ) ] )
% 0.71/1.11 , clause( 684, [ ~( gt( X, Y ) ), ~( gt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.71/1.11 ssItem( Y ) ), ~( ssItem( X ) ), gt( X, Z ) ] )
% 0.71/1.11 , clause( 685, [ ~( leq( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.71/1.11 ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Z ) ] )
% 0.71/1.11 , clause( 686, [ ~( geq( X, Y ) ), ~( geq( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.71/1.11 ssItem( Y ) ), ~( ssItem( X ) ), geq( X, Z ) ] )
% 0.71/1.11 , clause( 687, [ ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =(
% 0.71/1.11 app( app( Z, Y ), X ), app( Z, app( Y, X ) ) ) ] )
% 0.71/1.11 , clause( 688, [ ~( =( app( X, Y ), app( X, Z ) ) ), ~( ssList( Y ) ), ~(
% 0.71/1.11 ssList( X ) ), ~( ssList( Z ) ), =( Y, Z ) ] )
% 0.71/1.11 , clause( 689, [ ~( =( app( X, Y ), app( Z, Y ) ) ), ~( ssList( X ) ), ~(
% 0.71/1.11 ssList( Y ) ), ~( ssList( Z ) ), =( X, Z ) ] )
% 0.71/1.11 , clause( 690, [ ~( segmentP( X, Y ) ), ~( segmentP( Y, Z ) ), ~( ssList( Z
% 0.71/1.11 ) ), ~( ssList( Y ) ), ~( ssList( X ) ), segmentP( X, Z ) ] )
% 0.71/1.11 , clause( 691, [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, Z ) ), ~( ssList( Z
% 0.71/1.11 ) ), ~( ssList( Y ) ), ~( ssList( X ) ), rearsegP( X, Z ) ] )
% 0.71/1.11 , clause( 692, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, Z ) ), ~( ssList(
% 0.71/1.11 Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), frontsegP( X, Z ) ] )
% 0.71/1.11 , clause( 693, [ ~( lt( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.71/1.11 ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Z ) ] )
% 0.71/1.11 , clause( 694, [ ~( leq( X, Y ) ), ~( leq( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.71/1.11 ssItem( Y ) ), ~( ssItem( X ) ), leq( X, Z ) ] )
% 0.71/1.11 , clause( 695, [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =(
% 0.71/1.11 cons( X, app( Y, Z ) ), app( cons( X, Y ), Z ) ) ] )
% 0.71/1.11 , clause( 696, [ ~( memberP( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~(
% 0.71/1.11 ssList( X ) ), ~( ssItem( Z ) ), memberP( Y, Z ), memberP( X, Z ) ] )
% 0.71/1.11 , clause( 697, [ ~( leq( X, hd( Y ) ) ), ~( totalorderedP( Y ) ), ~( ssList(
% 0.71/1.11 Y ) ), ~( ssItem( X ) ), totalorderedP( cons( X, Y ) ), =( nil, Y ) ] )
% 0.71/1.11 , clause( 698, [ ~( lt( X, hd( Y ) ) ), ~( strictorderedP( Y ) ), ~( ssList(
% 0.71/1.11 Y ) ), ~( ssItem( X ) ), strictorderedP( cons( X, Y ) ), =( nil, Y ) ] )
% 0.71/1.11 , clause( 699, [ ~( memberP( cons( X, Y ), Z ) ), ~( ssList( Y ) ), ~(
% 0.71/1.11 ssItem( X ) ), ~( ssItem( Z ) ), memberP( Y, Z ), =( Z, X ) ] )
% 0.71/1.11 , clause( 700, [ ~( ssList( X ) ), duplicatefreeP( X ), =( app( app( skaf75(
% 0.71/1.11 X ), cons( skaf74( X ), skaf76( X ) ) ), cons( skaf74( X ), skaf77( X ) )
% 0.71/1.11 ), X ) ] )
% 0.71/1.11 , clause( 701, [ ~( ssList( X ) ), strictorderedP( X ), =( app( app( skaf71(
% 0.71/1.11 X ), cons( skaf69( X ), skaf72( X ) ) ), cons( skaf70( X ), skaf73( X ) )
% 0.71/1.11 ), X ) ] )
% 0.71/1.11 , clause( 702, [ ~( ssList( X ) ), totalorderedP( X ), =( app( app( skaf66(
% 0.71/1.11 X ), cons( skaf64( X ), skaf67( X ) ) ), cons( skaf65( X ), skaf68( X ) )
% 0.71/1.11 ), X ) ] )
% 0.71/1.11 , clause( 703, [ ~( ssList( X ) ), strictorderP( X ), =( app( app( skaf61(
% 0.71/1.11 X ), cons( skaf59( X ), skaf62( X ) ) ), cons( skaf60( X ), skaf63( X ) )
% 0.71/1.11 ), X ) ] )
% 0.71/1.11 , clause( 704, [ ~( ssList( X ) ), totalorderP( X ), =( app( app( skaf56( X
% 0.71/1.11 ), cons( skaf54( X ), skaf57( X ) ) ), cons( skaf55( X ), skaf58( X ) )
% 0.71/1.11 ), X ) ] )
% 0.71/1.11 , clause( 705, [ ~( ssList( X ) ), cyclefreeP( X ), =( app( app( skaf51( X
% 0.71/1.11 ), cons( skaf49( X ), skaf52( X ) ) ), cons( skaf50( X ), skaf53( X ) )
% 0.71/1.11 ), X ) ] )
% 0.71/1.11 , clause( 706, [ ~( segmentP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.71/1.11 , =( app( app( skaf47( X, Y ), Y ), skaf48( Y, X ) ), X ) ] )
% 0.71/1.11 , clause( 707, [ ~( memberP( X, Y ) ), ~( ssItem( Y ) ), ~( ssList( X ) ),
% 0.71/1.11 =( app( skaf42( X, Y ), cons( Y, skaf43( Y, X ) ) ), X ) ] )
% 0.71/1.11 , clause( 708, [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ),
% 0.71/1.11 ~( ssItem( X ) ), ~( ssList( T ) ), ~( ssList( Y ) ), =( X, Z ) ] )
% 0.71/1.11 , clause( 709, [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ),
% 0.71/1.11 ~( ssItem( X ) ), ~( ssList( T ) ), ~( ssList( Y ) ), =( T, Y ) ] )
% 0.71/1.11 , clause( 710, [ ~( segmentP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( T ) )
% 0.71/1.11 , ~( ssList( Y ) ), ~( ssList( X ) ), segmentP( app( app( T, X ), Z ), Y
% 0.71/1.11 ) ] )
% 0.71/1.11 , clause( 711, [ ~( =( app( app( X, Y ), Z ), T ) ), ~( ssList( Z ) ), ~(
% 0.71/1.11 ssList( X ) ), ~( ssList( Y ) ), ~( ssList( T ) ), segmentP( T, Y ) ] )
% 0.71/1.11 , clause( 712, [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T
% 0.71/1.11 ) ), ~( ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), frontsegP( Y
% 0.71/1.11 , T ) ] )
% 0.71/1.11 , clause( 713, [ ~( =( app( X, cons( Y, Z ) ), T ) ), ~( ssList( Z ) ), ~(
% 0.71/1.11 ssList( X ) ), ~( ssItem( Y ) ), ~( ssList( T ) ), memberP( T, Y ) ] )
% 0.71/1.11 , clause( 714, [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T
% 0.71/1.11 ) ), ~( ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), =( X, Z ) ]
% 0.71/1.11 )
% 0.71/1.11 , clause( 715, [ ~( =( tl( X ), tl( Y ) ) ), ~( =( hd( X ), hd( Y ) ) ),
% 0.71/1.11 ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( X, Y ), =( nil, X ) ]
% 0.71/1.11 )
% 0.71/1.11 , clause( 716, [ ~( frontsegP( X, Y ) ), ~( =( Z, T ) ), ~( ssList( Y ) ),
% 0.71/1.11 ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Z ) ), frontsegP( cons( Z
% 0.71/1.11 , X ), cons( T, Y ) ) ] )
% 0.71/1.11 , clause( 717, [ ~( =( app( app( X, cons( Y, Z ) ), cons( Y, T ) ), U ) ),
% 0.71/1.11 ~( ssList( T ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 0.71/1.11 ~( duplicatefreeP( U ) ), ~( ssList( U ) ) ] )
% 0.71/1.11 , clause( 718, [ ~( =( app( X, cons( Y, cons( Z, T ) ) ), U ) ), ~( ssList(
% 0.71/1.11 T ) ), ~( ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ), ~(
% 0.71/1.11 equalelemsP( U ) ), ~( ssList( U ) ), =( Y, Z ) ] )
% 0.71/1.11 , clause( 719, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ),
% 0.71/1.11 ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ),
% 0.71/1.11 ~( ssItem( Y ) ), ~( strictorderedP( W ) ), ~( ssList( W ) ), lt( Y, T )
% 0.71/1.11 ] )
% 0.71/1.11 , clause( 720, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ),
% 0.71/1.11 ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ),
% 0.71/1.11 ~( ssItem( Y ) ), ~( totalorderedP( W ) ), ~( ssList( W ) ), leq( Y, T )
% 0.71/1.16 ] )
% 0.71/1.16 , clause( 721, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ),
% 0.71/1.16 ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ),
% 0.71/1.16 ~( ssItem( Y ) ), ~( strictorderP( W ) ), ~( ssList( W ) ), lt( Y, T ),
% 0.71/1.16 lt( T, Y ) ] )
% 0.71/1.16 , clause( 722, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ),
% 0.71/1.16 ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ),
% 0.71/1.16 ~( ssItem( Y ) ), ~( totalorderP( W ) ), ~( ssList( W ) ), leq( Y, T ),
% 0.71/1.16 leq( T, Y ) ] )
% 0.71/1.16 , clause( 723, [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( =( app( app( Z,
% 0.71/1.16 cons( X, T ) ), cons( Y, U ) ), W ) ), ~( ssList( U ) ), ~( ssList( T ) )
% 0.71/1.16 , ~( ssList( Z ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), ~( cyclefreeP( W
% 0.71/1.16 ) ), ~( ssList( W ) ) ] )
% 0.71/1.16 , clause( 724, [ ssList( sk1 ) ] )
% 0.71/1.16 , clause( 725, [ ssList( sk2 ) ] )
% 0.71/1.16 , clause( 726, [ ssList( sk3 ) ] )
% 0.71/1.16 , clause( 727, [ ssList( sk4 ) ] )
% 0.71/1.16 , clause( 728, [ =( nil, sk3 ) ] )
% 0.71/1.16 , clause( 729, [ =( sk2, sk4 ) ] )
% 0.71/1.16 , clause( 730, [ =( sk1, sk3 ) ] )
% 0.71/1.16 , clause( 731, [ neq( sk2, nil ) ] )
% 0.71/1.16 , clause( 732, [ ~( frontsegP( sk2, sk1 ) ) ] )
% 0.71/1.16 ] ).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 subsumption(
% 0.71/1.16 clause( 59, [ ~( ssList( X ) ), frontsegP( X, nil ) ] )
% 0.71/1.16 , clause( 598, [ ~( ssList( X ) ), frontsegP( X, nil ) ] )
% 0.71/1.16 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.71/1.16 1 )] ) ).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 subsumption(
% 0.71/1.16 clause( 183, [ ssList( sk2 ) ] )
% 0.71/1.16 , clause( 725, [ ssList( sk2 ) ] )
% 0.71/1.16 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 subsumption(
% 0.71/1.16 clause( 186, [ =( nil, sk3 ) ] )
% 0.71/1.16 , clause( 728, [ =( nil, sk3 ) ] )
% 0.71/1.16 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 eqswap(
% 0.71/1.16 clause( 3008, [ =( sk3, sk1 ) ] )
% 0.71/1.16 , clause( 730, [ =( sk1, sk3 ) ] )
% 0.71/1.16 , 0, substitution( 0, [] )).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 subsumption(
% 0.71/1.16 clause( 188, [ =( sk3, sk1 ) ] )
% 0.71/1.16 , clause( 3008, [ =( sk3, sk1 ) ] )
% 0.71/1.16 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 subsumption(
% 0.71/1.16 clause( 190, [ ~( frontsegP( sk2, sk1 ) ) ] )
% 0.71/1.16 , clause( 732, [ ~( frontsegP( sk2, sk1 ) ) ] )
% 0.71/1.16 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 paramod(
% 0.71/1.16 clause( 3771, [ =( nil, sk1 ) ] )
% 0.71/1.16 , clause( 188, [ =( sk3, sk1 ) ] )
% 0.71/1.16 , 0, clause( 186, [ =( nil, sk3 ) ] )
% 0.71/1.16 , 0, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 subsumption(
% 0.71/1.16 clause( 326, [ =( nil, sk1 ) ] )
% 0.71/1.16 , clause( 3771, [ =( nil, sk1 ) ] )
% 0.71/1.16 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 paramod(
% 0.71/1.16 clause( 3774, [ frontsegP( X, sk1 ), ~( ssList( X ) ) ] )
% 0.71/1.16 , clause( 326, [ =( nil, sk1 ) ] )
% 0.71/1.16 , 0, clause( 59, [ ~( ssList( X ) ), frontsegP( X, nil ) ] )
% 0.71/1.16 , 1, 2, substitution( 0, [] ), substitution( 1, [ :=( X, X )] )).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 subsumption(
% 0.71/1.16 clause( 447, [ ~( ssList( X ) ), frontsegP( X, sk1 ) ] )
% 0.71/1.16 , clause( 3774, [ frontsegP( X, sk1 ), ~( ssList( X ) ) ] )
% 0.71/1.16 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.71/1.16 0 )] ) ).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 resolution(
% 0.71/1.16 clause( 3775, [ ~( ssList( sk2 ) ) ] )
% 0.71/1.16 , clause( 190, [ ~( frontsegP( sk2, sk1 ) ) ] )
% 0.71/1.16 , 0, clause( 447, [ ~( ssList( X ) ), frontsegP( X, sk1 ) ] )
% 0.71/1.16 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, sk2 )] )).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 resolution(
% 0.71/1.16 clause( 3776, [] )
% 0.71/1.16 , clause( 3775, [ ~( ssList( sk2 ) ) ] )
% 0.71/1.16 , 0, clause( 183, [ ssList( sk2 ) ] )
% 0.71/1.16 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 subsumption(
% 0.71/1.16 clause( 537, [] )
% 0.71/1.16 , clause( 3776, [] )
% 0.71/1.16 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 end.
% 0.71/1.16
% 0.71/1.16 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.16
% 0.71/1.16 Memory use:
% 0.71/1.16
% 0.71/1.16 space for terms: 12254
% 0.71/1.16 space for clauses: 31090
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 clauses generated: 980
% 0.71/1.16 clauses kept: 538
% 0.71/1.16 clauses selected: 105
% 0.71/1.16 clauses deleted: 15
% 0.71/1.16 clauses inuse deleted: 0
% 0.71/1.16
% 0.71/1.16 subsentry: 40030
% 0.71/1.16 literals s-matched: 25507
% 0.71/1.16 literals matched: 9753
% 0.71/1.16 full subsumption: 7816
% 0.71/1.16
% 0.71/1.16 checksum: -1281963475
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 Bliksem ended
%------------------------------------------------------------------------------