TSTP Solution File: SWC042-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWC042-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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:33:15 EDT 2022
% Result : Unsatisfiable 0.94s 1.39s
% Output : Refutation 0.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC042-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Sat Jun 11 23:52:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.91/1.31 *** allocated 10000 integers for termspace/termends
% 0.91/1.31 *** allocated 10000 integers for clauses
% 0.91/1.31 *** allocated 10000 integers for justifications
% 0.91/1.31 Bliksem 1.12
% 0.91/1.31
% 0.91/1.31
% 0.91/1.31 Automatic Strategy Selection
% 0.91/1.31
% 0.91/1.31 Clauses:
% 0.91/1.31 [
% 0.91/1.31 [ equalelemsP( nil ) ],
% 0.91/1.31 [ duplicatefreeP( nil ) ],
% 0.91/1.31 [ strictorderedP( nil ) ],
% 0.91/1.31 [ totalorderedP( nil ) ],
% 0.91/1.31 [ strictorderP( nil ) ],
% 0.91/1.31 [ totalorderP( nil ) ],
% 0.91/1.31 [ cyclefreeP( nil ) ],
% 0.91/1.31 [ ssList( nil ) ],
% 0.91/1.31 [ ssItem( skac3 ) ],
% 0.91/1.31 [ ssItem( skac2 ) ],
% 0.91/1.31 [ ~( singletonP( nil ) ) ],
% 0.91/1.31 [ ssItem( skaf83( X ) ) ],
% 0.91/1.31 [ ssList( skaf82( X ) ) ],
% 0.91/1.31 [ ssList( skaf81( X ) ) ],
% 0.91/1.31 [ ssList( skaf80( X ) ) ],
% 0.91/1.31 [ ssItem( skaf79( X ) ) ],
% 0.91/1.31 [ ssItem( skaf78( X ) ) ],
% 0.91/1.31 [ ssList( skaf77( X ) ) ],
% 0.91/1.31 [ ssList( skaf76( X ) ) ],
% 0.91/1.31 [ ssList( skaf75( X ) ) ],
% 0.91/1.31 [ ssItem( skaf74( X ) ) ],
% 0.91/1.31 [ ssList( skaf73( X ) ) ],
% 0.91/1.31 [ ssList( skaf72( X ) ) ],
% 0.91/1.31 [ ssList( skaf71( X ) ) ],
% 0.91/1.31 [ ssItem( skaf70( X ) ) ],
% 0.91/1.31 [ ssItem( skaf69( X ) ) ],
% 0.91/1.31 [ ssList( skaf68( X ) ) ],
% 0.91/1.31 [ ssList( skaf67( X ) ) ],
% 0.91/1.31 [ ssList( skaf66( X ) ) ],
% 0.91/1.31 [ ssItem( skaf65( X ) ) ],
% 0.91/1.31 [ ssItem( skaf64( X ) ) ],
% 0.91/1.31 [ ssList( skaf63( X ) ) ],
% 0.91/1.31 [ ssList( skaf62( X ) ) ],
% 0.91/1.31 [ ssList( skaf61( X ) ) ],
% 0.91/1.31 [ ssItem( skaf60( X ) ) ],
% 0.91/1.31 [ ssItem( skaf59( X ) ) ],
% 0.91/1.31 [ ssList( skaf58( X ) ) ],
% 0.91/1.31 [ ssList( skaf57( X ) ) ],
% 0.91/1.31 [ ssList( skaf56( X ) ) ],
% 0.91/1.31 [ ssItem( skaf55( X ) ) ],
% 0.91/1.31 [ ssItem( skaf54( X ) ) ],
% 0.91/1.31 [ ssList( skaf53( X ) ) ],
% 0.91/1.31 [ ssList( skaf52( X ) ) ],
% 0.91/1.31 [ ssList( skaf51( X ) ) ],
% 0.91/1.31 [ ssItem( skaf50( X ) ) ],
% 0.91/1.31 [ ssItem( skaf49( X ) ) ],
% 0.91/1.31 [ ssItem( skaf44( X ) ) ],
% 0.91/1.31 [ ssList( skaf48( X, Y ) ) ],
% 0.91/1.31 [ ssList( skaf47( X, Y ) ) ],
% 0.91/1.31 [ ssList( skaf46( X, Y ) ) ],
% 0.91/1.31 [ ssList( skaf45( X, Y ) ) ],
% 0.91/1.31 [ ssList( skaf43( X, Y ) ) ],
% 0.91/1.31 [ ssList( skaf42( X, Y ) ) ],
% 0.91/1.31 [ ~( =( skac3, skac2 ) ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), geq( X, X ) ],
% 0.91/1.31 [ ~( ssList( X ) ), segmentP( X, nil ) ],
% 0.91/1.31 [ ~( ssList( X ) ), segmentP( X, X ) ],
% 0.91/1.31 [ ~( ssList( X ) ), rearsegP( X, nil ) ],
% 0.91/1.31 [ ~( ssList( X ) ), rearsegP( X, X ) ],
% 0.91/1.31 [ ~( ssList( X ) ), frontsegP( X, nil ) ],
% 0.91/1.31 [ ~( ssList( X ) ), frontsegP( X, X ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), leq( X, X ) ],
% 0.91/1.31 [ ~( lt( X, X ) ), ~( ssItem( X ) ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), equalelemsP( cons( X, nil ) ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), strictorderedP( cons( X, nil ) ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), totalorderedP( cons( X, nil ) ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), strictorderP( cons( X, nil ) ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), totalorderP( cons( X, nil ) ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), cyclefreeP( cons( X, nil ) ) ],
% 0.91/1.31 [ ~( memberP( nil, X ) ), ~( ssItem( X ) ) ],
% 0.91/1.31 [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ],
% 0.91/1.31 [ ~( ssList( X ) ), =( app( X, nil ), X ) ],
% 0.91/1.31 [ ~( ssList( X ) ), =( app( nil, X ), X ) ],
% 0.91/1.31 [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ],
% 0.91/1.31 [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ],
% 0.91/1.31 [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ],
% 0.91/1.31 [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ],
% 0.91/1.31 [ ~( =( nil, X ) ), ~( ssList( X ) ), segmentP( nil, X ) ],
% 0.91/1.31 [ ~( segmentP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.91/1.31 [ ~( =( nil, X ) ), ~( ssList( X ) ), rearsegP( nil, X ) ],
% 0.91/1.31 [ ~( rearsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.91/1.31 [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X ) ],
% 0.91/1.31 [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.91/1.31 [ ~( ssList( X ) ), ~( ssList( Y ) ), ssList( app( Y, X ) ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), ~( ssList( Y ) ), ssList( cons( X, Y ) ) ],
% 0.91/1.31 [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf50( X ), skaf49( X ) ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf49( X ), skaf50( X ) ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( =( skaf79( X ), skaf78( X ) ) ), ~( ssList( X ) ), equalelemsP( X )
% 0.91/1.31 ],
% 0.91/1.31 [ ~( lt( skaf69( X ), skaf70( X ) ) ), ~( ssList( X ) ), strictorderedP(
% 0.91/1.31 X ) ],
% 0.91/1.31 [ ~( leq( skaf64( X ), skaf65( X ) ) ), ~( ssList( X ) ), totalorderedP(
% 0.91/1.31 X ) ],
% 0.91/1.31 [ ~( lt( skaf60( X ), skaf59( X ) ) ), ~( ssList( X ) ), strictorderP( X
% 0.91/1.31 ) ],
% 0.91/1.31 [ ~( lt( skaf59( X ), skaf60( X ) ) ), ~( ssList( X ) ), strictorderP( X
% 0.91/1.31 ) ],
% 0.91/1.31 [ ~( leq( skaf55( X ), skaf54( X ) ) ), ~( ssList( X ) ), totalorderP( X
% 0.91/1.31 ) ],
% 0.91/1.31 [ ~( leq( skaf54( X ), skaf55( X ) ) ), ~( ssList( X ) ), totalorderP( X
% 0.91/1.31 ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( tl( cons( X, Y ) ), Y ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( hd( cons( X, Y ) ), X ) ],
% 0.91/1.31 [ ~( =( cons( X, Y ), nil ) ), ~( ssItem( X ) ), ~( ssList( Y ) ) ],
% 0.91/1.31 [ ~( =( cons( X, Y ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y ) ) ],
% 0.91/1.31 [ ~( ssList( X ) ), ~( ssList( Y ) ), neq( Y, X ), =( Y, X ) ],
% 0.91/1.31 [ ~( singletonP( X ) ), ~( ssList( X ) ), =( cons( skaf44( X ), nil ), X
% 0.91/1.31 ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X ) ],
% 0.91/1.31 [ ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( X, Y ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( ssList( X ) ), =( cons( hd( X ), tl( X ) ), X ), =( nil, X ) ],
% 0.91/1.31 [ ~( gt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( Y, X ) ],
% 0.91/1.31 [ ~( lt( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), gt( Y, X ) ],
% 0.91/1.31 [ ~( geq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( Y, X ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( leq( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), geq( Y, X ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( ssList( X ) ), =( cons( skaf83( X ), skaf82( X ) ), X ), =( nil, X
% 0.91/1.31 ) ],
% 0.91/1.31 [ ~( gt( X, Y ) ), ~( gt( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( =( X, Y ) ), ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), strictorderedP(
% 0.91/1.31 cons( Y, X ) ) ],
% 0.91/1.31 [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), totalorderedP(
% 0.91/1.31 cons( Y, X ) ) ],
% 0.91/1.31 [ ~( lt( X, Y ) ), ~( lt( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y ) ),
% 0.91/1.31 singletonP( Y ) ],
% 0.91/1.31 [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( nil
% 0.91/1.31 , X ) ],
% 0.91/1.31 [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( nil
% 0.91/1.31 , Y ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( app( cons( X, nil ), Y ), cons(
% 0.91/1.31 X, Y ) ) ],
% 0.91/1.31 [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Y ), =( X
% 0.91/1.31 , Y ) ],
% 0.91/1.31 [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Y ), =( X
% 0.91/1.31 , Y ) ],
% 0.91/1.31 [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( hd( app( Y, X ) )
% 0.91/1.31 , hd( Y ) ) ],
% 0.91/1.31 [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X )
% 0.91/1.31 ), strictorderedP( Y ), =( nil, Y ) ],
% 0.91/1.31 [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X ) )
% 0.91/1.31 , totalorderedP( Y ), =( nil, Y ) ],
% 0.91/1.31 [ ~( geq( X, Y ) ), ~( geq( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) )
% 0.91/1.31 , =( Y, X ) ],
% 0.91/1.31 [ ~( segmentP( X, Y ) ), ~( segmentP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.91/1.31 ssList( Y ) ), =( Y, X ) ],
% 0.91/1.31 [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.91/1.31 ssList( Y ) ), =( Y, X ) ],
% 0.91/1.31 [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.91/1.31 ssList( Y ) ), =( Y, X ) ],
% 0.91/1.31 [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) )
% 0.91/1.31 , =( Y, X ) ],
% 0.91/1.31 [ ~( rearsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app(
% 0.91/1.31 skaf46( X, Y ), Y ), X ) ],
% 0.91/1.31 [ ~( frontsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app( Y
% 0.91/1.31 , skaf45( X, Y ) ), X ) ],
% 0.91/1.31 [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( tl( app( Y, X ) )
% 0.91/1.31 , app( tl( Y ), X ) ) ],
% 0.91/1.31 [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X )
% 0.91/1.31 ), lt( X, hd( Y ) ), =( nil, Y ) ],
% 0.91/1.31 [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X ) )
% 0.91/1.31 , leq( X, hd( Y ) ), =( nil, Y ) ],
% 0.91/1.31 [ ~( rearsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ), ~( ssList(
% 0.91/1.31 X ) ), rearsegP( app( Z, X ), Y ) ],
% 0.91/1.31 [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ), ~( ssList(
% 0.91/1.31 X ) ), frontsegP( app( X, Z ), Y ) ],
% 0.91/1.31 [ ~( =( X, Y ) ), ~( ssList( Z ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ),
% 0.91/1.31 memberP( cons( Y, Z ), X ) ],
% 0.91/1.31 [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y
% 0.91/1.31 ) ), memberP( cons( Z, X ), Y ) ],
% 0.91/1.31 [ ~( memberP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y
% 0.91/1.31 ) ), memberP( app( X, Z ), Y ) ],
% 0.91/1.31 [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssList( Z ) ), ~( ssItem( Y
% 0.91/1.31 ) ), memberP( app( Z, X ), Y ) ],
% 0.91/1.31 [ ~( ssList( X ) ), equalelemsP( X ), =( app( skaf80( X ), cons( skaf78(
% 0.91/1.31 X ), cons( skaf79( X ), skaf81( X ) ) ) ), X ) ],
% 0.91/1.31 [ ~( =( app( X, Y ), Z ) ), ~( ssList( X ) ), ~( ssList( Y ) ), ~(
% 0.91/1.31 ssList( Z ) ), rearsegP( Z, Y ) ],
% 0.91/1.31 [ ~( =( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), ~(
% 0.91/1.31 ssList( Z ) ), frontsegP( Z, X ) ],
% 0.91/1.31 [ ~( =( nil, X ) ), ~( =( nil, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.91/1.31 , =( app( X, Y ), nil ) ],
% 0.91/1.31 [ ~( gt( X, Y ) ), ~( gt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ),
% 0.91/1.31 ~( ssItem( X ) ), gt( X, Z ) ],
% 0.91/1.31 [ ~( leq( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.91/1.31 , ~( ssItem( X ) ), lt( X, Z ) ],
% 0.91/1.31 [ ~( geq( X, Y ) ), ~( geq( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.91/1.31 , ~( ssItem( X ) ), geq( X, Z ) ],
% 0.91/1.31 [ ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =( app( app( Z,
% 0.91/1.31 Y ), X ), app( Z, app( Y, X ) ) ) ],
% 0.91/1.31 [ ~( =( app( X, Y ), app( X, Z ) ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.91/1.31 , ~( ssList( Z ) ), =( Y, Z ) ],
% 0.91/1.31 [ ~( =( app( X, Y ), app( Z, Y ) ) ), ~( ssList( X ) ), ~( ssList( Y ) )
% 0.91/1.31 , ~( ssList( Z ) ), =( X, Z ) ],
% 0.91/1.31 [ ~( segmentP( X, Y ) ), ~( segmentP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.91/1.31 ssList( Y ) ), ~( ssList( X ) ), segmentP( X, Z ) ],
% 0.91/1.31 [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.91/1.31 ssList( Y ) ), ~( ssList( X ) ), rearsegP( X, Z ) ],
% 0.91/1.31 [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.91/1.31 ssList( Y ) ), ~( ssList( X ) ), frontsegP( X, Z ) ],
% 0.91/1.31 [ ~( lt( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ),
% 0.91/1.31 ~( ssItem( X ) ), lt( X, Z ) ],
% 0.91/1.31 [ ~( leq( X, Y ) ), ~( leq( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.91/1.31 , ~( ssItem( X ) ), leq( X, Z ) ],
% 0.91/1.31 [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =( cons( X, app(
% 0.91/1.31 Y, Z ) ), app( cons( X, Y ), Z ) ) ],
% 0.91/1.31 [ ~( memberP( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ),
% 0.91/1.31 ~( ssItem( Z ) ), memberP( Y, Z ), memberP( X, Z ) ],
% 0.91/1.31 [ ~( leq( X, hd( Y ) ) ), ~( totalorderedP( Y ) ), ~( ssList( Y ) ), ~(
% 0.91/1.31 ssItem( X ) ), totalorderedP( cons( X, Y ) ), =( nil, Y ) ],
% 0.91/1.31 [ ~( lt( X, hd( Y ) ) ), ~( strictorderedP( Y ) ), ~( ssList( Y ) ), ~(
% 0.91/1.31 ssItem( X ) ), strictorderedP( cons( X, Y ) ), =( nil, Y ) ],
% 0.91/1.31 [ ~( memberP( cons( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssItem( X ) ),
% 0.91/1.31 ~( ssItem( Z ) ), memberP( Y, Z ), =( Z, X ) ],
% 0.91/1.31 [ ~( ssList( X ) ), duplicatefreeP( X ), =( app( app( skaf75( X ), cons(
% 0.91/1.31 skaf74( X ), skaf76( X ) ) ), cons( skaf74( X ), skaf77( X ) ) ), X ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( ssList( X ) ), strictorderedP( X ), =( app( app( skaf71( X ), cons(
% 0.91/1.31 skaf69( X ), skaf72( X ) ) ), cons( skaf70( X ), skaf73( X ) ) ), X ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( ssList( X ) ), totalorderedP( X ), =( app( app( skaf66( X ), cons(
% 0.91/1.31 skaf64( X ), skaf67( X ) ) ), cons( skaf65( X ), skaf68( X ) ) ), X ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( ssList( X ) ), strictorderP( X ), =( app( app( skaf61( X ), cons(
% 0.91/1.31 skaf59( X ), skaf62( X ) ) ), cons( skaf60( X ), skaf63( X ) ) ), X ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( ssList( X ) ), totalorderP( X ), =( app( app( skaf56( X ), cons(
% 0.91/1.31 skaf54( X ), skaf57( X ) ) ), cons( skaf55( X ), skaf58( X ) ) ), X ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( ssList( X ) ), cyclefreeP( X ), =( app( app( skaf51( X ), cons(
% 0.91/1.31 skaf49( X ), skaf52( X ) ) ), cons( skaf50( X ), skaf53( X ) ) ), X ) ]
% 0.91/1.31 ,
% 0.91/1.31 [ ~( segmentP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app( app(
% 0.91/1.31 skaf47( X, Y ), Y ), skaf48( Y, X ) ), X ) ],
% 0.91/1.31 [ ~( memberP( X, Y ) ), ~( ssItem( Y ) ), ~( ssList( X ) ), =( app(
% 0.91/1.31 skaf42( X, Y ), cons( Y, skaf43( Y, X ) ) ), X ) ],
% 0.91/1.31 [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ), ~( ssItem( X )
% 0.91/1.31 ), ~( ssList( T ) ), ~( ssList( Y ) ), =( X, Z ) ],
% 0.91/1.31 [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ), ~( ssItem( X )
% 0.91/1.31 ), ~( ssList( T ) ), ~( ssList( Y ) ), =( T, Y ) ],
% 0.91/1.31 [ ~( segmentP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( T ) ), ~( ssList(
% 0.91/1.32 Y ) ), ~( ssList( X ) ), segmentP( app( app( T, X ), Z ), Y ) ],
% 0.91/1.32 [ ~( =( app( app( X, Y ), Z ), T ) ), ~( ssList( Z ) ), ~( ssList( X ) )
% 0.91/1.32 , ~( ssList( Y ) ), ~( ssList( T ) ), segmentP( T, Y ) ],
% 0.91/1.32 [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T ) ), ~(
% 0.91/1.32 ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), frontsegP( Y, T ) ]
% 0.91/1.32 ,
% 0.91/1.32 [ ~( =( app( X, cons( Y, Z ) ), T ) ), ~( ssList( Z ) ), ~( ssList( X )
% 0.91/1.32 ), ~( ssItem( Y ) ), ~( ssList( T ) ), memberP( T, Y ) ],
% 0.91/1.32 [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T ) ), ~(
% 0.91/1.32 ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), =( X, Z ) ],
% 0.91/1.32 [ ~( =( tl( X ), tl( Y ) ) ), ~( =( hd( X ), hd( Y ) ) ), ~( ssList( X )
% 0.91/1.32 ), ~( ssList( Y ) ), =( nil, Y ), =( X, Y ), =( nil, X ) ],
% 0.91/1.32 [ ~( frontsegP( X, Y ) ), ~( =( Z, T ) ), ~( ssList( Y ) ), ~( ssList( X
% 0.91/1.32 ) ), ~( ssItem( T ) ), ~( ssItem( Z ) ), frontsegP( cons( Z, X ), cons(
% 0.91/1.32 T, Y ) ) ],
% 0.91/1.32 [ ~( =( app( app( X, cons( Y, Z ) ), cons( Y, T ) ), U ) ), ~( ssList( T
% 0.91/1.32 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), ~(
% 0.91/1.32 duplicatefreeP( U ) ), ~( ssList( U ) ) ],
% 0.91/1.32 [ ~( =( app( X, cons( Y, cons( Z, T ) ) ), U ) ), ~( ssList( T ) ), ~(
% 0.91/1.32 ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ), ~( equalelemsP( U ) )
% 0.91/1.32 , ~( ssList( U ) ), =( Y, Z ) ],
% 0.91/1.32 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.91/1.32 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.91/1.32 ) ), ~( strictorderedP( W ) ), ~( ssList( W ) ), lt( Y, T ) ],
% 0.91/1.32 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.91/1.32 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.91/1.32 ) ), ~( totalorderedP( W ) ), ~( ssList( W ) ), leq( Y, T ) ],
% 0.91/1.32 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.91/1.32 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.91/1.32 ) ), ~( strictorderP( W ) ), ~( ssList( W ) ), lt( Y, T ), lt( T, Y ) ]
% 0.91/1.32 ,
% 0.91/1.32 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.91/1.32 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.91/1.32 ) ), ~( totalorderP( W ) ), ~( ssList( W ) ), leq( Y, T ), leq( T, Y ) ]
% 0.91/1.32 ,
% 0.91/1.32 [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( =( app( app( Z, cons( X, T ) )
% 0.91/1.32 , cons( Y, U ) ), W ) ), ~( ssList( U ) ), ~( ssList( T ) ), ~( ssList( Z
% 0.91/1.32 ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), ~( cyclefreeP( W ) ), ~( ssList(
% 0.91/1.32 W ) ) ],
% 0.91/1.32 [ ssList( sk1 ) ],
% 0.91/1.32 [ ssList( sk2 ) ],
% 0.91/1.32 [ ssList( sk3 ) ],
% 0.91/1.32 [ ssList( sk4 ) ],
% 0.91/1.32 [ =( nil, sk2 ) ],
% 0.91/1.32 [ =( sk2, sk4 ) ],
% 0.91/1.32 [ =( sk1, sk3 ) ],
% 0.91/1.32 [ ~( =( nil, sk1 ) ) ],
% 0.91/1.32 [ ssList( sk5 ) ],
% 0.91/1.32 [ =( app( sk3, sk5 ), sk4 ) ],
% 0.91/1.32 [ totalorderedP( sk3 ) ],
% 0.91/1.32 [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( =( app( cons( X, nil ), Y ),
% 0.91/1.32 sk5 ) ), ~( ssItem( Z ) ), ~( ssList( T ) ), ~( =( app( T, cons( Z, nil )
% 0.91/1.32 ), sk3 ) ), ~( leq( Z, X ) ) ],
% 0.91/1.32 [ =( nil, sk4 ), ~( =( nil, sk3 ) ) ]
% 0.91/1.32 ] .
% 0.91/1.32
% 0.91/1.32
% 0.91/1.32 percentage equality = 0.169657, percentage horn = 0.846154
% 0.91/1.32 This is a problem with some equality
% 0.91/1.32
% 0.91/1.32
% 0.91/1.32
% 0.91/1.32 Options Used:
% 0.91/1.32
% 0.91/1.32 useres = 1
% 0.91/1.32 useparamod = 1
% 0.91/1.32 useeqrefl = 1
% 0.91/1.32 useeqfact = 1
% 0.91/1.32 usefactor = 1
% 0.91/1.32 usesimpsplitting = 0
% 0.91/1.32 usesimpdemod = 5
% 0.91/1.32 usesimpres = 3
% 0.91/1.32
% 0.91/1.32 resimpinuse = 1000
% 0.91/1.32 resimpclauses = 20000
% 0.91/1.32 substype = eqrewr
% 0.91/1.32 backwardsubs = 1
% 0.91/1.32 selectoldest = 5
% 0.91/1.32
% 0.91/1.32 litorderings [0] = split
% 0.91/1.32 litorderings [1] = extend the termordering, first sorting on arguments
% 0.91/1.32
% 0.91/1.32 termordering = kbo
% 0.91/1.32
% 0.91/1.32 litapriori = 0
% 0.91/1.32 termapriori = 1
% 0.91/1.32 litaposteriori = 0
% 0.91/1.32 termaposteriori = 0
% 0.91/1.32 demodaposteriori = 0
% 0.91/1.32 ordereqreflfact = 0
% 0.91/1.32
% 0.91/1.32 litselect = negord
% 0.91/1.32
% 0.91/1.32 maxweight = 15
% 0.91/1.32 maxdepth = 30000
% 0.91/1.32 maxlength = 115
% 0.91/1.32 maxnrvars = 195
% 0.91/1.32 excuselevel = 1
% 0.91/1.32 increasemaxweight = 1
% 0.91/1.32
% 0.91/1.32 maxselected = 10000000
% 0.91/1.32 maxnrclauses = 10000000
% 0.91/1.32
% 0.91/1.32 showgenerated = 0
% 0.91/1.32 showkept = 0
% 0.91/1.32 showselected = 0
% 0.91/1.32 showdeleted = 0
% 0.91/1.32 showresimp = 1
% 0.91/1.32 showstatus = 2000
% 0.91/1.32
% 0.91/1.32 prologoutput = 1
% 0.91/1.32 nrgoals = 5000000
% 0.91/1.32 totalproof = 1
% 0.94/1.39
% 0.94/1.39 Symbols occurring in the translation:
% 0.94/1.39
% 0.94/1.39 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.94/1.39 . [1, 2] (w:1, o:80, a:1, s:1, b:0),
% 0.94/1.39 ! [4, 1] (w:0, o:27, a:1, s:1, b:0),
% 0.94/1.39 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.94/1.39 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.94/1.39 nil [39, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.94/1.39 equalelemsP [40, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.94/1.39 duplicatefreeP [41, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.94/1.39 strictorderedP [42, 1] (w:1, o:37, a:1, s:1, b:0),
% 0.94/1.39 totalorderedP [43, 1] (w:1, o:76, a:1, s:1, b:0),
% 0.94/1.39 strictorderP [44, 1] (w:1, o:38, a:1, s:1, b:0),
% 0.94/1.39 totalorderP [45, 1] (w:1, o:77, a:1, s:1, b:0),
% 0.94/1.39 cyclefreeP [46, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.94/1.39 ssList [47, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.94/1.39 skac3 [48, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.94/1.39 ssItem [49, 1] (w:1, o:36, a:1, s:1, b:0),
% 0.94/1.39 skac2 [50, 0] (w:1, o:5, a:1, s:1, b:0),
% 0.94/1.39 singletonP [51, 1] (w:1, o:39, a:1, s:1, b:0),
% 0.94/1.39 skaf83 [53, 1] (w:1, o:75, a:1, s:1, b:0),
% 0.94/1.39 skaf82 [54, 1] (w:1, o:74, a:1, s:1, b:0),
% 0.94/1.39 skaf81 [55, 1] (w:1, o:73, a:1, s:1, b:0),
% 0.94/1.39 skaf80 [56, 1] (w:1, o:72, a:1, s:1, b:0),
% 0.94/1.39 skaf79 [57, 1] (w:1, o:71, a:1, s:1, b:0),
% 0.94/1.39 skaf78 [58, 1] (w:1, o:70, a:1, s:1, b:0),
% 0.94/1.39 skaf77 [59, 1] (w:1, o:69, a:1, s:1, b:0),
% 0.94/1.39 skaf76 [60, 1] (w:1, o:68, a:1, s:1, b:0),
% 0.94/1.39 skaf75 [61, 1] (w:1, o:67, a:1, s:1, b:0),
% 0.94/1.39 skaf74 [62, 1] (w:1, o:66, a:1, s:1, b:0),
% 0.94/1.39 skaf73 [63, 1] (w:1, o:65, a:1, s:1, b:0),
% 0.94/1.39 skaf72 [64, 1] (w:1, o:64, a:1, s:1, b:0),
% 0.94/1.39 skaf71 [65, 1] (w:1, o:63, a:1, s:1, b:0),
% 0.94/1.39 skaf70 [66, 1] (w:1, o:62, a:1, s:1, b:0),
% 0.94/1.39 skaf69 [67, 1] (w:1, o:61, a:1, s:1, b:0),
% 0.94/1.39 skaf68 [68, 1] (w:1, o:60, a:1, s:1, b:0),
% 0.94/1.39 skaf67 [69, 1] (w:1, o:59, a:1, s:1, b:0),
% 0.94/1.39 skaf66 [70, 1] (w:1, o:58, a:1, s:1, b:0),
% 0.94/1.39 skaf65 [71, 1] (w:1, o:57, a:1, s:1, b:0),
% 0.94/1.39 skaf64 [72, 1] (w:1, o:56, a:1, s:1, b:0),
% 0.94/1.39 skaf63 [73, 1] (w:1, o:55, a:1, s:1, b:0),
% 0.94/1.39 skaf62 [74, 1] (w:1, o:54, a:1, s:1, b:0),
% 0.94/1.39 skaf61 [75, 1] (w:1, o:53, a:1, s:1, b:0),
% 0.94/1.39 skaf60 [76, 1] (w:1, o:52, a:1, s:1, b:0),
% 0.94/1.39 skaf59 [77, 1] (w:1, o:51, a:1, s:1, b:0),
% 0.94/1.39 skaf58 [78, 1] (w:1, o:50, a:1, s:1, b:0),
% 0.94/1.39 skaf57 [79, 1] (w:1, o:49, a:1, s:1, b:0),
% 0.94/1.39 skaf56 [80, 1] (w:1, o:48, a:1, s:1, b:0),
% 0.94/1.39 skaf55 [81, 1] (w:1, o:47, a:1, s:1, b:0),
% 0.94/1.39 skaf54 [82, 1] (w:1, o:46, a:1, s:1, b:0),
% 0.94/1.39 skaf53 [83, 1] (w:1, o:45, a:1, s:1, b:0),
% 0.94/1.39 skaf52 [84, 1] (w:1, o:44, a:1, s:1, b:0),
% 0.94/1.39 skaf51 [85, 1] (w:1, o:43, a:1, s:1, b:0),
% 0.94/1.39 skaf50 [86, 1] (w:1, o:42, a:1, s:1, b:0),
% 0.94/1.39 skaf49 [87, 1] (w:1, o:40, a:1, s:1, b:0),
% 0.94/1.39 skaf44 [88, 1] (w:1, o:41, a:1, s:1, b:0),
% 0.94/1.39 skaf48 [90, 2] (w:1, o:109, a:1, s:1, b:0),
% 0.94/1.39 skaf47 [91, 2] (w:1, o:108, a:1, s:1, b:0),
% 0.94/1.39 skaf46 [92, 2] (w:1, o:107, a:1, s:1, b:0),
% 0.94/1.39 skaf45 [93, 2] (w:1, o:106, a:1, s:1, b:0),
% 0.94/1.39 skaf43 [94, 2] (w:1, o:111, a:1, s:1, b:0),
% 0.94/1.39 skaf42 [95, 2] (w:1, o:110, a:1, s:1, b:0),
% 0.94/1.39 geq [96, 2] (w:1, o:113, a:1, s:1, b:0),
% 0.94/1.39 segmentP [97, 2] (w:1, o:114, a:1, s:1, b:0),
% 0.94/1.39 rearsegP [98, 2] (w:1, o:105, a:1, s:1, b:0),
% 0.94/1.39 frontsegP [99, 2] (w:1, o:112, a:1, s:1, b:0),
% 0.94/1.39 leq [100, 2] (w:1, o:115, a:1, s:1, b:0),
% 0.94/1.39 lt [101, 2] (w:1, o:116, a:1, s:1, b:0),
% 0.94/1.39 cons [102, 2] (w:1, o:117, a:1, s:1, b:0),
% 0.94/1.39 memberP [103, 2] (w:1, o:118, a:1, s:1, b:0),
% 0.94/1.39 app [104, 2] (w:1, o:119, a:1, s:1, b:0),
% 0.94/1.39 tl [105, 1] (w:1, o:78, a:1, s:1, b:0),
% 0.94/1.39 hd [106, 1] (w:1, o:79, a:1, s:1, b:0),
% 0.94/1.39 neq [107, 2] (w:1, o:120, a:1, s:1, b:0),
% 0.94/1.39 gt [108, 2] (w:1, o:121, a:1, s:1, b:0),
% 0.94/1.39 sk1 [113, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.94/1.39 sk2 [114, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.94/1.39 sk3 [115, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.94/1.39 sk4 [116, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.94/1.39 sk5 [117, 0] (w:1, o:11, a:1, s:1, b:0).
% 0.94/1.39
% 0.94/1.39
% 0.94/1.39 Starting Search:
% 0.94/1.39
% 0.94/1.39 Resimplifying inuse:
% 0.94/1.39 Done
% 0.94/1.39
% 0.94/1.39
% 0.94/1.39 Intermediate Status:
% 0.94/1.39 Generated: 4431
% 0.94/1.39 Kept: 2440
% 0.94/1.39 Inuse: 267
% 0.94/1.39 Deleted: 34
% 0.94/1.39 Deletedinuse: 0
% 0.94/1.39
% 0.94/1.39 Resimplifying inuse:
% 0.94/1.39 Done
% 0.94/1.39
% 0.94/1.39 Resimplifying inuse:
% 0.94/1.39 Done
% 0.94/1.39
% 0.94/1.39
% 0.94/1.39 Intermediate Status:
% 0.94/1.39 Generated: 14983
% 0.94/1.39 Kept: 4538
% 0.94/1.39 Inuse: 384
% 0.94/1.39 Deleted: 47
% 0.94/1.39 Deletedinuse: 0
% 0.94/1.39
% 0.94/1.39 Resimplifying inuse:
% 0.94/1.39 Done
% 0.94/1.39
% 0.94/1.39 Resimplifying inuse:
% 0.94/1.39 Done
% 0.94/1.39
% 0.94/1.39
% 0.94/1.39 Bliksems!, er is een bewijs:
% 0.94/1.39 % SZS status Unsatisfiable
% 0.94/1.39 % SZS output start Refutation
% 0.94/1.39
% 0.94/1.39 clause( 59, [ ~( ssList( X ) ), frontsegP( X, nil ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 60, [ ~( ssList( X ) ), frontsegP( X, X ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 125, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~( ssList( X
% 0.94/1.39 ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 133, [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ),
% 0.94/1.39 ~( ssList( X ) ), frontsegP( app( X, Z ), Y ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 182, [ ssList( sk1 ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 183, [ ssList( sk2 ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 186, [ =( nil, sk2 ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 187, [ =( sk4, sk2 ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 188, [ =( sk3, sk1 ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 189, [ ~( =( sk2, sk1 ) ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 190, [ ssList( sk5 ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 191, [ =( app( sk1, sk5 ), sk2 ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 452, [ ~( ssList( X ) ), frontsegP( X, sk2 ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 4518, [ ~( =( X, sk1 ) ), ~( frontsegP( sk2, X ) ), ~( ssList( X )
% 0.94/1.39 ), ~( ssList( sk2 ) ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 4531, [ ~( frontsegP( sk2, sk1 ) ), ~( ssList( sk2 ) ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 4538, [ ~( frontsegP( sk2, sk1 ) ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 5456, [ ~( frontsegP( sk1, X ) ), ~( ssList( X ) ), ~( ssList( sk1
% 0.94/1.39 ) ), frontsegP( sk2, X ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 5477, [ ~( ssList( sk1 ) ), frontsegP( sk2, sk1 ) ] )
% 0.94/1.39 .
% 0.94/1.39 clause( 5572, [] )
% 0.94/1.39 .
% 0.94/1.39
% 0.94/1.39
% 0.94/1.39 % SZS output end Refutation
% 0.94/1.39 found a proof!
% 0.94/1.39
% 0.94/1.39 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.94/1.39
% 0.94/1.39 initialclauses(
% 0.94/1.39 [ clause( 5574, [ equalelemsP( nil ) ] )
% 0.94/1.39 , clause( 5575, [ duplicatefreeP( nil ) ] )
% 0.94/1.39 , clause( 5576, [ strictorderedP( nil ) ] )
% 0.94/1.39 , clause( 5577, [ totalorderedP( nil ) ] )
% 0.94/1.39 , clause( 5578, [ strictorderP( nil ) ] )
% 0.94/1.39 , clause( 5579, [ totalorderP( nil ) ] )
% 0.94/1.39 , clause( 5580, [ cyclefreeP( nil ) ] )
% 0.94/1.39 , clause( 5581, [ ssList( nil ) ] )
% 0.94/1.39 , clause( 5582, [ ssItem( skac3 ) ] )
% 0.94/1.39 , clause( 5583, [ ssItem( skac2 ) ] )
% 0.94/1.39 , clause( 5584, [ ~( singletonP( nil ) ) ] )
% 0.94/1.39 , clause( 5585, [ ssItem( skaf83( X ) ) ] )
% 0.94/1.39 , clause( 5586, [ ssList( skaf82( X ) ) ] )
% 0.94/1.39 , clause( 5587, [ ssList( skaf81( X ) ) ] )
% 0.94/1.39 , clause( 5588, [ ssList( skaf80( X ) ) ] )
% 0.94/1.39 , clause( 5589, [ ssItem( skaf79( X ) ) ] )
% 0.94/1.39 , clause( 5590, [ ssItem( skaf78( X ) ) ] )
% 0.94/1.39 , clause( 5591, [ ssList( skaf77( X ) ) ] )
% 0.94/1.39 , clause( 5592, [ ssList( skaf76( X ) ) ] )
% 0.94/1.39 , clause( 5593, [ ssList( skaf75( X ) ) ] )
% 0.94/1.39 , clause( 5594, [ ssItem( skaf74( X ) ) ] )
% 0.94/1.39 , clause( 5595, [ ssList( skaf73( X ) ) ] )
% 0.94/1.39 , clause( 5596, [ ssList( skaf72( X ) ) ] )
% 0.94/1.39 , clause( 5597, [ ssList( skaf71( X ) ) ] )
% 0.94/1.39 , clause( 5598, [ ssItem( skaf70( X ) ) ] )
% 0.94/1.39 , clause( 5599, [ ssItem( skaf69( X ) ) ] )
% 0.94/1.39 , clause( 5600, [ ssList( skaf68( X ) ) ] )
% 0.94/1.39 , clause( 5601, [ ssList( skaf67( X ) ) ] )
% 0.94/1.39 , clause( 5602, [ ssList( skaf66( X ) ) ] )
% 0.94/1.39 , clause( 5603, [ ssItem( skaf65( X ) ) ] )
% 0.94/1.39 , clause( 5604, [ ssItem( skaf64( X ) ) ] )
% 0.94/1.39 , clause( 5605, [ ssList( skaf63( X ) ) ] )
% 0.94/1.39 , clause( 5606, [ ssList( skaf62( X ) ) ] )
% 0.94/1.39 , clause( 5607, [ ssList( skaf61( X ) ) ] )
% 0.94/1.39 , clause( 5608, [ ssItem( skaf60( X ) ) ] )
% 0.94/1.39 , clause( 5609, [ ssItem( skaf59( X ) ) ] )
% 0.94/1.39 , clause( 5610, [ ssList( skaf58( X ) ) ] )
% 0.94/1.39 , clause( 5611, [ ssList( skaf57( X ) ) ] )
% 0.94/1.39 , clause( 5612, [ ssList( skaf56( X ) ) ] )
% 0.94/1.39 , clause( 5613, [ ssItem( skaf55( X ) ) ] )
% 0.94/1.39 , clause( 5614, [ ssItem( skaf54( X ) ) ] )
% 0.94/1.39 , clause( 5615, [ ssList( skaf53( X ) ) ] )
% 0.94/1.39 , clause( 5616, [ ssList( skaf52( X ) ) ] )
% 0.94/1.39 , clause( 5617, [ ssList( skaf51( X ) ) ] )
% 0.94/1.39 , clause( 5618, [ ssItem( skaf50( X ) ) ] )
% 0.94/1.39 , clause( 5619, [ ssItem( skaf49( X ) ) ] )
% 0.94/1.39 , clause( 5620, [ ssItem( skaf44( X ) ) ] )
% 0.94/1.39 , clause( 5621, [ ssList( skaf48( X, Y ) ) ] )
% 0.94/1.39 , clause( 5622, [ ssList( skaf47( X, Y ) ) ] )
% 0.94/1.39 , clause( 5623, [ ssList( skaf46( X, Y ) ) ] )
% 0.94/1.39 , clause( 5624, [ ssList( skaf45( X, Y ) ) ] )
% 0.94/1.39 , clause( 5625, [ ssList( skaf43( X, Y ) ) ] )
% 0.94/1.39 , clause( 5626, [ ssList( skaf42( X, Y ) ) ] )
% 0.94/1.39 , clause( 5627, [ ~( =( skac3, skac2 ) ) ] )
% 0.94/1.39 , clause( 5628, [ ~( ssItem( X ) ), geq( X, X ) ] )
% 0.94/1.39 , clause( 5629, [ ~( ssList( X ) ), segmentP( X, nil ) ] )
% 0.94/1.39 , clause( 5630, [ ~( ssList( X ) ), segmentP( X, X ) ] )
% 0.94/1.39 , clause( 5631, [ ~( ssList( X ) ), rearsegP( X, nil ) ] )
% 0.94/1.39 , clause( 5632, [ ~( ssList( X ) ), rearsegP( X, X ) ] )
% 0.94/1.39 , clause( 5633, [ ~( ssList( X ) ), frontsegP( X, nil ) ] )
% 0.94/1.39 , clause( 5634, [ ~( ssList( X ) ), frontsegP( X, X ) ] )
% 0.94/1.39 , clause( 5635, [ ~( ssItem( X ) ), leq( X, X ) ] )
% 0.94/1.39 , clause( 5636, [ ~( lt( X, X ) ), ~( ssItem( X ) ) ] )
% 0.94/1.39 , clause( 5637, [ ~( ssItem( X ) ), equalelemsP( cons( X, nil ) ) ] )
% 0.94/1.39 , clause( 5638, [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ] )
% 0.94/1.39 , clause( 5639, [ ~( ssItem( X ) ), strictorderedP( cons( X, nil ) ) ] )
% 0.94/1.39 , clause( 5640, [ ~( ssItem( X ) ), totalorderedP( cons( X, nil ) ) ] )
% 0.94/1.39 , clause( 5641, [ ~( ssItem( X ) ), strictorderP( cons( X, nil ) ) ] )
% 0.94/1.39 , clause( 5642, [ ~( ssItem( X ) ), totalorderP( cons( X, nil ) ) ] )
% 0.94/1.39 , clause( 5643, [ ~( ssItem( X ) ), cyclefreeP( cons( X, nil ) ) ] )
% 0.94/1.39 , clause( 5644, [ ~( memberP( nil, X ) ), ~( ssItem( X ) ) ] )
% 0.94/1.39 , clause( 5645, [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ] )
% 0.94/1.39 , clause( 5646, [ ~( ssList( X ) ), =( app( X, nil ), X ) ] )
% 0.94/1.39 , clause( 5647, [ ~( ssList( X ) ), =( app( nil, X ), X ) ] )
% 0.94/1.39 , clause( 5648, [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ] )
% 0.94/1.39 , clause( 5649, [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ] )
% 0.94/1.39 , clause( 5650, [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ] )
% 0.94/1.39 , clause( 5651, [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ] )
% 0.94/1.39 , clause( 5652, [ ~( =( nil, X ) ), ~( ssList( X ) ), segmentP( nil, X ) ]
% 0.94/1.39 )
% 0.94/1.39 , clause( 5653, [ ~( segmentP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 0.94/1.39 )
% 0.94/1.39 , clause( 5654, [ ~( =( nil, X ) ), ~( ssList( X ) ), rearsegP( nil, X ) ]
% 0.94/1.39 )
% 0.94/1.39 , clause( 5655, [ ~( rearsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 0.94/1.39 )
% 0.94/1.39 , clause( 5656, [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X ) ]
% 0.94/1.39 )
% 0.94/1.39 , clause( 5657, [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 0.94/1.39 )
% 0.94/1.39 , clause( 5658, [ ~( ssList( X ) ), ~( ssList( Y ) ), ssList( app( Y, X ) )
% 0.94/1.39 ] )
% 0.94/1.39 , clause( 5659, [ ~( ssItem( X ) ), ~( ssList( Y ) ), ssList( cons( X, Y )
% 0.94/1.39 ) ] )
% 0.94/1.39 , clause( 5660, [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf50( X ),
% 0.94/1.39 skaf49( X ) ) ] )
% 0.94/1.39 , clause( 5661, [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf49( X ),
% 0.94/1.39 skaf50( X ) ) ] )
% 0.94/1.39 , clause( 5662, [ ~( =( skaf79( X ), skaf78( X ) ) ), ~( ssList( X ) ),
% 0.94/1.39 equalelemsP( X ) ] )
% 0.94/1.39 , clause( 5663, [ ~( lt( skaf69( X ), skaf70( X ) ) ), ~( ssList( X ) ),
% 0.94/1.39 strictorderedP( X ) ] )
% 0.94/1.39 , clause( 5664, [ ~( leq( skaf64( X ), skaf65( X ) ) ), ~( ssList( X ) ),
% 0.94/1.39 totalorderedP( X ) ] )
% 0.94/1.39 , clause( 5665, [ ~( lt( skaf60( X ), skaf59( X ) ) ), ~( ssList( X ) ),
% 0.94/1.39 strictorderP( X ) ] )
% 0.94/1.39 , clause( 5666, [ ~( lt( skaf59( X ), skaf60( X ) ) ), ~( ssList( X ) ),
% 0.94/1.39 strictorderP( X ) ] )
% 0.94/1.39 , clause( 5667, [ ~( leq( skaf55( X ), skaf54( X ) ) ), ~( ssList( X ) ),
% 0.94/1.39 totalorderP( X ) ] )
% 0.94/1.39 , clause( 5668, [ ~( leq( skaf54( X ), skaf55( X ) ) ), ~( ssList( X ) ),
% 0.94/1.39 totalorderP( X ) ] )
% 0.94/1.39 , clause( 5669, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( tl( cons( X, Y ) )
% 0.94/1.39 , Y ) ] )
% 0.94/1.39 , clause( 5670, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( hd( cons( X, Y ) )
% 0.94/1.39 , X ) ] )
% 0.94/1.39 , clause( 5671, [ ~( =( cons( X, Y ), nil ) ), ~( ssItem( X ) ), ~( ssList(
% 0.94/1.39 Y ) ) ] )
% 0.94/1.39 , clause( 5672, [ ~( =( cons( X, Y ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y
% 0.94/1.39 ) ) ] )
% 0.94/1.39 , clause( 5673, [ ~( ssList( X ) ), ~( ssList( Y ) ), neq( Y, X ), =( Y, X
% 0.94/1.39 ) ] )
% 0.94/1.39 , clause( 5674, [ ~( singletonP( X ) ), ~( ssList( X ) ), =( cons( skaf44(
% 0.94/1.39 X ), nil ), X ) ] )
% 0.94/1.39 , clause( 5675, [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X
% 0.94/1.39 ) ] )
% 0.94/1.39 , clause( 5676, [ ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq(
% 0.94/1.39 X, Y ) ] )
% 0.94/1.39 , clause( 5677, [ ~( ssList( X ) ), =( cons( hd( X ), tl( X ) ), X ), =(
% 0.94/1.39 nil, X ) ] )
% 0.94/1.39 , clause( 5678, [ ~( gt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 0.94/1.39 Y, X ) ] )
% 0.94/1.39 , clause( 5679, [ ~( lt( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), gt(
% 0.94/1.39 Y, X ) ] )
% 0.94/1.39 , clause( 5680, [ ~( geq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq(
% 0.94/1.39 Y, X ) ] )
% 0.94/1.39 , clause( 5681, [ ~( leq( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), geq(
% 0.94/1.39 Y, X ) ] )
% 0.94/1.39 , clause( 5682, [ ~( ssList( X ) ), =( cons( skaf83( X ), skaf82( X ) ), X
% 0.94/1.39 ), =( nil, X ) ] )
% 0.94/1.39 , clause( 5683, [ ~( gt( X, Y ) ), ~( gt( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.94/1.39 ssItem( Y ) ) ] )
% 0.94/1.39 , clause( 5684, [ ~( =( X, Y ) ), ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~(
% 0.94/1.39 ssItem( X ) ) ] )
% 0.94/1.39 , clause( 5685, [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 0.94/1.39 strictorderedP( cons( Y, X ) ) ] )
% 0.94/1.39 , clause( 5686, [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 0.94/1.39 totalorderedP( cons( Y, X ) ) ] )
% 0.94/1.39 , clause( 5687, [ ~( lt( X, Y ) ), ~( lt( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.94/1.39 ssItem( Y ) ) ] )
% 0.94/1.39 , clause( 5688, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssList( Y ) ), ~(
% 0.94/1.39 ssList( X ) ) ] )
% 0.94/1.39 , clause( 5689, [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList(
% 0.94/1.39 Y ) ), singletonP( Y ) ] )
% 0.94/1.39 , clause( 5690, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~(
% 0.94/1.39 ssItem( X ) ) ] )
% 0.94/1.39 , clause( 5691, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList(
% 0.94/1.39 X ) ), =( nil, X ) ] )
% 0.94/1.39 , clause( 5692, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList(
% 0.94/1.39 X ) ), =( nil, Y ) ] )
% 0.94/1.39 , clause( 5693, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( app( cons( X, nil
% 0.94/1.39 ), Y ), cons( X, Y ) ) ] )
% 0.94/1.39 , clause( 5694, [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 0.94/1.39 X, Y ), =( X, Y ) ] )
% 0.94/1.39 , clause( 5695, [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 0.94/1.39 X, Y ), =( X, Y ) ] )
% 0.94/1.39 , clause( 5696, [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( hd(
% 0.94/1.39 app( Y, X ) ), hd( Y ) ) ] )
% 0.94/1.39 , clause( 5697, [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ),
% 0.94/1.39 ~( ssItem( X ) ), strictorderedP( Y ), =( nil, Y ) ] )
% 0.94/1.39 , clause( 5698, [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~(
% 0.94/1.39 ssItem( X ) ), totalorderedP( Y ), =( nil, Y ) ] )
% 0.94/1.39 , clause( 5699, [ ~( geq( X, Y ) ), ~( geq( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.94/1.39 ssItem( Y ) ), =( Y, X ) ] )
% 0.94/1.39 , clause( 5700, [ ~( segmentP( X, Y ) ), ~( segmentP( Y, X ) ), ~( ssList(
% 0.94/1.39 X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.94/1.39 , clause( 5701, [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, X ) ), ~( ssList(
% 0.94/1.39 X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.94/1.39 , clause( 5702, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~( ssList(
% 0.94/1.39 X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.94/1.39 , clause( 5703, [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.94/1.39 ssItem( Y ) ), =( Y, X ) ] )
% 0.94/1.39 , clause( 5704, [ ~( rearsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.94/1.39 , =( app( skaf46( X, Y ), Y ), X ) ] )
% 0.94/1.39 , clause( 5705, [ ~( frontsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X )
% 0.94/1.39 ), =( app( Y, skaf45( X, Y ) ), X ) ] )
% 0.94/1.39 , clause( 5706, [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( tl(
% 0.94/1.39 app( Y, X ) ), app( tl( Y ), X ) ) ] )
% 0.94/1.39 , clause( 5707, [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ),
% 0.94/1.39 ~( ssItem( X ) ), lt( X, hd( Y ) ), =( nil, Y ) ] )
% 0.94/1.39 , clause( 5708, [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~(
% 0.94/1.39 ssItem( X ) ), leq( X, hd( Y ) ), =( nil, Y ) ] )
% 0.94/1.39 , clause( 5709, [ ~( rearsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) )
% 0.94/1.39 , ~( ssList( X ) ), rearsegP( app( Z, X ), Y ) ] )
% 0.94/1.39 , clause( 5710, [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y )
% 0.94/1.39 ), ~( ssList( X ) ), frontsegP( app( X, Z ), Y ) ] )
% 0.94/1.39 , clause( 5711, [ ~( =( X, Y ) ), ~( ssList( Z ) ), ~( ssItem( Y ) ), ~(
% 0.94/1.39 ssItem( X ) ), memberP( cons( Y, Z ), X ) ] )
% 0.94/1.39 , clause( 5712, [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssItem( Z ) )
% 0.94/1.39 , ~( ssItem( Y ) ), memberP( cons( Z, X ), Y ) ] )
% 0.94/1.39 , clause( 5713, [ ~( memberP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( X ) )
% 0.94/1.39 , ~( ssItem( Y ) ), memberP( app( X, Z ), Y ) ] )
% 0.94/1.39 , clause( 5714, [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssList( Z ) )
% 0.94/1.39 , ~( ssItem( Y ) ), memberP( app( Z, X ), Y ) ] )
% 0.94/1.39 , clause( 5715, [ ~( ssList( X ) ), equalelemsP( X ), =( app( skaf80( X ),
% 0.94/1.39 cons( skaf78( X ), cons( skaf79( X ), skaf81( X ) ) ) ), X ) ] )
% 0.94/1.39 , clause( 5716, [ ~( =( app( X, Y ), Z ) ), ~( ssList( X ) ), ~( ssList( Y
% 0.94/1.39 ) ), ~( ssList( Z ) ), rearsegP( Z, Y ) ] )
% 0.94/1.39 , clause( 5717, [ ~( =( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X
% 0.94/1.39 ) ), ~( ssList( Z ) ), frontsegP( Z, X ) ] )
% 0.94/1.39 , clause( 5718, [ ~( =( nil, X ) ), ~( =( nil, Y ) ), ~( ssList( Y ) ), ~(
% 0.94/1.39 ssList( X ) ), =( app( X, Y ), nil ) ] )
% 0.94/1.39 , clause( 5719, [ ~( gt( X, Y ) ), ~( gt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.94/1.39 ssItem( Y ) ), ~( ssItem( X ) ), gt( X, Z ) ] )
% 0.94/1.39 , clause( 5720, [ ~( leq( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.94/1.39 ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Z ) ] )
% 0.94/1.39 , clause( 5721, [ ~( geq( X, Y ) ), ~( geq( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.94/1.39 ssItem( Y ) ), ~( ssItem( X ) ), geq( X, Z ) ] )
% 0.94/1.39 , clause( 5722, [ ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =(
% 0.94/1.39 app( app( Z, Y ), X ), app( Z, app( Y, X ) ) ) ] )
% 0.94/1.39 , clause( 5723, [ ~( =( app( X, Y ), app( X, Z ) ) ), ~( ssList( Y ) ), ~(
% 0.94/1.39 ssList( X ) ), ~( ssList( Z ) ), =( Y, Z ) ] )
% 0.94/1.39 , clause( 5724, [ ~( =( app( X, Y ), app( Z, Y ) ) ), ~( ssList( X ) ), ~(
% 0.94/1.39 ssList( Y ) ), ~( ssList( Z ) ), =( X, Z ) ] )
% 0.94/1.39 , clause( 5725, [ ~( segmentP( X, Y ) ), ~( segmentP( Y, Z ) ), ~( ssList(
% 0.94/1.39 Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), segmentP( X, Z ) ] )
% 0.94/1.39 , clause( 5726, [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, Z ) ), ~( ssList(
% 0.94/1.39 Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), rearsegP( X, Z ) ] )
% 0.94/1.39 , clause( 5727, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, Z ) ), ~( ssList(
% 0.94/1.39 Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), frontsegP( X, Z ) ] )
% 0.94/1.39 , clause( 5728, [ ~( lt( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.94/1.39 ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Z ) ] )
% 0.94/1.39 , clause( 5729, [ ~( leq( X, Y ) ), ~( leq( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.94/1.39 ssItem( Y ) ), ~( ssItem( X ) ), leq( X, Z ) ] )
% 0.94/1.39 , clause( 5730, [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =(
% 0.94/1.39 cons( X, app( Y, Z ) ), app( cons( X, Y ), Z ) ) ] )
% 0.94/1.39 , clause( 5731, [ ~( memberP( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~(
% 0.94/1.39 ssList( X ) ), ~( ssItem( Z ) ), memberP( Y, Z ), memberP( X, Z ) ] )
% 0.94/1.39 , clause( 5732, [ ~( leq( X, hd( Y ) ) ), ~( totalorderedP( Y ) ), ~(
% 0.94/1.39 ssList( Y ) ), ~( ssItem( X ) ), totalorderedP( cons( X, Y ) ), =( nil, Y
% 0.94/1.39 ) ] )
% 0.94/1.39 , clause( 5733, [ ~( lt( X, hd( Y ) ) ), ~( strictorderedP( Y ) ), ~(
% 0.94/1.39 ssList( Y ) ), ~( ssItem( X ) ), strictorderedP( cons( X, Y ) ), =( nil,
% 0.94/1.39 Y ) ] )
% 0.94/1.39 , clause( 5734, [ ~( memberP( cons( X, Y ), Z ) ), ~( ssList( Y ) ), ~(
% 0.94/1.39 ssItem( X ) ), ~( ssItem( Z ) ), memberP( Y, Z ), =( Z, X ) ] )
% 0.94/1.39 , clause( 5735, [ ~( ssList( X ) ), duplicatefreeP( X ), =( app( app(
% 0.94/1.39 skaf75( X ), cons( skaf74( X ), skaf76( X ) ) ), cons( skaf74( X ),
% 0.94/1.39 skaf77( X ) ) ), X ) ] )
% 0.94/1.39 , clause( 5736, [ ~( ssList( X ) ), strictorderedP( X ), =( app( app(
% 0.94/1.39 skaf71( X ), cons( skaf69( X ), skaf72( X ) ) ), cons( skaf70( X ),
% 0.94/1.39 skaf73( X ) ) ), X ) ] )
% 0.94/1.39 , clause( 5737, [ ~( ssList( X ) ), totalorderedP( X ), =( app( app( skaf66(
% 0.94/1.39 X ), cons( skaf64( X ), skaf67( X ) ) ), cons( skaf65( X ), skaf68( X ) )
% 0.94/1.39 ), X ) ] )
% 0.94/1.39 , clause( 5738, [ ~( ssList( X ) ), strictorderP( X ), =( app( app( skaf61(
% 0.94/1.39 X ), cons( skaf59( X ), skaf62( X ) ) ), cons( skaf60( X ), skaf63( X ) )
% 0.94/1.39 ), X ) ] )
% 0.94/1.39 , clause( 5739, [ ~( ssList( X ) ), totalorderP( X ), =( app( app( skaf56(
% 0.94/1.39 X ), cons( skaf54( X ), skaf57( X ) ) ), cons( skaf55( X ), skaf58( X ) )
% 0.94/1.39 ), X ) ] )
% 0.94/1.39 , clause( 5740, [ ~( ssList( X ) ), cyclefreeP( X ), =( app( app( skaf51( X
% 0.94/1.39 ), cons( skaf49( X ), skaf52( X ) ) ), cons( skaf50( X ), skaf53( X ) )
% 0.94/1.39 ), X ) ] )
% 0.94/1.39 , clause( 5741, [ ~( segmentP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.94/1.39 , =( app( app( skaf47( X, Y ), Y ), skaf48( Y, X ) ), X ) ] )
% 0.94/1.39 , clause( 5742, [ ~( memberP( X, Y ) ), ~( ssItem( Y ) ), ~( ssList( X ) )
% 0.94/1.39 , =( app( skaf42( X, Y ), cons( Y, skaf43( Y, X ) ) ), X ) ] )
% 0.94/1.39 , clause( 5743, [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ),
% 0.94/1.39 ~( ssItem( X ) ), ~( ssList( T ) ), ~( ssList( Y ) ), =( X, Z ) ] )
% 0.94/1.39 , clause( 5744, [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ),
% 0.94/1.39 ~( ssItem( X ) ), ~( ssList( T ) ), ~( ssList( Y ) ), =( T, Y ) ] )
% 0.94/1.39 , clause( 5745, [ ~( segmentP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( T ) )
% 0.94/1.39 , ~( ssList( Y ) ), ~( ssList( X ) ), segmentP( app( app( T, X ), Z ), Y
% 0.94/1.39 ) ] )
% 0.94/1.39 , clause( 5746, [ ~( =( app( app( X, Y ), Z ), T ) ), ~( ssList( Z ) ), ~(
% 0.94/1.39 ssList( X ) ), ~( ssList( Y ) ), ~( ssList( T ) ), segmentP( T, Y ) ] )
% 0.94/1.39 , clause( 5747, [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList(
% 0.94/1.39 T ) ), ~( ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), frontsegP( Y
% 0.94/1.39 , T ) ] )
% 0.94/1.39 , clause( 5748, [ ~( =( app( X, cons( Y, Z ) ), T ) ), ~( ssList( Z ) ),
% 0.94/1.39 ~( ssList( X ) ), ~( ssItem( Y ) ), ~( ssList( T ) ), memberP( T, Y ) ]
% 0.94/1.39 )
% 0.94/1.39 , clause( 5749, [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList(
% 0.94/1.39 T ) ), ~( ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), =( X, Z ) ]
% 0.94/1.39 )
% 0.94/1.39 , clause( 5750, [ ~( =( tl( X ), tl( Y ) ) ), ~( =( hd( X ), hd( Y ) ) ),
% 0.94/1.39 ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( X, Y ), =( nil, X ) ]
% 0.94/1.39 )
% 0.94/1.39 , clause( 5751, [ ~( frontsegP( X, Y ) ), ~( =( Z, T ) ), ~( ssList( Y ) )
% 0.94/1.39 , ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Z ) ), frontsegP( cons(
% 0.94/1.39 Z, X ), cons( T, Y ) ) ] )
% 0.94/1.39 , clause( 5752, [ ~( =( app( app( X, cons( Y, Z ) ), cons( Y, T ) ), U ) )
% 0.94/1.39 , ~( ssList( T ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y ) )
% 0.94/1.39 , ~( duplicatefreeP( U ) ), ~( ssList( U ) ) ] )
% 0.94/1.39 , clause( 5753, [ ~( =( app( X, cons( Y, cons( Z, T ) ) ), U ) ), ~( ssList(
% 0.94/1.39 T ) ), ~( ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ), ~(
% 0.94/1.39 equalelemsP( U ) ), ~( ssList( U ) ), =( Y, Z ) ] )
% 0.94/1.39 , clause( 5754, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 0.94/1.39 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 0.94/1.39 , ~( ssItem( Y ) ), ~( strictorderedP( W ) ), ~( ssList( W ) ), lt( Y, T
% 0.94/1.39 ) ] )
% 0.94/1.39 , clause( 5755, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 0.94/1.39 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 0.94/1.39 , ~( ssItem( Y ) ), ~( totalorderedP( W ) ), ~( ssList( W ) ), leq( Y, T
% 0.94/1.39 ) ] )
% 0.94/1.39 , clause( 5756, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 0.94/1.39 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 0.94/1.39 , ~( ssItem( Y ) ), ~( strictorderP( W ) ), ~( ssList( W ) ), lt( Y, T )
% 0.94/1.39 , lt( T, Y ) ] )
% 0.94/1.39 , clause( 5757, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 0.94/1.39 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 0.94/1.39 , ~( ssItem( Y ) ), ~( totalorderP( W ) ), ~( ssList( W ) ), leq( Y, T )
% 0.94/1.39 , leq( T, Y ) ] )
% 0.94/1.39 , clause( 5758, [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( =( app( app( Z,
% 0.94/1.39 cons( X, T ) ), cons( Y, U ) ), W ) ), ~( ssList( U ) ), ~( ssList( T ) )
% 0.94/1.39 , ~( ssList( Z ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), ~( cyclefreeP( W
% 0.94/1.39 ) ), ~( ssList( W ) ) ] )
% 0.94/1.39 , clause( 5759, [ ssList( sk1 ) ] )
% 0.94/1.39 , clause( 5760, [ ssList( sk2 ) ] )
% 0.94/1.39 , clause( 5761, [ ssList( sk3 ) ] )
% 0.94/1.39 , clause( 5762, [ ssList( sk4 ) ] )
% 0.94/1.39 , clause( 5763, [ =( nil, sk2 ) ] )
% 0.94/1.39 , clause( 5764, [ =( sk2, sk4 ) ] )
% 0.94/1.39 , clause( 5765, [ =( sk1, sk3 ) ] )
% 0.94/1.39 , clause( 5766, [ ~( =( nil, sk1 ) ) ] )
% 0.94/1.39 , clause( 5767, [ ssList( sk5 ) ] )
% 0.94/1.39 , clause( 5768, [ =( app( sk3, sk5 ), sk4 ) ] )
% 0.94/1.39 , clause( 5769, [ totalorderedP( sk3 ) ] )
% 0.94/1.39 , clause( 5770, [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( =( app( cons( X,
% 0.94/1.39 nil ), Y ), sk5 ) ), ~( ssItem( Z ) ), ~( ssList( T ) ), ~( =( app( T,
% 0.94/1.39 cons( Z, nil ) ), sk3 ) ), ~( leq( Z, X ) ) ] )
% 0.94/1.39 , clause( 5771, [ =( nil, sk4 ), ~( =( nil, sk3 ) ) ] )
% 0.94/1.39 ] ).
% 0.94/1.39
% 0.94/1.39
% 0.94/1.39
% 0.94/1.39 subsumption(
% 0.94/1.39 clause( 59, [ ~( ssList( X ) ), frontsegP( X, nil ) ] )
% 0.94/1.39 , clause( 5633, [ ~( ssList( X ) ), frontsegP( X, nil ) ] )
% 0.94/1.39 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.94/1.39 1 )] ) ).
% 0.94/1.39
% 0.94/1.39
% 0.94/1.39 subsumption(
% 0.94/1.39 clause( 60, [ ~( ssList( X ) ), frontsegP( X, X ) ] )
% 0.94/1.39 , clause( 5634, [ ~( ssList( X ) ), frontsegP( X, X ) ] )
% 0.94/1.39 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.94/1.39 1 )] ) ).
% 0.94/1.39
% 0.94/1.39
% 0.94/1.39 subsumption(
% 0.94/1.39 clause( 125, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~( ssList( X
% 0.94/1.39 ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.94/1.39 , clause( 5702, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~( ssList(
% 0.94/1.39 X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.94/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.94/1.39 ), ==>( 1, 1 ), ==>( 2, 2 ), ==>( 3, 3 ), ==>( 4, 4 )] ) ).
% 0.94/1.39
% 0.94/1.39
% 0.94/1.39 subsumption(
% 0.94/1.39 clause( 133, [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ),
% 0.94/1.39 ~( ssList( X ) ), frontsegP( app( X, Z ), Y ) ] )
% 0.94/1.39 , clauCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------