%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWC179-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n024.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:34:32 EDT 2022
% Result : Unsatisfiable 1.61s 2.04s
% Output : Refutation 1.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWC179-1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.07 % Command : bliksem %s
% 0.07/0.26 % Computer : n024.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % DateTime : Sun Jun 12 10:42:48 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.49/0.90 *** allocated 10000 integers for termspace/termends
% 0.49/0.90 *** allocated 10000 integers for clauses
% 0.49/0.90 *** allocated 10000 integers for justifications
% 0.49/0.90 Bliksem 1.12
% 0.49/0.90
% 0.49/0.90
% 0.49/0.90 Automatic Strategy Selection
% 0.49/0.90
% 0.49/0.90 Clauses:
% 0.49/0.90 [
% 0.49/0.90 [ equalelemsP( nil ) ],
% 0.49/0.90 [ duplicatefreeP( nil ) ],
% 0.49/0.90 [ strictorderedP( nil ) ],
% 0.49/0.90 [ totalorderedP( nil ) ],
% 0.49/0.90 [ strictorderP( nil ) ],
% 0.49/0.90 [ totalorderP( nil ) ],
% 0.49/0.90 [ cyclefreeP( nil ) ],
% 0.49/0.90 [ ssList( nil ) ],
% 0.49/0.90 [ ssItem( skac3 ) ],
% 0.49/0.90 [ ssItem( skac2 ) ],
% 0.49/0.90 [ ~( singletonP( nil ) ) ],
% 0.49/0.90 [ ssItem( skaf83( X ) ) ],
% 0.49/0.90 [ ssList( skaf82( X ) ) ],
% 0.49/0.90 [ ssList( skaf81( X ) ) ],
% 0.49/0.90 [ ssList( skaf80( X ) ) ],
% 0.49/0.90 [ ssItem( skaf79( X ) ) ],
% 0.49/0.90 [ ssItem( skaf78( X ) ) ],
% 0.49/0.90 [ ssList( skaf77( X ) ) ],
% 0.49/0.90 [ ssList( skaf76( X ) ) ],
% 0.49/0.90 [ ssList( skaf75( X ) ) ],
% 0.49/0.90 [ ssItem( skaf74( X ) ) ],
% 0.49/0.90 [ ssList( skaf73( X ) ) ],
% 0.49/0.90 [ ssList( skaf72( X ) ) ],
% 0.49/0.90 [ ssList( skaf71( X ) ) ],
% 0.49/0.90 [ ssItem( skaf70( X ) ) ],
% 0.49/0.90 [ ssItem( skaf69( X ) ) ],
% 0.49/0.90 [ ssList( skaf68( X ) ) ],
% 0.49/0.90 [ ssList( skaf67( X ) ) ],
% 0.49/0.90 [ ssList( skaf66( X ) ) ],
% 0.49/0.90 [ ssItem( skaf65( X ) ) ],
% 0.49/0.90 [ ssItem( skaf64( X ) ) ],
% 0.49/0.90 [ ssList( skaf63( X ) ) ],
% 0.49/0.90 [ ssList( skaf62( X ) ) ],
% 0.49/0.90 [ ssList( skaf61( X ) ) ],
% 0.49/0.90 [ ssItem( skaf60( X ) ) ],
% 0.49/0.90 [ ssItem( skaf59( X ) ) ],
% 0.49/0.90 [ ssList( skaf58( X ) ) ],
% 0.49/0.90 [ ssList( skaf57( X ) ) ],
% 0.49/0.90 [ ssList( skaf56( X ) ) ],
% 0.49/0.90 [ ssItem( skaf55( X ) ) ],
% 0.49/0.90 [ ssItem( skaf54( X ) ) ],
% 0.49/0.90 [ ssList( skaf53( X ) ) ],
% 0.49/0.90 [ ssList( skaf52( X ) ) ],
% 0.49/0.90 [ ssList( skaf51( X ) ) ],
% 0.49/0.90 [ ssItem( skaf50( X ) ) ],
% 0.49/0.90 [ ssItem( skaf49( X ) ) ],
% 0.49/0.90 [ ssItem( skaf44( X ) ) ],
% 0.49/0.90 [ ssList( skaf48( X, Y ) ) ],
% 0.49/0.90 [ ssList( skaf47( X, Y ) ) ],
% 0.49/0.90 [ ssList( skaf46( X, Y ) ) ],
% 0.49/0.90 [ ssList( skaf45( X, Y ) ) ],
% 0.49/0.90 [ ssList( skaf43( X, Y ) ) ],
% 0.49/0.90 [ ssList( skaf42( X, Y ) ) ],
% 0.49/0.90 [ ~( =( skac3, skac2 ) ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), geq( X, X ) ],
% 0.49/0.90 [ ~( ssList( X ) ), segmentP( X, nil ) ],
% 0.49/0.90 [ ~( ssList( X ) ), segmentP( X, X ) ],
% 0.49/0.90 [ ~( ssList( X ) ), rearsegP( X, nil ) ],
% 0.49/0.90 [ ~( ssList( X ) ), rearsegP( X, X ) ],
% 0.49/0.90 [ ~( ssList( X ) ), frontsegP( X, nil ) ],
% 0.49/0.90 [ ~( ssList( X ) ), frontsegP( X, X ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), leq( X, X ) ],
% 0.49/0.90 [ ~( lt( X, X ) ), ~( ssItem( X ) ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), equalelemsP( cons( X, nil ) ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), strictorderedP( cons( X, nil ) ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), totalorderedP( cons( X, nil ) ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), strictorderP( cons( X, nil ) ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), totalorderP( cons( X, nil ) ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), cyclefreeP( cons( X, nil ) ) ],
% 0.49/0.90 [ ~( memberP( nil, X ) ), ~( ssItem( X ) ) ],
% 0.49/0.90 [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ],
% 0.49/0.90 [ ~( ssList( X ) ), =( app( X, nil ), X ) ],
% 0.49/0.90 [ ~( ssList( X ) ), =( app( nil, X ), X ) ],
% 0.49/0.90 [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ],
% 0.49/0.90 [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ],
% 0.49/0.90 [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ],
% 0.49/0.90 [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ],
% 0.49/0.90 [ ~( =( nil, X ) ), ~( ssList( X ) ), segmentP( nil, X ) ],
% 0.49/0.90 [ ~( segmentP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.49/0.90 [ ~( =( nil, X ) ), ~( ssList( X ) ), rearsegP( nil, X ) ],
% 0.49/0.90 [ ~( rearsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.49/0.90 [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X ) ],
% 0.49/0.90 [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.49/0.90 [ ~( ssList( X ) ), ~( ssList( Y ) ), ssList( app( Y, X ) ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), ~( ssList( Y ) ), ssList( cons( X, Y ) ) ],
% 0.49/0.90 [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf50( X ), skaf49( X ) ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf49( X ), skaf50( X ) ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( =( skaf79( X ), skaf78( X ) ) ), ~( ssList( X ) ), equalelemsP( X )
% 0.49/0.90 ],
% 0.49/0.90 [ ~( lt( skaf69( X ), skaf70( X ) ) ), ~( ssList( X ) ), strictorderedP(
% 0.49/0.90 X ) ],
% 0.49/0.90 [ ~( leq( skaf64( X ), skaf65( X ) ) ), ~( ssList( X ) ), totalorderedP(
% 0.49/0.90 X ) ],
% 0.49/0.90 [ ~( lt( skaf60( X ), skaf59( X ) ) ), ~( ssList( X ) ), strictorderP( X
% 0.49/0.90 ) ],
% 0.49/0.90 [ ~( lt( skaf59( X ), skaf60( X ) ) ), ~( ssList( X ) ), strictorderP( X
% 0.49/0.90 ) ],
% 0.49/0.90 [ ~( leq( skaf55( X ), skaf54( X ) ) ), ~( ssList( X ) ), totalorderP( X
% 0.49/0.90 ) ],
% 0.49/0.90 [ ~( leq( skaf54( X ), skaf55( X ) ) ), ~( ssList( X ) ), totalorderP( X
% 0.49/0.90 ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( tl( cons( X, Y ) ), Y ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( hd( cons( X, Y ) ), X ) ],
% 0.49/0.90 [ ~( =( cons( X, Y ), nil ) ), ~( ssItem( X ) ), ~( ssList( Y ) ) ],
% 0.49/0.90 [ ~( =( cons( X, Y ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y ) ) ],
% 0.49/0.90 [ ~( ssList( X ) ), ~( ssList( Y ) ), neq( Y, X ), =( Y, X ) ],
% 0.49/0.90 [ ~( singletonP( X ) ), ~( ssList( X ) ), =( cons( skaf44( X ), nil ), X
% 0.49/0.90 ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X ) ],
% 0.49/0.90 [ ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( X, Y ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( ssList( X ) ), =( cons( hd( X ), tl( X ) ), X ), =( nil, X ) ],
% 0.49/0.90 [ ~( gt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( Y, X ) ],
% 0.49/0.90 [ ~( lt( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), gt( Y, X ) ],
% 0.49/0.90 [ ~( geq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( Y, X ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( leq( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), geq( Y, X ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( ssList( X ) ), =( cons( skaf83( X ), skaf82( X ) ), X ), =( nil, X
% 0.49/0.90 ) ],
% 0.49/0.90 [ ~( gt( X, Y ) ), ~( gt( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( =( X, Y ) ), ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), strictorderedP(
% 0.49/0.90 cons( Y, X ) ) ],
% 0.49/0.90 [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), totalorderedP(
% 0.49/0.90 cons( Y, X ) ) ],
% 0.49/0.90 [ ~( lt( X, Y ) ), ~( lt( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y ) ),
% 0.49/0.90 singletonP( Y ) ],
% 0.49/0.90 [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( nil
% 0.49/0.90 , X ) ],
% 0.49/0.90 [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( nil
% 0.49/0.90 , Y ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( app( cons( X, nil ), Y ), cons(
% 0.49/0.90 X, Y ) ) ],
% 0.49/0.90 [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Y ), =( X
% 0.49/0.90 , Y ) ],
% 0.49/0.90 [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Y ), =( X
% 0.49/0.90 , Y ) ],
% 0.49/0.90 [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( hd( app( Y, X ) )
% 0.49/0.90 , hd( Y ) ) ],
% 0.49/0.90 [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X )
% 0.49/0.90 ), strictorderedP( Y ), =( nil, Y ) ],
% 0.49/0.90 [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X ) )
% 0.49/0.90 , totalorderedP( Y ), =( nil, Y ) ],
% 0.49/0.90 [ ~( geq( X, Y ) ), ~( geq( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) )
% 0.49/0.90 , =( Y, X ) ],
% 0.49/0.90 [ ~( segmentP( X, Y ) ), ~( segmentP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.49/0.90 ssList( Y ) ), =( Y, X ) ],
% 0.49/0.90 [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.49/0.90 ssList( Y ) ), =( Y, X ) ],
% 0.49/0.90 [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.49/0.90 ssList( Y ) ), =( Y, X ) ],
% 0.49/0.90 [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) )
% 0.49/0.90 , =( Y, X ) ],
% 0.49/0.90 [ ~( rearsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app(
% 0.49/0.90 skaf46( X, Y ), Y ), X ) ],
% 0.49/0.90 [ ~( frontsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app( Y
% 0.49/0.90 , skaf45( X, Y ) ), X ) ],
% 0.49/0.90 [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( tl( app( Y, X ) )
% 0.49/0.90 , app( tl( Y ), X ) ) ],
% 0.49/0.90 [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X )
% 0.49/0.90 ), lt( X, hd( Y ) ), =( nil, Y ) ],
% 0.49/0.90 [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X ) )
% 0.49/0.90 , leq( X, hd( Y ) ), =( nil, Y ) ],
% 0.49/0.90 [ ~( rearsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ), ~( ssList(
% 0.49/0.90 X ) ), rearsegP( app( Z, X ), Y ) ],
% 0.49/0.90 [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ), ~( ssList(
% 0.49/0.90 X ) ), frontsegP( app( X, Z ), Y ) ],
% 0.49/0.90 [ ~( =( X, Y ) ), ~( ssList( Z ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ),
% 0.49/0.90 memberP( cons( Y, Z ), X ) ],
% 0.49/0.90 [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y
% 0.49/0.90 ) ), memberP( cons( Z, X ), Y ) ],
% 0.49/0.90 [ ~( memberP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y
% 0.49/0.90 ) ), memberP( app( X, Z ), Y ) ],
% 0.49/0.90 [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssList( Z ) ), ~( ssItem( Y
% 0.49/0.90 ) ), memberP( app( Z, X ), Y ) ],
% 0.49/0.90 [ ~( ssList( X ) ), equalelemsP( X ), =( app( skaf80( X ), cons( skaf78(
% 0.49/0.90 X ), cons( skaf79( X ), skaf81( X ) ) ) ), X ) ],
% 0.49/0.90 [ ~( =( app( X, Y ), Z ) ), ~( ssList( X ) ), ~( ssList( Y ) ), ~(
% 0.49/0.90 ssList( Z ) ), rearsegP( Z, Y ) ],
% 0.49/0.90 [ ~( =( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), ~(
% 0.49/0.90 ssList( Z ) ), frontsegP( Z, X ) ],
% 0.49/0.90 [ ~( =( nil, X ) ), ~( =( nil, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.49/0.90 , =( app( X, Y ), nil ) ],
% 0.49/0.90 [ ~( gt( X, Y ) ), ~( gt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ),
% 0.49/0.90 ~( ssItem( X ) ), gt( X, Z ) ],
% 0.49/0.90 [ ~( leq( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.49/0.90 , ~( ssItem( X ) ), lt( X, Z ) ],
% 0.49/0.90 [ ~( geq( X, Y ) ), ~( geq( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.49/0.90 , ~( ssItem( X ) ), geq( X, Z ) ],
% 0.49/0.90 [ ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =( app( app( Z,
% 0.49/0.90 Y ), X ), app( Z, app( Y, X ) ) ) ],
% 0.49/0.90 [ ~( =( app( X, Y ), app( X, Z ) ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.49/0.90 , ~( ssList( Z ) ), =( Y, Z ) ],
% 0.49/0.90 [ ~( =( app( X, Y ), app( Z, Y ) ) ), ~( ssList( X ) ), ~( ssList( Y ) )
% 0.49/0.90 , ~( ssList( Z ) ), =( X, Z ) ],
% 0.49/0.90 [ ~( segmentP( X, Y ) ), ~( segmentP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.49/0.90 ssList( Y ) ), ~( ssList( X ) ), segmentP( X, Z ) ],
% 0.49/0.90 [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.49/0.90 ssList( Y ) ), ~( ssList( X ) ), rearsegP( X, Z ) ],
% 0.49/0.90 [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.49/0.90 ssList( Y ) ), ~( ssList( X ) ), frontsegP( X, Z ) ],
% 0.49/0.90 [ ~( lt( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ),
% 0.49/0.90 ~( ssItem( X ) ), lt( X, Z ) ],
% 0.49/0.90 [ ~( leq( X, Y ) ), ~( leq( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.49/0.90 , ~( ssItem( X ) ), leq( X, Z ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =( cons( X, app(
% 0.49/0.90 Y, Z ) ), app( cons( X, Y ), Z ) ) ],
% 0.49/0.90 [ ~( memberP( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ),
% 0.49/0.90 ~( ssItem( Z ) ), memberP( Y, Z ), memberP( X, Z ) ],
% 0.49/0.90 [ ~( leq( X, hd( Y ) ) ), ~( totalorderedP( Y ) ), ~( ssList( Y ) ), ~(
% 0.49/0.90 ssItem( X ) ), totalorderedP( cons( X, Y ) ), =( nil, Y ) ],
% 0.49/0.90 [ ~( lt( X, hd( Y ) ) ), ~( strictorderedP( Y ) ), ~( ssList( Y ) ), ~(
% 0.49/0.90 ssItem( X ) ), strictorderedP( cons( X, Y ) ), =( nil, Y ) ],
% 0.49/0.90 [ ~( memberP( cons( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssItem( X ) ),
% 0.49/0.90 ~( ssItem( Z ) ), memberP( Y, Z ), =( Z, X ) ],
% 0.49/0.90 [ ~( ssList( X ) ), duplicatefreeP( X ), =( app( app( skaf75( X ), cons(
% 0.49/0.90 skaf74( X ), skaf76( X ) ) ), cons( skaf74( X ), skaf77( X ) ) ), X ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( ssList( X ) ), strictorderedP( X ), =( app( app( skaf71( X ), cons(
% 0.49/0.90 skaf69( X ), skaf72( X ) ) ), cons( skaf70( X ), skaf73( X ) ) ), X ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( ssList( X ) ), totalorderedP( X ), =( app( app( skaf66( X ), cons(
% 0.49/0.90 skaf64( X ), skaf67( X ) ) ), cons( skaf65( X ), skaf68( X ) ) ), X ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( ssList( X ) ), strictorderP( X ), =( app( app( skaf61( X ), cons(
% 0.49/0.90 skaf59( X ), skaf62( X ) ) ), cons( skaf60( X ), skaf63( X ) ) ), X ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( ssList( X ) ), totalorderP( X ), =( app( app( skaf56( X ), cons(
% 0.49/0.90 skaf54( X ), skaf57( X ) ) ), cons( skaf55( X ), skaf58( X ) ) ), X ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( ssList( X ) ), cyclefreeP( X ), =( app( app( skaf51( X ), cons(
% 0.49/0.90 skaf49( X ), skaf52( X ) ) ), cons( skaf50( X ), skaf53( X ) ) ), X ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( segmentP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app( app(
% 0.49/0.90 skaf47( X, Y ), Y ), skaf48( Y, X ) ), X ) ],
% 0.49/0.90 [ ~( memberP( X, Y ) ), ~( ssItem( Y ) ), ~( ssList( X ) ), =( app(
% 0.49/0.90 skaf42( X, Y ), cons( Y, skaf43( Y, X ) ) ), X ) ],
% 0.49/0.90 [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ), ~( ssItem( X )
% 0.49/0.90 ), ~( ssList( T ) ), ~( ssList( Y ) ), =( X, Z ) ],
% 0.49/0.90 [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ), ~( ssItem( X )
% 0.49/0.90 ), ~( ssList( T ) ), ~( ssList( Y ) ), =( T, Y ) ],
% 0.49/0.90 [ ~( segmentP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( T ) ), ~( ssList(
% 0.49/0.90 Y ) ), ~( ssList( X ) ), segmentP( app( app( T, X ), Z ), Y ) ],
% 0.49/0.90 [ ~( =( app( app( X, Y ), Z ), T ) ), ~( ssList( Z ) ), ~( ssList( X ) )
% 0.49/0.90 , ~( ssList( Y ) ), ~( ssList( T ) ), segmentP( T, Y ) ],
% 0.49/0.90 [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T ) ), ~(
% 0.49/0.90 ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), frontsegP( Y, T ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( =( app( X, cons( Y, Z ) ), T ) ), ~( ssList( Z ) ), ~( ssList( X )
% 0.49/0.90 ), ~( ssItem( Y ) ), ~( ssList( T ) ), memberP( T, Y ) ],
% 0.49/0.90 [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T ) ), ~(
% 0.49/0.90 ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), =( X, Z ) ],
% 0.49/0.90 [ ~( =( tl( X ), tl( Y ) ) ), ~( =( hd( X ), hd( Y ) ) ), ~( ssList( X )
% 0.49/0.90 ), ~( ssList( Y ) ), =( nil, Y ), =( X, Y ), =( nil, X ) ],
% 0.49/0.90 [ ~( frontsegP( X, Y ) ), ~( =( Z, T ) ), ~( ssList( Y ) ), ~( ssList( X
% 0.49/0.90 ) ), ~( ssItem( T ) ), ~( ssItem( Z ) ), frontsegP( cons( Z, X ), cons(
% 0.49/0.90 T, Y ) ) ],
% 0.49/0.90 [ ~( =( app( app( X, cons( Y, Z ) ), cons( Y, T ) ), U ) ), ~( ssList( T
% 0.49/0.90 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), ~(
% 0.49/0.90 duplicatefreeP( U ) ), ~( ssList( U ) ) ],
% 0.49/0.90 [ ~( =( app( X, cons( Y, cons( Z, T ) ) ), U ) ), ~( ssList( T ) ), ~(
% 0.49/0.90 ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ), ~( equalelemsP( U ) )
% 0.49/0.90 , ~( ssList( U ) ), =( Y, Z ) ],
% 0.49/0.90 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.49/0.90 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.49/0.90 ) ), ~( strictorderedP( W ) ), ~( ssList( W ) ), lt( Y, T ) ],
% 0.49/0.90 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.49/0.90 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.49/0.90 ) ), ~( totalorderedP( W ) ), ~( ssList( W ) ), leq( Y, T ) ],
% 0.49/0.90 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.49/0.90 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.49/0.90 ) ), ~( strictorderP( W ) ), ~( ssList( W ) ), lt( Y, T ), lt( T, Y ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.49/0.90 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.49/0.90 ) ), ~( totalorderP( W ) ), ~( ssList( W ) ), leq( Y, T ), leq( T, Y ) ]
% 0.49/0.90 ,
% 0.49/0.90 [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( =( app( app( Z, cons( X, T ) )
% 0.49/0.90 , cons( Y, U ) ), W ) ), ~( ssList( U ) ), ~( ssList( T ) ), ~( ssList( Z
% 0.49/0.90 ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), ~( cyclefreeP( W ) ), ~( ssList(
% 0.49/0.90 W ) ) ],
% 0.49/0.90 [ ssList( sk1 ) ],
% 0.49/0.90 [ ssList( sk2 ) ],
% 0.49/0.90 [ ssList( sk3 ) ],
% 0.49/0.90 [ ssList( sk4 ) ],
% 0.49/0.90 [ =( sk2, sk4 ) ],
% 0.49/0.90 [ =( sk1, sk3 ) ],
% 0.49/0.90 [ ~( duplicatefreeP( sk1 ) ) ],
% 0.49/0.90 [ ssItem( sk5 ), =( nil, sk4 ) ],
% 0.49/0.90 [ ssItem( sk5 ), =( nil, sk3 ) ],
% 0.49/0.90 [ ssList( sk6 ), =( nil, sk4 ) ],
% 0.49/0.90 [ ssList( sk7 ), =( nil, sk4 ) ],
% 0.49/0.90 [ =( cons( sk5, nil ), sk3 ), =( nil, sk4 ) ],
% 0.49/0.90 [ =( app( app( sk6, sk3 ), sk7 ), sk4 ), =( nil, sk4 ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), ~( memberP( sk6, X ) ), ~( lt( sk5, X ) ), =( nil,
% 0.49/0.90 sk4 ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), ~( memberP( sk7, X ) ), ~( lt( X, sk5 ) ), =( nil,
% 0.49/0.90 sk4 ) ],
% 0.49/0.90 [ ssList( sk6 ), =( nil, sk3 ) ],
% 0.49/0.90 [ ssList( sk7 ), =( nil, sk3 ) ],
% 0.49/0.90 [ =( cons( sk5, nil ), sk3 ), =( nil, sk3 ) ],
% 0.49/0.90 [ =( app( app( sk6, sk3 ), sk7 ), sk4 ), =( nil, sk3 ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), ~( memberP( sk6, X ) ), ~( lt( sk5, X ) ), =( nil,
% 0.49/0.90 sk3 ) ],
% 0.49/0.90 [ ~( ssItem( X ) ), ~( memberP( sk7, X ) ), ~( lt( X, sk5 ) ), =( nil,
% 0.49/0.90 sk3 ) ]
% 0.49/0.90 ] .
% 0.49/0.90
% 0.49/0.90
% 0.49/0.90 percentage equality = 0.180818, percentage horn = 0.802956
% 0.49/0.90 This is a problem with some equality
% 0.49/0.90
% 0.49/0.90
% 0.49/0.90
% 0.49/0.90 Options Used:
% 0.49/0.90
% 0.49/0.90 useres = 1
% 0.49/0.90 useparamod = 1
% 0.49/0.90 useeqrefl = 1
% 0.49/0.90 useeqfact = 1
% 0.49/0.90 usefactor = 1
% 0.49/0.90 usesimpsplitting = 0
% 0.49/0.90 usesimpdemod = 5
% 0.49/0.90 usesimpres = 3
% 0.49/0.90
% 0.49/0.90 resimpinuse = 1000
% 0.49/0.90 resimpclauses = 20000
% 0.49/0.90 substype = eqrewr
% 0.49/0.90 backwardsubs = 1
% 0.49/0.90 selectoldest = 5
% 0.49/0.90
% 0.49/0.90 litorderings [0] = split
% 0.49/0.90 litorderings [1] = extend the termordering, first sorting on arguments
% 0.49/0.90
% 0.49/0.90 termordering = kbo
% 0.49/0.90
% 0.49/0.90 litapriori = 0
% 0.49/0.90 termapriori = 1
% 0.49/0.90 litaposteriori = 0
% 0.49/0.90 termaposteriori = 0
% 1.61/2.03 demodaposteriori = 0
% 1.61/2.03 ordereqreflfact = 0
% 1.61/2.03
% 1.61/2.03 litselect = negord
% 1.61/2.03
% 1.61/2.03 maxweight = 15
% 1.61/2.03 maxdepth = 30000
% 1.61/2.03 maxlength = 115
% 1.61/2.03 maxnrvars = 195
% 1.61/2.03 excuselevel = 1
% 1.61/2.03 increasemaxweight = 1
% 1.61/2.03
% 1.61/2.03 maxselected = 10000000
% 1.61/2.03 maxnrclauses = 10000000
% 1.61/2.03
% 1.61/2.03 showgenerated = 0
% 1.61/2.03 showkept = 0
% 1.61/2.03 showselected = 0
% 1.61/2.03 showdeleted = 0
% 1.61/2.03 showresimp = 1
% 1.61/2.03 showstatus = 2000
% 1.61/2.03
% 1.61/2.03 prologoutput = 1
% 1.61/2.03 nrgoals = 5000000
% 1.61/2.03 totalproof = 1
% 1.61/2.03
% 1.61/2.03 Symbols occurring in the translation:
% 1.61/2.03
% 1.61/2.03 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.61/2.03 . [1, 2] (w:1, o:79, a:1, s:1, b:0),
% 1.61/2.03 ! [4, 1] (w:0, o:26, a:1, s:1, b:0),
% 1.61/2.03 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.61/2.03 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.61/2.03 nil [39, 0] (w:1, o:18, a:1, s:1, b:0),
% 1.61/2.03 equalelemsP [40, 1] (w:1, o:33, a:1, s:1, b:0),
% 1.61/2.03 duplicatefreeP [41, 1] (w:1, o:32, a:1, s:1, b:0),
% 1.61/2.03 strictorderedP [42, 1] (w:1, o:36, a:1, s:1, b:0),
% 1.61/2.03 totalorderedP [43, 1] (w:1, o:75, a:1, s:1, b:0),
% 1.61/2.03 strictorderP [44, 1] (w:1, o:37, a:1, s:1, b:0),
% 1.61/2.03 totalorderP [45, 1] (w:1, o:76, a:1, s:1, b:0),
% 1.61/2.03 cyclefreeP [46, 1] (w:1, o:31, a:1, s:1, b:0),
% 1.61/2.03 ssList [47, 1] (w:1, o:34, a:1, s:1, b:0),
% 1.61/2.03 skac3 [48, 0] (w:1, o:6, a:1, s:1, b:0),
% 1.61/2.03 ssItem [49, 1] (w:1, o:35, a:1, s:1, b:0),
% 1.61/2.03 skac2 [50, 0] (w:1, o:5, a:1, s:1, b:0),
% 1.61/2.03 singletonP [51, 1] (w:1, o:38, a:1, s:1, b:0),
% 1.61/2.03 skaf83 [53, 1] (w:1, o:74, a:1, s:1, b:0),
% 1.61/2.03 skaf82 [54, 1] (w:1, o:73, a:1, s:1, b:0),
% 1.61/2.03 skaf81 [55, 1] (w:1, o:72, a:1, s:1, b:0),
% 1.61/2.03 skaf80 [56, 1] (w:1, o:71, a:1, s:1, b:0),
% 1.61/2.03 skaf79 [57, 1] (w:1, o:70, a:1, s:1, b:0),
% 1.61/2.03 skaf78 [58, 1] (w:1, o:69, a:1, s:1, b:0),
% 1.61/2.03 skaf77 [59, 1] (w:1, o:68, a:1, s:1, b:0),
% 1.61/2.03 skaf76 [60, 1] (w:1, o:67, a:1, s:1, b:0),
% 1.61/2.03 skaf75 [61, 1] (w:1, o:66, a:1, s:1, b:0),
% 1.61/2.03 skaf74 [62, 1] (w:1, o:65, a:1, s:1, b:0),
% 1.61/2.03 skaf73 [63, 1] (w:1, o:64, a:1, s:1, b:0),
% 1.61/2.03 skaf72 [64, 1] (w:1, o:63, a:1, s:1, b:0),
% 1.61/2.03 skaf71 [65, 1] (w:1, o:62, a:1, s:1, b:0),
% 1.61/2.03 skaf70 [66, 1] (w:1, o:61, a:1, s:1, b:0),
% 1.61/2.03 skaf69 [67, 1] (w:1, o:60, a:1, s:1, b:0),
% 1.61/2.03 skaf68 [68, 1] (w:1, o:59, a:1, s:1, b:0),
% 1.61/2.03 skaf67 [69, 1] (w:1, o:58, a:1, s:1, b:0),
% 1.61/2.03 skaf66 [70, 1] (w:1, o:57, a:1, s:1, b:0),
% 1.61/2.03 skaf65 [71, 1] (w:1, o:56, a:1, s:1, b:0),
% 1.61/2.03 skaf64 [72, 1] (w:1, o:55, a:1, s:1, b:0),
% 1.61/2.03 skaf63 [73, 1] (w:1, o:54, a:1, s:1, b:0),
% 1.61/2.03 skaf62 [74, 1] (w:1, o:53, a:1, s:1, b:0),
% 1.61/2.03 skaf61 [75, 1] (w:1, o:52, a:1, s:1, b:0),
% 1.61/2.03 skaf60 [76, 1] (w:1, o:51, a:1, s:1, b:0),
% 1.61/2.03 skaf59 [77, 1] (w:1, o:50, a:1, s:1, b:0),
% 1.61/2.03 skaf58 [78, 1] (w:1, o:49, a:1, s:1, b:0),
% 1.61/2.03 skaf57 [79, 1] (w:1, o:48, a:1, s:1, b:0),
% 1.61/2.03 skaf56 [80, 1] (w:1, o:47, a:1, s:1, b:0),
% 1.61/2.03 skaf55 [81, 1] (w:1, o:46, a:1, s:1, b:0),
% 1.61/2.03 skaf54 [82, 1] (w:1, o:45, a:1, s:1, b:0),
% 1.61/2.03 skaf53 [83, 1] (w:1, o:44, a:1, s:1, b:0),
% 1.61/2.03 skaf52 [84, 1] (w:1, o:43, a:1, s:1, b:0),
% 1.61/2.03 skaf51 [85, 1] (w:1, o:42, a:1, s:1, b:0),
% 1.61/2.04 skaf50 [86, 1] (w:1, o:41, a:1, s:1, b:0),
% 1.61/2.04 skaf49 [87, 1] (w:1, o:39, a:1, s:1, b:0),
% 1.61/2.04 skaf44 [88, 1] (w:1, o:40, a:1, s:1, b:0),
% 1.61/2.04 skaf48 [90, 2] (w:1, o:108, a:1, s:1, b:0),
% 1.61/2.04 skaf47 [91, 2] (w:1, o:107, a:1, s:1, b:0),
% 1.61/2.04 skaf46 [92, 2] (w:1, o:106, a:1, s:1, b:0),
% 1.61/2.04 skaf45 [93, 2] (w:1, o:105, a:1, s:1, b:0),
% 1.61/2.04 skaf43 [94, 2] (w:1, o:110, a:1, s:1, b:0),
% 1.61/2.04 skaf42 [95, 2] (w:1, o:109, a:1, s:1, b:0),
% 1.61/2.04 geq [96, 2] (w:1, o:112, a:1, s:1, b:0),
% 1.61/2.04 segmentP [97, 2] (w:1, o:113, a:1, s:1, b:0),
% 1.61/2.04 rearsegP [98, 2] (w:1, o:104, a:1, s:1, b:0),
% 1.61/2.04 frontsegP [99, 2] (w:1, o:111, a:1, s:1, b:0),
% 1.61/2.04 leq [100, 2] (w:1, o:114, a:1, s:1, b:0),
% 1.61/2.04 lt [101, 2] (w:1, o:115, a:1, s:1, b:0),
% 1.61/2.04 cons [102, 2] (w:1, o:116, a:1, s:1, b:0),
% 1.61/2.04 memberP [103, 2] (w:1, o:117, a:1, s:1, b:0),
% 1.61/2.04 app [104, 2] (w:1, o:118, a:1, s:1, b:0),
% 1.61/2.04 tl [105, 1] (w:1, o:77, a:1, s:1, b:0),
% 1.61/2.04 hd [106, 1] (w:1, o:78, a:1, s:1, b:0),
% 1.61/2.04 neq [107, 2] (w:1, o:119, a:1, s:1, b:0),
% 1.61/2.04 gt [108, 2] (w:1, o:120, a:1, s:1, b:0),
% 1.61/2.04 sk1 [113, 0] (w:1, o:7, a:1, s:1, b:0),
% 1.61/2.04 sk2 [114, 0] (w:1, o:8, a:1, s:1, b:0),
% 1.61/2.04 sk3 [115, 0] (w:1, o:9, a:1, s:1, b:0),
% 1.61/2.04 sk4 [116, 0] (w:1, o:10, a:1, s:1, b:0),
% 1.61/2.04 sk5 [117, 0] (w:1, o:11, a:1, s:1, b:0),
% 1.61/2.04 sk6 [118, 0] (w:1, o:12, a:1, s:1, b:0),
% 1.61/2.04 sk7 [119, 0] (w:1, o:13, a:1, s:1, b:0).
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 Starting Search:
% 1.61/2.04
% 1.61/2.04 Resimplifying inuse:
% 1.61/2.04 Done
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 Intermediate Status:
% 1.61/2.04 Generated: 3849
% 1.61/2.04 Kept: 2018
% 1.61/2.04 Inuse: 209
% 1.61/2.04 Deleted: 79
% 1.61/2.04 Deletedinuse: 42
% 1.61/2.04
% 1.61/2.04 Resimplifying inuse:
% 1.61/2.04 Done
% 1.61/2.04
% 1.61/2.04 Resimplifying inuse:
% 1.61/2.04 Done
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 Intermediate Status:
% 1.61/2.04 Generated: 10112
% 1.61/2.04 Kept: 4260
% 1.61/2.04 Inuse: 290
% 1.61/2.04 Deleted: 148
% 1.61/2.04 Deletedinuse: 47
% 1.61/2.04
% 1.61/2.04 Resimplifying inuse:
% 1.61/2.04 Done
% 1.61/2.04
% 1.61/2.04 Resimplifying inuse:
% 1.61/2.04 Done
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 Intermediate Status:
% 1.61/2.04 Generated: 19718
% 1.61/2.04 Kept: 6412
% 1.61/2.04 Inuse: 342
% 1.61/2.04 Deleted: 227
% 1.61/2.04 Deletedinuse: 48
% 1.61/2.04
% 1.61/2.04 Resimplifying inuse:
% 1.61/2.04 Done
% 1.61/2.04
% 1.61/2.04 Resimplifying inuse:
% 1.61/2.04 Done
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 Intermediate Status:
% 1.61/2.04 Generated: 28561
% 1.61/2.04 Kept: 8478
% 1.61/2.04 Inuse: 355
% 1.61/2.04 Deleted: 310
% 1.61/2.04 Deletedinuse: 49
% 1.61/2.04
% 1.61/2.04 Resimplifying inuse:
% 1.61/2.04 Done
% 1.61/2.04
% 1.61/2.04 Resimplifying inuse:
% 1.61/2.04 Done
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 Intermediate Status:
% 1.61/2.04 Generated: 41631
% 1.61/2.04 Kept: 10688
% 1.61/2.04 Inuse: 378
% 1.61/2.04 Deleted: 332
% 1.61/2.04 Deletedinuse: 49
% 1.61/2.04
% 1.61/2.04 Resimplifying inuse:
% 1.61/2.04 Done
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 Bliksems!, er is een bewijs:
% 1.61/2.04 % SZS status Unsatisfiable
% 1.61/2.04 % SZS output start Refutation
% 1.61/2.04
% 1.61/2.04 clause( 1, [ duplicatefreeP( nil ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 7, [ ssList( nil ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 64, [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 71, [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 72, [ ~( ssList( X ) ), =( app( X, nil ), X ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 80, [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 81, [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 99, [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X ) ]
% 1.61/2.04 )
% 1.61/2.04 .
% 1.61/2.04 clause( 114, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~(
% 1.61/2.04 ssItem( X ) ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 115, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X )
% 1.61/2.04 ), =( nil, X ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 182, [ ssList( sk1 ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 186, [ =( sk4, sk2 ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 187, [ =( sk3, sk1 ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 188, [ ~( duplicatefreeP( sk1 ) ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 193, [ =( cons( sk5, nil ), sk1 ), =( nil, sk2 ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 199, [ =( cons( sk5, nil ), sk1 ), =( sk2, sk1 ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 744, [ ssItem( X ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 752, [ duplicatefreeP( cons( X, nil ) ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 785, [ =( app( nil, nil ), nil ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 1321, [ ~( frontsegP( nil, sk1 ) ), =( nil, sk1 ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 2787, [ neq( Y, X ), =( Y, X ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 3314, [ ~( =( X, Y ) ), ~( neq( X, Y ) ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 3542, [ ~( =( app( sk1, X ), nil ) ), ~( ssList( X ) ), ~( ssList(
% 1.61/2.04 sk1 ) ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 3543, [ ~( =( app( sk1, sk1 ), nil ) ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 4867, [ ~( frontsegP( nil, sk1 ) ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 4876, [ ~( =( nil, sk1 ) ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 10235, [ ~( duplicatefreeP( X ) ), neq( sk1, X ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 11829, [ =( cons( sk5, nil ), sk1 ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 12019, [ ~( duplicatefreeP( X ) ), ~( =( sk1, X ) ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 12028, [ ~( =( cons( X, nil ), sk1 ) ) ] )
% 1.61/2.04 .
% 1.61/2.04 clause( 12131, [] )
% 1.61/2.04 .
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 % SZS output end Refutation
% 1.61/2.04 found a proof!
% 1.61/2.04
% 1.61/2.04 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.61/2.04
% 1.61/2.04 initialclauses(
% 1.61/2.04 [ clause( 12133, [ equalelemsP( nil ) ] )
% 1.61/2.04 , clause( 12134, [ duplicatefreeP( nil ) ] )
% 1.61/2.04 , clause( 12135, [ strictorderedP( nil ) ] )
% 1.61/2.04 , clause( 12136, [ totalorderedP( nil ) ] )
% 1.61/2.04 , clause( 12137, [ strictorderP( nil ) ] )
% 1.61/2.04 , clause( 12138, [ totalorderP( nil ) ] )
% 1.61/2.04 , clause( 12139, [ cyclefreeP( nil ) ] )
% 1.61/2.04 , clause( 12140, [ ssList( nil ) ] )
% 1.61/2.04 , clause( 12141, [ ssItem( skac3 ) ] )
% 1.61/2.04 , clause( 12142, [ ssItem( skac2 ) ] )
% 1.61/2.04 , clause( 12143, [ ~( singletonP( nil ) ) ] )
% 1.61/2.04 , clause( 12144, [ ssItem( skaf83( X ) ) ] )
% 1.61/2.04 , clause( 12145, [ ssList( skaf82( X ) ) ] )
% 1.61/2.04 , clause( 12146, [ ssList( skaf81( X ) ) ] )
% 1.61/2.04 , clause( 12147, [ ssList( skaf80( X ) ) ] )
% 1.61/2.04 , clause( 12148, [ ssItem( skaf79( X ) ) ] )
% 1.61/2.04 , clause( 12149, [ ssItem( skaf78( X ) ) ] )
% 1.61/2.04 , clause( 12150, [ ssList( skaf77( X ) ) ] )
% 1.61/2.04 , clause( 12151, [ ssList( skaf76( X ) ) ] )
% 1.61/2.04 , clause( 12152, [ ssList( skaf75( X ) ) ] )
% 1.61/2.04 , clause( 12153, [ ssItem( skaf74( X ) ) ] )
% 1.61/2.04 , clause( 12154, [ ssList( skaf73( X ) ) ] )
% 1.61/2.04 , clause( 12155, [ ssList( skaf72( X ) ) ] )
% 1.61/2.04 , clause( 12156, [ ssList( skaf71( X ) ) ] )
% 1.61/2.04 , clause( 12157, [ ssItem( skaf70( X ) ) ] )
% 1.61/2.04 , clause( 12158, [ ssItem( skaf69( X ) ) ] )
% 1.61/2.04 , clause( 12159, [ ssList( skaf68( X ) ) ] )
% 1.61/2.04 , clause( 12160, [ ssList( skaf67( X ) ) ] )
% 1.61/2.04 , clause( 12161, [ ssList( skaf66( X ) ) ] )
% 1.61/2.04 , clause( 12162, [ ssItem( skaf65( X ) ) ] )
% 1.61/2.04 , clause( 12163, [ ssItem( skaf64( X ) ) ] )
% 1.61/2.04 , clause( 12164, [ ssList( skaf63( X ) ) ] )
% 1.61/2.04 , clause( 12165, [ ssList( skaf62( X ) ) ] )
% 1.61/2.04 , clause( 12166, [ ssList( skaf61( X ) ) ] )
% 1.61/2.04 , clause( 12167, [ ssItem( skaf60( X ) ) ] )
% 1.61/2.04 , clause( 12168, [ ssItem( skaf59( X ) ) ] )
% 1.61/2.04 , clause( 12169, [ ssList( skaf58( X ) ) ] )
% 1.61/2.04 , clause( 12170, [ ssList( skaf57( X ) ) ] )
% 1.61/2.04 , clause( 12171, [ ssList( skaf56( X ) ) ] )
% 1.61/2.04 , clause( 12172, [ ssItem( skaf55( X ) ) ] )
% 1.61/2.04 , clause( 12173, [ ssItem( skaf54( X ) ) ] )
% 1.61/2.04 , clause( 12174, [ ssList( skaf53( X ) ) ] )
% 1.61/2.04 , clause( 12175, [ ssList( skaf52( X ) ) ] )
% 1.61/2.04 , clause( 12176, [ ssList( skaf51( X ) ) ] )
% 1.61/2.04 , clause( 12177, [ ssItem( skaf50( X ) ) ] )
% 1.61/2.04 , clause( 12178, [ ssItem( skaf49( X ) ) ] )
% 1.61/2.04 , clause( 12179, [ ssItem( skaf44( X ) ) ] )
% 1.61/2.04 , clause( 12180, [ ssList( skaf48( X, Y ) ) ] )
% 1.61/2.04 , clause( 12181, [ ssList( skaf47( X, Y ) ) ] )
% 1.61/2.04 , clause( 12182, [ ssList( skaf46( X, Y ) ) ] )
% 1.61/2.04 , clause( 12183, [ ssList( skaf45( X, Y ) ) ] )
% 1.61/2.04 , clause( 12184, [ ssList( skaf43( X, Y ) ) ] )
% 1.61/2.04 , clause( 12185, [ ssList( skaf42( X, Y ) ) ] )
% 1.61/2.04 , clause( 12186, [ ~( =( skac3, skac2 ) ) ] )
% 1.61/2.04 , clause( 12187, [ ~( ssItem( X ) ), geq( X, X ) ] )
% 1.61/2.04 , clause( 12188, [ ~( ssList( X ) ), segmentP( X, nil ) ] )
% 1.61/2.04 , clause( 12189, [ ~( ssList( X ) ), segmentP( X, X ) ] )
% 1.61/2.04 , clause( 12190, [ ~( ssList( X ) ), rearsegP( X, nil ) ] )
% 1.61/2.04 , clause( 12191, [ ~( ssList( X ) ), rearsegP( X, X ) ] )
% 1.61/2.04 , clause( 12192, [ ~( ssList( X ) ), frontsegP( X, nil ) ] )
% 1.61/2.04 , clause( 12193, [ ~( ssList( X ) ), frontsegP( X, X ) ] )
% 1.61/2.04 , clause( 12194, [ ~( ssItem( X ) ), leq( X, X ) ] )
% 1.61/2.04 , clause( 12195, [ ~( lt( X, X ) ), ~( ssItem( X ) ) ] )
% 1.61/2.04 , clause( 12196, [ ~( ssItem( X ) ), equalelemsP( cons( X, nil ) ) ] )
% 1.61/2.04 , clause( 12197, [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ] )
% 1.61/2.04 , clause( 12198, [ ~( ssItem( X ) ), strictorderedP( cons( X, nil ) ) ] )
% 1.61/2.04 , clause( 12199, [ ~( ssItem( X ) ), totalorderedP( cons( X, nil ) ) ] )
% 1.61/2.04 , clause( 12200, [ ~( ssItem( X ) ), strictorderP( cons( X, nil ) ) ] )
% 1.61/2.04 , clause( 12201, [ ~( ssItem( X ) ), totalorderP( cons( X, nil ) ) ] )
% 1.61/2.04 , clause( 12202, [ ~( ssItem( X ) ), cyclefreeP( cons( X, nil ) ) ] )
% 1.61/2.04 , clause( 12203, [ ~( memberP( nil, X ) ), ~( ssItem( X ) ) ] )
% 1.61/2.04 , clause( 12204, [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ] )
% 1.61/2.04 , clause( 12205, [ ~( ssList( X ) ), =( app( X, nil ), X ) ] )
% 1.61/2.04 , clause( 12206, [ ~( ssList( X ) ), =( app( nil, X ), X ) ] )
% 1.61/2.04 , clause( 12207, [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ] )
% 1.61/2.04 , clause( 12208, [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ] )
% 1.61/2.04 , clause( 12209, [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ] )
% 1.61/2.04 , clause( 12210, [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ] )
% 1.61/2.04 , clause( 12211, [ ~( =( nil, X ) ), ~( ssList( X ) ), segmentP( nil, X ) ]
% 1.61/2.04 )
% 1.61/2.04 , clause( 12212, [ ~( segmentP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 1.61/2.04 )
% 1.61/2.04 , clause( 12213, [ ~( =( nil, X ) ), ~( ssList( X ) ), rearsegP( nil, X ) ]
% 1.61/2.04 )
% 1.61/2.04 , clause( 12214, [ ~( rearsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 1.61/2.04 )
% 1.61/2.04 , clause( 12215, [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X )
% 1.61/2.04 ] )
% 1.61/2.04 , clause( 12216, [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X )
% 1.61/2.04 ] )
% 1.61/2.04 , clause( 12217, [ ~( ssList( X ) ), ~( ssList( Y ) ), ssList( app( Y, X )
% 1.61/2.04 ) ] )
% 1.61/2.04 , clause( 12218, [ ~( ssItem( X ) ), ~( ssList( Y ) ), ssList( cons( X, Y )
% 1.61/2.04 ) ] )
% 1.61/2.04 , clause( 12219, [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf50( X ),
% 1.61/2.04 skaf49( X ) ) ] )
% 1.61/2.04 , clause( 12220, [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf49( X ),
% 1.61/2.04 skaf50( X ) ) ] )
% 1.61/2.04 , clause( 12221, [ ~( =( skaf79( X ), skaf78( X ) ) ), ~( ssList( X ) ),
% 1.61/2.04 equalelemsP( X ) ] )
% 1.61/2.04 , clause( 12222, [ ~( lt( skaf69( X ), skaf70( X ) ) ), ~( ssList( X ) ),
% 1.61/2.04 strictorderedP( X ) ] )
% 1.61/2.04 , clause( 12223, [ ~( leq( skaf64( X ), skaf65( X ) ) ), ~( ssList( X ) ),
% 1.61/2.04 totalorderedP( X ) ] )
% 1.61/2.04 , clause( 12224, [ ~( lt( skaf60( X ), skaf59( X ) ) ), ~( ssList( X ) ),
% 1.61/2.04 strictorderP( X ) ] )
% 1.61/2.04 , clause( 12225, [ ~( lt( skaf59( X ), skaf60( X ) ) ), ~( ssList( X ) ),
% 1.61/2.04 strictorderP( X ) ] )
% 1.61/2.04 , clause( 12226, [ ~( leq( skaf55( X ), skaf54( X ) ) ), ~( ssList( X ) ),
% 1.61/2.04 totalorderP( X ) ] )
% 1.61/2.04 , clause( 12227, [ ~( leq( skaf54( X ), skaf55( X ) ) ), ~( ssList( X ) ),
% 1.61/2.04 totalorderP( X ) ] )
% 1.61/2.04 , clause( 12228, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( tl( cons( X, Y )
% 1.61/2.04 ), Y ) ] )
% 1.61/2.04 , clause( 12229, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( hd( cons( X, Y )
% 1.61/2.04 ), X ) ] )
% 1.61/2.04 , clause( 12230, [ ~( =( cons( X, Y ), nil ) ), ~( ssItem( X ) ), ~( ssList(
% 1.61/2.04 Y ) ) ] )
% 1.61/2.04 , clause( 12231, [ ~( =( cons( X, Y ), Y ) ), ~( ssItem( X ) ), ~( ssList(
% 1.61/2.04 Y ) ) ] )
% 1.61/2.04 , clause( 12232, [ ~( ssList( X ) ), ~( ssList( Y ) ), neq( Y, X ), =( Y, X
% 1.61/2.04 ) ] )
% 1.61/2.04 , clause( 12233, [ ~( singletonP( X ) ), ~( ssList( X ) ), =( cons( skaf44(
% 1.61/2.04 X ), nil ), X ) ] )
% 1.61/2.04 , clause( 12234, [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X
% 1.61/2.04 ) ] )
% 1.61/2.04 , clause( 12235, [ ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq(
% 1.61/2.04 X, Y ) ] )
% 1.61/2.04 , clause( 12236, [ ~( ssList( X ) ), =( cons( hd( X ), tl( X ) ), X ), =(
% 1.61/2.04 nil, X ) ] )
% 1.61/2.04 , clause( 12237, [ ~( gt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 1.61/2.04 Y, X ) ] )
% 1.61/2.04 , clause( 12238, [ ~( lt( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), gt(
% 1.61/2.04 Y, X ) ] )
% 1.61/2.04 , clause( 12239, [ ~( geq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ),
% 1.61/2.04 leq( Y, X ) ] )
% 1.61/2.04 , clause( 12240, [ ~( leq( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ),
% 1.61/2.04 geq( Y, X ) ] )
% 1.61/2.04 , clause( 12241, [ ~( ssList( X ) ), =( cons( skaf83( X ), skaf82( X ) ), X
% 1.61/2.04 ), =( nil, X ) ] )
% 1.61/2.04 , clause( 12242, [ ~( gt( X, Y ) ), ~( gt( Y, X ) ), ~( ssItem( X ) ), ~(
% 1.61/2.04 ssItem( Y ) ) ] )
% 1.61/2.04 , clause( 12243, [ ~( =( X, Y ) ), ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~(
% 1.61/2.04 ssItem( X ) ) ] )
% 1.61/2.04 , clause( 12244, [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 1.61/2.04 strictorderedP( cons( Y, X ) ) ] )
% 1.61/2.04 , clause( 12245, [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 1.61/2.04 totalorderedP( cons( Y, X ) ) ] )
% 1.61/2.04 , clause( 12246, [ ~( lt( X, Y ) ), ~( lt( Y, X ) ), ~( ssItem( X ) ), ~(
% 1.61/2.04 ssItem( Y ) ) ] )
% 1.61/2.04 , clause( 12247, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssList( Y ) ), ~(
% 1.61/2.04 ssList( X ) ) ] )
% 1.61/2.04 , clause( 12248, [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList(
% 1.61/2.04 Y ) ), singletonP( Y ) ] )
% 1.61/2.04 , clause( 12249, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~(
% 1.61/2.04 ssItem( X ) ) ] )
% 1.61/2.04 , clause( 12250, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList(
% 1.61/2.04 X ) ), =( nil, X ) ] )
% 1.61/2.04 , clause( 12251, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList(
% 1.61/2.04 X ) ), =( nil, Y ) ] )
% 1.61/2.04 , clause( 12252, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( app( cons( X, nil
% 1.61/2.04 ), Y ), cons( X, Y ) ) ] )
% 1.61/2.04 , clause( 12253, [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 1.61/2.04 X, Y ), =( X, Y ) ] )
% 1.61/2.04 , clause( 12254, [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 1.61/2.04 X, Y ), =( X, Y ) ] )
% 1.61/2.04 , clause( 12255, [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( hd(
% 1.61/2.04 app( Y, X ) ), hd( Y ) ) ] )
% 1.61/2.04 , clause( 12256, [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ),
% 1.61/2.04 ~( ssItem( X ) ), strictorderedP( Y ), =( nil, Y ) ] )
% 1.61/2.04 , clause( 12257, [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ),
% 1.61/2.04 ~( ssItem( X ) ), totalorderedP( Y ), =( nil, Y ) ] )
% 1.61/2.04 , clause( 12258, [ ~( geq( X, Y ) ), ~( geq( Y, X ) ), ~( ssItem( X ) ),
% 1.61/2.04 ~( ssItem( Y ) ), =( Y, X ) ] )
% 1.61/2.04 , clause( 12259, [ ~( segmentP( X, Y ) ), ~( segmentP( Y, X ) ), ~( ssList(
% 1.61/2.04 X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 1.61/2.04 , clause( 12260, [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, X ) ), ~( ssList(
% 1.61/2.04 X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 1.61/2.04 , clause( 12261, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~(
% 1.61/2.04 ssList( X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 1.61/2.04 , clause( 12262, [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( ssItem( X ) ),
% 1.61/2.04 ~( ssItem( Y ) ), =( Y, X ) ] )
% 1.61/2.04 , clause( 12263, [ ~( rearsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X )
% 1.61/2.04 ), =( app( skaf46( X, Y ), Y ), X ) ] )
% 1.61/2.04 , clause( 12264, [ ~( frontsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X )
% 1.61/2.04 ), =( app( Y, skaf45( X, Y ) ), X ) ] )
% 1.61/2.04 , clause( 12265, [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( tl(
% 1.61/2.04 app( Y, X ) ), app( tl( Y ), X ) ) ] )
% 1.61/2.04 , clause( 12266, [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ),
% 1.61/2.04 ~( ssItem( X ) ), lt( X, hd( Y ) ), =( nil, Y ) ] )
% 1.61/2.04 , clause( 12267, [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ),
% 1.61/2.04 ~( ssItem( X ) ), leq( X, hd( Y ) ), =( nil, Y ) ] )
% 1.61/2.04 , clause( 12268, [ ~( rearsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y )
% 1.61/2.04 ), ~( ssList( X ) ), rearsegP( app( Z, X ), Y ) ] )
% 1.61/2.04 , clause( 12269, [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y )
% 1.61/2.04 ), ~( ssList( X ) ), frontsegP( app( X, Z ), Y ) ] )
% 1.61/2.04 , clause( 12270, [ ~( =( X, Y ) ), ~( ssList( Z ) ), ~( ssItem( Y ) ), ~(
% 1.61/2.04 ssItem( X ) ), memberP( cons( Y, Z ), X ) ] )
% 1.61/2.04 , clause( 12271, [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssItem( Z ) )
% 1.61/2.04 , ~( ssItem( Y ) ), memberP( cons( Z, X ), Y ) ] )
% 1.61/2.04 , clause( 12272, [ ~( memberP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( X ) )
% 1.61/2.04 , ~( ssItem( Y ) ), memberP( app( X, Z ), Y ) ] )
% 1.61/2.04 , clause( 12273, [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssList( Z ) )
% 1.61/2.04 , ~( ssItem( Y ) ), memberP( app( Z, X ), Y ) ] )
% 1.61/2.04 , clause( 12274, [ ~( ssList( X ) ), equalelemsP( X ), =( app( skaf80( X )
% 1.61/2.04 , cons( skaf78( X ), cons( skaf79( X ), skaf81( X ) ) ) ), X ) ] )
% 1.61/2.04 , clause( 12275, [ ~( =( app( X, Y ), Z ) ), ~( ssList( X ) ), ~( ssList( Y
% 1.61/2.04 ) ), ~( ssList( Z ) ), rearsegP( Z, Y ) ] )
% 1.61/2.04 , clause( 12276, [ ~( =( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X
% 1.61/2.04 ) ), ~( ssList( Z ) ), frontsegP( Z, X ) ] )
% 1.61/2.04 , clause( 12277, [ ~( =( nil, X ) ), ~( =( nil, Y ) ), ~( ssList( Y ) ),
% 1.61/2.04 ~( ssList( X ) ), =( app( X, Y ), nil ) ] )
% 1.61/2.04 , clause( 12278, [ ~( gt( X, Y ) ), ~( gt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 1.61/2.04 ssItem( Y ) ), ~( ssItem( X ) ), gt( X, Z ) ] )
% 1.61/2.04 , clause( 12279, [ ~( leq( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 1.61/2.04 ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Z ) ] )
% 1.61/2.04 , clause( 12280, [ ~( geq( X, Y ) ), ~( geq( Y, Z ) ), ~( ssItem( Z ) ),
% 1.61/2.04 ~( ssItem( Y ) ), ~( ssItem( X ) ), geq( X, Z ) ] )
% 1.61/2.04 , clause( 12281, [ ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ),
% 1.61/2.04 =( app( app( Z, Y ), X ), app( Z, app( Y, X ) ) ) ] )
% 1.61/2.04 , clause( 12282, [ ~( =( app( X, Y ), app( X, Z ) ) ), ~( ssList( Y ) ),
% 1.61/2.04 ~( ssList( X ) ), ~( ssList( Z ) ), =( Y, Z ) ] )
% 1.61/2.04 , clause( 12283, [ ~( =( app( X, Y ), app( Z, Y ) ) ), ~( ssList( X ) ),
% 1.61/2.04 ~( ssList( Y ) ), ~( ssList( Z ) ), =( X, Z ) ] )
% 1.61/2.04 , clause( 12284, [ ~( segmentP( X, Y ) ), ~( segmentP( Y, Z ) ), ~( ssList(
% 1.61/2.04 Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), segmentP( X, Z ) ] )
% 1.61/2.04 , clause( 12285, [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, Z ) ), ~( ssList(
% 1.61/2.04 Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), rearsegP( X, Z ) ] )
% 1.61/2.04 , clause( 12286, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, Z ) ), ~(
% 1.61/2.04 ssList( Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), frontsegP( X, Z ) ] )
% 1.61/2.04 , clause( 12287, [ ~( lt( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 1.61/2.04 ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Z ) ] )
% 1.61/2.04 , clause( 12288, [ ~( leq( X, Y ) ), ~( leq( Y, Z ) ), ~( ssItem( Z ) ),
% 1.61/2.04 ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( X, Z ) ] )
% 1.61/2.04 , clause( 12289, [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ),
% 1.61/2.04 =( cons( X, app( Y, Z ) ), app( cons( X, Y ), Z ) ) ] )
% 1.61/2.04 , clause( 12290, [ ~( memberP( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~(
% 1.61/2.04 ssList( X ) ), ~( ssItem( Z ) ), memberP( Y, Z ), memberP( X, Z ) ] )
% 1.61/2.04 , clause( 12291, [ ~( leq( X, hd( Y ) ) ), ~( totalorderedP( Y ) ), ~(
% 1.61/2.04 ssList( Y ) ), ~( ssItem( X ) ), totalorderedP( cons( X, Y ) ), =( nil, Y
% 1.61/2.04 ) ] )
% 1.61/2.04 , clause( 12292, [ ~( lt( X, hd( Y ) ) ), ~( strictorderedP( Y ) ), ~(
% 1.61/2.04 ssList( Y ) ), ~( ssItem( X ) ), strictorderedP( cons( X, Y ) ), =( nil,
% 1.61/2.04 Y ) ] )
% 1.61/2.04 , clause( 12293, [ ~( memberP( cons( X, Y ), Z ) ), ~( ssList( Y ) ), ~(
% 1.61/2.04 ssItem( X ) ), ~( ssItem( Z ) ), memberP( Y, Z ), =( Z, X ) ] )
% 1.61/2.04 , clause( 12294, [ ~( ssList( X ) ), duplicatefreeP( X ), =( app( app(
% 1.61/2.04 skaf75( X ), cons( skaf74( X ), skaf76( X ) ) ), cons( skaf74( X ),
% 1.61/2.04 skaf77( X ) ) ), X ) ] )
% 1.61/2.04 , clause( 12295, [ ~( ssList( X ) ), strictorderedP( X ), =( app( app(
% 1.61/2.04 skaf71( X ), cons( skaf69( X ), skaf72( X ) ) ), cons( skaf70( X ),
% 1.61/2.04 skaf73( X ) ) ), X ) ] )
% 1.61/2.04 , clause( 12296, [ ~( ssList( X ) ), totalorderedP( X ), =( app( app(
% 1.61/2.04 skaf66( X ), cons( skaf64( X ), skaf67( X ) ) ), cons( skaf65( X ),
% 1.61/2.04 skaf68( X ) ) ), X ) ] )
% 1.61/2.04 , clause( 12297, [ ~( ssList( X ) ), strictorderP( X ), =( app( app( skaf61(
% 1.61/2.04 X ), cons( skaf59( X ), skaf62( X ) ) ), cons( skaf60( X ), skaf63( X ) )
% 1.61/2.04 ), X ) ] )
% 1.61/2.04 , clause( 12298, [ ~( ssList( X ) ), totalorderP( X ), =( app( app( skaf56(
% 1.61/2.04 X ), cons( skaf54( X ), skaf57( X ) ) ), cons( skaf55( X ), skaf58( X ) )
% 1.61/2.04 ), X ) ] )
% 1.61/2.04 , clause( 12299, [ ~( ssList( X ) ), cyclefreeP( X ), =( app( app( skaf51(
% 1.61/2.04 X ), cons( skaf49( X ), skaf52( X ) ) ), cons( skaf50( X ), skaf53( X ) )
% 1.61/2.04 ), X ) ] )
% 1.61/2.04 , clause( 12300, [ ~( segmentP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X )
% 1.61/2.04 ), =( app( app( skaf47( X, Y ), Y ), skaf48( Y, X ) ), X ) ] )
% 1.61/2.04 , clause( 12301, [ ~( memberP( X, Y ) ), ~( ssItem( Y ) ), ~( ssList( X ) )
% 1.61/2.04 , =( app( skaf42( X, Y ), cons( Y, skaf43( Y, X ) ) ), X ) ] )
% 1.61/2.04 , clause( 12302, [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ),
% 1.61/2.04 ~( ssItem( X ) ), ~( ssList( T ) ), ~( ssList( Y ) ), =( X, Z ) ] )
% 1.61/2.04 , clause( 12303, [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ),
% 1.61/2.04 ~( ssItem( X ) ), ~( ssList( T ) ), ~( ssList( Y ) ), =( T, Y ) ] )
% 1.61/2.04 , clause( 12304, [ ~( segmentP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( T )
% 1.61/2.04 ), ~( ssList( Y ) ), ~( ssList( X ) ), segmentP( app( app( T, X ), Z ),
% 1.61/2.04 Y ) ] )
% 1.61/2.04 , clause( 12305, [ ~( =( app( app( X, Y ), Z ), T ) ), ~( ssList( Z ) ),
% 1.61/2.04 ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( T ) ), segmentP( T, Y ) ]
% 1.61/2.04 )
% 1.61/2.04 , clause( 12306, [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList(
% 1.61/2.04 T ) ), ~( ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), frontsegP( Y
% 1.61/2.04 , T ) ] )
% 1.61/2.04 , clause( 12307, [ ~( =( app( X, cons( Y, Z ) ), T ) ), ~( ssList( Z ) ),
% 1.61/2.04 ~( ssList( X ) ), ~( ssItem( Y ) ), ~( ssList( T ) ), memberP( T, Y ) ]
% 1.61/2.04 )
% 1.61/2.04 , clause( 12308, [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList(
% 1.61/2.04 T ) ), ~( ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), =( X, Z ) ]
% 1.61/2.04 )
% 1.61/2.04 , clause( 12309, [ ~( =( tl( X ), tl( Y ) ) ), ~( =( hd( X ), hd( Y ) ) ),
% 1.61/2.04 ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( X, Y ), =( nil, X ) ]
% 1.61/2.04 )
% 1.61/2.04 , clause( 12310, [ ~( frontsegP( X, Y ) ), ~( =( Z, T ) ), ~( ssList( Y ) )
% 1.61/2.04 , ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Z ) ), frontsegP( cons(
% 1.61/2.04 Z, X ), cons( T, Y ) ) ] )
% 1.61/2.04 , clause( 12311, [ ~( =( app( app( X, cons( Y, Z ) ), cons( Y, T ) ), U ) )
% 1.61/2.04 , ~( ssList( T ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y ) )
% 1.61/2.04 , ~( duplicatefreeP( U ) ), ~( ssList( U ) ) ] )
% 1.61/2.04 , clause( 12312, [ ~( =( app( X, cons( Y, cons( Z, T ) ) ), U ) ), ~(
% 1.61/2.04 ssList( T ) ), ~( ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ), ~(
% 1.61/2.04 equalelemsP( U ) ), ~( ssList( U ) ), =( Y, Z ) ] )
% 1.61/2.04 , clause( 12313, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 1.61/2.04 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 1.61/2.04 , ~( ssItem( Y ) ), ~( strictorderedP( W ) ), ~( ssList( W ) ), lt( Y, T
% 1.61/2.04 ) ] )
% 1.61/2.04 , clause( 12314, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 1.61/2.04 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 1.61/2.04 , ~( ssItem( Y ) ), ~( totalorderedP( W ) ), ~( ssList( W ) ), leq( Y, T
% 1.61/2.04 ) ] )
% 1.61/2.04 , clause( 12315, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 1.61/2.04 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 1.61/2.04 , ~( ssItem( Y ) ), ~( strictorderP( W ) ), ~( ssList( W ) ), lt( Y, T )
% 1.61/2.04 , lt( T, Y ) ] )
% 1.61/2.04 , clause( 12316, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 1.61/2.04 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 1.61/2.04 , ~( ssItem( Y ) ), ~( totalorderP( W ) ), ~( ssList( W ) ), leq( Y, T )
% 1.61/2.04 , leq( T, Y ) ] )
% 1.61/2.04 , clause( 12317, [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( =( app( app( Z,
% 1.61/2.04 cons( X, T ) ), cons( Y, U ) ), W ) ), ~( ssList( U ) ), ~( ssList( T ) )
% 1.61/2.04 , ~( ssList( Z ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), ~( cyclefreeP( W
% 1.61/2.04 ) ), ~( ssList( W ) ) ] )
% 1.61/2.04 , clause( 12318, [ ssList( sk1 ) ] )
% 1.61/2.04 , clause( 12319, [ ssList( sk2 ) ] )
% 1.61/2.04 , clause( 12320, [ ssList( sk3 ) ] )
% 1.61/2.04 , clause( 12321, [ ssList( sk4 ) ] )
% 1.61/2.04 , clause( 12322, [ =( sk2, sk4 ) ] )
% 1.61/2.04 , clause( 12323, [ =( sk1, sk3 ) ] )
% 1.61/2.04 , clause( 12324, [ ~( duplicatefreeP( sk1 ) ) ] )
% 1.61/2.04 , clause( 12325, [ ssItem( sk5 ), =( nil, sk4 ) ] )
% 1.61/2.04 , clause( 12326, [ ssItem( sk5 ), =( nil, sk3 ) ] )
% 1.61/2.04 , clause( 12327, [ ssList( sk6 ), =( nil, sk4 ) ] )
% 1.61/2.04 , clause( 12328, [ ssList( sk7 ), =( nil, sk4 ) ] )
% 1.61/2.04 , clause( 12329, [ =( cons( sk5, nil ), sk3 ), =( nil, sk4 ) ] )
% 1.61/2.04 , clause( 12330, [ =( app( app( sk6, sk3 ), sk7 ), sk4 ), =( nil, sk4 ) ]
% 1.61/2.04 )
% 1.61/2.04 , clause( 12331, [ ~( ssItem( X ) ), ~( memberP( sk6, X ) ), ~( lt( sk5, X
% 1.61/2.04 ) ), =( nil, sk4 ) ] )
% 1.61/2.04 , clause( 12332, [ ~( ssItem( X ) ), ~( memberP( sk7, X ) ), ~( lt( X, sk5
% 1.61/2.04 ) ), =( nil, sk4 ) ] )
% 1.61/2.04 , clause( 12333, [ ssList( sk6 ), =( nil, sk3 ) ] )
% 1.61/2.04 , clause( 12334, [ ssList( sk7 ), =( nil, sk3 ) ] )
% 1.61/2.04 , clause( 12335, [ =( cons( sk5, nil ), sk3 ), =( nil, sk3 ) ] )
% 1.61/2.04 , clause( 12336, [ =( app( app( sk6, sk3 ), sk7 ), sk4 ), =( nil, sk3 ) ]
% 1.61/2.04 )
% 1.61/2.04 , clause( 12337, [ ~( ssItem( X ) ), ~( memberP( sk6, X ) ), ~( lt( sk5, X
% 1.61/2.04 ) ), =( nil, sk3 ) ] )
% 1.61/2.04 , clause( 12338, [ ~( ssItem( X ) ), ~( memberP( sk7, X ) ), ~( lt( X, sk5
% 1.61/2.04 ) ), =( nil, sk3 ) ] )
% 1.61/2.04 ] ).
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 subsumption(
% 1.61/2.04 clause( 1, [ duplicatefreeP( nil ) ] )
% 1.61/2.04 , clause( 12134, [ duplicatefreeP( nil ) ] )
% 1.61/2.04 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 subsumption(
% 1.61/2.04 clause( 7, [ ssList( nil ) ] )
% 1.61/2.04 , clause( 12140, [ ssList( nil ) ] )
% 1.61/2.04 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 subsumption(
% 1.61/2.04 clause( 64, [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ] )
% 1.61/2.04 , clause( 12197, [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ] )
% 1.61/2.04 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.61/2.04 1 )] ) ).
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 subsumption(
% 1.61/2.04 clause( 71, [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ] )
% 1.61/2.04 , clause( 12204, [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ] )
% 1.61/2.04 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.61/2.04 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 subsumption(
% 1.61/2.04 clause( 72, [ ~( ssList( X ) ), =( app( X, nil ), X ) ] )
% 1.61/2.04 , clause( 12205, [ ~( ssList( X ) ), =( app( X, nil ), X ) ] )
% 1.61/2.04 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.61/2.04 1 )] ) ).
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 subsumption(
% 1.61/2.04 clause( 80, [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X ) ] )
% 1.61/2.04 , clause( 12215, [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X )
% 1.61/2.04 ] )
% 1.61/2.04 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.61/2.04 1 ), ==>( 2, 2 )] ) ).
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 subsumption(
% 1.61/2.04 clause( 81, [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ] )
% 1.61/2.04 , clause( 12216, [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X )
% 1.61/2.04 ] )
% 1.61/2.04 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.61/2.04 1 ), ==>( 2, 2 )] ) ).
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 subsumption(
% 1.61/2.04 clause( 99, [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X ) ]
% 1.61/2.04 )
% 1.61/2.04 , clause( 12234, [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X
% 1.61/2.04 ) ] )
% 1.61/2.04 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.61/2.04 ), ==>( 1, 1 ), ==>( 2, 2 ), ==>( 3, 3 )] ) ).
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 subsumption(
% 1.61/2.04 clause( 114, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~(
% 1.61/2.04 ssItem( X ) ) ] )
% 1.61/2.04 , clause( 12249, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~(
% 1.61/2.04 ssItem( X ) ) ] )
% 1.61/2.04 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.61/2.04 ), ==>( 1, 1 ), ==>( 2, 2 ), ==>( 3, 3 )] ) ).
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 subsumption(
% 1.61/2.04 clause( 115, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X )
% 1.61/2.04 ), =( nil, X ) ] )
% 1.61/2.04 , clause( 12250, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList(
% 1.61/2.04 X ) ), =( nil, X ) ] )
% 1.61/2.04 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.61/2.04 ), ==>( 1, 1 ), ==>( 2, 2 ), ==>( 3, 3 )] ) ).
% 1.61/2.04
% 1.61/2.04
% 1.61/2.04 subsumption(
% 1.61/2.04 clause( 182, [ ssList( sk1 ) ] )
% 1.70/2.08 , clause( 12318, [ ssList( sk1 ) ] )
% 1.70/2.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 eqswap(
% 1.70/2.08 clause( 14009, [ =( sk4, sk2 ) ] )
% 1.70/2.08 , clause( 12322, [ =( sk2, sk4 ) ] )
% 1.70/2.08 , 0, substitution( 0, [] )).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 subsumption(
% 1.70/2.08 clause( 186, [ =( sk4, sk2 ) ] )
% 1.70/2.08 , clause( 14009, [ =( sk4, sk2 ) ] )
% 1.70/2.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 eqswap(
% 1.70/2.08 clause( 14768, [ =( sk3, sk1 ) ] )
% 1.70/2.08 , clause( 12323, [ =( sk1, sk3 ) ] )
% 1.70/2.08 , 0, substitution( 0, [] )).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 subsumption(
% 1.70/2.08 clause( 187, [ =( sk3, sk1 ) ] )
% 1.70/2.08 , clause( 14768, [ =( sk3, sk1 ) ] )
% 1.70/2.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 subsumption(
% 1.70/2.08 clause( 188, [ ~( duplicatefreeP( sk1 ) ) ] )
% 1.70/2.08 , clause( 12324, [ ~( duplicatefreeP( sk1 ) ) ] )
% 1.70/2.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 paramod(
% 1.70/2.08 clause( 16699, [ =( cons( sk5, nil ), sk1 ), =( nil, sk4 ) ] )
% 1.70/2.08 , clause( 187, [ =( sk3, sk1 ) ] )
% 1.70/2.08 , 0, clause( 12329, [ =( cons( sk5, nil ), sk3 ), =( nil, sk4 ) ] )
% 1.70/2.08 , 0, 4, substitution( 0, [] ), substitution( 1, [] )).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 paramod(
% 1.70/2.08 clause( 16700, [ =( nil, sk2 ), =( cons( sk5, nil ), sk1 ) ] )
% 1.70/2.08 , clause( 186, [ =( sk4, sk2 ) ] )
% 1.70/2.08 , 0, clause( 16699, [ =( cons( sk5, nil ), sk1 ), =( nil, sk4 ) ] )
% 1.70/2.08 , 1, 2, substitution( 0, [] ), substitution( 1, [] )).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 subsumption(
% 1.70/2.08 clause( 193, [ =( cons( sk5, nil ), sk1 ), =( nil, sk2 ) ] )
% 1.70/2.08 , clause( 16700, [ =( nil, sk2 ), =( cons( sk5, nil ), sk1 ) ] )
% 1.70/2.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 1.70/2.08 ).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 eqswap(
% 1.70/2.08 clause( 19055, [ =( sk1, cons( sk5, nil ) ), =( nil, sk2 ) ] )
% 1.70/2.08 , clause( 193, [ =( cons( sk5, nil ), sk1 ), =( nil, sk2 ) ] )
% 1.70/2.08 , 0, substitution( 0, [] )).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 paramod(
% 1.70/2.08 clause( 19063, [ =( nil, sk1 ), =( cons( sk5, nil ), sk3 ) ] )
% 1.70/2.08 , clause( 187, [ =( sk3, sk1 ) ] )
% 1.70/2.08 , 0, clause( 12335, [ =( cons( sk5, nil ), sk3 ), =( nil, sk3 ) ] )
% 1.70/2.08 , 1, 2, substitution( 0, [] ), substitution( 1, [] )).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 paramod(
% 1.70/2.08 clause( 19065, [ =( sk2, sk1 ), =( sk1, cons( sk5, nil ) ), =( cons( sk5,
% 1.70/2.08 nil ), sk3 ) ] )
% 1.70/2.08 , clause( 19055, [ =( sk1, cons( sk5, nil ) ), =( nil, sk2 ) ] )
% 1.70/2.08 , 1, clause( 19063, [ =( nil, sk1 ), =( cons( sk5, nil ), sk3 ) ] )
% 1.70/2.08 , 0, 1, substitution( 0, [] ), substitution( 1, [] )).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 paramod(
% 1.70/2.08 clause( 19369, [ =( cons( sk5, nil ), sk1 ), =( sk2, sk1 ), =( sk1, cons(
% 1.70/2.08 sk5, nil ) ) ] )
% 1.70/2.08 , clause( 187, [ =( sk3, sk1 ) ] )
% 1.70/2.08 , 0, clause( 19065, [ =( sk2, sk1 ), =( sk1, cons( sk5, nil ) ), =( cons(
% 1.70/2.08 sk5, nil ), sk3 ) ] )
% 1.70/2.08 , 2, 4, substitution( 0, [] ), substitution( 1, [] )).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 eqswap(
% 1.70/2.08 clause( 19372, [ =( cons( sk5, nil ), sk1 ), =( cons( sk5, nil ), sk1 ),
% 1.70/2.08 =( sk2, sk1 ) ] )
% 1.70/2.08 , clause( 19369, [ =( cons( sk5, nil ), sk1 ), =( sk2, sk1 ), =( sk1, cons(
% 1.70/2.08 sk5, nil ) ) ] )
% 1.70/2.08 , 2, substitution( 0, [] )).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 factor(
% 1.70/2.08 clause( 19380, [ =( cons( sk5, nil ), sk1 ), =( sk2, sk1 ) ] )
% 1.70/2.08 , clause( 19372, [ =( cons( sk5, nil ), sk1 ), =( cons( sk5, nil ), sk1 ),
% 1.70/2.08 =( sk2, sk1 ) ] )
% 1.70/2.08 , 0, 1, substitution( 0, [] )).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 subsumption(
% 1.70/2.08 clause( 199, [ =( cons( sk5, nil ), sk1 ), =( sk2, sk1 ) ] )
% 1.70/2.08 , clause( 19380, [ =( cons( sk5, nil ), sk1 ), =( sk2, sk1 ) ] )
% 1.70/2.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] )
% 1.70/2.08 ).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 resolution(
% 1.70/2.08 clause( 19381, [ duplicatefreeP( sk1 ), ssItem( X ) ] )
% 1.70/2.08 , clause( 71, [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ] )
% 1.70/2.08 , 0, clause( 182, [ ssList( sk1 ) ] )
% 1.70/2.08 , 0, substitution( 0, [ :=( X, sk1 ), :=( Y, X )] ), substitution( 1, [] )
% 1.70/2.08 ).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 resolution(
% 1.70/2.08 clause( 19382, [ ssItem( X ) ] )
% 1.70/2.08 , clause( 188, [ ~( duplicatefreeP( sk1 ) ) ] )
% 1.70/2.08 , 0, clause( 19381, [ duplicatefreeP( sk1 ), ssItem( X ) ] )
% 1.70/2.08 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, X )] )).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 subsumption(
% 1.70/2.08 clause( 744, [ ssItem( X ) ] )
% 1.70/2.08 , clause( 19382, [ ssItem( X ) ] )
% 1.70/2.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 resolution(
% 1.70/2.08 clause( 19383, [ duplicatefreeP( cons( X, nil ) ) ] )
% 1.70/2.08 , clause( 64, [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ] )
% 1.70/2.08 , 0, clause( 744, [ ssItem( X ) ] )
% 1.70/2.08 , 0, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 1.70/2.08 ).
% 1.70/2.08
% 1.70/2.08
% 1.70/2.08 subsumption(
% 1.70/2.08 clause( 752, [ duplicatefreeP( cons( X, nil ) ) ] )
% 1.70/2.08 , clause( 19383, [ duplicatefreeP( cons( X, nil ) ) ] )
% 2.12/2.55 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 eqswap(
% 2.12/2.55 clause( 19384, [ =( X, app( X, nil ) ), ~( ssList( X ) ) ] )
% 2.12/2.55 , clause( 72, [ ~( ssList( X ) ), =( app( X, nil ), X ) ] )
% 2.12/2.55 , 1, substitution( 0, [ :=( X, X )] )).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 resolution(
% 2.12/2.55 clause( 19385, [ =( nil, app( nil, nil ) ) ] )
% 2.12/2.55 , clause( 19384, [ =( X, app( X, nil ) ), ~( ssList( X ) ) ] )
% 2.12/2.55 , 1, clause( 7, [ ssList( nil ) ] )
% 2.12/2.55 , 0, substitution( 0, [ :=( X, nil )] ), substitution( 1, [] )).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 eqswap(
% 2.12/2.55 clause( 19386, [ =( app( nil, nil ), nil ) ] )
% 2.12/2.55 , clause( 19385, [ =( nil, app( nil, nil ) ) ] )
% 2.12/2.55 , 0, substitution( 0, [] )).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 subsumption(
% 2.12/2.55 clause( 785, [ =( app( nil, nil ), nil ) ] )
% 2.12/2.55 , clause( 19386, [ =( app( nil, nil ), nil ) ] )
% 2.12/2.55 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 eqswap(
% 2.12/2.55 clause( 19387, [ =( X, nil ), ~( frontsegP( nil, X ) ), ~( ssList( X ) ) ]
% 2.12/2.55 )
% 2.12/2.55 , clause( 81, [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 2.12/2.55 )
% 2.12/2.55 , 2, substitution( 0, [ :=( X, X )] )).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 resolution(
% 2.12/2.55 clause( 19388, [ =( sk1, nil ), ~( frontsegP( nil, sk1 ) ) ] )
% 2.12/2.55 , clause( 19387, [ =( X, nil ), ~( frontsegP( nil, X ) ), ~( ssList( X ) )
% 2.12/2.55 ] )
% 2.12/2.55 , 2, clause( 182, [ ssList( sk1 ) ] )
% 2.12/2.55 , 0, substitution( 0, [ :=( X, sk1 )] ), substitution( 1, [] )).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 eqswap(
% 2.12/2.55 clause( 19389, [ =( nil, sk1 ), ~( frontsegP( nil, sk1 ) ) ] )
% 2.12/2.55 , clause( 19388, [ =( sk1, nil ), ~( frontsegP( nil, sk1 ) ) ] )
% 2.12/2.55 , 0, substitution( 0, [] )).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 subsumption(
% 2.12/2.55 clause( 1321, [ ~( frontsegP( nil, sk1 ) ), =( nil, sk1 ) ] )
% 2.12/2.55 , clause( 19389, [ =( nil, sk1 ), ~( frontsegP( nil, sk1 ) ) ] )
% 2.12/2.55 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 2.12/2.55 ).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 resolution(
% 2.12/2.55 clause( 19392, [ ~( ssItem( Y ) ), neq( Y, X ), =( Y, X ) ] )
% 2.12/2.55 , clause( 99, [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X )
% 2.12/2.55 ] )
% 2.12/2.55 , 0, clause( 744, [ ssItem( X ) ] )
% 2.12/2.55 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 2.12/2.55 , X )] )).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 resolution(
% 2.12/2.55 clause( 19394, [ neq( X, Y ), =( X, Y ) ] )
% 2.12/2.55 , clause( 19392, [ ~( ssItem( Y ) ), neq( Y, X ), =( Y, X ) ] )
% 2.12/2.55 , 0, clause( 744, [ ssItem( X ) ] )
% 2.12/2.55 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] ), substitution( 1, [ :=( X
% 2.12/2.55 , X )] )).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 subsumption(
% 2.12/2.55 clause( 2787, [ neq( Y, X ), =( Y, X ) ] )
% 2.12/2.55 , clause( 19394, [ neq( X, Y ), =( X, Y ) ] )
% 2.12/2.55 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 2.12/2.55 ), ==>( 1, 1 )] ) ).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 resolution(
% 2.12/2.55 clause( 19398, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( X ) ) ] )
% 2.12/2.55 , clause( 114, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~(
% 2.12/2.55 ssItem( X ) ) ] )
% 2.12/2.55 , 2, clause( 744, [ ssItem( X ) ] )
% 2.12/2.55 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 2.12/2.55 , Y )] )).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 resolution(
% 2.12/2.55 clause( 19400, [ ~( =( X, Y ) ), ~( neq( X, Y ) ) ] )
% 2.12/2.55 , clause( 19398, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( X ) ) ] )
% 2.12/2.55 , 2, clause( 744, [ ssItem( X ) ] )
% 2.12/2.55 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 2.12/2.55 , X )] )).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 subsumption(
% 2.12/2.55 clause( 3314, [ ~( =( X, Y ) ), ~( neq( X, Y ) ) ] )
% 2.12/2.55 , clause( 19400, [ ~( =( X, Y ) ), ~( neq( X, Y ) ) ] )
% 2.12/2.55 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.12/2.55 ), ==>( 1, 1 )] ) ).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 eqswap(
% 2.12/2.55 clause( 19403, [ =( X, nil ), ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) )
% 2.12/2.55 , ~( ssList( X ) ) ] )
% 2.12/2.55 , clause( 115, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X
% 2.12/2.55 ) ), =( nil, X ) ] )
% 2.12/2.55 , 3, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 eqswap(
% 2.12/2.55 clause( 19404, [ ~( =( nil, app( X, Y ) ) ), =( X, nil ), ~( ssList( Y ) )
% 2.12/2.55 , ~( ssList( X ) ) ] )
% 2.12/2.55 , clause( 19403, [ =( X, nil ), ~( =( app( X, Y ), nil ) ), ~( ssList( Y )
% 2.12/2.55 ), ~( ssList( X ) ) ] )
% 2.12/2.55 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 paramod(
% 2.12/2.55 clause( 19405, [ ~( duplicatefreeP( nil ) ), ~( =( nil, app( sk1, X ) ) ),
% 2.12/2.55 ~( ssList( X ) ), ~( ssList( sk1 ) ) ] )
% 2.12/2.55 , clause( 19404, [ ~( =( nil, app( X, Y ) ) ), =( X, nil ), ~( ssList( Y )
% 2.12/2.55 ), ~( ssList( X ) ) ] )
% 2.12/2.55 , 1, clause( 188, [ ~( duplicatefreeP( sk1 ) ) ] )
% 2.12/2.55 , 0, 2, substitution( 0, [ :=( X, sk1 ), :=( Y, X )] ), substitution( 1, [] )
% 2.12/2.55 ).
% 2.12/2.55
% 2.12/2.55
% 2.12/2.55 resolution(
% 2.12/2.55 clause( 19991, [ ~( =( nil, app( sk1, X ) ) ), ~( ssList( X ) ), ~( ssList(
% 2.12/2.56 sk1 ) ) ] )
% 2.12/2.56 , clause( 19405, [ ~( duplicatefreeP( nil ) ), ~( =( nil, app( sk1, X ) ) )
% 2.12/2.56 , ~( ssList( X ) ), ~( ssList( sk1 ) ) ] )
% 2.12/2.56 , 0, clause( 1, [ duplicatefreeP( nil ) ] )
% 2.12/2.56 , 0, substitution( 0, [ :=( X, X )] ), substitution( 1, [] )).
% 2.12/2.56
% 2.12/2.56
% 2.12/2.56 eqswap(
% 2.12/2.56 clause( 19992, [ ~( =( app( sk1, X ), nil ) ), ~( ssList( X ) ), ~( ssList(
% 2.12/2.56 sk1 ) ) ] )
% 2.12/2.56 , clause( 19991, [ ~( =( nil, app( sk1, X ) ) ), ~( ssList( X ) ), ~(
% 2.12/2.56 ssList( sk1 ) ) ] )
% 2.12/2.56 , 0, substitution( 0, [ :=( X, X )] )).
% 2.12/2.56
% 2.12/2.56
% 2.12/2.56 subsumption(
% 2.12/2.56 clause( 3542, [ ~( =( app( sk1, X ), nil ) ), ~( ssList( X ) ), ~( ssList(
% 2.12/2.56 sk1 ) ) ] )
% 2.12/2.56 , clause( 19992, [ ~( =( app( sk1, X ), nil ) ), ~( ssList( X ) ), ~(
% 2.12/2.56 ssList( sk1 ) ) ] )
% 2.12/2.56 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 2.12/2.56 1 ), ==>( 2, 2 )] ) ).
% 2.12/2.56
% 2.12/2.56
% 2.12/2.56 factor(
% 2.12/2.56 clause( 19997, [ ~( =( app( sk1, sk1 ), nil ) ), ~( ssList( sk1 ) ) ] )
% 2.12/2.56 , clause( 3542, [ ~( =( app( sk1, X ), nil ) ), ~( ssList( X ) ), ~( ssList(
% 2.12/2.56 sk1 ) ) ] )
% 2.12/2.56 , 1, 2, substitution( 0, [ :=( X, sk1 )] )).
% 2.12/2.56
% 2.12/2.56
% 2.12/2.56 resolution(
% 2.12/2.56 clause( 19998, [ ~( =( app( sk1, sk1 ), nil ) ) ] )
% 2.12/2.56 , clause( 19997, [ ~( =( app( sk1, sk1 ), nil ) ), ~( ssList( sk1 ) ) ] )
% 2.12/2.56 , 1, clause( 182, [ ssList( sk1 ) ] )
% 2.12/2.56 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 2.12/2.56
% 2.12/2.56
% 2.12/2.56 subsumption(
% 2.12/2.56 clause( 3543, [ ~( =( app( sk1, sk1 ), nil ) ) ] )
% 2.12/2.56 , clause( 19998, [ ~( =( app( sk1, sk1 ), nil ) ) ] )
% 2.12/2.56 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.12/2.56
% 2.12/2.56
% 2.12/2.56 eqswap(
% 2.12/2.56 clause( 20000, [ =( X, nil ), ~( frontsegP( nil, X ) ), ~( ssList( X ) ) ]
% 2.12/2.56 )
% 2.12/2.56 , clause( 81, [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 2.12/2.56 )
% 2.12/2.56 , 2, substitution( 0, [ :=( X, X )] )).
% 2.12/2.56
% 2.12/2.56
% 2.12/2.56 eqswap(
% 2.12/2.56 clause( 20001, [ ~( =( nil, app( sk1, sk1 ) ) ) ] )
% 2.12/2.56 , clause( 3543, [ ~( =( app( sk1, sk1 ), nil ) ) ] )
% 2.12/2.56 , 0, substitution( 0, [] )).
% 2.12/2.56
% 2.12/2.56
% 2.12/2.56 paramod(
% 2.12/2.56 clause( 20007, [ ~( =( nil, app( sk1, nil ) ) ), ~( frontsegP( nil, sk1 ) )
% 2.12/2.56 , ~( ssList( sk1 ) ) ] )
% 2.12/2.56 , clause( 20000, [ =( X, nil ), ~( frontsegP( nil, X ) ), ~( ssList( X ) )
% 2.12/2.56 ] )
% 2.12/2.56 , 0, clause( 20001, [ ~( =( nil, app( sk1, sk1 ) ) ) ] )
% 2.12/2.56 , 0, 5, substitution( 0, [ :=( X, sk1 )] ), substitution( 1, [] )).
% 2.12/2.56
% 2.12/2.56
% 2.12/2.56 paramod(
% 2.12/2.56 clause( 20012, [ ~( ssList( nil ) ), ~( frontsegP( nil, sk1 ) ), ~( ssList(
% 2.12/2.56 sk1 ) ), ~( =( nil, app( sk1, nil ) ) ), ~( frontsegP( nil, sk1 ) ) ] )
% 2.12/2.56 , clause( 20000, [ =( X, nil ), ~( frontsegP( nil, X ) ), ~( ssList( X ) )
% 2.12/2.56 ] )
% 2.12/2.56 , 0, clause( 20007, [ ~( =( nil, app( sk1, nil ) ) ), ~( frontsegP( nil,
% 2.12/2.56 sk1 ) ), ~( ssList( sk1 ) ) ] )
% 2.12/2.56 , 2, 2, substitution( 0, [ :=( X, sk1 )] ), substitution( 1, [] )).
% 2.12/2.56
% 2.12/2.56
% 2.12/2.56 paramod(
% 2.12/2.56 clause( 20016, [ ~( =( nil, app( nil, nil ) ) ), ~( frontsegP( nil, sk1 ) )
% 2.12/2.56 , ~( ssList( sk1 ) ), ~( ssList( nil ) ), ~( frontsegP( nil, sk1 ) ), ~(
% 2.12/2.56 ssList( sk1 ) ), ~( frontsegP( nil, sk1 ) ) ] )
% 2.12/2.56 , clause( 20000, [ =( X, nil ), ~( frontsegP( nil, X ) ), ~( ssList( X ) )
% 2.12/2.56 ] )
% 2.12/2.56 , 0, clause( 20012, [ ~( ssList( nil ) ), ~( frontsegP( nil, sk1 ) ), ~(
% 2.12/2.56 ssList( sk1 ) ), ~( =( nil, app( sk1, nil ) ) ), ~( frontsegP( nil, sk1 )
% 2.12/2.56 ) ] )
% 2.12/2.56 , 3, 4, substitution( 0, [ :=( X, sk1 )] ), substitution( 1, [] )).
% 2.12/2.56
% 2.12/2.56
% 2.12/2.56 paramod(
% 2.12/2.56 clause( 20136, [ ~( =( nil, nil ) ), ~( frontsegP( nil, sk1 ) ), ~( ssList(
% 2.12/2.56 sk1 ) ), ~( ssList( nil ) ), ~( frontsegP( nil, sk1 ) ), ~( ssList( sk1 )
% 2.12/2.56 ), ~( frontsegP( nil, sk1 ) ) ] )
% 2.12/2.56 , clause( 785, [ =( app( nil, nil ), nil ) ] )
% 2.12/2.56 , 0, clause( 20016, [ ~( =( nil, app( nil, nil ) ) ), ~( frontsegP( nil,
% 2.12/2.56 sk1 ) ), ~( ssList( sk1 ) ), ~( ssList( nil ) ), ~( frontsegP( nil, sk1 )
% 2.12/2.56 ), ~( ssList( sk1 ) ), ~( frontsegP( nil, sk1 ) ) ] )
% 2.12/2.56 , 0, 3, substitution( 0, [] ), substitution( 1, [] )).
% 2.12/2.56
% 2.12/2.56
% 2.12/2.56 factor(
% 2.12/2.56 clause( 20137, [ ~( =( nil, nil ) ), ~( frontsegP( nil, sk1 ) ), ~( ssList(
% 2.12/2.56 sk1 ) ), ~( ssList( nil ) ), ~( ssList( sk1 ) ), ~( frontsegP( nil, sk1 )
% 2.12/2.56 ) ] )
% 2.12/2.56 , clause( 20136, [ ~( =( nil, nil ) ), ~( frontsegP( nil, sk1 ) ), ~(
% 2.12/2.56 ssList( sk1 ) ), ~( ssList( nil ) ), ~( frontsegP( nil, sk1 ) ), ~(
% 2.12/2.56 ssList( sk1 ) ), ~( frontsegP( nil, sk1 ) ) ] )
% 2.12/2.56 , 1, 4, substitution( 0, [] )).
% 2.12/2.56
% 2.12/2.56
% 2.12/2.56 factor(
% 2.12/2.56 clause( 20138, [ ~( =( nil, nil ) ), ~( frontsegP( nil, sk1 ) ), ~( ssList(
% 2.12/2.56 sk1 ) ), ~( ssList( nil ) ), ~( ssList( sk1 ) ) ] )
% 4.42/4.81 , clause( 20137, [ ~( =( nil, nil ) ), ~( frontsegP( nil, sk1 ) ), ~(
% 4.42/4.81 ssList( sk1 ) ), ~( ssList( nil ) ), ~( ssList( sk1 ) ), ~( frontsegP(
% 4.42/4.81 nil, sk1 ) ) ] )
% 4.42/4.81 , 1, 5, substitution( 0, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 factor(
% 4.42/4.81 clause( 20139, [ ~( =( nil, nil ) ), ~( frontsegP( nil, sk1 ) ), ~( ssList(
% 4.42/4.81 sk1 ) ), ~( ssList( nil ) ) ] )
% 4.42/4.81 , clause( 20138, [ ~( =( nil, nil ) ), ~( frontsegP( nil, sk1 ) ), ~(
% 4.42/4.81 ssList( sk1 ) ), ~( ssList( nil ) ), ~( ssList( sk1 ) ) ] )
% 4.42/4.81 , 2, 4, substitution( 0, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 paramod(
% 4.42/4.81 clause( 20143, [ ~( ssList( sk1 ) ), ~( frontsegP( nil, sk1 ) ), ~( =( nil
% 4.42/4.81 , nil ) ), ~( frontsegP( nil, sk1 ) ), ~( ssList( sk1 ) ) ] )
% 4.42/4.81 , clause( 1321, [ ~( frontsegP( nil, sk1 ) ), =( nil, sk1 ) ] )
% 4.42/4.81 , 1, clause( 20139, [ ~( =( nil, nil ) ), ~( frontsegP( nil, sk1 ) ), ~(
% 4.42/4.81 ssList( sk1 ) ), ~( ssList( nil ) ) ] )
% 4.42/4.81 , 3, 2, substitution( 0, [] ), substitution( 1, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 factor(
% 4.42/4.81 clause( 20170, [ ~( ssList( sk1 ) ), ~( frontsegP( nil, sk1 ) ), ~( =( nil
% 4.42/4.81 , nil ) ), ~( frontsegP( nil, sk1 ) ) ] )
% 4.42/4.81 , clause( 20143, [ ~( ssList( sk1 ) ), ~( frontsegP( nil, sk1 ) ), ~( =(
% 4.42/4.81 nil, nil ) ), ~( frontsegP( nil, sk1 ) ), ~( ssList( sk1 ) ) ] )
% 4.42/4.81 , 0, 4, substitution( 0, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 eqrefl(
% 4.42/4.81 clause( 20173, [ ~( ssList( sk1 ) ), ~( frontsegP( nil, sk1 ) ), ~(
% 4.42/4.81 frontsegP( nil, sk1 ) ) ] )
% 4.42/4.81 , clause( 20170, [ ~( ssList( sk1 ) ), ~( frontsegP( nil, sk1 ) ), ~( =(
% 4.42/4.81 nil, nil ) ), ~( frontsegP( nil, sk1 ) ) ] )
% 4.42/4.81 , 2, substitution( 0, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 factor(
% 4.42/4.81 clause( 20174, [ ~( ssList( sk1 ) ), ~( frontsegP( nil, sk1 ) ) ] )
% 4.42/4.81 , clause( 20173, [ ~( ssList( sk1 ) ), ~( frontsegP( nil, sk1 ) ), ~(
% 4.42/4.81 frontsegP( nil, sk1 ) ) ] )
% 4.42/4.81 , 1, 2, substitution( 0, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 resolution(
% 4.42/4.81 clause( 20175, [ ~( frontsegP( nil, sk1 ) ) ] )
% 4.42/4.81 , clause( 20174, [ ~( ssList( sk1 ) ), ~( frontsegP( nil, sk1 ) ) ] )
% 4.42/4.81 , 0, clause( 182, [ ssList( sk1 ) ] )
% 4.42/4.81 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 subsumption(
% 4.42/4.81 clause( 4867, [ ~( frontsegP( nil, sk1 ) ) ] )
% 4.42/4.81 , clause( 20175, [ ~( frontsegP( nil, sk1 ) ) ] )
% 4.42/4.81 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 eqswap(
% 4.42/4.81 clause( 20176, [ ~( =( X, nil ) ), ~( ssList( X ) ), frontsegP( nil, X ) ]
% 4.42/4.81 )
% 4.42/4.81 , clause( 80, [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X ) ]
% 4.42/4.81 )
% 4.42/4.81 , 0, substitution( 0, [ :=( X, X )] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 resolution(
% 4.42/4.81 clause( 20177, [ ~( =( sk1, nil ) ), ~( ssList( sk1 ) ) ] )
% 4.42/4.81 , clause( 4867, [ ~( frontsegP( nil, sk1 ) ) ] )
% 4.42/4.81 , 0, clause( 20176, [ ~( =( X, nil ) ), ~( ssList( X ) ), frontsegP( nil, X
% 4.42/4.81 ) ] )
% 4.42/4.81 , 2, substitution( 0, [] ), substitution( 1, [ :=( X, sk1 )] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 resolution(
% 4.42/4.81 clause( 20178, [ ~( =( sk1, nil ) ) ] )
% 4.42/4.81 , clause( 20177, [ ~( =( sk1, nil ) ), ~( ssList( sk1 ) ) ] )
% 4.42/4.81 , 1, clause( 182, [ ssList( sk1 ) ] )
% 4.42/4.81 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 eqswap(
% 4.42/4.81 clause( 20179, [ ~( =( nil, sk1 ) ) ] )
% 4.42/4.81 , clause( 20178, [ ~( =( sk1, nil ) ) ] )
% 4.42/4.81 , 0, substitution( 0, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 subsumption(
% 4.42/4.81 clause( 4876, [ ~( =( nil, sk1 ) ) ] )
% 4.42/4.81 , clause( 20179, [ ~( =( nil, sk1 ) ) ] )
% 4.42/4.81 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 paramod(
% 4.42/4.81 clause( 20635, [ ~( duplicatefreeP( X ) ), neq( sk1, X ) ] )
% 4.42/4.81 , clause( 2787, [ neq( Y, X ), =( Y, X ) ] )
% 4.42/4.81 , 1, clause( 188, [ ~( duplicatefreeP( sk1 ) ) ] )
% 4.42/4.81 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, sk1 )] ), substitution( 1, [] )
% 4.42/4.81 ).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 subsumption(
% 4.42/4.81 clause( 10235, [ ~( duplicatefreeP( X ) ), neq( sk1, X ) ] )
% 4.42/4.81 , clause( 20635, [ ~( duplicatefreeP( X ) ), neq( sk1, X ) ] )
% 4.42/4.81 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 4.42/4.81 1 )] ) ).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 eqswap(
% 4.42/4.81 clause( 21092, [ =( sk1, cons( sk5, nil ) ), =( sk2, sk1 ) ] )
% 4.42/4.81 , clause( 199, [ =( cons( sk5, nil ), sk1 ), =( sk2, sk1 ) ] )
% 4.42/4.81 , 0, substitution( 0, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 paramod(
% 4.42/4.81 clause( 21096, [ =( nil, sk1 ), =( sk1, cons( sk5, nil ) ), =( cons( sk5,
% 4.42/4.81 nil ), sk1 ) ] )
% 4.42/4.81 , clause( 21092, [ =( sk1, cons( sk5, nil ) ), =( sk2, sk1 ) ] )
% 4.42/4.81 , 1, clause( 193, [ =( cons( sk5, nil ), sk1 ), =( nil, sk2 ) ] )
% 4.42/4.81 , 1, 2, substitution( 0, [] ), substitution( 1, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 resolution(
% 4.42/4.81 clause( 21097, [ =( sk1, cons( sk5, nil ) ), =( cons( sk5, nil ), sk1 ) ]
% 4.42/4.81 )
% 4.42/4.81 , clause( 4876, [ ~( =( nil, sk1 ) ) ] )
% 4.42/4.81 , 0, clause( 21096, [ =( nil, sk1 ), =( sk1, cons( sk5, nil ) ), =( cons(
% 4.42/4.81 sk5, nil ), sk1 ) ] )
% 4.42/4.81 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 eqswap(
% 4.42/4.81 clause( 21098, [ =( cons( sk5, nil ), sk1 ), =( cons( sk5, nil ), sk1 ) ]
% 4.42/4.81 )
% 4.42/4.81 , clause( 21097, [ =( sk1, cons( sk5, nil ) ), =( cons( sk5, nil ), sk1 ) ]
% 4.42/4.81 )
% 4.42/4.81 , 0, substitution( 0, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 factor(
% 4.42/4.81 clause( 21100, [ =( cons( sk5, nil ), sk1 ) ] )
% 4.42/4.81 , clause( 21098, [ =( cons( sk5, nil ), sk1 ), =( cons( sk5, nil ), sk1 ) ]
% 4.42/4.81 )
% 4.42/4.81 , 0, 1, substitution( 0, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 subsumption(
% 4.42/4.81 clause( 11829, [ =( cons( sk5, nil ), sk1 ) ] )
% 4.42/4.81 , clause( 21100, [ =( cons( sk5, nil ), sk1 ) ] )
% 4.42/4.81 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 eqswap(
% 4.42/4.81 clause( 21102, [ ~( =( Y, X ) ), ~( neq( X, Y ) ) ] )
% 4.42/4.81 , clause( 3314, [ ~( =( X, Y ) ), ~( neq( X, Y ) ) ] )
% 4.42/4.81 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 resolution(
% 4.42/4.81 clause( 21103, [ ~( =( X, sk1 ) ), ~( duplicatefreeP( X ) ) ] )
% 4.42/4.81 , clause( 21102, [ ~( =( Y, X ) ), ~( neq( X, Y ) ) ] )
% 4.42/4.81 , 1, clause( 10235, [ ~( duplicatefreeP( X ) ), neq( sk1, X ) ] )
% 4.42/4.81 , 1, substitution( 0, [ :=( X, sk1 ), :=( Y, X )] ), substitution( 1, [
% 4.42/4.81 :=( X, X )] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 eqswap(
% 4.42/4.81 clause( 21104, [ ~( =( sk1, X ) ), ~( duplicatefreeP( X ) ) ] )
% 4.42/4.81 , clause( 21103, [ ~( =( X, sk1 ) ), ~( duplicatefreeP( X ) ) ] )
% 4.42/4.81 , 0, substitution( 0, [ :=( X, X )] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 subsumption(
% 4.42/4.81 clause( 12019, [ ~( duplicatefreeP( X ) ), ~( =( sk1, X ) ) ] )
% 4.42/4.81 , clause( 21104, [ ~( =( sk1, X ) ), ~( duplicatefreeP( X ) ) ] )
% 4.42/4.81 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 4.42/4.81 0 )] ) ).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 eqswap(
% 4.42/4.81 clause( 21105, [ ~( =( X, sk1 ) ), ~( duplicatefreeP( X ) ) ] )
% 4.42/4.81 , clause( 12019, [ ~( duplicatefreeP( X ) ), ~( =( sk1, X ) ) ] )
% 4.42/4.81 , 1, substitution( 0, [ :=( X, X )] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 resolution(
% 4.42/4.81 clause( 21106, [ ~( =( cons( X, nil ), sk1 ) ) ] )
% 4.42/4.81 , clause( 21105, [ ~( =( X, sk1 ) ), ~( duplicatefreeP( X ) ) ] )
% 4.42/4.81 , 1, clause( 752, [ duplicatefreeP( cons( X, nil ) ) ] )
% 4.42/4.81 , 0, substitution( 0, [ :=( X, cons( X, nil ) )] ), substitution( 1, [ :=(
% 4.42/4.81 X, X )] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 subsumption(
% 4.42/4.81 clause( 12028, [ ~( =( cons( X, nil ), sk1 ) ) ] )
% 4.42/4.81 , clause( 21106, [ ~( =( cons( X, nil ), sk1 ) ) ] )
% 4.42/4.81 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 resolution(
% 4.42/4.81 clause( 21110, [] )
% 4.42/4.81 , clause( 12028, [ ~( =( cons( X, nil ), sk1 ) ) ] )
% 4.42/4.81 , 0, clause( 11829, [ =( cons( sk5, nil ), sk1 ) ] )
% 4.42/4.81 , 0, substitution( 0, [ :=( X, sk5 )] ), substitution( 1, [] )).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 subsumption(
% 4.42/4.81 clause( 12131, [] )
% 4.42/4.81 , clause( 21110, [] )
% 4.42/4.81 , substitution( 0, [] ), permutation( 0, [] ) ).
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 end.
% 4.42/4.81
% 4.42/4.81 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 4.42/4.81
% 4.42/4.81 Memory use:
% 4.42/4.81
% 4.42/4.81 space for terms: 206678
% 4.42/4.81 space for clauses: 670273
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 clauses generated: 46364
% 4.42/4.81 clauses kept: 12132
% 4.42/4.81 clauses selected: 427
% 4.42/4.81 clauses deleted: 345
% 4.42/4.81 clauses inuse deleted: 49
% 4.42/4.81
% 4.42/4.81 subsentry: 976100
% 4.42/4.81 literals s-matched: 690576
% 4.42/4.81 literals matched: 644797
% 4.42/4.81 full subsumption: 607799
% 4.42/4.81
% 4.42/4.81 checksum: 1413829957
% 4.42/4.81
% 4.42/4.81
% 4.42/4.81 Bliksem ended
%------------------------------------------------------------------------------