TSTP Solution File: SWC254-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWC254-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Tue Jul 19 19:35:13 EDT 2022
% Result : Unsatisfiable 0.89s 1.24s
% Output : Refutation 0.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC254-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n021.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 : Sun Jun 12 14:43:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.05 *** allocated 10000 integers for termspace/termends
% 0.45/1.05 *** allocated 10000 integers for clauses
% 0.45/1.05 *** allocated 10000 integers for justifications
% 0.45/1.05 Bliksem 1.12
% 0.45/1.05
% 0.45/1.05
% 0.45/1.05 Automatic Strategy Selection
% 0.45/1.05
% 0.45/1.05 Clauses:
% 0.45/1.05 [
% 0.45/1.05 [ equalelemsP( nil ) ],
% 0.45/1.05 [ duplicatefreeP( nil ) ],
% 0.45/1.05 [ strictorderedP( nil ) ],
% 0.45/1.05 [ totalorderedP( nil ) ],
% 0.45/1.05 [ strictorderP( nil ) ],
% 0.45/1.05 [ totalorderP( nil ) ],
% 0.45/1.05 [ cyclefreeP( nil ) ],
% 0.45/1.05 [ ssList( nil ) ],
% 0.45/1.05 [ ssItem( skac3 ) ],
% 0.45/1.05 [ ssItem( skac2 ) ],
% 0.45/1.05 [ ~( singletonP( nil ) ) ],
% 0.45/1.05 [ ssItem( skaf83( X ) ) ],
% 0.45/1.05 [ ssList( skaf82( X ) ) ],
% 0.45/1.05 [ ssList( skaf81( X ) ) ],
% 0.45/1.05 [ ssList( skaf80( X ) ) ],
% 0.45/1.05 [ ssItem( skaf79( X ) ) ],
% 0.45/1.05 [ ssItem( skaf78( X ) ) ],
% 0.45/1.05 [ ssList( skaf77( X ) ) ],
% 0.45/1.05 [ ssList( skaf76( X ) ) ],
% 0.45/1.05 [ ssList( skaf75( X ) ) ],
% 0.45/1.05 [ ssItem( skaf74( X ) ) ],
% 0.45/1.05 [ ssList( skaf73( X ) ) ],
% 0.45/1.05 [ ssList( skaf72( X ) ) ],
% 0.45/1.05 [ ssList( skaf71( X ) ) ],
% 0.45/1.05 [ ssItem( skaf70( X ) ) ],
% 0.45/1.05 [ ssItem( skaf69( X ) ) ],
% 0.45/1.05 [ ssList( skaf68( X ) ) ],
% 0.45/1.05 [ ssList( skaf67( X ) ) ],
% 0.45/1.05 [ ssList( skaf66( X ) ) ],
% 0.45/1.05 [ ssItem( skaf65( X ) ) ],
% 0.45/1.05 [ ssItem( skaf64( X ) ) ],
% 0.45/1.05 [ ssList( skaf63( X ) ) ],
% 0.45/1.05 [ ssList( skaf62( X ) ) ],
% 0.45/1.05 [ ssList( skaf61( X ) ) ],
% 0.45/1.05 [ ssItem( skaf60( X ) ) ],
% 0.45/1.05 [ ssItem( skaf59( X ) ) ],
% 0.45/1.05 [ ssList( skaf58( X ) ) ],
% 0.45/1.05 [ ssList( skaf57( X ) ) ],
% 0.45/1.05 [ ssList( skaf56( X ) ) ],
% 0.45/1.05 [ ssItem( skaf55( X ) ) ],
% 0.45/1.05 [ ssItem( skaf54( X ) ) ],
% 0.45/1.05 [ ssList( skaf53( X ) ) ],
% 0.45/1.05 [ ssList( skaf52( X ) ) ],
% 0.45/1.05 [ ssList( skaf51( X ) ) ],
% 0.45/1.05 [ ssItem( skaf50( X ) ) ],
% 0.45/1.05 [ ssItem( skaf49( X ) ) ],
% 0.45/1.05 [ ssItem( skaf44( X ) ) ],
% 0.45/1.05 [ ssList( skaf48( X, Y ) ) ],
% 0.45/1.05 [ ssList( skaf47( X, Y ) ) ],
% 0.45/1.05 [ ssList( skaf46( X, Y ) ) ],
% 0.45/1.05 [ ssList( skaf45( X, Y ) ) ],
% 0.45/1.05 [ ssList( skaf43( X, Y ) ) ],
% 0.45/1.05 [ ssList( skaf42( X, Y ) ) ],
% 0.45/1.05 [ ~( =( skac3, skac2 ) ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), geq( X, X ) ],
% 0.45/1.05 [ ~( ssList( X ) ), segmentP( X, nil ) ],
% 0.45/1.05 [ ~( ssList( X ) ), segmentP( X, X ) ],
% 0.45/1.05 [ ~( ssList( X ) ), rearsegP( X, nil ) ],
% 0.45/1.05 [ ~( ssList( X ) ), rearsegP( X, X ) ],
% 0.45/1.05 [ ~( ssList( X ) ), frontsegP( X, nil ) ],
% 0.45/1.05 [ ~( ssList( X ) ), frontsegP( X, X ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), leq( X, X ) ],
% 0.45/1.05 [ ~( lt( X, X ) ), ~( ssItem( X ) ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), equalelemsP( cons( X, nil ) ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), strictorderedP( cons( X, nil ) ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), totalorderedP( cons( X, nil ) ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), strictorderP( cons( X, nil ) ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), totalorderP( cons( X, nil ) ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), cyclefreeP( cons( X, nil ) ) ],
% 0.45/1.05 [ ~( memberP( nil, X ) ), ~( ssItem( X ) ) ],
% 0.45/1.05 [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ],
% 0.45/1.05 [ ~( ssList( X ) ), =( app( X, nil ), X ) ],
% 0.45/1.05 [ ~( ssList( X ) ), =( app( nil, X ), X ) ],
% 0.45/1.05 [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ],
% 0.45/1.05 [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ],
% 0.45/1.05 [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ],
% 0.45/1.05 [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ],
% 0.45/1.05 [ ~( =( nil, X ) ), ~( ssList( X ) ), segmentP( nil, X ) ],
% 0.45/1.05 [ ~( segmentP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.45/1.05 [ ~( =( nil, X ) ), ~( ssList( X ) ), rearsegP( nil, X ) ],
% 0.45/1.05 [ ~( rearsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.45/1.05 [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X ) ],
% 0.45/1.05 [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.45/1.05 [ ~( ssList( X ) ), ~( ssList( Y ) ), ssList( app( Y, X ) ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), ~( ssList( Y ) ), ssList( cons( X, Y ) ) ],
% 0.45/1.05 [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf50( X ), skaf49( X ) ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf49( X ), skaf50( X ) ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( =( skaf79( X ), skaf78( X ) ) ), ~( ssList( X ) ), equalelemsP( X )
% 0.45/1.05 ],
% 0.45/1.05 [ ~( lt( skaf69( X ), skaf70( X ) ) ), ~( ssList( X ) ), strictorderedP(
% 0.45/1.05 X ) ],
% 0.45/1.05 [ ~( leq( skaf64( X ), skaf65( X ) ) ), ~( ssList( X ) ), totalorderedP(
% 0.45/1.05 X ) ],
% 0.45/1.05 [ ~( lt( skaf60( X ), skaf59( X ) ) ), ~( ssList( X ) ), strictorderP( X
% 0.45/1.05 ) ],
% 0.45/1.05 [ ~( lt( skaf59( X ), skaf60( X ) ) ), ~( ssList( X ) ), strictorderP( X
% 0.45/1.05 ) ],
% 0.45/1.05 [ ~( leq( skaf55( X ), skaf54( X ) ) ), ~( ssList( X ) ), totalorderP( X
% 0.45/1.05 ) ],
% 0.45/1.05 [ ~( leq( skaf54( X ), skaf55( X ) ) ), ~( ssList( X ) ), totalorderP( X
% 0.45/1.05 ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( tl( cons( X, Y ) ), Y ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( hd( cons( X, Y ) ), X ) ],
% 0.45/1.05 [ ~( =( cons( X, Y ), nil ) ), ~( ssItem( X ) ), ~( ssList( Y ) ) ],
% 0.45/1.05 [ ~( =( cons( X, Y ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y ) ) ],
% 0.45/1.05 [ ~( ssList( X ) ), ~( ssList( Y ) ), neq( Y, X ), =( Y, X ) ],
% 0.45/1.05 [ ~( singletonP( X ) ), ~( ssList( X ) ), =( cons( skaf44( X ), nil ), X
% 0.45/1.05 ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X ) ],
% 0.45/1.05 [ ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( X, Y ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( ssList( X ) ), =( cons( hd( X ), tl( X ) ), X ), =( nil, X ) ],
% 0.45/1.05 [ ~( gt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( Y, X ) ],
% 0.45/1.05 [ ~( lt( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), gt( Y, X ) ],
% 0.45/1.05 [ ~( geq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( Y, X ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( leq( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), geq( Y, X ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( ssList( X ) ), =( cons( skaf83( X ), skaf82( X ) ), X ), =( nil, X
% 0.45/1.05 ) ],
% 0.45/1.05 [ ~( gt( X, Y ) ), ~( gt( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( =( X, Y ) ), ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), strictorderedP(
% 0.45/1.05 cons( Y, X ) ) ],
% 0.45/1.05 [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), totalorderedP(
% 0.45/1.05 cons( Y, X ) ) ],
% 0.45/1.05 [ ~( lt( X, Y ) ), ~( lt( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y ) ),
% 0.45/1.05 singletonP( Y ) ],
% 0.45/1.05 [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( nil
% 0.45/1.05 , X ) ],
% 0.45/1.05 [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( nil
% 0.45/1.05 , Y ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( app( cons( X, nil ), Y ), cons(
% 0.45/1.05 X, Y ) ) ],
% 0.45/1.05 [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Y ), =( X
% 0.45/1.05 , Y ) ],
% 0.45/1.05 [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Y ), =( X
% 0.45/1.05 , Y ) ],
% 0.45/1.05 [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( hd( app( Y, X ) )
% 0.45/1.05 , hd( Y ) ) ],
% 0.45/1.05 [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X )
% 0.45/1.05 ), strictorderedP( Y ), =( nil, Y ) ],
% 0.45/1.05 [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X ) )
% 0.45/1.05 , totalorderedP( Y ), =( nil, Y ) ],
% 0.45/1.05 [ ~( geq( X, Y ) ), ~( geq( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) )
% 0.45/1.05 , =( Y, X ) ],
% 0.45/1.05 [ ~( segmentP( X, Y ) ), ~( segmentP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.45/1.05 ssList( Y ) ), =( Y, X ) ],
% 0.45/1.05 [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.45/1.05 ssList( Y ) ), =( Y, X ) ],
% 0.45/1.05 [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.45/1.05 ssList( Y ) ), =( Y, X ) ],
% 0.45/1.05 [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) )
% 0.45/1.05 , =( Y, X ) ],
% 0.45/1.05 [ ~( rearsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app(
% 0.45/1.05 skaf46( X, Y ), Y ), X ) ],
% 0.45/1.05 [ ~( frontsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app( Y
% 0.45/1.05 , skaf45( X, Y ) ), X ) ],
% 0.45/1.05 [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( tl( app( Y, X ) )
% 0.45/1.05 , app( tl( Y ), X ) ) ],
% 0.45/1.05 [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X )
% 0.45/1.05 ), lt( X, hd( Y ) ), =( nil, Y ) ],
% 0.45/1.05 [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X ) )
% 0.45/1.05 , leq( X, hd( Y ) ), =( nil, Y ) ],
% 0.45/1.05 [ ~( rearsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ), ~( ssList(
% 0.45/1.05 X ) ), rearsegP( app( Z, X ), Y ) ],
% 0.45/1.05 [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ), ~( ssList(
% 0.45/1.05 X ) ), frontsegP( app( X, Z ), Y ) ],
% 0.45/1.05 [ ~( =( X, Y ) ), ~( ssList( Z ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ),
% 0.45/1.05 memberP( cons( Y, Z ), X ) ],
% 0.45/1.05 [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y
% 0.45/1.05 ) ), memberP( cons( Z, X ), Y ) ],
% 0.45/1.05 [ ~( memberP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y
% 0.45/1.05 ) ), memberP( app( X, Z ), Y ) ],
% 0.45/1.05 [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssList( Z ) ), ~( ssItem( Y
% 0.45/1.05 ) ), memberP( app( Z, X ), Y ) ],
% 0.45/1.05 [ ~( ssList( X ) ), equalelemsP( X ), =( app( skaf80( X ), cons( skaf78(
% 0.45/1.05 X ), cons( skaf79( X ), skaf81( X ) ) ) ), X ) ],
% 0.45/1.05 [ ~( =( app( X, Y ), Z ) ), ~( ssList( X ) ), ~( ssList( Y ) ), ~(
% 0.45/1.05 ssList( Z ) ), rearsegP( Z, Y ) ],
% 0.45/1.05 [ ~( =( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), ~(
% 0.45/1.05 ssList( Z ) ), frontsegP( Z, X ) ],
% 0.45/1.05 [ ~( =( nil, X ) ), ~( =( nil, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.45/1.05 , =( app( X, Y ), nil ) ],
% 0.45/1.05 [ ~( gt( X, Y ) ), ~( gt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ),
% 0.45/1.05 ~( ssItem( X ) ), gt( X, Z ) ],
% 0.45/1.05 [ ~( leq( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.45/1.05 , ~( ssItem( X ) ), lt( X, Z ) ],
% 0.45/1.05 [ ~( geq( X, Y ) ), ~( geq( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.45/1.05 , ~( ssItem( X ) ), geq( X, Z ) ],
% 0.45/1.05 [ ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =( app( app( Z,
% 0.45/1.05 Y ), X ), app( Z, app( Y, X ) ) ) ],
% 0.45/1.05 [ ~( =( app( X, Y ), app( X, Z ) ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.45/1.05 , ~( ssList( Z ) ), =( Y, Z ) ],
% 0.45/1.05 [ ~( =( app( X, Y ), app( Z, Y ) ) ), ~( ssList( X ) ), ~( ssList( Y ) )
% 0.45/1.05 , ~( ssList( Z ) ), =( X, Z ) ],
% 0.45/1.05 [ ~( segmentP( X, Y ) ), ~( segmentP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.45/1.05 ssList( Y ) ), ~( ssList( X ) ), segmentP( X, Z ) ],
% 0.45/1.05 [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.45/1.05 ssList( Y ) ), ~( ssList( X ) ), rearsegP( X, Z ) ],
% 0.45/1.05 [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.45/1.05 ssList( Y ) ), ~( ssList( X ) ), frontsegP( X, Z ) ],
% 0.45/1.05 [ ~( lt( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ),
% 0.45/1.05 ~( ssItem( X ) ), lt( X, Z ) ],
% 0.45/1.05 [ ~( leq( X, Y ) ), ~( leq( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.45/1.05 , ~( ssItem( X ) ), leq( X, Z ) ],
% 0.45/1.05 [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =( cons( X, app(
% 0.45/1.05 Y, Z ) ), app( cons( X, Y ), Z ) ) ],
% 0.45/1.05 [ ~( memberP( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ),
% 0.45/1.05 ~( ssItem( Z ) ), memberP( Y, Z ), memberP( X, Z ) ],
% 0.45/1.05 [ ~( leq( X, hd( Y ) ) ), ~( totalorderedP( Y ) ), ~( ssList( Y ) ), ~(
% 0.45/1.05 ssItem( X ) ), totalorderedP( cons( X, Y ) ), =( nil, Y ) ],
% 0.45/1.05 [ ~( lt( X, hd( Y ) ) ), ~( strictorderedP( Y ) ), ~( ssList( Y ) ), ~(
% 0.45/1.05 ssItem( X ) ), strictorderedP( cons( X, Y ) ), =( nil, Y ) ],
% 0.45/1.05 [ ~( memberP( cons( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssItem( X ) ),
% 0.45/1.05 ~( ssItem( Z ) ), memberP( Y, Z ), =( Z, X ) ],
% 0.45/1.05 [ ~( ssList( X ) ), duplicatefreeP( X ), =( app( app( skaf75( X ), cons(
% 0.45/1.05 skaf74( X ), skaf76( X ) ) ), cons( skaf74( X ), skaf77( X ) ) ), X ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( ssList( X ) ), strictorderedP( X ), =( app( app( skaf71( X ), cons(
% 0.45/1.05 skaf69( X ), skaf72( X ) ) ), cons( skaf70( X ), skaf73( X ) ) ), X ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( ssList( X ) ), totalorderedP( X ), =( app( app( skaf66( X ), cons(
% 0.45/1.05 skaf64( X ), skaf67( X ) ) ), cons( skaf65( X ), skaf68( X ) ) ), X ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( ssList( X ) ), strictorderP( X ), =( app( app( skaf61( X ), cons(
% 0.45/1.05 skaf59( X ), skaf62( X ) ) ), cons( skaf60( X ), skaf63( X ) ) ), X ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( ssList( X ) ), totalorderP( X ), =( app( app( skaf56( X ), cons(
% 0.45/1.05 skaf54( X ), skaf57( X ) ) ), cons( skaf55( X ), skaf58( X ) ) ), X ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( ssList( X ) ), cyclefreeP( X ), =( app( app( skaf51( X ), cons(
% 0.45/1.05 skaf49( X ), skaf52( X ) ) ), cons( skaf50( X ), skaf53( X ) ) ), X ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( segmentP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app( app(
% 0.45/1.05 skaf47( X, Y ), Y ), skaf48( Y, X ) ), X ) ],
% 0.45/1.05 [ ~( memberP( X, Y ) ), ~( ssItem( Y ) ), ~( ssList( X ) ), =( app(
% 0.45/1.05 skaf42( X, Y ), cons( Y, skaf43( Y, X ) ) ), X ) ],
% 0.45/1.05 [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ), ~( ssItem( X )
% 0.45/1.05 ), ~( ssList( T ) ), ~( ssList( Y ) ), =( X, Z ) ],
% 0.45/1.05 [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ), ~( ssItem( X )
% 0.45/1.05 ), ~( ssList( T ) ), ~( ssList( Y ) ), =( T, Y ) ],
% 0.45/1.05 [ ~( segmentP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( T ) ), ~( ssList(
% 0.45/1.05 Y ) ), ~( ssList( X ) ), segmentP( app( app( T, X ), Z ), Y ) ],
% 0.45/1.05 [ ~( =( app( app( X, Y ), Z ), T ) ), ~( ssList( Z ) ), ~( ssList( X ) )
% 0.45/1.05 , ~( ssList( Y ) ), ~( ssList( T ) ), segmentP( T, Y ) ],
% 0.45/1.05 [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T ) ), ~(
% 0.45/1.05 ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), frontsegP( Y, T ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( =( app( X, cons( Y, Z ) ), T ) ), ~( ssList( Z ) ), ~( ssList( X )
% 0.45/1.05 ), ~( ssItem( Y ) ), ~( ssList( T ) ), memberP( T, Y ) ],
% 0.45/1.05 [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T ) ), ~(
% 0.45/1.05 ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), =( X, Z ) ],
% 0.45/1.05 [ ~( =( tl( X ), tl( Y ) ) ), ~( =( hd( X ), hd( Y ) ) ), ~( ssList( X )
% 0.45/1.05 ), ~( ssList( Y ) ), =( nil, Y ), =( X, Y ), =( nil, X ) ],
% 0.45/1.05 [ ~( frontsegP( X, Y ) ), ~( =( Z, T ) ), ~( ssList( Y ) ), ~( ssList( X
% 0.45/1.05 ) ), ~( ssItem( T ) ), ~( ssItem( Z ) ), frontsegP( cons( Z, X ), cons(
% 0.45/1.05 T, Y ) ) ],
% 0.45/1.05 [ ~( =( app( app( X, cons( Y, Z ) ), cons( Y, T ) ), U ) ), ~( ssList( T
% 0.45/1.05 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), ~(
% 0.45/1.05 duplicatefreeP( U ) ), ~( ssList( U ) ) ],
% 0.45/1.05 [ ~( =( app( X, cons( Y, cons( Z, T ) ) ), U ) ), ~( ssList( T ) ), ~(
% 0.45/1.05 ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ), ~( equalelemsP( U ) )
% 0.45/1.05 , ~( ssList( U ) ), =( Y, Z ) ],
% 0.45/1.05 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.45/1.05 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.45/1.05 ) ), ~( strictorderedP( W ) ), ~( ssList( W ) ), lt( Y, T ) ],
% 0.45/1.05 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.45/1.05 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.45/1.05 ) ), ~( totalorderedP( W ) ), ~( ssList( W ) ), leq( Y, T ) ],
% 0.45/1.05 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.45/1.05 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.45/1.05 ) ), ~( strictorderP( W ) ), ~( ssList( W ) ), lt( Y, T ), lt( T, Y ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.45/1.05 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.45/1.05 ) ), ~( totalorderP( W ) ), ~( ssList( W ) ), leq( Y, T ), leq( T, Y ) ]
% 0.45/1.05 ,
% 0.45/1.05 [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( =( app( app( Z, cons( X, T ) )
% 0.45/1.05 , cons( Y, U ) ), W ) ), ~( ssList( U ) ), ~( ssList( T ) ), ~( ssList( Z
% 0.45/1.05 ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), ~( cyclefreeP( W ) ), ~( ssList(
% 0.45/1.05 W ) ) ],
% 0.45/1.05 [ ssList( sk1 ) ],
% 0.45/1.05 [ ssList( sk2 ) ],
% 0.45/1.05 [ ssList( sk3 ) ],
% 0.45/1.05 [ ssList( sk4 ) ],
% 0.45/1.05 [ =( sk2, sk4 ) ],
% 0.45/1.05 [ =( sk1, sk3 ) ],
% 0.45/1.05 [ neq( sk2, nil ), neq( sk2, nil ) ],
% 0.45/1.05 [ neq( sk2, nil ), ~( neq( sk4, nil ) ) ],
% 0.45/1.05 [ ssItem( sk5 ), neq( sk2, nil ) ],
% 0.45/1.05 [ ssList( sk6 ), neq( sk2, nil ) ],
% 0.45/1.05 [ =( cons( sk5, nil ), sk3 ), neq( sk2, nil ) ],
% 0.45/1.05 [ =( app( sk6, cons( sk5, nil ) ), sk4 ), neq( sk2, nil ) ],
% 0.45/1.05 [ ~( singletonP( sk1 ) ), neq( sk2, nil ) ],
% 0.45/1.05 [ ssItem( sk5 ), ~( neq( sk4, nil ) ) ],
% 0.45/1.05 [ ssList( sk6 ), ~( neq( sk4, nil ) ) ],
% 0.45/1.05 [ =( cons( sk5, nil ), sk3 ), ~( neq( sk4, nil ) ) ],
% 0.45/1.06 [ =( app( sk6, cons( sk5, nil ) ), sk4 ), ~( neq( sk4, nil ) ) ],
% 0.45/1.06 [ ~( singletonP( sk1 ) ), ~( neq( sk4, nil ) ) ]
% 0.45/1.06 ] .
% 0.45/1.06
% 0.45/1.06
% 0.45/1.06 percentage equality = 0.160454, percentage horn = 0.832487
% 0.45/1.06 This is a problem with some equality
% 0.45/1.06
% 0.45/1.06
% 0.45/1.06
% 0.45/1.06 Options Used:
% 0.45/1.06
% 0.45/1.06 useres = 1
% 0.45/1.06 useparamod = 1
% 0.45/1.06 useeqrefl = 1
% 0.45/1.06 useeqfact = 1
% 0.45/1.06 usefactor = 1
% 0.45/1.06 usesimpsplitting = 0
% 0.45/1.06 usesimpdemod = 5
% 0.45/1.06 usesimpres = 3
% 0.45/1.06
% 0.45/1.06 resimpinuse = 1000
% 0.45/1.06 resimpclauses = 20000
% 0.45/1.06 substype = eqrewr
% 0.45/1.06 backwardsubs = 1
% 0.45/1.06 selectoldest = 5
% 0.45/1.06
% 0.45/1.06 litorderings [0] = split
% 0.45/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.45/1.06
% 0.45/1.06 termordering = kbo
% 0.45/1.06
% 0.45/1.06 litapriori = 0
% 0.45/1.06 termapriori = 1
% 0.45/1.06 litaposteriori = 0
% 0.45/1.06 termaposteriori = 0
% 0.45/1.06 demodaposteriori = 0
% 0.45/1.06 ordereqreflfact = 0
% 0.45/1.06
% 0.45/1.06 litselect = negord
% 0.45/1.06
% 0.45/1.06 maxweight = 15
% 0.45/1.06 maxdepth = 30000
% 0.45/1.06 maxlength = 115
% 0.45/1.06 maxnrvars = 195
% 0.45/1.06 excuselevel = 1
% 0.45/1.06 increasemaxweight = 1
% 0.45/1.06
% 0.45/1.06 maxselected = 10000000
% 0.89/1.24 maxnrclauses = 10000000
% 0.89/1.24
% 0.89/1.24 showgenerated = 0
% 0.89/1.24 showkept = 0
% 0.89/1.24 showselected = 0
% 0.89/1.24 showdeleted = 0
% 0.89/1.24 showresimp = 1
% 0.89/1.24 showstatus = 2000
% 0.89/1.24
% 0.89/1.24 prologoutput = 1
% 0.89/1.24 nrgoals = 5000000
% 0.89/1.24 totalproof = 1
% 0.89/1.24
% 0.89/1.24 Symbols occurring in the translation:
% 0.89/1.24
% 0.89/1.24 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.89/1.24 . [1, 2] (w:1, o:77, a:1, s:1, b:0),
% 0.89/1.24 ! [4, 1] (w:0, o:24, a:1, s:1, b:0),
% 0.89/1.24 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.89/1.24 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.89/1.24 nil [39, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.89/1.24 equalelemsP [40, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.89/1.24 duplicatefreeP [41, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.89/1.24 strictorderedP [42, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.89/1.24 totalorderedP [43, 1] (w:1, o:73, a:1, s:1, b:0),
% 0.89/1.24 strictorderP [44, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.89/1.24 totalorderP [45, 1] (w:1, o:74, a:1, s:1, b:0),
% 0.89/1.24 cyclefreeP [46, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.89/1.24 ssList [47, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.89/1.24 skac3 [48, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.89/1.24 ssItem [49, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.89/1.24 skac2 [50, 0] (w:1, o:5, a:1, s:1, b:0),
% 0.89/1.24 singletonP [51, 1] (w:1, o:36, a:1, s:1, b:0),
% 0.89/1.24 skaf83 [53, 1] (w:1, o:72, a:1, s:1, b:0),
% 0.89/1.24 skaf82 [54, 1] (w:1, o:71, a:1, s:1, b:0),
% 0.89/1.24 skaf81 [55, 1] (w:1, o:70, a:1, s:1, b:0),
% 0.89/1.24 skaf80 [56, 1] (w:1, o:69, a:1, s:1, b:0),
% 0.89/1.24 skaf79 [57, 1] (w:1, o:68, a:1, s:1, b:0),
% 0.89/1.24 skaf78 [58, 1] (w:1, o:67, a:1, s:1, b:0),
% 0.89/1.24 skaf77 [59, 1] (w:1, o:66, a:1, s:1, b:0),
% 0.89/1.24 skaf76 [60, 1] (w:1, o:65, a:1, s:1, b:0),
% 0.89/1.24 skaf75 [61, 1] (w:1, o:64, a:1, s:1, b:0),
% 0.89/1.24 skaf74 [62, 1] (w:1, o:63, a:1, s:1, b:0),
% 0.89/1.24 skaf73 [63, 1] (w:1, o:62, a:1, s:1, b:0),
% 0.89/1.24 skaf72 [64, 1] (w:1, o:61, a:1, s:1, b:0),
% 0.89/1.24 skaf71 [65, 1] (w:1, o:60, a:1, s:1, b:0),
% 0.89/1.24 skaf70 [66, 1] (w:1, o:59, a:1, s:1, b:0),
% 0.89/1.24 skaf69 [67, 1] (w:1, o:58, a:1, s:1, b:0),
% 0.89/1.24 skaf68 [68, 1] (w:1, o:57, a:1, s:1, b:0),
% 0.89/1.24 skaf67 [69, 1] (w:1, o:56, a:1, s:1, b:0),
% 0.89/1.24 skaf66 [70, 1] (w:1, o:55, a:1, s:1, b:0),
% 0.89/1.24 skaf65 [71, 1] (w:1, o:54, a:1, s:1, b:0),
% 0.89/1.24 skaf64 [72, 1] (w:1, o:53, a:1, s:1, b:0),
% 0.89/1.24 skaf63 [73, 1] (w:1, o:52, a:1, s:1, b:0),
% 0.89/1.24 skaf62 [74, 1] (w:1, o:51, a:1, s:1, b:0),
% 0.89/1.24 skaf61 [75, 1] (w:1, o:50, a:1, s:1, b:0),
% 0.89/1.24 skaf60 [76, 1] (w:1, o:49, a:1, s:1, b:0),
% 0.89/1.24 skaf59 [77, 1] (w:1, o:48, a:1, s:1, b:0),
% 0.89/1.24 skaf58 [78, 1] (w:1, o:47, a:1, s:1, b:0),
% 0.89/1.24 skaf57 [79, 1] (w:1, o:46, a:1, s:1, b:0),
% 0.89/1.24 skaf56 [80, 1] (w:1, o:45, a:1, s:1, b:0),
% 0.89/1.24 skaf55 [81, 1] (w:1, o:44, a:1, s:1, b:0),
% 0.89/1.24 skaf54 [82, 1] (w:1, o:43, a:1, s:1, b:0),
% 0.89/1.24 skaf53 [83, 1] (w:1, o:42, a:1, s:1, b:0),
% 0.89/1.24 skaf52 [84, 1] (w:1, o:41, a:1, s:1, b:0),
% 0.89/1.24 skaf51 [85, 1] (w:1, o:40, a:1, s:1, b:0),
% 0.89/1.24 skaf50 [86, 1] (w:1, o:39, a:1, s:1, b:0),
% 0.89/1.24 skaf49 [87, 1] (w:1, o:37, a:1, s:1, b:0),
% 0.89/1.24 skaf44 [88, 1] (w:1, o:38, a:1, s:1, b:0),
% 0.89/1.24 skaf48 [90, 2] (w:1, o:106, a:1, s:1, b:0),
% 0.89/1.24 skaf47 [91, 2] (w:1, o:105, a:1, s:1, b:0),
% 0.89/1.24 skaf46 [92, 2] (w:1, o:104, a:1, s:1, b:0),
% 0.89/1.24 skaf45 [93, 2] (w:1, o:103, a:1, s:1, b:0),
% 0.89/1.24 skaf43 [94, 2] (w:1, o:108, a:1, s:1, b:0),
% 0.89/1.24 skaf42 [95, 2] (w:1, o:107, a:1, s:1, b:0),
% 0.89/1.24 geq [96, 2] (w:1, o:110, a:1, s:1, b:0),
% 0.89/1.24 segmentP [97, 2] (w:1, o:111, a:1, s:1, b:0),
% 0.89/1.24 rearsegP [98, 2] (w:1, o:102, a:1, s:1, b:0),
% 0.89/1.24 frontsegP [99, 2] (w:1, o:109, a:1, s:1, b:0),
% 0.89/1.24 leq [100, 2] (w:1, o:112, a:1, s:1, b:0),
% 0.89/1.24 lt [101, 2] (w:1, o:113, a:1, s:1, b:0),
% 0.89/1.24 cons [102, 2] (w:1, o:114, a:1, s:1, b:0),
% 0.89/1.24 memberP [103, 2] (w:1, o:115, a:1, s:1, b:0),
% 0.89/1.24 app [104, 2] (w:1, o:116, a:1, s:1, b:0),
% 0.89/1.24 tl [105, 1] (w:1, o:75, a:1, s:1, b:0),
% 0.89/1.24 hd [106, 1] (w:1, o:76, a:1, s:1, b:0),
% 0.89/1.24 neq [107, 2] (w:1, o:117, a:1, s:1, b:0),
% 0.89/1.24 gt [108, 2] (w:1, o:118, a:1, s:1, b:0),
% 0.89/1.24 sk1 [113, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.89/1.24 sk2 [114, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.89/1.24 sk3 [115, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.89/1.24 sk4 [116, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.89/1.24 sk5 [117, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.89/1.24 sk6 [118, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.89/1.24
% 0.89/1.24
% 0.89/1.24 Starting Search:
% 0.89/1.24
% 0.89/1.24 Resimplifying inuse:
% 0.89/1.24 Done
% 0.89/1.24
% 0.89/1.24
% 0.89/1.24 Intermediate Status:
% 0.89/1.24 Generated: 4089
% 0.89/1.24 Kept: 2053
% 0.89/1.24 Inuse: 209
% 0.89/1.24 Deleted: 2
% 0.89/1.24 Deletedinuse: 0
% 0.89/1.24
% 0.89/1.24 Resimplifying inuse:
% 0.89/1.24 Done
% 0.89/1.24
% 0.89/1.24 Resimplifying inuse:
% 0.89/1.24 Done
% 0.89/1.24
% 0.89/1.24
% 0.89/1.24 Intermediate Status:
% 0.89/1.24 Generated: 9090
% 0.89/1.24 Kept: 4717
% 0.89/1.24 Inuse: 294
% 0.89/1.24 Deleted: 2
% 0.89/1.24 Deletedinuse: 0
% 0.89/1.24
% 0.89/1.24 Resimplifying inuse:
% 0.89/1.24 Done
% 0.89/1.24
% 0.89/1.24 Resimplifying inuse:
% 0.89/1.24 Done
% 0.89/1.24
% 0.89/1.24
% 0.89/1.24 Bliksems!, er is een bewijs:
% 0.89/1.24 % SZS status Unsatisfiable
% 0.89/1.24 % SZS output start Refutation
% 0.89/1.24
% 0.89/1.24 clause( 113, [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y
% 0.89/1.24 ) ), singletonP( Y ) ] )
% 0.89/1.24 .
% 0.89/1.24 clause( 182, [ ssList( sk1 ) ] )
% 0.89/1.24 .
% 0.89/1.24 clause( 186, [ =( sk4, sk2 ) ] )
% 0.89/1.24 .
% 0.89/1.24 clause( 187, [ =( sk3, sk1 ) ] )
% 0.89/1.24 .
% 0.89/1.24 clause( 188, [ neq( sk2, nil ) ] )
% 0.89/1.24 .
% 0.89/1.24 clause( 189, [ ssItem( sk5 ) ] )
% 0.89/1.24 .
% 0.89/1.24 clause( 191, [ =( cons( sk5, nil ), sk1 ) ] )
% 0.89/1.24 .
% 0.89/1.24 clause( 193, [ ~( singletonP( sk1 ) ) ] )
% 0.89/1.24 .
% 0.89/1.24 clause( 6199, [ ~( ssList( X ) ), singletonP( X ), ~( =( sk1, X ) ) ] )
% 0.89/1.24 .
% 0.89/1.24 clause( 6230, [ singletonP( sk1 ) ] )
% 0.89/1.24 .
% 0.89/1.24 clause( 6258, [] )
% 0.89/1.24 .
% 0.89/1.24
% 0.89/1.24
% 0.89/1.24 % SZS output end Refutation
% 0.89/1.24 found a proof!
% 0.89/1.24
% 0.89/1.24 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.89/1.24
% 0.89/1.24 initialclauses(
% 0.89/1.24 [ clause( 6260, [ equalelemsP( nil ) ] )
% 0.89/1.24 , clause( 6261, [ duplicatefreeP( nil ) ] )
% 0.89/1.24 , clause( 6262, [ strictorderedP( nil ) ] )
% 0.89/1.24 , clause( 6263, [ totalorderedP( nil ) ] )
% 0.89/1.24 , clause( 6264, [ strictorderP( nil ) ] )
% 0.89/1.24 , clause( 6265, [ totalorderP( nil ) ] )
% 0.89/1.24 , clause( 6266, [ cyclefreeP( nil ) ] )
% 0.89/1.24 , clause( 6267, [ ssList( nil ) ] )
% 0.89/1.24 , clause( 6268, [ ssItem( skac3 ) ] )
% 0.89/1.24 , clause( 6269, [ ssItem( skac2 ) ] )
% 0.89/1.24 , clause( 6270, [ ~( singletonP( nil ) ) ] )
% 0.89/1.24 , clause( 6271, [ ssItem( skaf83( X ) ) ] )
% 0.89/1.24 , clause( 6272, [ ssList( skaf82( X ) ) ] )
% 0.89/1.24 , clause( 6273, [ ssList( skaf81( X ) ) ] )
% 0.89/1.24 , clause( 6274, [ ssList( skaf80( X ) ) ] )
% 0.89/1.24 , clause( 6275, [ ssItem( skaf79( X ) ) ] )
% 0.89/1.24 , clause( 6276, [ ssItem( skaf78( X ) ) ] )
% 0.89/1.24 , clause( 6277, [ ssList( skaf77( X ) ) ] )
% 0.89/1.24 , clause( 6278, [ ssList( skaf76( X ) ) ] )
% 0.89/1.24 , clause( 6279, [ ssList( skaf75( X ) ) ] )
% 0.89/1.24 , clause( 6280, [ ssItem( skaf74( X ) ) ] )
% 0.89/1.24 , clause( 6281, [ ssList( skaf73( X ) ) ] )
% 0.89/1.24 , clause( 6282, [ ssList( skaf72( X ) ) ] )
% 0.89/1.24 , clause( 6283, [ ssList( skaf71( X ) ) ] )
% 0.89/1.24 , clause( 6284, [ ssItem( skaf70( X ) ) ] )
% 0.89/1.24 , clause( 6285, [ ssItem( skaf69( X ) ) ] )
% 0.89/1.24 , clause( 6286, [ ssList( skaf68( X ) ) ] )
% 0.89/1.24 , clause( 6287, [ ssList( skaf67( X ) ) ] )
% 0.89/1.24 , clause( 6288, [ ssList( skaf66( X ) ) ] )
% 0.89/1.24 , clause( 6289, [ ssItem( skaf65( X ) ) ] )
% 0.89/1.24 , clause( 6290, [ ssItem( skaf64( X ) ) ] )
% 0.89/1.24 , clause( 6291, [ ssList( skaf63( X ) ) ] )
% 0.89/1.24 , clause( 6292, [ ssList( skaf62( X ) ) ] )
% 0.89/1.24 , clause( 6293, [ ssList( skaf61( X ) ) ] )
% 0.89/1.24 , clause( 6294, [ ssItem( skaf60( X ) ) ] )
% 0.89/1.24 , clause( 6295, [ ssItem( skaf59( X ) ) ] )
% 0.89/1.24 , clause( 6296, [ ssList( skaf58( X ) ) ] )
% 0.89/1.24 , clause( 6297, [ ssList( skaf57( X ) ) ] )
% 0.89/1.24 , clause( 6298, [ ssList( skaf56( X ) ) ] )
% 0.89/1.24 , clause( 6299, [ ssItem( skaf55( X ) ) ] )
% 0.89/1.24 , clause( 6300, [ ssItem( skaf54( X ) ) ] )
% 0.89/1.24 , clause( 6301, [ ssList( skaf53( X ) ) ] )
% 0.89/1.24 , clause( 6302, [ ssList( skaf52( X ) ) ] )
% 0.89/1.24 , clause( 6303, [ ssList( skaf51( X ) ) ] )
% 0.89/1.24 , clause( 6304, [ ssItem( skaf50( X ) ) ] )
% 0.89/1.24 , clause( 6305, [ ssItem( skaf49( X ) ) ] )
% 0.89/1.24 , clause( 6306, [ ssItem( skaf44( X ) ) ] )
% 0.89/1.24 , clause( 6307, [ ssList( skaf48( X, Y ) ) ] )
% 0.89/1.24 , clause( 6308, [ ssList( skaf47( X, Y ) ) ] )
% 0.89/1.24 , clause( 6309, [ ssList( skaf46( X, Y ) ) ] )
% 0.89/1.24 , clause( 6310, [ ssList( skaf45( X, Y ) ) ] )
% 0.89/1.24 , clause( 6311, [ ssList( skaf43( X, Y ) ) ] )
% 0.89/1.24 , clause( 6312, [ ssList( skaf42( X, Y ) ) ] )
% 0.89/1.24 , clause( 6313, [ ~( =( skac3, skac2 ) ) ] )
% 0.89/1.24 , clause( 6314, [ ~( ssItem( X ) ), geq( X, X ) ] )
% 0.89/1.24 , clause( 6315, [ ~( ssList( X ) ), segmentP( X, nil ) ] )
% 0.89/1.24 , clause( 6316, [ ~( ssList( X ) ), segmentP( X, X ) ] )
% 0.89/1.24 , clause( 6317, [ ~( ssList( X ) ), rearsegP( X, nil ) ] )
% 0.89/1.24 , clause( 6318, [ ~( ssList( X ) ), rearsegP( X, X ) ] )
% 0.89/1.24 , clause( 6319, [ ~( ssList( X ) ), frontsegP( X, nil ) ] )
% 0.89/1.24 , clause( 6320, [ ~( ssList( X ) ), frontsegP( X, X ) ] )
% 0.89/1.24 , clause( 6321, [ ~( ssItem( X ) ), leq( X, X ) ] )
% 0.89/1.24 , clause( 6322, [ ~( lt( X, X ) ), ~( ssItem( X ) ) ] )
% 0.89/1.24 , clause( 6323, [ ~( ssItem( X ) ), equalelemsP( cons( X, nil ) ) ] )
% 0.89/1.24 , clause( 6324, [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ] )
% 0.89/1.24 , clause( 6325, [ ~( ssItem( X ) ), strictorderedP( cons( X, nil ) ) ] )
% 0.89/1.24 , clause( 6326, [ ~( ssItem( X ) ), totalorderedP( cons( X, nil ) ) ] )
% 0.89/1.24 , clause( 6327, [ ~( ssItem( X ) ), strictorderP( cons( X, nil ) ) ] )
% 0.89/1.24 , clause( 6328, [ ~( ssItem( X ) ), totalorderP( cons( X, nil ) ) ] )
% 0.89/1.24 , clause( 6329, [ ~( ssItem( X ) ), cyclefreeP( cons( X, nil ) ) ] )
% 0.89/1.24 , clause( 6330, [ ~( memberP( nil, X ) ), ~( ssItem( X ) ) ] )
% 0.89/1.24 , clause( 6331, [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ] )
% 0.89/1.24 , clause( 6332, [ ~( ssList( X ) ), =( app( X, nil ), X ) ] )
% 0.89/1.24 , clause( 6333, [ ~( ssList( X ) ), =( app( nil, X ), X ) ] )
% 0.89/1.24 , clause( 6334, [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ] )
% 0.89/1.24 , clause( 6335, [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ] )
% 0.89/1.24 , clause( 6336, [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ] )
% 0.89/1.24 , clause( 6337, [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ] )
% 0.89/1.24 , clause( 6338, [ ~( =( nil, X ) ), ~( ssList( X ) ), segmentP( nil, X ) ]
% 0.89/1.24 )
% 0.89/1.24 , clause( 6339, [ ~( segmentP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 0.89/1.24 )
% 0.89/1.24 , clause( 6340, [ ~( =( nil, X ) ), ~( ssList( X ) ), rearsegP( nil, X ) ]
% 0.89/1.24 )
% 0.89/1.24 , clause( 6341, [ ~( rearsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 0.89/1.24 )
% 0.89/1.24 , clause( 6342, [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X ) ]
% 0.89/1.24 )
% 0.89/1.24 , clause( 6343, [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 0.89/1.24 )
% 0.89/1.24 , clause( 6344, [ ~( ssList( X ) ), ~( ssList( Y ) ), ssList( app( Y, X ) )
% 0.89/1.24 ] )
% 0.89/1.24 , clause( 6345, [ ~( ssItem( X ) ), ~( ssList( Y ) ), ssList( cons( X, Y )
% 0.89/1.24 ) ] )
% 0.89/1.24 , clause( 6346, [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf50( X ),
% 0.89/1.24 skaf49( X ) ) ] )
% 0.89/1.24 , clause( 6347, [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf49( X ),
% 0.89/1.24 skaf50( X ) ) ] )
% 0.89/1.24 , clause( 6348, [ ~( =( skaf79( X ), skaf78( X ) ) ), ~( ssList( X ) ),
% 0.89/1.24 equalelemsP( X ) ] )
% 0.89/1.24 , clause( 6349, [ ~( lt( skaf69( X ), skaf70( X ) ) ), ~( ssList( X ) ),
% 0.89/1.24 strictorderedP( X ) ] )
% 0.89/1.24 , clause( 6350, [ ~( leq( skaf64( X ), skaf65( X ) ) ), ~( ssList( X ) ),
% 0.89/1.24 totalorderedP( X ) ] )
% 0.89/1.24 , clause( 6351, [ ~( lt( skaf60( X ), skaf59( X ) ) ), ~( ssList( X ) ),
% 0.89/1.24 strictorderP( X ) ] )
% 0.89/1.24 , clause( 6352, [ ~( lt( skaf59( X ), skaf60( X ) ) ), ~( ssList( X ) ),
% 0.89/1.24 strictorderP( X ) ] )
% 0.89/1.24 , clause( 6353, [ ~( leq( skaf55( X ), skaf54( X ) ) ), ~( ssList( X ) ),
% 0.89/1.24 totalorderP( X ) ] )
% 0.89/1.24 , clause( 6354, [ ~( leq( skaf54( X ), skaf55( X ) ) ), ~( ssList( X ) ),
% 0.89/1.24 totalorderP( X ) ] )
% 0.89/1.24 , clause( 6355, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( tl( cons( X, Y ) )
% 0.89/1.24 , Y ) ] )
% 0.89/1.24 , clause( 6356, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( hd( cons( X, Y ) )
% 0.89/1.24 , X ) ] )
% 0.89/1.24 , clause( 6357, [ ~( =( cons( X, Y ), nil ) ), ~( ssItem( X ) ), ~( ssList(
% 0.89/1.24 Y ) ) ] )
% 0.89/1.24 , clause( 6358, [ ~( =( cons( X, Y ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y
% 0.89/1.24 ) ) ] )
% 0.89/1.24 , clause( 6359, [ ~( ssList( X ) ), ~( ssList( Y ) ), neq( Y, X ), =( Y, X
% 0.89/1.24 ) ] )
% 0.89/1.24 , clause( 6360, [ ~( singletonP( X ) ), ~( ssList( X ) ), =( cons( skaf44(
% 0.89/1.24 X ), nil ), X ) ] )
% 0.89/1.24 , clause( 6361, [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X
% 0.89/1.24 ) ] )
% 0.89/1.24 , clause( 6362, [ ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq(
% 0.89/1.24 X, Y ) ] )
% 0.89/1.24 , clause( 6363, [ ~( ssList( X ) ), =( cons( hd( X ), tl( X ) ), X ), =(
% 0.89/1.24 nil, X ) ] )
% 0.89/1.24 , clause( 6364, [ ~( gt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 0.89/1.24 Y, X ) ] )
% 0.89/1.24 , clause( 6365, [ ~( lt( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), gt(
% 0.89/1.24 Y, X ) ] )
% 0.89/1.24 , clause( 6366, [ ~( geq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq(
% 0.89/1.24 Y, X ) ] )
% 0.89/1.24 , clause( 6367, [ ~( leq( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), geq(
% 0.89/1.24 Y, X ) ] )
% 0.89/1.24 , clause( 6368, [ ~( ssList( X ) ), =( cons( skaf83( X ), skaf82( X ) ), X
% 0.89/1.24 ), =( nil, X ) ] )
% 0.89/1.24 , clause( 6369, [ ~( gt( X, Y ) ), ~( gt( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.89/1.24 ssItem( Y ) ) ] )
% 0.89/1.24 , clause( 6370, [ ~( =( X, Y ) ), ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~(
% 0.89/1.24 ssItem( X ) ) ] )
% 0.89/1.24 , clause( 6371, [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 0.89/1.24 strictorderedP( cons( Y, X ) ) ] )
% 0.89/1.24 , clause( 6372, [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 0.89/1.24 totalorderedP( cons( Y, X ) ) ] )
% 0.89/1.24 , clause( 6373, [ ~( lt( X, Y ) ), ~( lt( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.89/1.24 ssItem( Y ) ) ] )
% 0.89/1.24 , clause( 6374, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssList( Y ) ), ~(
% 0.89/1.24 ssList( X ) ) ] )
% 0.89/1.24 , clause( 6375, [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList(
% 0.89/1.24 Y ) ), singletonP( Y ) ] )
% 0.89/1.24 , clause( 6376, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~(
% 0.89/1.24 ssItem( X ) ) ] )
% 0.89/1.24 , clause( 6377, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList(
% 0.89/1.24 X ) ), =( nil, X ) ] )
% 0.89/1.24 , clause( 6378, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList(
% 0.89/1.24 X ) ), =( nil, Y ) ] )
% 0.89/1.24 , clause( 6379, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( app( cons( X, nil
% 0.89/1.24 ), Y ), cons( X, Y ) ) ] )
% 0.89/1.24 , clause( 6380, [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 0.89/1.24 X, Y ), =( X, Y ) ] )
% 0.89/1.24 , clause( 6381, [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 0.89/1.24 X, Y ), =( X, Y ) ] )
% 0.89/1.24 , clause( 6382, [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( hd(
% 0.89/1.24 app( Y, X ) ), hd( Y ) ) ] )
% 0.89/1.24 , clause( 6383, [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ),
% 0.89/1.24 ~( ssItem( X ) ), strictorderedP( Y ), =( nil, Y ) ] )
% 0.89/1.24 , clause( 6384, [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~(
% 0.89/1.24 ssItem( X ) ), totalorderedP( Y ), =( nil, Y ) ] )
% 0.89/1.24 , clause( 6385, [ ~( geq( X, Y ) ), ~( geq( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.89/1.24 ssItem( Y ) ), =( Y, X ) ] )
% 0.89/1.24 , clause( 6386, [ ~( segmentP( X, Y ) ), ~( segmentP( Y, X ) ), ~( ssList(
% 0.89/1.24 X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.89/1.24 , clause( 6387, [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, X ) ), ~( ssList(
% 0.89/1.24 X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.89/1.24 , clause( 6388, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~( ssList(
% 0.89/1.24 X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 0.89/1.24 , clause( 6389, [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( ssItem( X ) ), ~(
% 0.89/1.24 ssItem( Y ) ), =( Y, X ) ] )
% 0.89/1.24 , clause( 6390, [ ~( rearsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.89/1.24 , =( app( skaf46( X, Y ), Y ), X ) ] )
% 0.89/1.24 , clause( 6391, [ ~( frontsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X )
% 0.89/1.24 ), =( app( Y, skaf45( X, Y ) ), X ) ] )
% 0.89/1.24 , clause( 6392, [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( tl(
% 0.89/1.24 app( Y, X ) ), app( tl( Y ), X ) ) ] )
% 0.89/1.24 , clause( 6393, [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ),
% 0.89/1.24 ~( ssItem( X ) ), lt( X, hd( Y ) ), =( nil, Y ) ] )
% 0.89/1.24 , clause( 6394, [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~(
% 0.89/1.24 ssItem( X ) ), leq( X, hd( Y ) ), =( nil, Y ) ] )
% 0.89/1.24 , clause( 6395, [ ~( rearsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) )
% 0.89/1.24 , ~( ssList( X ) ), rearsegP( app( Z, X ), Y ) ] )
% 0.89/1.24 , clause( 6396, [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y )
% 0.89/1.24 ), ~( ssList( X ) ), frontsegP( app( X, Z ), Y ) ] )
% 0.89/1.24 , clause( 6397, [ ~( =( X, Y ) ), ~( ssList( Z ) ), ~( ssItem( Y ) ), ~(
% 0.89/1.24 ssItem( X ) ), memberP( cons( Y, Z ), X ) ] )
% 0.89/1.24 , clause( 6398, [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssItem( Z ) )
% 0.89/1.24 , ~( ssItem( Y ) ), memberP( cons( Z, X ), Y ) ] )
% 0.89/1.24 , clause( 6399, [ ~( memberP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( X ) )
% 0.89/1.24 , ~( ssItem( Y ) ), memberP( app( X, Z ), Y ) ] )
% 0.89/1.24 , clause( 6400, [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssList( Z ) )
% 0.89/1.24 , ~( ssItem( Y ) ), memberP( app( Z, X ), Y ) ] )
% 0.89/1.24 , clause( 6401, [ ~( ssList( X ) ), equalelemsP( X ), =( app( skaf80( X ),
% 0.89/1.24 cons( skaf78( X ), cons( skaf79( X ), skaf81( X ) ) ) ), X ) ] )
% 0.89/1.24 , clause( 6402, [ ~( =( app( X, Y ), Z ) ), ~( ssList( X ) ), ~( ssList( Y
% 0.89/1.24 ) ), ~( ssList( Z ) ), rearsegP( Z, Y ) ] )
% 0.89/1.24 , clause( 6403, [ ~( =( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X
% 0.89/1.24 ) ), ~( ssList( Z ) ), frontsegP( Z, X ) ] )
% 0.89/1.24 , clause( 6404, [ ~( =( nil, X ) ), ~( =( nil, Y ) ), ~( ssList( Y ) ), ~(
% 0.89/1.24 ssList( X ) ), =( app( X, Y ), nil ) ] )
% 0.89/1.24 , clause( 6405, [ ~( gt( X, Y ) ), ~( gt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.89/1.24 ssItem( Y ) ), ~( ssItem( X ) ), gt( X, Z ) ] )
% 0.89/1.24 , clause( 6406, [ ~( leq( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.89/1.24 ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Z ) ] )
% 0.89/1.24 , clause( 6407, [ ~( geq( X, Y ) ), ~( geq( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.89/1.24 ssItem( Y ) ), ~( ssItem( X ) ), geq( X, Z ) ] )
% 0.89/1.24 , clause( 6408, [ ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =(
% 0.89/1.24 app( app( Z, Y ), X ), app( Z, app( Y, X ) ) ) ] )
% 0.89/1.24 , clause( 6409, [ ~( =( app( X, Y ), app( X, Z ) ) ), ~( ssList( Y ) ), ~(
% 0.89/1.24 ssList( X ) ), ~( ssList( Z ) ), =( Y, Z ) ] )
% 0.89/1.24 , clause( 6410, [ ~( =( app( X, Y ), app( Z, Y ) ) ), ~( ssList( X ) ), ~(
% 0.89/1.24 ssList( Y ) ), ~( ssList( Z ) ), =( X, Z ) ] )
% 0.89/1.24 , clause( 6411, [ ~( segmentP( X, Y ) ), ~( segmentP( Y, Z ) ), ~( ssList(
% 0.89/1.24 Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), segmentP( X, Z ) ] )
% 0.89/1.24 , clause( 6412, [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, Z ) ), ~( ssList(
% 0.89/1.24 Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), rearsegP( X, Z ) ] )
% 0.89/1.24 , clause( 6413, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, Z ) ), ~( ssList(
% 0.89/1.24 Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), frontsegP( X, Z ) ] )
% 0.89/1.24 , clause( 6414, [ ~( lt( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.89/1.24 ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Z ) ] )
% 0.89/1.24 , clause( 6415, [ ~( leq( X, Y ) ), ~( leq( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 0.89/1.24 ssItem( Y ) ), ~( ssItem( X ) ), leq( X, Z ) ] )
% 0.89/1.24 , clause( 6416, [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =(
% 0.89/1.24 cons( X, app( Y, Z ) ), app( cons( X, Y ), Z ) ) ] )
% 0.89/1.24 , clause( 6417, [ ~( memberP( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~(
% 0.89/1.24 ssList( X ) ), ~( ssItem( Z ) ), memberP( Y, Z ), memberP( X, Z ) ] )
% 0.89/1.24 , clause( 6418, [ ~( leq( X, hd( Y ) ) ), ~( totalorderedP( Y ) ), ~(
% 0.89/1.24 ssList( Y ) ), ~( ssItem( X ) ), totalorderedP( cons( X, Y ) ), =( nil, Y
% 0.89/1.24 ) ] )
% 0.89/1.24 , clause( 6419, [ ~( lt( X, hd( Y ) ) ), ~( strictorderedP( Y ) ), ~(
% 0.89/1.24 ssList( Y ) ), ~( ssItem( X ) ), strictorderedP( cons( X, Y ) ), =( nil,
% 0.89/1.24 Y ) ] )
% 0.89/1.24 , clause( 6420, [ ~( memberP( cons( X, Y ), Z ) ), ~( ssList( Y ) ), ~(
% 0.89/1.24 ssItem( X ) ), ~( ssItem( Z ) ), memberP( Y, Z ), =( Z, X ) ] )
% 0.89/1.24 , clause( 6421, [ ~( ssList( X ) ), duplicatefreeP( X ), =( app( app(
% 0.89/1.24 skaf75( X ), cons( skaf74( X ), skaf76( X ) ) ), cons( skaf74( X ),
% 0.89/1.24 skaf77( X ) ) ), X ) ] )
% 0.89/1.24 , clause( 6422, [ ~( ssList( X ) ), strictorderedP( X ), =( app( app(
% 0.89/1.24 skaf71( X ), cons( skaf69( X ), skaf72( X ) ) ), cons( skaf70( X ),
% 0.89/1.24 skaf73( X ) ) ), X ) ] )
% 0.89/1.24 , clause( 6423, [ ~( ssList( X ) ), totalorderedP( X ), =( app( app( skaf66(
% 0.89/1.24 X ), cons( skaf64( X ), skaf67( X ) ) ), cons( skaf65( X ), skaf68( X ) )
% 0.89/1.24 ), X ) ] )
% 0.89/1.24 , clause( 6424, [ ~( ssList( X ) ), strictorderP( X ), =( app( app( skaf61(
% 0.89/1.24 X ), cons( skaf59( X ), skaf62( X ) ) ), cons( skaf60( X ), skaf63( X ) )
% 0.89/1.24 ), X ) ] )
% 0.89/1.24 , clause( 6425, [ ~( ssList( X ) ), totalorderP( X ), =( app( app( skaf56(
% 0.89/1.24 X ), cons( skaf54( X ), skaf57( X ) ) ), cons( skaf55( X ), skaf58( X ) )
% 0.89/1.24 ), X ) ] )
% 0.89/1.24 , clause( 6426, [ ~( ssList( X ) ), cyclefreeP( X ), =( app( app( skaf51( X
% 0.89/1.24 ), cons( skaf49( X ), skaf52( X ) ) ), cons( skaf50( X ), skaf53( X ) )
% 0.89/1.24 ), X ) ] )
% 0.89/1.24 , clause( 6427, [ ~( segmentP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.89/1.24 , =( app( app( skaf47( X, Y ), Y ), skaf48( Y, X ) ), X ) ] )
% 0.89/1.24 , clause( 6428, [ ~( memberP( X, Y ) ), ~( ssItem( Y ) ), ~( ssList( X ) )
% 0.89/1.24 , =( app( skaf42( X, Y ), cons( Y, skaf43( Y, X ) ) ), X ) ] )
% 0.89/1.24 , clause( 6429, [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ),
% 0.89/1.24 ~( ssItem( X ) ), ~( ssList( T ) ), ~( ssList( Y ) ), =( X, Z ) ] )
% 0.89/1.24 , clause( 6430, [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ),
% 0.89/1.24 ~( ssItem( X ) ), ~( ssList( T ) ), ~( ssList( Y ) ), =( T, Y ) ] )
% 0.89/1.24 , clause( 6431, [ ~( segmentP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( T ) )
% 0.89/1.24 , ~( ssList( Y ) ), ~( ssList( X ) ), segmentP( app( app( T, X ), Z ), Y
% 0.89/1.24 ) ] )
% 0.89/1.24 , clause( 6432, [ ~( =( app( app( X, Y ), Z ), T ) ), ~( ssList( Z ) ), ~(
% 0.89/1.24 ssList( X ) ), ~( ssList( Y ) ), ~( ssList( T ) ), segmentP( T, Y ) ] )
% 0.89/1.24 , clause( 6433, [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList(
% 0.89/1.24 T ) ), ~( ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), frontsegP( Y
% 0.89/1.24 , T ) ] )
% 0.89/1.24 , clause( 6434, [ ~( =( app( X, cons( Y, Z ) ), T ) ), ~( ssList( Z ) ),
% 0.89/1.24 ~( ssList( X ) ), ~( ssItem( Y ) ), ~( ssList( T ) ), memberP( T, Y ) ]
% 0.89/1.24 )
% 0.89/1.24 , clause( 6435, [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList(
% 0.91/1.28 T ) ), ~( ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), =( X, Z ) ]
% 0.91/1.28 )
% 0.91/1.28 , clause( 6436, [ ~( =( tl( X ), tl( Y ) ) ), ~( =( hd( X ), hd( Y ) ) ),
% 0.91/1.28 ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( X, Y ), =( nil, X ) ]
% 0.91/1.28 )
% 0.91/1.28 , clause( 6437, [ ~( frontsegP( X, Y ) ), ~( =( Z, T ) ), ~( ssList( Y ) )
% 0.91/1.28 , ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Z ) ), frontsegP( cons(
% 0.91/1.28 Z, X ), cons( T, Y ) ) ] )
% 0.91/1.28 , clause( 6438, [ ~( =( app( app( X, cons( Y, Z ) ), cons( Y, T ) ), U ) )
% 0.91/1.28 , ~( ssList( T ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y ) )
% 0.91/1.28 , ~( duplicatefreeP( U ) ), ~( ssList( U ) ) ] )
% 0.91/1.28 , clause( 6439, [ ~( =( app( X, cons( Y, cons( Z, T ) ) ), U ) ), ~( ssList(
% 0.91/1.28 T ) ), ~( ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ), ~(
% 0.91/1.28 equalelemsP( U ) ), ~( ssList( U ) ), =( Y, Z ) ] )
% 0.91/1.28 , clause( 6440, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 0.91/1.28 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 0.91/1.28 , ~( ssItem( Y ) ), ~( strictorderedP( W ) ), ~( ssList( W ) ), lt( Y, T
% 0.91/1.28 ) ] )
% 0.91/1.28 , clause( 6441, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 0.91/1.28 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 0.91/1.28 , ~( ssItem( Y ) ), ~( totalorderedP( W ) ), ~( ssList( W ) ), leq( Y, T
% 0.91/1.28 ) ] )
% 0.91/1.28 , clause( 6442, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 0.91/1.28 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 0.91/1.28 , ~( ssItem( Y ) ), ~( strictorderP( W ) ), ~( ssList( W ) ), lt( Y, T )
% 0.91/1.28 , lt( T, Y ) ] )
% 0.91/1.28 , clause( 6443, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 0.91/1.28 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 0.91/1.28 , ~( ssItem( Y ) ), ~( totalorderP( W ) ), ~( ssList( W ) ), leq( Y, T )
% 0.91/1.28 , leq( T, Y ) ] )
% 0.91/1.28 , clause( 6444, [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( =( app( app( Z,
% 0.91/1.28 cons( X, T ) ), cons( Y, U ) ), W ) ), ~( ssList( U ) ), ~( ssList( T ) )
% 0.91/1.28 , ~( ssList( Z ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), ~( cyclefreeP( W
% 0.91/1.28 ) ), ~( ssList( W ) ) ] )
% 0.91/1.28 , clause( 6445, [ ssList( sk1 ) ] )
% 0.91/1.28 , clause( 6446, [ ssList( sk2 ) ] )
% 0.91/1.28 , clause( 6447, [ ssList( sk3 ) ] )
% 0.91/1.28 , clause( 6448, [ ssList( sk4 ) ] )
% 0.91/1.28 , clause( 6449, [ =( sk2, sk4 ) ] )
% 0.91/1.28 , clause( 6450, [ =( sk1, sk3 ) ] )
% 0.91/1.28 , clause( 6451, [ neq( sk2, nil ), neq( sk2, nil ) ] )
% 0.91/1.28 , clause( 6452, [ neq( sk2, nil ), ~( neq( sk4, nil ) ) ] )
% 0.91/1.28 , clause( 6453, [ ssItem( sk5 ), neq( sk2, nil ) ] )
% 0.91/1.28 , clause( 6454, [ ssList( sk6 ), neq( sk2, nil ) ] )
% 0.91/1.28 , clause( 6455, [ =( cons( sk5, nil ), sk3 ), neq( sk2, nil ) ] )
% 0.91/1.28 , clause( 6456, [ =( app( sk6, cons( sk5, nil ) ), sk4 ), neq( sk2, nil ) ]
% 0.91/1.28 )
% 0.91/1.28 , clause( 6457, [ ~( singletonP( sk1 ) ), neq( sk2, nil ) ] )
% 0.91/1.28 , clause( 6458, [ ssItem( sk5 ), ~( neq( sk4, nil ) ) ] )
% 0.91/1.28 , clause( 6459, [ ssList( sk6 ), ~( neq( sk4, nil ) ) ] )
% 0.91/1.28 , clause( 6460, [ =( cons( sk5, nil ), sk3 ), ~( neq( sk4, nil ) ) ] )
% 0.91/1.28 , clause( 6461, [ =( app( sk6, cons( sk5, nil ) ), sk4 ), ~( neq( sk4, nil
% 0.91/1.28 ) ) ] )
% 0.91/1.28 , clause( 6462, [ ~( singletonP( sk1 ) ), ~( neq( sk4, nil ) ) ] )
% 0.91/1.28 ] ).
% 0.91/1.28
% 0.91/1.28
% 0.91/1.28
% 0.91/1.28 subsumption(
% 0.91/1.28 clause( 113, [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y
% 0.91/1.28 ) ), singletonP( Y ) ] )
% 0.91/1.28 , clause( 6375, [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList(
% 0.91/1.28 Y ) ), singletonP( Y ) ] )
% 0.91/1.28 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.91/1.28 ), ==>( 1, 1 ), ==>( 2, 2 ), ==>( 3, 3 )] ) ).
% 0.91/1.28
% 0.91/1.28
% 0.91/1.28 subsumption(
% 0.91/1.28 clause( 182, [ ssList( sk1 ) ] )
% 0.91/1.28 , clause( 6445, [ ssList( sk1 ) ] )
% 0.91/1.28 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.91/1.28
% 0.91/1.28
% 0.91/1.28 eqswap(
% 0.91/1.28 clause( 8023, [ =( sk4, sk2 ) ] )
% 0.91/1.28 , clause( 6449, [ =( sk2, sk4 ) ] )
% 0.91/1.28 , 0, substitution( 0, [] )).
% 0.91/1.28
% 0.91/1.28
% 0.91/1.28 subsumption(
% 0.91/1.28 clause( 186, [ =( sk4, sk2 ) ] )
% 0.91/1.28 , clause( 8023, [ =( sk4, sk2 ) ] )
% 0.91/1.28 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.91/1.28
% 0.91/1.28
% 0.91/1.28 eqswap(
% 0.91/1.28 clause( 8782, [ =( sk3, sk1 ) ] )
% 0.91/1.28 , clause( 6450, [ =( sk1, sk3 ) ] )
% 0.91/1.28 , 0, substitution( 0, [] )).
% 0.91/1.28
% 0.91/1.28
% 0.91/1.28 subsumption(
% 0.91/1.28 clause( 187, [ =( sk3, sk1 ) ] )
% 0.91/1.28 , clause( 8782, [ =( sk3, sk1 ) ] )
% 0.91/1.28 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.91/1.28
% 0.91/1.28
% 0.91/1.28 factor(
% 0.91/1.29 clause( 9548, [ neq( sk2, nil ) ] )
% 0.91/1.29 , clause( 6451, [ neq( sk2, nil ), neq( sk2, nil ) ] )
% 0.91/1.29 , 0, 1, substitution( 0, [] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 subsumption(
% 0.91/1.29 clause( 188, [ neq( sk2, nil ) ] )
% 0.91/1.29 , clause( 9548, [ neq( sk2, nil ) ] )
% 0.91/1.29 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 paramod(
% 0.91/1.29 clause( 10523, [ ~( neq( sk2, nil ) ), ssItem( sk5 ) ] )
% 0.91/1.29 , clause( 186, [ =( sk4, sk2 ) ] )
% 0.91/1.29 , 0, clause( 6458, [ ssItem( sk5 ), ~( neq( sk4, nil ) ) ] )
% 0.91/1.29 , 1, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 resolution(
% 0.91/1.29 clause( 10524, [ ssItem( sk5 ) ] )
% 0.91/1.29 , clause( 10523, [ ~( neq( sk2, nil ) ), ssItem( sk5 ) ] )
% 0.91/1.29 , 0, clause( 188, [ neq( sk2, nil ) ] )
% 0.91/1.29 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 subsumption(
% 0.91/1.29 clause( 189, [ ssItem( sk5 ) ] )
% 0.91/1.29 , clause( 10524, [ ssItem( sk5 ) ] )
% 0.91/1.29 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 paramod(
% 0.91/1.29 clause( 11701, [ =( cons( sk5, nil ), sk1 ), ~( neq( sk4, nil ) ) ] )
% 0.91/1.29 , clause( 187, [ =( sk3, sk1 ) ] )
% 0.91/1.29 , 0, clause( 6460, [ =( cons( sk5, nil ), sk3 ), ~( neq( sk4, nil ) ) ] )
% 0.91/1.29 , 0, 4, substitution( 0, [] ), substitution( 1, [] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 paramod(
% 0.91/1.29 clause( 11702, [ ~( neq( sk2, nil ) ), =( cons( sk5, nil ), sk1 ) ] )
% 0.91/1.29 , clause( 186, [ =( sk4, sk2 ) ] )
% 0.91/1.29 , 0, clause( 11701, [ =( cons( sk5, nil ), sk1 ), ~( neq( sk4, nil ) ) ] )
% 0.91/1.29 , 1, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 resolution(
% 0.91/1.29 clause( 11703, [ =( cons( sk5, nil ), sk1 ) ] )
% 0.91/1.29 , clause( 11702, [ ~( neq( sk2, nil ) ), =( cons( sk5, nil ), sk1 ) ] )
% 0.91/1.29 , 0, clause( 188, [ neq( sk2, nil ) ] )
% 0.91/1.29 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 subsumption(
% 0.91/1.29 clause( 191, [ =( cons( sk5, nil ), sk1 ) ] )
% 0.91/1.29 , clause( 11703, [ =( cons( sk5, nil ), sk1 ) ] )
% 0.91/1.29 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 paramod(
% 0.91/1.29 clause( 12709, [ ~( neq( sk2, nil ) ), ~( singletonP( sk1 ) ) ] )
% 0.91/1.29 , clause( 186, [ =( sk4, sk2 ) ] )
% 0.91/1.29 , 0, clause( 6462, [ ~( singletonP( sk1 ) ), ~( neq( sk4, nil ) ) ] )
% 0.91/1.29 , 1, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 resolution(
% 0.91/1.29 clause( 12710, [ ~( singletonP( sk1 ) ) ] )
% 0.91/1.29 , clause( 12709, [ ~( neq( sk2, nil ) ), ~( singletonP( sk1 ) ) ] )
% 0.91/1.29 , 0, clause( 188, [ neq( sk2, nil ) ] )
% 0.91/1.29 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 subsumption(
% 0.91/1.29 clause( 193, [ ~( singletonP( sk1 ) ) ] )
% 0.91/1.29 , clause( 12710, [ ~( singletonP( sk1 ) ) ] )
% 0.91/1.29 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 eqswap(
% 0.91/1.29 clause( 12711, [ ~( =( Y, cons( X, nil ) ) ), ~( ssItem( X ) ), ~( ssList(
% 0.91/1.29 Y ) ), singletonP( Y ) ] )
% 0.91/1.29 , clause( 113, [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList(
% 0.91/1.29 Y ) ), singletonP( Y ) ] )
% 0.91/1.29 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 resolution(
% 0.91/1.29 clause( 12713, [ ~( =( X, cons( sk5, nil ) ) ), ~( ssList( X ) ),
% 0.91/1.29 singletonP( X ) ] )
% 0.91/1.29 , clause( 12711, [ ~( =( Y, cons( X, nil ) ) ), ~( ssItem( X ) ), ~( ssList(
% 0.91/1.29 Y ) ), singletonP( Y ) ] )
% 0.91/1.29 , 1, clause( 189, [ ssItem( sk5 ) ] )
% 0.91/1.29 , 0, substitution( 0, [ :=( X, sk5 ), :=( Y, X )] ), substitution( 1, [] )
% 0.91/1.29 ).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 paramod(
% 0.91/1.29 clause( 12714, [ ~( =( X, sk1 ) ), ~( ssList( X ) ), singletonP( X ) ] )
% 0.91/1.29 , clause( 191, [ =( cons( sk5, nil ), sk1 ) ] )
% 0.91/1.29 , 0, clause( 12713, [ ~( =( X, cons( sk5, nil ) ) ), ~( ssList( X ) ),
% 0.91/1.29 singletonP( X ) ] )
% 0.91/1.29 , 0, 3, substitution( 0, [] ), substitution( 1, [ :=( X, X )] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 eqswap(
% 0.91/1.29 clause( 12715, [ ~( =( sk1, X ) ), ~( ssList( X ) ), singletonP( X ) ] )
% 0.91/1.29 , clause( 12714, [ ~( =( X, sk1 ) ), ~( ssList( X ) ), singletonP( X ) ] )
% 0.91/1.29 , 0, substitution( 0, [ :=( X, X )] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 subsumption(
% 0.91/1.29 clause( 6199, [ ~( ssList( X ) ), singletonP( X ), ~( =( sk1, X ) ) ] )
% 0.91/1.29 , clause( 12715, [ ~( =( sk1, X ) ), ~( ssList( X ) ), singletonP( X ) ] )
% 0.91/1.29 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 2 ), ==>( 1,
% 0.91/1.29 0 ), ==>( 2, 1 )] ) ).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 eqswap(
% 0.91/1.29 clause( 12716, [ ~( =( X, sk1 ) ), ~( ssList( X ) ), singletonP( X ) ] )
% 0.91/1.29 , clause( 6199, [ ~( ssList( X ) ), singletonP( X ), ~( =( sk1, X ) ) ] )
% 0.91/1.29 , 2, substitution( 0, [ :=( X, X )] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 eqrefl(
% 0.91/1.29 clause( 12717, [ ~( ssList( sk1 ) ), singletonP( sk1 ) ] )
% 0.91/1.29 , clause( 12716, [ ~( =( X, sk1 ) ), ~( ssList( X ) ), singletonP( X ) ] )
% 0.91/1.29 , 0, substitution( 0, [ :=( X, sk1 )] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 resolution(
% 0.91/1.29 clause( 12718, [ singletonP( sk1 ) ] )
% 0.91/1.29 , clause( 12717, [ ~( ssList( sk1 ) ), singletonP( sk1 ) ] )
% 0.91/1.29 , 0, clause( 182, [ ssList( sk1 ) ] )
% 0.91/1.29 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 subsumption(
% 0.91/1.29 clause( 6230, [ singletonP( sk1 ) ] )
% 0.91/1.29 , clause( 12718, [ singletonP( sk1 ) ] )
% 0.91/1.29 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 resolution(
% 0.91/1.29 clause( 12719, [] )
% 0.91/1.29 , clause( 193, [ ~( singletonP( sk1 ) ) ] )
% 0.91/1.29 , 0, clause( 6230, [ singletonP( sk1 ) ] )
% 0.91/1.29 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 subsumption(
% 0.91/1.29 clause( 6258, [] )
% 0.91/1.29 , clause( 12719, [] )
% 0.91/1.29 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 end.
% 0.91/1.29
% 0.91/1.29 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.91/1.29
% 0.91/1.29 Memory use:
% 0.91/1.29
% 0.91/1.29 space for terms: 82445
% 0.91/1.29 space for clauses: 322070
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 clauses generated: 13293
% 0.91/1.29 clauses kept: 6259
% 0.91/1.29 clauses selected: 363
% 0.91/1.29 clauses deleted: 4
% 0.91/1.29 clauses inuse deleted: 0
% 0.91/1.29
% 0.91/1.29 subsentry: 95414
% 0.91/1.29 literals s-matched: 58678
% 0.91/1.29 literals matched: 25341
% 0.91/1.29 full subsumption: 15054
% 0.91/1.29
% 0.91/1.29 checksum: 1129397765
% 0.91/1.29
% 0.91/1.29
% 0.91/1.29 Bliksem ended
%------------------------------------------------------------------------------