TSTP Solution File: SWC121-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWC121-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n013.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:00 EDT 2022
% Result : Unsatisfiable 2.30s 2.66s
% Output : Refutation 2.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC121-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.32 % Computer : n013.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % DateTime : Sun Jun 12 11:27:59 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.72/1.12 *** allocated 10000 integers for termspace/termends
% 0.72/1.12 *** allocated 10000 integers for clauses
% 0.72/1.12 *** allocated 10000 integers for justifications
% 0.72/1.12 Bliksem 1.12
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 Automatic Strategy Selection
% 0.72/1.12
% 0.72/1.12 Clauses:
% 0.72/1.12 [
% 0.72/1.12 [ equalelemsP( nil ) ],
% 0.72/1.12 [ duplicatefreeP( nil ) ],
% 0.72/1.12 [ strictorderedP( nil ) ],
% 0.72/1.12 [ totalorderedP( nil ) ],
% 0.72/1.12 [ strictorderP( nil ) ],
% 0.72/1.12 [ totalorderP( nil ) ],
% 0.72/1.12 [ cyclefreeP( nil ) ],
% 0.72/1.12 [ ssList( nil ) ],
% 0.72/1.12 [ ssItem( skac3 ) ],
% 0.72/1.12 [ ssItem( skac2 ) ],
% 0.72/1.12 [ ~( singletonP( nil ) ) ],
% 0.72/1.12 [ ssItem( skaf83( X ) ) ],
% 0.72/1.12 [ ssList( skaf82( X ) ) ],
% 0.72/1.12 [ ssList( skaf81( X ) ) ],
% 0.72/1.12 [ ssList( skaf80( X ) ) ],
% 0.72/1.12 [ ssItem( skaf79( X ) ) ],
% 0.72/1.12 [ ssItem( skaf78( X ) ) ],
% 0.72/1.12 [ ssList( skaf77( X ) ) ],
% 0.72/1.12 [ ssList( skaf76( X ) ) ],
% 0.72/1.12 [ ssList( skaf75( X ) ) ],
% 0.72/1.12 [ ssItem( skaf74( X ) ) ],
% 0.72/1.12 [ ssList( skaf73( X ) ) ],
% 0.72/1.12 [ ssList( skaf72( X ) ) ],
% 0.72/1.12 [ ssList( skaf71( X ) ) ],
% 0.72/1.12 [ ssItem( skaf70( X ) ) ],
% 0.72/1.12 [ ssItem( skaf69( X ) ) ],
% 0.72/1.12 [ ssList( skaf68( X ) ) ],
% 0.72/1.12 [ ssList( skaf67( X ) ) ],
% 0.72/1.12 [ ssList( skaf66( X ) ) ],
% 0.72/1.12 [ ssItem( skaf65( X ) ) ],
% 0.72/1.12 [ ssItem( skaf64( X ) ) ],
% 0.72/1.12 [ ssList( skaf63( X ) ) ],
% 0.72/1.12 [ ssList( skaf62( X ) ) ],
% 0.72/1.12 [ ssList( skaf61( X ) ) ],
% 0.72/1.12 [ ssItem( skaf60( X ) ) ],
% 0.72/1.12 [ ssItem( skaf59( X ) ) ],
% 0.72/1.12 [ ssList( skaf58( X ) ) ],
% 0.72/1.12 [ ssList( skaf57( X ) ) ],
% 0.72/1.12 [ ssList( skaf56( X ) ) ],
% 0.72/1.12 [ ssItem( skaf55( X ) ) ],
% 0.72/1.12 [ ssItem( skaf54( X ) ) ],
% 0.72/1.12 [ ssList( skaf53( X ) ) ],
% 0.72/1.12 [ ssList( skaf52( X ) ) ],
% 0.72/1.12 [ ssList( skaf51( X ) ) ],
% 0.72/1.12 [ ssItem( skaf50( X ) ) ],
% 0.72/1.12 [ ssItem( skaf49( X ) ) ],
% 0.72/1.12 [ ssItem( skaf44( X ) ) ],
% 0.72/1.12 [ ssList( skaf48( X, Y ) ) ],
% 0.72/1.12 [ ssList( skaf47( X, Y ) ) ],
% 0.72/1.12 [ ssList( skaf46( X, Y ) ) ],
% 0.72/1.12 [ ssList( skaf45( X, Y ) ) ],
% 0.72/1.12 [ ssList( skaf43( X, Y ) ) ],
% 0.72/1.12 [ ssList( skaf42( X, Y ) ) ],
% 0.72/1.12 [ ~( =( skac3, skac2 ) ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), geq( X, X ) ],
% 0.72/1.12 [ ~( ssList( X ) ), segmentP( X, nil ) ],
% 0.72/1.12 [ ~( ssList( X ) ), segmentP( X, X ) ],
% 0.72/1.12 [ ~( ssList( X ) ), rearsegP( X, nil ) ],
% 0.72/1.12 [ ~( ssList( X ) ), rearsegP( X, X ) ],
% 0.72/1.12 [ ~( ssList( X ) ), frontsegP( X, nil ) ],
% 0.72/1.12 [ ~( ssList( X ) ), frontsegP( X, X ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), leq( X, X ) ],
% 0.72/1.12 [ ~( lt( X, X ) ), ~( ssItem( X ) ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), equalelemsP( cons( X, nil ) ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), strictorderedP( cons( X, nil ) ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), totalorderedP( cons( X, nil ) ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), strictorderP( cons( X, nil ) ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), totalorderP( cons( X, nil ) ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), cyclefreeP( cons( X, nil ) ) ],
% 0.72/1.12 [ ~( memberP( nil, X ) ), ~( ssItem( X ) ) ],
% 0.72/1.12 [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ],
% 0.72/1.12 [ ~( ssList( X ) ), =( app( X, nil ), X ) ],
% 0.72/1.12 [ ~( ssList( X ) ), =( app( nil, X ), X ) ],
% 0.72/1.12 [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ],
% 0.72/1.12 [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ],
% 0.72/1.12 [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ],
% 0.72/1.12 [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ],
% 0.72/1.12 [ ~( =( nil, X ) ), ~( ssList( X ) ), segmentP( nil, X ) ],
% 0.72/1.12 [ ~( segmentP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.72/1.12 [ ~( =( nil, X ) ), ~( ssList( X ) ), rearsegP( nil, X ) ],
% 0.72/1.12 [ ~( rearsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.72/1.12 [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X ) ],
% 0.72/1.12 [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ],
% 0.72/1.12 [ ~( ssList( X ) ), ~( ssList( Y ) ), ssList( app( Y, X ) ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), ~( ssList( Y ) ), ssList( cons( X, Y ) ) ],
% 0.72/1.12 [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf50( X ), skaf49( X ) ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf49( X ), skaf50( X ) ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( =( skaf79( X ), skaf78( X ) ) ), ~( ssList( X ) ), equalelemsP( X )
% 0.72/1.12 ],
% 0.72/1.12 [ ~( lt( skaf69( X ), skaf70( X ) ) ), ~( ssList( X ) ), strictorderedP(
% 0.72/1.12 X ) ],
% 0.72/1.12 [ ~( leq( skaf64( X ), skaf65( X ) ) ), ~( ssList( X ) ), totalorderedP(
% 0.72/1.12 X ) ],
% 0.72/1.12 [ ~( lt( skaf60( X ), skaf59( X ) ) ), ~( ssList( X ) ), strictorderP( X
% 0.72/1.12 ) ],
% 0.72/1.12 [ ~( lt( skaf59( X ), skaf60( X ) ) ), ~( ssList( X ) ), strictorderP( X
% 0.72/1.12 ) ],
% 0.72/1.12 [ ~( leq( skaf55( X ), skaf54( X ) ) ), ~( ssList( X ) ), totalorderP( X
% 0.72/1.12 ) ],
% 0.72/1.12 [ ~( leq( skaf54( X ), skaf55( X ) ) ), ~( ssList( X ) ), totalorderP( X
% 0.72/1.12 ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( tl( cons( X, Y ) ), Y ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( hd( cons( X, Y ) ), X ) ],
% 0.72/1.12 [ ~( =( cons( X, Y ), nil ) ), ~( ssItem( X ) ), ~( ssList( Y ) ) ],
% 0.72/1.12 [ ~( =( cons( X, Y ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y ) ) ],
% 0.72/1.12 [ ~( ssList( X ) ), ~( ssList( Y ) ), neq( Y, X ), =( Y, X ) ],
% 0.72/1.12 [ ~( singletonP( X ) ), ~( ssList( X ) ), =( cons( skaf44( X ), nil ), X
% 0.72/1.12 ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X ) ],
% 0.72/1.12 [ ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( X, Y ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( ssList( X ) ), =( cons( hd( X ), tl( X ) ), X ), =( nil, X ) ],
% 0.72/1.12 [ ~( gt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( Y, X ) ],
% 0.72/1.12 [ ~( lt( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), gt( Y, X ) ],
% 0.72/1.12 [ ~( geq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( Y, X ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( leq( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), geq( Y, X ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( ssList( X ) ), =( cons( skaf83( X ), skaf82( X ) ), X ), =( nil, X
% 0.72/1.12 ) ],
% 0.72/1.12 [ ~( gt( X, Y ) ), ~( gt( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( =( X, Y ) ), ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), strictorderedP(
% 0.72/1.12 cons( Y, X ) ) ],
% 0.72/1.12 [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), totalorderedP(
% 0.72/1.12 cons( Y, X ) ) ],
% 0.72/1.12 [ ~( lt( X, Y ) ), ~( lt( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList( Y ) ),
% 0.72/1.12 singletonP( Y ) ],
% 0.72/1.12 [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( nil
% 0.72/1.12 , X ) ],
% 0.72/1.12 [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( nil
% 0.72/1.12 , Y ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( app( cons( X, nil ), Y ), cons(
% 0.72/1.12 X, Y ) ) ],
% 0.72/1.12 [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Y ), =( X
% 0.72/1.12 , Y ) ],
% 0.72/1.12 [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Y ), =( X
% 0.72/1.12 , Y ) ],
% 0.72/1.12 [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( hd( app( Y, X ) )
% 0.72/1.12 , hd( Y ) ) ],
% 0.72/1.12 [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X )
% 0.72/1.12 ), strictorderedP( Y ), =( nil, Y ) ],
% 0.72/1.12 [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X ) )
% 0.72/1.12 , totalorderedP( Y ), =( nil, Y ) ],
% 0.72/1.12 [ ~( geq( X, Y ) ), ~( geq( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) )
% 0.72/1.12 , =( Y, X ) ],
% 0.72/1.12 [ ~( segmentP( X, Y ) ), ~( segmentP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.72/1.12 ssList( Y ) ), =( Y, X ) ],
% 0.72/1.12 [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.72/1.12 ssList( Y ) ), =( Y, X ) ],
% 0.72/1.12 [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~( ssList( X ) ), ~(
% 0.72/1.12 ssList( Y ) ), =( Y, X ) ],
% 0.72/1.12 [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( ssItem( X ) ), ~( ssItem( Y ) )
% 0.72/1.12 , =( Y, X ) ],
% 0.72/1.12 [ ~( rearsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app(
% 0.72/1.12 skaf46( X, Y ), Y ), X ) ],
% 0.72/1.12 [ ~( frontsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app( Y
% 0.72/1.12 , skaf45( X, Y ) ), X ) ],
% 0.72/1.12 [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( tl( app( Y, X ) )
% 0.72/1.12 , app( tl( Y ), X ) ) ],
% 0.72/1.12 [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X )
% 0.72/1.12 ), lt( X, hd( Y ) ), =( nil, Y ) ],
% 0.72/1.12 [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ), ~( ssItem( X ) )
% 0.72/1.12 , leq( X, hd( Y ) ), =( nil, Y ) ],
% 0.72/1.12 [ ~( rearsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ), ~( ssList(
% 0.72/1.12 X ) ), rearsegP( app( Z, X ), Y ) ],
% 0.72/1.12 [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y ) ), ~( ssList(
% 0.72/1.12 X ) ), frontsegP( app( X, Z ), Y ) ],
% 0.72/1.12 [ ~( =( X, Y ) ), ~( ssList( Z ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ),
% 0.72/1.12 memberP( cons( Y, Z ), X ) ],
% 0.72/1.12 [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y
% 0.72/1.12 ) ), memberP( cons( Z, X ), Y ) ],
% 0.72/1.12 [ ~( memberP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y
% 0.72/1.12 ) ), memberP( app( X, Z ), Y ) ],
% 0.72/1.12 [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssList( Z ) ), ~( ssItem( Y
% 0.72/1.12 ) ), memberP( app( Z, X ), Y ) ],
% 0.72/1.12 [ ~( ssList( X ) ), equalelemsP( X ), =( app( skaf80( X ), cons( skaf78(
% 0.72/1.12 X ), cons( skaf79( X ), skaf81( X ) ) ) ), X ) ],
% 0.72/1.12 [ ~( =( app( X, Y ), Z ) ), ~( ssList( X ) ), ~( ssList( Y ) ), ~(
% 0.72/1.12 ssList( Z ) ), rearsegP( Z, Y ) ],
% 0.72/1.12 [ ~( =( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), ~(
% 0.72/1.12 ssList( Z ) ), frontsegP( Z, X ) ],
% 0.72/1.12 [ ~( =( nil, X ) ), ~( =( nil, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.72/1.12 , =( app( X, Y ), nil ) ],
% 0.72/1.12 [ ~( gt( X, Y ) ), ~( gt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ),
% 0.72/1.12 ~( ssItem( X ) ), gt( X, Z ) ],
% 0.72/1.12 [ ~( leq( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.72/1.12 , ~( ssItem( X ) ), lt( X, Z ) ],
% 0.72/1.12 [ ~( geq( X, Y ) ), ~( geq( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.72/1.12 , ~( ssItem( X ) ), geq( X, Z ) ],
% 0.72/1.12 [ ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =( app( app( Z,
% 0.72/1.12 Y ), X ), app( Z, app( Y, X ) ) ) ],
% 0.72/1.12 [ ~( =( app( X, Y ), app( X, Z ) ) ), ~( ssList( Y ) ), ~( ssList( X ) )
% 0.72/1.12 , ~( ssList( Z ) ), =( Y, Z ) ],
% 0.72/1.12 [ ~( =( app( X, Y ), app( Z, Y ) ) ), ~( ssList( X ) ), ~( ssList( Y ) )
% 0.72/1.12 , ~( ssList( Z ) ), =( X, Z ) ],
% 0.72/1.12 [ ~( segmentP( X, Y ) ), ~( segmentP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.72/1.12 ssList( Y ) ), ~( ssList( X ) ), segmentP( X, Z ) ],
% 0.72/1.12 [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.72/1.12 ssList( Y ) ), ~( ssList( X ) ), rearsegP( X, Z ) ],
% 0.72/1.12 [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, Z ) ), ~( ssList( Z ) ), ~(
% 0.72/1.12 ssList( Y ) ), ~( ssList( X ) ), frontsegP( X, Z ) ],
% 0.72/1.12 [ ~( lt( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ),
% 0.72/1.12 ~( ssItem( X ) ), lt( X, Z ) ],
% 0.72/1.12 [ ~( leq( X, Y ) ), ~( leq( Y, Z ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) )
% 0.72/1.12 , ~( ssItem( X ) ), leq( X, Z ) ],
% 0.72/1.12 [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ), =( cons( X, app(
% 0.72/1.12 Y, Z ) ), app( cons( X, Y ), Z ) ) ],
% 0.72/1.12 [ ~( memberP( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ),
% 0.72/1.12 ~( ssItem( Z ) ), memberP( Y, Z ), memberP( X, Z ) ],
% 0.72/1.12 [ ~( leq( X, hd( Y ) ) ), ~( totalorderedP( Y ) ), ~( ssList( Y ) ), ~(
% 0.72/1.12 ssItem( X ) ), totalorderedP( cons( X, Y ) ), =( nil, Y ) ],
% 0.72/1.12 [ ~( lt( X, hd( Y ) ) ), ~( strictorderedP( Y ) ), ~( ssList( Y ) ), ~(
% 0.72/1.12 ssItem( X ) ), strictorderedP( cons( X, Y ) ), =( nil, Y ) ],
% 0.72/1.12 [ ~( memberP( cons( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssItem( X ) ),
% 0.72/1.12 ~( ssItem( Z ) ), memberP( Y, Z ), =( Z, X ) ],
% 0.72/1.12 [ ~( ssList( X ) ), duplicatefreeP( X ), =( app( app( skaf75( X ), cons(
% 0.72/1.12 skaf74( X ), skaf76( X ) ) ), cons( skaf74( X ), skaf77( X ) ) ), X ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( ssList( X ) ), strictorderedP( X ), =( app( app( skaf71( X ), cons(
% 0.72/1.12 skaf69( X ), skaf72( X ) ) ), cons( skaf70( X ), skaf73( X ) ) ), X ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( ssList( X ) ), totalorderedP( X ), =( app( app( skaf66( X ), cons(
% 0.72/1.12 skaf64( X ), skaf67( X ) ) ), cons( skaf65( X ), skaf68( X ) ) ), X ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( ssList( X ) ), strictorderP( X ), =( app( app( skaf61( X ), cons(
% 0.72/1.12 skaf59( X ), skaf62( X ) ) ), cons( skaf60( X ), skaf63( X ) ) ), X ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( ssList( X ) ), totalorderP( X ), =( app( app( skaf56( X ), cons(
% 0.72/1.12 skaf54( X ), skaf57( X ) ) ), cons( skaf55( X ), skaf58( X ) ) ), X ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( ssList( X ) ), cyclefreeP( X ), =( app( app( skaf51( X ), cons(
% 0.72/1.12 skaf49( X ), skaf52( X ) ) ), cons( skaf50( X ), skaf53( X ) ) ), X ) ]
% 0.72/1.12 ,
% 0.72/1.12 [ ~( segmentP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X ) ), =( app( app(
% 0.72/1.12 skaf47( X, Y ), Y ), skaf48( Y, X ) ), X ) ],
% 0.72/1.12 [ ~( memberP( X, Y ) ), ~( ssItem( Y ) ), ~( ssList( X ) ), =( app(
% 0.72/1.12 skaf42( X, Y ), cons( Y, skaf43( Y, X ) ) ), X ) ],
% 0.72/1.12 [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ), ~( ssItem( X )
% 0.72/1.12 ), ~( ssList( T ) ), ~( ssList( Y ) ), =( X, Z ) ],
% 0.72/1.12 [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ), ~( ssItem( X )
% 0.72/1.12 ), ~( ssList( T ) ), ~( ssList( Y ) ), =( T, Y ) ],
% 0.72/1.12 [ ~( segmentP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( T ) ), ~( ssList(
% 0.77/1.16 Y ) ), ~( ssList( X ) ), segmentP( app( app( T, X ), Z ), Y ) ],
% 0.77/1.16 [ ~( =( app( app( X, Y ), Z ), T ) ), ~( ssList( Z ) ), ~( ssList( X ) )
% 0.77/1.16 , ~( ssList( Y ) ), ~( ssList( T ) ), segmentP( T, Y ) ],
% 0.77/1.16 [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T ) ), ~(
% 0.77/1.16 ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), frontsegP( Y, T ) ]
% 0.77/1.16 ,
% 0.77/1.16 [ ~( =( app( X, cons( Y, Z ) ), T ) ), ~( ssList( Z ) ), ~( ssList( X )
% 0.77/1.16 ), ~( ssItem( Y ) ), ~( ssList( T ) ), memberP( T, Y ) ],
% 0.77/1.16 [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList( T ) ), ~(
% 0.77/1.16 ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), =( X, Z ) ],
% 0.77/1.16 [ ~( =( tl( X ), tl( Y ) ) ), ~( =( hd( X ), hd( Y ) ) ), ~( ssList( X )
% 0.77/1.16 ), ~( ssList( Y ) ), =( nil, Y ), =( X, Y ), =( nil, X ) ],
% 0.77/1.16 [ ~( frontsegP( X, Y ) ), ~( =( Z, T ) ), ~( ssList( Y ) ), ~( ssList( X
% 0.77/1.16 ) ), ~( ssItem( T ) ), ~( ssItem( Z ) ), frontsegP( cons( Z, X ), cons(
% 0.77/1.16 T, Y ) ) ],
% 0.77/1.16 [ ~( =( app( app( X, cons( Y, Z ) ), cons( Y, T ) ), U ) ), ~( ssList( T
% 0.77/1.16 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y ) ), ~(
% 0.77/1.16 duplicatefreeP( U ) ), ~( ssList( U ) ) ],
% 0.77/1.16 [ ~( =( app( X, cons( Y, cons( Z, T ) ) ), U ) ), ~( ssList( T ) ), ~(
% 0.77/1.16 ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ), ~( equalelemsP( U ) )
% 0.77/1.16 , ~( ssList( U ) ), =( Y, Z ) ],
% 0.77/1.16 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.77/1.16 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.77/1.16 ) ), ~( strictorderedP( W ) ), ~( ssList( W ) ), lt( Y, T ) ],
% 0.77/1.16 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.77/1.16 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.77/1.16 ) ), ~( totalorderedP( W ) ), ~( ssList( W ) ), leq( Y, T ) ],
% 0.77/1.16 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.77/1.16 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.77/1.16 ) ), ~( strictorderP( W ) ), ~( ssList( W ) ), lt( Y, T ), lt( T, Y ) ]
% 0.77/1.16 ,
% 0.77/1.16 [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) ), ~( ssList( U
% 0.77/1.16 ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Y
% 0.77/1.16 ) ), ~( totalorderP( W ) ), ~( ssList( W ) ), leq( Y, T ), leq( T, Y ) ]
% 0.77/1.16 ,
% 0.77/1.16 [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( =( app( app( Z, cons( X, T ) )
% 0.77/1.16 , cons( Y, U ) ), W ) ), ~( ssList( U ) ), ~( ssList( T ) ), ~( ssList( Z
% 0.77/1.16 ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), ~( cyclefreeP( W ) ), ~( ssList(
% 0.77/1.16 W ) ) ],
% 0.77/1.16 [ ssList( sk1 ) ],
% 0.77/1.16 [ ssList( sk2 ) ],
% 0.77/1.16 [ ssList( sk3 ) ],
% 0.77/1.16 [ ssList( sk4 ) ],
% 0.77/1.16 [ =( sk2, sk4 ) ],
% 0.77/1.16 [ =( sk1, sk3 ) ],
% 0.77/1.16 [ neq( sk2, nil ), neq( sk2, nil ) ],
% 0.77/1.16 [ neq( sk2, nil ), ~( neq( sk4, nil ) ) ],
% 0.77/1.16 [ neq( sk3, nil ), neq( sk2, nil ) ],
% 0.77/1.16 [ segmentP( sk4, sk3 ), neq( sk2, nil ) ],
% 0.77/1.16 [ ~( neq( sk1, nil ) ), ~( segmentP( sk2, sk1 ) ), neq( sk2, nil ) ]
% 0.77/1.16 ,
% 0.77/1.16 [ neq( sk3, nil ), ~( neq( sk4, nil ) ) ],
% 0.77/1.16 [ segmentP( sk4, sk3 ), ~( neq( sk4, nil ) ) ],
% 0.77/1.16 [ ~( neq( sk1, nil ) ), ~( segmentP( sk2, sk1 ) ), ~( neq( sk4, nil ) )
% 0.77/1.16 ]
% 0.77/1.16 ] .
% 0.77/1.16
% 0.77/1.16
% 0.77/1.16 percentage equality = 0.159539, percentage horn = 0.838542
% 0.77/1.16 This is a problem with some equality
% 0.77/1.16
% 0.77/1.16
% 0.77/1.16
% 0.77/1.16 Options Used:
% 0.77/1.16
% 0.77/1.16 useres = 1
% 0.77/1.16 useparamod = 1
% 0.77/1.16 useeqrefl = 1
% 0.77/1.16 useeqfact = 1
% 0.77/1.16 usefactor = 1
% 0.77/1.16 usesimpsplitting = 0
% 0.77/1.16 usesimpdemod = 5
% 0.77/1.16 usesimpres = 3
% 0.77/1.16
% 0.77/1.16 resimpinuse = 1000
% 0.77/1.16 resimpclauses = 20000
% 0.77/1.16 substype = eqrewr
% 0.77/1.16 backwardsubs = 1
% 0.77/1.16 selectoldest = 5
% 0.77/1.16
% 0.77/1.16 litorderings [0] = split
% 0.77/1.16 litorderings [1] = extend the termordering, first sorting on arguments
% 0.77/1.16
% 0.77/1.16 termordering = kbo
% 0.77/1.16
% 0.77/1.16 litapriori = 0
% 0.77/1.16 termapriori = 1
% 0.77/1.16 litaposteriori = 0
% 0.77/1.16 termaposteriori = 0
% 0.77/1.16 demodaposteriori = 0
% 0.77/1.16 ordereqreflfact = 0
% 0.77/1.16
% 0.77/1.16 litselect = negord
% 0.77/1.16
% 0.77/1.16 maxweight = 15
% 0.77/1.16 maxdepth = 30000
% 0.77/1.16 maxlength = 115
% 0.77/1.16 maxnrvars = 195
% 0.77/1.16 excuselevel = 1
% 0.77/1.16 increasemaxweight = 1
% 0.77/1.16
% 0.77/1.16 maxselected = 10000000
% 0.77/1.16 maxnrclauses = 10000000
% 0.77/1.16
% 0.77/1.16 showgenerated = 0
% 0.77/1.16 showkept = 0
% 0.77/1.16 showselected = 0
% 0.77/1.16 showdeleted = 0
% 0.77/1.16 showresimp = 1
% 0.77/1.16 showstatus = 2000
% 2.30/2.66
% 2.30/2.66 prologoutput = 1
% 2.30/2.66 nrgoals = 5000000
% 2.30/2.66 totalproof = 1
% 2.30/2.66
% 2.30/2.66 Symbols occurring in the translation:
% 2.30/2.66
% 2.30/2.66 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 2.30/2.66 . [1, 2] (w:1, o:75, a:1, s:1, b:0),
% 2.30/2.66 ! [4, 1] (w:0, o:22, a:1, s:1, b:0),
% 2.30/2.66 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 2.30/2.66 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 2.30/2.66 nil [39, 0] (w:1, o:15, a:1, s:1, b:0),
% 2.30/2.66 equalelemsP [40, 1] (w:1, o:29, a:1, s:1, b:0),
% 2.30/2.66 duplicatefreeP [41, 1] (w:1, o:28, a:1, s:1, b:0),
% 2.30/2.66 strictorderedP [42, 1] (w:1, o:32, a:1, s:1, b:0),
% 2.30/2.66 totalorderedP [43, 1] (w:1, o:71, a:1, s:1, b:0),
% 2.30/2.66 strictorderP [44, 1] (w:1, o:33, a:1, s:1, b:0),
% 2.30/2.66 totalorderP [45, 1] (w:1, o:72, a:1, s:1, b:0),
% 2.30/2.66 cyclefreeP [46, 1] (w:1, o:27, a:1, s:1, b:0),
% 2.30/2.66 ssList [47, 1] (w:1, o:30, a:1, s:1, b:0),
% 2.30/2.66 skac3 [48, 0] (w:1, o:6, a:1, s:1, b:0),
% 2.30/2.66 ssItem [49, 1] (w:1, o:31, a:1, s:1, b:0),
% 2.30/2.66 skac2 [50, 0] (w:1, o:5, a:1, s:1, b:0),
% 2.30/2.66 singletonP [51, 1] (w:1, o:34, a:1, s:1, b:0),
% 2.30/2.66 skaf83 [53, 1] (w:1, o:70, a:1, s:1, b:0),
% 2.30/2.66 skaf82 [54, 1] (w:1, o:69, a:1, s:1, b:0),
% 2.30/2.66 skaf81 [55, 1] (w:1, o:68, a:1, s:1, b:0),
% 2.30/2.66 skaf80 [56, 1] (w:1, o:67, a:1, s:1, b:0),
% 2.30/2.66 skaf79 [57, 1] (w:1, o:66, a:1, s:1, b:0),
% 2.30/2.66 skaf78 [58, 1] (w:1, o:65, a:1, s:1, b:0),
% 2.30/2.66 skaf77 [59, 1] (w:1, o:64, a:1, s:1, b:0),
% 2.30/2.66 skaf76 [60, 1] (w:1, o:63, a:1, s:1, b:0),
% 2.30/2.66 skaf75 [61, 1] (w:1, o:62, a:1, s:1, b:0),
% 2.30/2.66 skaf74 [62, 1] (w:1, o:61, a:1, s:1, b:0),
% 2.30/2.66 skaf73 [63, 1] (w:1, o:60, a:1, s:1, b:0),
% 2.30/2.66 skaf72 [64, 1] (w:1, o:59, a:1, s:1, b:0),
% 2.30/2.66 skaf71 [65, 1] (w:1, o:58, a:1, s:1, b:0),
% 2.30/2.66 skaf70 [66, 1] (w:1, o:57, a:1, s:1, b:0),
% 2.30/2.66 skaf69 [67, 1] (w:1, o:56, a:1, s:1, b:0),
% 2.30/2.66 skaf68 [68, 1] (w:1, o:55, a:1, s:1, b:0),
% 2.30/2.66 skaf67 [69, 1] (w:1, o:54, a:1, s:1, b:0),
% 2.30/2.66 skaf66 [70, 1] (w:1, o:53, a:1, s:1, b:0),
% 2.30/2.66 skaf65 [71, 1] (w:1, o:52, a:1, s:1, b:0),
% 2.30/2.66 skaf64 [72, 1] (w:1, o:51, a:1, s:1, b:0),
% 2.30/2.66 skaf63 [73, 1] (w:1, o:50, a:1, s:1, b:0),
% 2.30/2.66 skaf62 [74, 1] (w:1, o:49, a:1, s:1, b:0),
% 2.30/2.66 skaf61 [75, 1] (w:1, o:48, a:1, s:1, b:0),
% 2.30/2.66 skaf60 [76, 1] (w:1, o:47, a:1, s:1, b:0),
% 2.30/2.66 skaf59 [77, 1] (w:1, o:46, a:1, s:1, b:0),
% 2.30/2.66 skaf58 [78, 1] (w:1, o:45, a:1, s:1, b:0),
% 2.30/2.66 skaf57 [79, 1] (w:1, o:44, a:1, s:1, b:0),
% 2.30/2.66 skaf56 [80, 1] (w:1, o:43, a:1, s:1, b:0),
% 2.30/2.66 skaf55 [81, 1] (w:1, o:42, a:1, s:1, b:0),
% 2.30/2.66 skaf54 [82, 1] (w:1, o:41, a:1, s:1, b:0),
% 2.30/2.66 skaf53 [83, 1] (w:1, o:40, a:1, s:1, b:0),
% 2.30/2.66 skaf52 [84, 1] (w:1, o:39, a:1, s:1, b:0),
% 2.30/2.66 skaf51 [85, 1] (w:1, o:38, a:1, s:1, b:0),
% 2.30/2.66 skaf50 [86, 1] (w:1, o:37, a:1, s:1, b:0),
% 2.30/2.66 skaf49 [87, 1] (w:1, o:35, a:1, s:1, b:0),
% 2.30/2.66 skaf44 [88, 1] (w:1, o:36, a:1, s:1, b:0),
% 2.30/2.66 skaf48 [90, 2] (w:1, o:104, a:1, s:1, b:0),
% 2.30/2.66 skaf47 [91, 2] (w:1, o:103, a:1, s:1, b:0),
% 2.30/2.66 skaf46 [92, 2] (w:1, o:102, a:1, s:1, b:0),
% 2.30/2.66 skaf45 [93, 2] (w:1, o:101, a:1, s:1, b:0),
% 2.30/2.66 skaf43 [94, 2] (w:1, o:106, a:1, s:1, b:0),
% 2.30/2.66 skaf42 [95, 2] (w:1, o:105, a:1, s:1, b:0),
% 2.30/2.66 geq [96, 2] (w:1, o:108, a:1, s:1, b:0),
% 2.30/2.66 segmentP [97, 2] (w:1, o:109, a:1, s:1, b:0),
% 2.30/2.66 rearsegP [98, 2] (w:1, o:100, a:1, s:1, b:0),
% 2.30/2.66 frontsegP [99, 2] (w:1, o:107, a:1, s:1, b:0),
% 2.30/2.66 leq [100, 2] (w:1, o:110, a:1, s:1, b:0),
% 2.30/2.66 lt [101, 2] (w:1, o:111, a:1, s:1, b:0),
% 2.30/2.66 cons [102, 2] (w:1, o:112, a:1, s:1, b:0),
% 2.30/2.66 memberP [103, 2] (w:1, o:113, a:1, s:1, b:0),
% 2.30/2.66 app [104, 2] (w:1, o:114, a:1, s:1, b:0),
% 2.30/2.66 tl [105, 1] (w:1, o:73, a:1, s:1, b:0),
% 2.30/2.66 hd [106, 1] (w:1, o:74, a:1, s:1, b:0),
% 2.30/2.66 neq [107, 2] (w:1, o:115, a:1, s:1, b:0),
% 2.30/2.66 gt [108, 2] (w:1, o:116, a:1, s:1, b:0),
% 2.30/2.66 sk1 [113, 0] (w:1, o:7, a:1, s:1, b:0),
% 2.30/2.66 sk2 [114, 0] (w:1, o:8, a:1, s:1, b:0),
% 2.30/2.66 sk3 [115, 0] (w:1, o:9, a:1, s:1, b:0),
% 2.30/2.66 sk4 [116, 0] (w:1, o:10, a:1, s:1, b:0).
% 2.30/2.66
% 2.30/2.66
% 2.30/2.66 Starting Search:
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66
% 2.30/2.66 Intermediate Status:
% 2.30/2.66 Generated: 4085
% 2.30/2.66 Kept: 2001
% 2.30/2.66 Inuse: 206
% 2.30/2.66 Deleted: 2
% 2.30/2.66 Deletedinuse: 0
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66
% 2.30/2.66 Intermediate Status:
% 2.30/2.66 Generated: 9100
% 2.30/2.66 Kept: 4702
% 2.30/2.66 Inuse: 294
% 2.30/2.66 Deleted: 2
% 2.30/2.66 Deletedinuse: 0
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66
% 2.30/2.66 Intermediate Status:
% 2.30/2.66 Generated: 15267
% 2.30/2.66 Kept: 7139
% 2.30/2.66 Inuse: 373
% 2.30/2.66 Deleted: 3
% 2.30/2.66 Deletedinuse: 0
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66
% 2.30/2.66 Intermediate Status:
% 2.30/2.66 Generated: 21277
% 2.30/2.66 Kept: 9166
% 2.30/2.66 Inuse: 392
% 2.30/2.66 Deleted: 4
% 2.30/2.66 Deletedinuse: 0
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66
% 2.30/2.66 Intermediate Status:
% 2.30/2.66 Generated: 37640
% 2.30/2.66 Kept: 11179
% 2.30/2.66 Inuse: 442
% 2.30/2.66 Deleted: 6
% 2.30/2.66 Deletedinuse: 2
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66
% 2.30/2.66 Intermediate Status:
% 2.30/2.66 Generated: 46027
% 2.30/2.66 Kept: 13209
% 2.30/2.66 Inuse: 492
% 2.30/2.66 Deleted: 6
% 2.30/2.66 Deletedinuse: 2
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66
% 2.30/2.66 Intermediate Status:
% 2.30/2.66 Generated: 55202
% 2.30/2.66 Kept: 15462
% 2.30/2.66 Inuse: 527
% 2.30/2.66 Deleted: 6
% 2.30/2.66 Deletedinuse: 2
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66
% 2.30/2.66 Intermediate Status:
% 2.30/2.66 Generated: 63938
% 2.30/2.66 Kept: 17485
% 2.30/2.66 Inuse: 557
% 2.30/2.66 Deleted: 7
% 2.30/2.66 Deletedinuse: 3
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66
% 2.30/2.66 Intermediate Status:
% 2.30/2.66 Generated: 75366
% 2.30/2.66 Kept: 19640
% 2.30/2.66 Inuse: 587
% 2.30/2.66 Deleted: 8
% 2.30/2.66 Deletedinuse: 4
% 2.30/2.66
% 2.30/2.66 Resimplifying inuse:
% 2.30/2.66 Done
% 2.30/2.66
% 2.30/2.66 Resimplifying clauses:
% 2.30/2.66
% 2.30/2.66 Bliksems!, er is een bewijs:
% 2.30/2.66 % SZS status Unsatisfiable
% 2.30/2.66 % SZS output start Refutation
% 2.30/2.66
% 2.30/2.66 clause( 186, [ =( sk4, sk2 ) ] )
% 2.30/2.66 .
% 2.30/2.66 clause( 187, [ =( sk3, sk1 ) ] )
% 2.30/2.66 .
% 2.30/2.66 clause( 188, [ neq( sk2, nil ) ] )
% 2.30/2.66 .
% 2.30/2.66 clause( 189, [ neq( sk1, nil ) ] )
% 2.30/2.66 .
% 2.30/2.66 clause( 190, [ segmentP( sk2, sk1 ) ] )
% 2.30/2.66 .
% 2.30/2.66 clause( 191, [ ~( segmentP( sk2, sk1 ) ), ~( neq( sk2, nil ) ) ] )
% 2.30/2.66 .
% 2.30/2.66 clause( 20168, [] )
% 2.30/2.66 .
% 2.30/2.66
% 2.30/2.66
% 2.30/2.66 % SZS output end Refutation
% 2.30/2.66 found a proof!
% 2.30/2.66
% 2.30/2.66 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 2.30/2.66
% 2.30/2.66 initialclauses(
% 2.30/2.66 [ clause( 20170, [ equalelemsP( nil ) ] )
% 2.30/2.66 , clause( 20171, [ duplicatefreeP( nil ) ] )
% 2.30/2.66 , clause( 20172, [ strictorderedP( nil ) ] )
% 2.30/2.66 , clause( 20173, [ totalorderedP( nil ) ] )
% 2.30/2.66 , clause( 20174, [ strictorderP( nil ) ] )
% 2.30/2.66 , clause( 20175, [ totalorderP( nil ) ] )
% 2.30/2.66 , clause( 20176, [ cyclefreeP( nil ) ] )
% 2.30/2.66 , clause( 20177, [ ssList( nil ) ] )
% 2.30/2.66 , clause( 20178, [ ssItem( skac3 ) ] )
% 2.30/2.66 , clause( 20179, [ ssItem( skac2 ) ] )
% 2.30/2.66 , clause( 20180, [ ~( singletonP( nil ) ) ] )
% 2.30/2.66 , clause( 20181, [ ssItem( skaf83( X ) ) ] )
% 2.30/2.66 , clause( 20182, [ ssList( skaf82( X ) ) ] )
% 2.30/2.66 , clause( 20183, [ ssList( skaf81( X ) ) ] )
% 2.30/2.66 , clause( 20184, [ ssList( skaf80( X ) ) ] )
% 2.30/2.66 , clause( 20185, [ ssItem( skaf79( X ) ) ] )
% 2.30/2.66 , clause( 20186, [ ssItem( skaf78( X ) ) ] )
% 2.30/2.66 , clause( 20187, [ ssList( skaf77( X ) ) ] )
% 2.30/2.66 , clause( 20188, [ ssList( skaf76( X ) ) ] )
% 2.30/2.66 , clause( 20189, [ ssList( skaf75( X ) ) ] )
% 2.30/2.66 , clause( 20190, [ ssItem( skaf74( X ) ) ] )
% 2.30/2.66 , clause( 20191, [ ssList( skaf73( X ) ) ] )
% 2.30/2.66 , clause( 20192, [ ssList( skaf72( X ) ) ] )
% 2.30/2.66 , clause( 20193, [ ssList( skaf71( X ) ) ] )
% 2.30/2.66 , clause( 20194, [ ssItem( skaf70( X ) ) ] )
% 2.30/2.66 , clause( 20195, [ ssItem( skaf69( X ) ) ] )
% 2.30/2.66 , clause( 20196, [ ssList( skaf68( X ) ) ] )
% 2.30/2.66 , clause( 20197, [ ssList( skaf67( X ) ) ] )
% 2.30/2.66 , clause( 20198, [ ssList( skaf66( X ) ) ] )
% 2.30/2.66 , clause( 20199, [ ssItem( skaf65( X ) ) ] )
% 2.30/2.66 , clause( 20200, [ ssItem( skaf64( X ) ) ] )
% 2.30/2.66 , clause( 20201, [ ssList( skaf63( X ) ) ] )
% 2.30/2.66 , clause( 20202, [ ssList( skaf62( X ) ) ] )
% 2.30/2.66 , clause( 20203, [ ssList( skaf61( X ) ) ] )
% 2.30/2.66 , clause( 20204, [ ssItem( skaf60( X ) ) ] )
% 2.30/2.66 , clause( 20205, [ ssItem( skaf59( X ) ) ] )
% 2.30/2.66 , clause( 20206, [ ssList( skaf58( X ) ) ] )
% 2.30/2.66 , clause( 20207, [ ssList( skaf57( X ) ) ] )
% 2.30/2.66 , clause( 20208, [ ssList( skaf56( X ) ) ] )
% 2.30/2.66 , clause( 20209, [ ssItem( skaf55( X ) ) ] )
% 2.30/2.66 , clause( 20210, [ ssItem( skaf54( X ) ) ] )
% 2.30/2.66 , clause( 20211, [ ssList( skaf53( X ) ) ] )
% 2.30/2.66 , clause( 20212, [ ssList( skaf52( X ) ) ] )
% 2.30/2.66 , clause( 20213, [ ssList( skaf51( X ) ) ] )
% 2.30/2.66 , clause( 20214, [ ssItem( skaf50( X ) ) ] )
% 2.30/2.66 , clause( 20215, [ ssItem( skaf49( X ) ) ] )
% 2.30/2.66 , clause( 20216, [ ssItem( skaf44( X ) ) ] )
% 2.30/2.66 , clause( 20217, [ ssList( skaf48( X, Y ) ) ] )
% 2.30/2.66 , clause( 20218, [ ssList( skaf47( X, Y ) ) ] )
% 2.30/2.66 , clause( 20219, [ ssList( skaf46( X, Y ) ) ] )
% 2.30/2.66 , clause( 20220, [ ssList( skaf45( X, Y ) ) ] )
% 2.30/2.66 , clause( 20221, [ ssList( skaf43( X, Y ) ) ] )
% 2.30/2.66 , clause( 20222, [ ssList( skaf42( X, Y ) ) ] )
% 2.30/2.66 , clause( 20223, [ ~( =( skac3, skac2 ) ) ] )
% 2.30/2.66 , clause( 20224, [ ~( ssItem( X ) ), geq( X, X ) ] )
% 2.30/2.66 , clause( 20225, [ ~( ssList( X ) ), segmentP( X, nil ) ] )
% 2.30/2.66 , clause( 20226, [ ~( ssList( X ) ), segmentP( X, X ) ] )
% 2.30/2.66 , clause( 20227, [ ~( ssList( X ) ), rearsegP( X, nil ) ] )
% 2.30/2.66 , clause( 20228, [ ~( ssList( X ) ), rearsegP( X, X ) ] )
% 2.30/2.66 , clause( 20229, [ ~( ssList( X ) ), frontsegP( X, nil ) ] )
% 2.30/2.66 , clause( 20230, [ ~( ssList( X ) ), frontsegP( X, X ) ] )
% 2.30/2.66 , clause( 20231, [ ~( ssItem( X ) ), leq( X, X ) ] )
% 2.30/2.66 , clause( 20232, [ ~( lt( X, X ) ), ~( ssItem( X ) ) ] )
% 2.30/2.66 , clause( 20233, [ ~( ssItem( X ) ), equalelemsP( cons( X, nil ) ) ] )
% 2.30/2.66 , clause( 20234, [ ~( ssItem( X ) ), duplicatefreeP( cons( X, nil ) ) ] )
% 2.30/2.66 , clause( 20235, [ ~( ssItem( X ) ), strictorderedP( cons( X, nil ) ) ] )
% 2.30/2.66 , clause( 20236, [ ~( ssItem( X ) ), totalorderedP( cons( X, nil ) ) ] )
% 2.30/2.66 , clause( 20237, [ ~( ssItem( X ) ), strictorderP( cons( X, nil ) ) ] )
% 2.30/2.66 , clause( 20238, [ ~( ssItem( X ) ), totalorderP( cons( X, nil ) ) ] )
% 2.30/2.66 , clause( 20239, [ ~( ssItem( X ) ), cyclefreeP( cons( X, nil ) ) ] )
% 2.30/2.66 , clause( 20240, [ ~( memberP( nil, X ) ), ~( ssItem( X ) ) ] )
% 2.30/2.66 , clause( 20241, [ ~( ssList( X ) ), duplicatefreeP( X ), ssItem( Y ) ] )
% 2.30/2.66 , clause( 20242, [ ~( ssList( X ) ), =( app( X, nil ), X ) ] )
% 2.30/2.66 , clause( 20243, [ ~( ssList( X ) ), =( app( nil, X ), X ) ] )
% 2.30/2.66 , clause( 20244, [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ] )
% 2.30/2.66 , clause( 20245, [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ] )
% 2.30/2.66 , clause( 20246, [ ~( ssList( X ) ), ssList( tl( X ) ), =( nil, X ) ] )
% 2.30/2.66 , clause( 20247, [ ~( ssList( X ) ), ssItem( hd( X ) ), =( nil, X ) ] )
% 2.30/2.66 , clause( 20248, [ ~( =( nil, X ) ), ~( ssList( X ) ), segmentP( nil, X ) ]
% 2.30/2.66 )
% 2.30/2.66 , clause( 20249, [ ~( segmentP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 2.30/2.66 )
% 2.30/2.66 , clause( 20250, [ ~( =( nil, X ) ), ~( ssList( X ) ), rearsegP( nil, X ) ]
% 2.30/2.66 )
% 2.30/2.66 , clause( 20251, [ ~( rearsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X ) ]
% 2.30/2.66 )
% 2.30/2.66 , clause( 20252, [ ~( =( nil, X ) ), ~( ssList( X ) ), frontsegP( nil, X )
% 2.30/2.66 ] )
% 2.30/2.66 , clause( 20253, [ ~( frontsegP( nil, X ) ), ~( ssList( X ) ), =( nil, X )
% 2.30/2.66 ] )
% 2.30/2.66 , clause( 20254, [ ~( ssList( X ) ), ~( ssList( Y ) ), ssList( app( Y, X )
% 2.30/2.66 ) ] )
% 2.30/2.66 , clause( 20255, [ ~( ssItem( X ) ), ~( ssList( Y ) ), ssList( cons( X, Y )
% 2.30/2.66 ) ] )
% 2.30/2.66 , clause( 20256, [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf50( X ),
% 2.30/2.66 skaf49( X ) ) ] )
% 2.30/2.66 , clause( 20257, [ ~( ssList( X ) ), cyclefreeP( X ), leq( skaf49( X ),
% 2.30/2.66 skaf50( X ) ) ] )
% 2.30/2.66 , clause( 20258, [ ~( =( skaf79( X ), skaf78( X ) ) ), ~( ssList( X ) ),
% 2.30/2.66 equalelemsP( X ) ] )
% 2.30/2.66 , clause( 20259, [ ~( lt( skaf69( X ), skaf70( X ) ) ), ~( ssList( X ) ),
% 2.30/2.66 strictorderedP( X ) ] )
% 2.30/2.66 , clause( 20260, [ ~( leq( skaf64( X ), skaf65( X ) ) ), ~( ssList( X ) ),
% 2.30/2.66 totalorderedP( X ) ] )
% 2.30/2.66 , clause( 20261, [ ~( lt( skaf60( X ), skaf59( X ) ) ), ~( ssList( X ) ),
% 2.30/2.66 strictorderP( X ) ] )
% 2.30/2.66 , clause( 20262, [ ~( lt( skaf59( X ), skaf60( X ) ) ), ~( ssList( X ) ),
% 2.30/2.66 strictorderP( X ) ] )
% 2.30/2.66 , clause( 20263, [ ~( leq( skaf55( X ), skaf54( X ) ) ), ~( ssList( X ) ),
% 2.30/2.66 totalorderP( X ) ] )
% 2.30/2.66 , clause( 20264, [ ~( leq( skaf54( X ), skaf55( X ) ) ), ~( ssList( X ) ),
% 2.30/2.66 totalorderP( X ) ] )
% 2.30/2.66 , clause( 20265, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( tl( cons( X, Y )
% 2.30/2.66 ), Y ) ] )
% 2.30/2.66 , clause( 20266, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( hd( cons( X, Y )
% 2.30/2.66 ), X ) ] )
% 2.30/2.66 , clause( 20267, [ ~( =( cons( X, Y ), nil ) ), ~( ssItem( X ) ), ~( ssList(
% 2.30/2.66 Y ) ) ] )
% 2.30/2.66 , clause( 20268, [ ~( =( cons( X, Y ), Y ) ), ~( ssItem( X ) ), ~( ssList(
% 2.30/2.66 Y ) ) ] )
% 2.30/2.66 , clause( 20269, [ ~( ssList( X ) ), ~( ssList( Y ) ), neq( Y, X ), =( Y, X
% 2.30/2.66 ) ] )
% 2.30/2.66 , clause( 20270, [ ~( singletonP( X ) ), ~( ssList( X ) ), =( cons( skaf44(
% 2.30/2.66 X ), nil ), X ) ] )
% 2.30/2.66 , clause( 20271, [ ~( ssItem( X ) ), ~( ssItem( Y ) ), neq( Y, X ), =( Y, X
% 2.30/2.66 ) ] )
% 2.30/2.66 , clause( 20272, [ ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), leq(
% 2.30/2.66 X, Y ) ] )
% 2.30/2.66 , clause( 20273, [ ~( ssList( X ) ), =( cons( hd( X ), tl( X ) ), X ), =(
% 2.30/2.66 nil, X ) ] )
% 2.30/2.66 , clause( 20274, [ ~( gt( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 2.30/2.66 Y, X ) ] )
% 2.30/2.66 , clause( 20275, [ ~( lt( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ), gt(
% 2.30/2.66 Y, X ) ] )
% 2.30/2.66 , clause( 20276, [ ~( geq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ),
% 2.30/2.66 leq( Y, X ) ] )
% 2.30/2.66 , clause( 20277, [ ~( leq( X, Y ) ), ~( ssItem( X ) ), ~( ssItem( Y ) ),
% 2.30/2.66 geq( Y, X ) ] )
% 2.30/2.66 , clause( 20278, [ ~( ssList( X ) ), =( cons( skaf83( X ), skaf82( X ) ), X
% 2.30/2.66 ), =( nil, X ) ] )
% 2.30/2.66 , clause( 20279, [ ~( gt( X, Y ) ), ~( gt( Y, X ) ), ~( ssItem( X ) ), ~(
% 2.30/2.66 ssItem( Y ) ) ] )
% 2.30/2.66 , clause( 20280, [ ~( =( X, Y ) ), ~( lt( X, Y ) ), ~( ssItem( Y ) ), ~(
% 2.30/2.66 ssItem( X ) ) ] )
% 2.30/2.66 , clause( 20281, [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 2.30/2.66 strictorderedP( cons( Y, X ) ) ] )
% 2.30/2.66 , clause( 20282, [ ~( =( nil, X ) ), ~( ssList( X ) ), ~( ssItem( Y ) ),
% 2.30/2.66 totalorderedP( cons( Y, X ) ) ] )
% 2.30/2.66 , clause( 20283, [ ~( lt( X, Y ) ), ~( lt( Y, X ) ), ~( ssItem( X ) ), ~(
% 2.30/2.66 ssItem( Y ) ) ] )
% 2.30/2.66 , clause( 20284, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssList( Y ) ), ~(
% 2.30/2.66 ssList( X ) ) ] )
% 2.30/2.66 , clause( 20285, [ ~( =( cons( X, nil ), Y ) ), ~( ssItem( X ) ), ~( ssList(
% 2.30/2.66 Y ) ), singletonP( Y ) ] )
% 2.30/2.66 , clause( 20286, [ ~( =( X, Y ) ), ~( neq( X, Y ) ), ~( ssItem( Y ) ), ~(
% 2.30/2.66 ssItem( X ) ) ] )
% 2.30/2.66 , clause( 20287, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList(
% 2.30/2.66 X ) ), =( nil, X ) ] )
% 2.30/2.66 , clause( 20288, [ ~( =( app( X, Y ), nil ) ), ~( ssList( Y ) ), ~( ssList(
% 2.30/2.66 X ) ), =( nil, Y ) ] )
% 2.30/2.66 , clause( 20289, [ ~( ssItem( X ) ), ~( ssList( Y ) ), =( app( cons( X, nil
% 2.30/2.66 ), Y ), cons( X, Y ) ) ] )
% 2.30/2.66 , clause( 20290, [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 2.30/2.66 X, Y ), =( X, Y ) ] )
% 2.30/2.66 , clause( 20291, [ ~( leq( X, Y ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), lt(
% 2.30/2.66 X, Y ), =( X, Y ) ] )
% 2.30/2.66 , clause( 20292, [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( hd(
% 2.30/2.66 app( Y, X ) ), hd( Y ) ) ] )
% 2.30/2.66 , clause( 20293, [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ),
% 2.30/2.66 ~( ssItem( X ) ), strictorderedP( Y ), =( nil, Y ) ] )
% 2.30/2.66 , clause( 20294, [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ),
% 2.30/2.66 ~( ssItem( X ) ), totalorderedP( Y ), =( nil, Y ) ] )
% 2.30/2.66 , clause( 20295, [ ~( geq( X, Y ) ), ~( geq( Y, X ) ), ~( ssItem( X ) ),
% 2.30/2.66 ~( ssItem( Y ) ), =( Y, X ) ] )
% 2.30/2.66 , clause( 20296, [ ~( segmentP( X, Y ) ), ~( segmentP( Y, X ) ), ~( ssList(
% 2.30/2.66 X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 2.30/2.66 , clause( 20297, [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, X ) ), ~( ssList(
% 2.30/2.66 X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 2.30/2.66 , clause( 20298, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, X ) ), ~(
% 2.30/2.66 ssList( X ) ), ~( ssList( Y ) ), =( Y, X ) ] )
% 2.30/2.66 , clause( 20299, [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( ssItem( X ) ),
% 2.30/2.66 ~( ssItem( Y ) ), =( Y, X ) ] )
% 2.30/2.66 , clause( 20300, [ ~( rearsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X )
% 2.30/2.66 ), =( app( skaf46( X, Y ), Y ), X ) ] )
% 2.30/2.66 , clause( 20301, [ ~( frontsegP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X )
% 2.30/2.66 ), =( app( Y, skaf45( X, Y ) ), X ) ] )
% 2.30/2.66 , clause( 20302, [ ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( tl(
% 2.30/2.66 app( Y, X ) ), app( tl( Y ), X ) ) ] )
% 2.30/2.66 , clause( 20303, [ ~( strictorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ),
% 2.30/2.66 ~( ssItem( X ) ), lt( X, hd( Y ) ), =( nil, Y ) ] )
% 2.30/2.66 , clause( 20304, [ ~( totalorderedP( cons( X, Y ) ) ), ~( ssList( Y ) ),
% 2.30/2.66 ~( ssItem( X ) ), leq( X, hd( Y ) ), =( nil, Y ) ] )
% 2.30/2.66 , clause( 20305, [ ~( rearsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y )
% 2.30/2.66 ), ~( ssList( X ) ), rearsegP( app( Z, X ), Y ) ] )
% 2.30/2.66 , clause( 20306, [ ~( frontsegP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( Y )
% 2.30/2.66 ), ~( ssList( X ) ), frontsegP( app( X, Z ), Y ) ] )
% 2.30/2.66 , clause( 20307, [ ~( =( X, Y ) ), ~( ssList( Z ) ), ~( ssItem( Y ) ), ~(
% 2.30/2.66 ssItem( X ) ), memberP( cons( Y, Z ), X ) ] )
% 2.30/2.66 , clause( 20308, [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssItem( Z ) )
% 2.30/2.66 , ~( ssItem( Y ) ), memberP( cons( Z, X ), Y ) ] )
% 2.30/2.66 , clause( 20309, [ ~( memberP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( X ) )
% 2.30/2.66 , ~( ssItem( Y ) ), memberP( app( X, Z ), Y ) ] )
% 2.30/2.66 , clause( 20310, [ ~( memberP( X, Y ) ), ~( ssList( X ) ), ~( ssList( Z ) )
% 2.30/2.66 , ~( ssItem( Y ) ), memberP( app( Z, X ), Y ) ] )
% 2.30/2.66 , clause( 20311, [ ~( ssList( X ) ), equalelemsP( X ), =( app( skaf80( X )
% 2.30/2.66 , cons( skaf78( X ), cons( skaf79( X ), skaf81( X ) ) ) ), X ) ] )
% 2.30/2.66 , clause( 20312, [ ~( =( app( X, Y ), Z ) ), ~( ssList( X ) ), ~( ssList( Y
% 2.30/2.66 ) ), ~( ssList( Z ) ), rearsegP( Z, Y ) ] )
% 2.30/2.66 , clause( 20313, [ ~( =( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~( ssList( X
% 2.30/2.66 ) ), ~( ssList( Z ) ), frontsegP( Z, X ) ] )
% 2.30/2.66 , clause( 20314, [ ~( =( nil, X ) ), ~( =( nil, Y ) ), ~( ssList( Y ) ),
% 2.30/2.66 ~( ssList( X ) ), =( app( X, Y ), nil ) ] )
% 2.30/2.66 , clause( 20315, [ ~( gt( X, Y ) ), ~( gt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 2.30/2.66 ssItem( Y ) ), ~( ssItem( X ) ), gt( X, Z ) ] )
% 2.30/2.66 , clause( 20316, [ ~( leq( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 2.30/2.66 ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Z ) ] )
% 2.30/2.66 , clause( 20317, [ ~( geq( X, Y ) ), ~( geq( Y, Z ) ), ~( ssItem( Z ) ),
% 2.30/2.66 ~( ssItem( Y ) ), ~( ssItem( X ) ), geq( X, Z ) ] )
% 2.30/2.66 , clause( 20318, [ ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ),
% 2.30/2.66 =( app( app( Z, Y ), X ), app( Z, app( Y, X ) ) ) ] )
% 2.30/2.66 , clause( 20319, [ ~( =( app( X, Y ), app( X, Z ) ) ), ~( ssList( Y ) ),
% 2.30/2.66 ~( ssList( X ) ), ~( ssList( Z ) ), =( Y, Z ) ] )
% 2.30/2.66 , clause( 20320, [ ~( =( app( X, Y ), app( Z, Y ) ) ), ~( ssList( X ) ),
% 2.30/2.66 ~( ssList( Y ) ), ~( ssList( Z ) ), =( X, Z ) ] )
% 2.30/2.66 , clause( 20321, [ ~( segmentP( X, Y ) ), ~( segmentP( Y, Z ) ), ~( ssList(
% 2.30/2.66 Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), segmentP( X, Z ) ] )
% 2.30/2.66 , clause( 20322, [ ~( rearsegP( X, Y ) ), ~( rearsegP( Y, Z ) ), ~( ssList(
% 2.30/2.66 Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), rearsegP( X, Z ) ] )
% 2.30/2.66 , clause( 20323, [ ~( frontsegP( X, Y ) ), ~( frontsegP( Y, Z ) ), ~(
% 2.30/2.66 ssList( Z ) ), ~( ssList( Y ) ), ~( ssList( X ) ), frontsegP( X, Z ) ] )
% 2.30/2.66 , clause( 20324, [ ~( lt( X, Y ) ), ~( lt( Y, Z ) ), ~( ssItem( Z ) ), ~(
% 2.30/2.66 ssItem( Y ) ), ~( ssItem( X ) ), lt( X, Z ) ] )
% 2.30/2.66 , clause( 20325, [ ~( leq( X, Y ) ), ~( leq( Y, Z ) ), ~( ssItem( Z ) ),
% 2.30/2.66 ~( ssItem( Y ) ), ~( ssItem( X ) ), leq( X, Z ) ] )
% 2.30/2.66 , clause( 20326, [ ~( ssItem( X ) ), ~( ssList( Y ) ), ~( ssList( Z ) ),
% 2.30/2.66 =( cons( X, app( Y, Z ) ), app( cons( X, Y ), Z ) ) ] )
% 2.30/2.66 , clause( 20327, [ ~( memberP( app( X, Y ), Z ) ), ~( ssList( Y ) ), ~(
% 2.30/2.66 ssList( X ) ), ~( ssItem( Z ) ), memberP( Y, Z ), memberP( X, Z ) ] )
% 2.30/2.66 , clause( 20328, [ ~( leq( X, hd( Y ) ) ), ~( totalorderedP( Y ) ), ~(
% 2.30/2.66 ssList( Y ) ), ~( ssItem( X ) ), totalorderedP( cons( X, Y ) ), =( nil, Y
% 2.30/2.66 ) ] )
% 2.30/2.66 , clause( 20329, [ ~( lt( X, hd( Y ) ) ), ~( strictorderedP( Y ) ), ~(
% 2.30/2.66 ssList( Y ) ), ~( ssItem( X ) ), strictorderedP( cons( X, Y ) ), =( nil,
% 2.30/2.66 Y ) ] )
% 2.30/2.66 , clause( 20330, [ ~( memberP( cons( X, Y ), Z ) ), ~( ssList( Y ) ), ~(
% 2.30/2.66 ssItem( X ) ), ~( ssItem( Z ) ), memberP( Y, Z ), =( Z, X ) ] )
% 2.30/2.66 , clause( 20331, [ ~( ssList( X ) ), duplicatefreeP( X ), =( app( app(
% 2.30/2.66 skaf75( X ), cons( skaf74( X ), skaf76( X ) ) ), cons( skaf74( X ),
% 2.30/2.66 skaf77( X ) ) ), X ) ] )
% 2.30/2.66 , clause( 20332, [ ~( ssList( X ) ), strictorderedP( X ), =( app( app(
% 2.30/2.66 skaf71( X ), cons( skaf69( X ), skaf72( X ) ) ), cons( skaf70( X ),
% 2.30/2.66 skaf73( X ) ) ), X ) ] )
% 2.30/2.66 , clause( 20333, [ ~( ssList( X ) ), totalorderedP( X ), =( app( app(
% 2.30/2.66 skaf66( X ), cons( skaf64( X ), skaf67( X ) ) ), cons( skaf65( X ),
% 2.30/2.66 skaf68( X ) ) ), X ) ] )
% 2.30/2.66 , clause( 20334, [ ~( ssList( X ) ), strictorderP( X ), =( app( app( skaf61(
% 2.30/2.66 X ), cons( skaf59( X ), skaf62( X ) ) ), cons( skaf60( X ), skaf63( X ) )
% 2.30/2.66 ), X ) ] )
% 2.30/2.66 , clause( 20335, [ ~( ssList( X ) ), totalorderP( X ), =( app( app( skaf56(
% 2.30/2.66 X ), cons( skaf54( X ), skaf57( X ) ) ), cons( skaf55( X ), skaf58( X ) )
% 2.30/2.66 ), X ) ] )
% 2.30/2.66 , clause( 20336, [ ~( ssList( X ) ), cyclefreeP( X ), =( app( app( skaf51(
% 2.30/2.66 X ), cons( skaf49( X ), skaf52( X ) ) ), cons( skaf50( X ), skaf53( X ) )
% 2.30/2.66 ), X ) ] )
% 2.30/2.66 , clause( 20337, [ ~( segmentP( X, Y ) ), ~( ssList( Y ) ), ~( ssList( X )
% 2.30/2.66 ), =( app( app( skaf47( X, Y ), Y ), skaf48( Y, X ) ), X ) ] )
% 2.30/2.66 , clause( 20338, [ ~( memberP( X, Y ) ), ~( ssItem( Y ) ), ~( ssList( X ) )
% 2.30/2.66 , =( app( skaf42( X, Y ), cons( Y, skaf43( Y, X ) ) ), X ) ] )
% 2.30/2.66 , clause( 20339, [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ),
% 2.30/2.66 ~( ssItem( X ) ), ~( ssList( T ) ), ~( ssList( Y ) ), =( X, Z ) ] )
% 2.30/2.67 , clause( 20340, [ ~( =( cons( X, Y ), cons( Z, T ) ) ), ~( ssItem( Z ) ),
% 2.30/2.67 ~( ssItem( X ) ), ~( ssList( T ) ), ~( ssList( Y ) ), =( T, Y ) ] )
% 2.30/2.67 , clause( 20341, [ ~( segmentP( X, Y ) ), ~( ssList( Z ) ), ~( ssList( T )
% 2.30/2.67 ), ~( ssList( Y ) ), ~( ssList( X ) ), segmentP( app( app( T, X ), Z ),
% 2.30/2.67 Y ) ] )
% 2.30/2.67 , clause( 20342, [ ~( =( app( app( X, Y ), Z ), T ) ), ~( ssList( Z ) ),
% 2.30/2.67 ~( ssList( X ) ), ~( ssList( Y ) ), ~( ssList( T ) ), segmentP( T, Y ) ]
% 2.30/2.67 )
% 2.30/2.67 , clause( 20343, [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList(
% 2.30/2.67 T ) ), ~( ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), frontsegP( Y
% 2.30/2.67 , T ) ] )
% 2.30/2.67 , clause( 20344, [ ~( =( app( X, cons( Y, Z ) ), T ) ), ~( ssList( Z ) ),
% 2.30/2.67 ~( ssList( X ) ), ~( ssItem( Y ) ), ~( ssList( T ) ), memberP( T, Y ) ]
% 2.30/2.67 )
% 2.30/2.67 , clause( 20345, [ ~( frontsegP( cons( X, Y ), cons( Z, T ) ) ), ~( ssList(
% 2.30/2.67 T ) ), ~( ssList( Y ) ), ~( ssItem( Z ) ), ~( ssItem( X ) ), =( X, Z ) ]
% 2.30/2.67 )
% 2.30/2.67 , clause( 20346, [ ~( =( tl( X ), tl( Y ) ) ), ~( =( hd( X ), hd( Y ) ) ),
% 2.30/2.67 ~( ssList( X ) ), ~( ssList( Y ) ), =( nil, Y ), =( X, Y ), =( nil, X ) ]
% 2.30/2.67 )
% 2.30/2.67 , clause( 20347, [ ~( frontsegP( X, Y ) ), ~( =( Z, T ) ), ~( ssList( Y ) )
% 2.30/2.67 , ~( ssList( X ) ), ~( ssItem( T ) ), ~( ssItem( Z ) ), frontsegP( cons(
% 2.30/2.67 Z, X ), cons( T, Y ) ) ] )
% 2.30/2.67 , clause( 20348, [ ~( =( app( app( X, cons( Y, Z ) ), cons( Y, T ) ), U ) )
% 2.30/2.67 , ~( ssList( T ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( Y ) )
% 2.30/2.67 , ~( duplicatefreeP( U ) ), ~( ssList( U ) ) ] )
% 2.30/2.67 , clause( 20349, [ ~( =( app( X, cons( Y, cons( Z, T ) ) ), U ) ), ~(
% 2.30/2.67 ssList( T ) ), ~( ssList( X ) ), ~( ssItem( Z ) ), ~( ssItem( Y ) ), ~(
% 2.30/2.67 equalelemsP( U ) ), ~( ssList( U ) ), =( Y, Z ) ] )
% 2.30/2.67 , clause( 20350, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 2.30/2.67 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 2.30/2.67 , ~( ssItem( Y ) ), ~( strictorderedP( W ) ), ~( ssList( W ) ), lt( Y, T
% 2.30/2.67 ) ] )
% 2.30/2.67 , clause( 20351, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 2.30/2.67 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 2.30/2.67 , ~( ssItem( Y ) ), ~( totalorderedP( W ) ), ~( ssList( W ) ), leq( Y, T
% 2.30/2.67 ) ] )
% 2.30/2.67 , clause( 20352, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 2.30/2.67 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 2.30/2.67 , ~( ssItem( Y ) ), ~( strictorderP( W ) ), ~( ssList( W ) ), lt( Y, T )
% 2.30/2.67 , lt( T, Y ) ] )
% 2.30/2.67 , clause( 20353, [ ~( =( app( app( X, cons( Y, Z ) ), cons( T, U ) ), W ) )
% 2.30/2.67 , ~( ssList( U ) ), ~( ssList( Z ) ), ~( ssList( X ) ), ~( ssItem( T ) )
% 2.30/2.67 , ~( ssItem( Y ) ), ~( totalorderP( W ) ), ~( ssList( W ) ), leq( Y, T )
% 2.30/2.67 , leq( T, Y ) ] )
% 2.30/2.67 , clause( 20354, [ ~( leq( X, Y ) ), ~( leq( Y, X ) ), ~( =( app( app( Z,
% 2.30/2.67 cons( X, T ) ), cons( Y, U ) ), W ) ), ~( ssList( U ) ), ~( ssList( T ) )
% 2.30/2.67 , ~( ssList( Z ) ), ~( ssItem( Y ) ), ~( ssItem( X ) ), ~( cyclefreeP( W
% 2.30/2.67 ) ), ~( ssList( W ) ) ] )
% 2.30/2.67 , clause( 20355, [ ssList( sk1 ) ] )
% 2.30/2.67 , clause( 20356, [ ssList( sk2 ) ] )
% 2.30/2.67 , clause( 20357, [ ssList( sk3 ) ] )
% 2.30/2.67 , clause( 20358, [ ssList( sk4 ) ] )
% 2.30/2.67 , clause( 20359, [ =( sk2, sk4 ) ] )
% 2.30/2.67 , clause( 20360, [ =( sk1, sk3 ) ] )
% 2.30/2.67 , clause( 20361, [ neq( sk2, nil ), neq( sk2, nil ) ] )
% 2.30/2.67 , clause( 20362, [ neq( sk2, nil ), ~( neq( sk4, nil ) ) ] )
% 2.30/2.67 , clause( 20363, [ neq( sk3, nil ), neq( sk2, nil ) ] )
% 2.30/2.67 , clause( 20364, [ segmentP( sk4, sk3 ), neq( sk2, nil ) ] )
% 2.30/2.67 , clause( 20365, [ ~( neq( sk1, nil ) ), ~( segmentP( sk2, sk1 ) ), neq(
% 2.30/2.67 sk2, nil ) ] )
% 2.30/2.67 , clause( 20366, [ neq( sk3, nil ), ~( neq( sk4, nil ) ) ] )
% 2.30/2.67 , clause( 20367, [ segmentP( sk4, sk3 ), ~( neq( sk4, nil ) ) ] )
% 2.30/2.67 , clause( 20368, [ ~( neq( sk1, nil ) ), ~( segmentP( sk2, sk1 ) ), ~( neq(
% 2.30/2.67 sk4, nil ) ) ] )
% 2.30/2.67 ] ).
% 2.30/2.67
% 2.30/2.67
% 2.30/2.67
% 2.30/2.67 eqswap(
% 2.30/2.67 clause( 21126, [ =( sk4, sk2 ) ] )
% 2.30/2.67 , clause( 20359, [ =( sk2, sk4 ) ] )
% 2.30/2.67 , 0, substitution( 0, [] )).
% 2.30/2.67
% 2.30/2.67
% 2.30/2.67 subsumption(
% 2.30/2.67 clause( 186, [ =( sk4, sk2 ) ] )
% 2.30/2.67 , clause( 21126, [ =( sk4, sk2 ) ] )
% 2.30/2.67 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.30/2.67
% 2.30/2.67
% 2.30/2.67 eqswap(
% 2.30/2.67 clause( 21885, [ =( sk3, sk1 ) ] )
% 2.30/2.67 , clause( 20360, [ =( sk1, sk3 ) ] )
% 2.30/2.67 , 0, substitution( 0, [] )).
% 2.30/2.67
% 2.30/2.67
% 2.30/2.67 subsumption(
% 2.30/2.67 clause( 187, [ =( sk3, sk1 ) ] )
% 2.30/2.70 , clause( 21885, [ =( sk3, sk1 ) ] )
% 2.30/2.70 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 factor(
% 2.30/2.70 clause( 22651, [ neq( sk2, nil ) ] )
% 2.30/2.70 , clause( 20361, [ neq( sk2, nil ), neq( sk2, nil ) ] )
% 2.30/2.70 , 0, 1, substitution( 0, [] )).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 subsumption(
% 2.30/2.70 clause( 188, [ neq( sk2, nil ) ] )
% 2.30/2.70 , clause( 22651, [ neq( sk2, nil ) ] )
% 2.30/2.70 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 paramod(
% 2.30/2.70 clause( 23818, [ neq( sk1, nil ), ~( neq( sk4, nil ) ) ] )
% 2.30/2.70 , clause( 187, [ =( sk3, sk1 ) ] )
% 2.30/2.70 , 0, clause( 20366, [ neq( sk3, nil ), ~( neq( sk4, nil ) ) ] )
% 2.30/2.70 , 0, 1, substitution( 0, [] ), substitution( 1, [] )).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 paramod(
% 2.30/2.70 clause( 23819, [ ~( neq( sk2, nil ) ), neq( sk1, nil ) ] )
% 2.30/2.70 , clause( 186, [ =( sk4, sk2 ) ] )
% 2.30/2.70 , 0, clause( 23818, [ neq( sk1, nil ), ~( neq( sk4, nil ) ) ] )
% 2.30/2.70 , 1, 2, substitution( 0, [] ), substitution( 1, [] )).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 resolution(
% 2.30/2.70 clause( 23820, [ neq( sk1, nil ) ] )
% 2.30/2.70 , clause( 23819, [ ~( neq( sk2, nil ) ), neq( sk1, nil ) ] )
% 2.30/2.70 , 0, clause( 188, [ neq( sk2, nil ) ] )
% 2.30/2.70 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 subsumption(
% 2.30/2.70 clause( 189, [ neq( sk1, nil ) ] )
% 2.30/2.70 , clause( 23820, [ neq( sk1, nil ) ] )
% 2.30/2.70 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 paramod(
% 2.30/2.70 clause( 25188, [ ~( neq( sk2, nil ) ), segmentP( sk4, sk3 ) ] )
% 2.30/2.70 , clause( 186, [ =( sk4, sk2 ) ] )
% 2.30/2.70 , 0, clause( 20367, [ segmentP( sk4, sk3 ), ~( neq( sk4, nil ) ) ] )
% 2.30/2.70 , 1, 2, substitution( 0, [] ), substitution( 1, [] )).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 paramod(
% 2.30/2.70 clause( 25190, [ segmentP( sk2, sk3 ), ~( neq( sk2, nil ) ) ] )
% 2.30/2.70 , clause( 186, [ =( sk4, sk2 ) ] )
% 2.30/2.70 , 0, clause( 25188, [ ~( neq( sk2, nil ) ), segmentP( sk4, sk3 ) ] )
% 2.30/2.70 , 1, 1, substitution( 0, [] ), substitution( 1, [] )).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 paramod(
% 2.30/2.70 clause( 25191, [ segmentP( sk2, sk1 ), ~( neq( sk2, nil ) ) ] )
% 2.30/2.70 , clause( 187, [ =( sk3, sk1 ) ] )
% 2.30/2.70 , 0, clause( 25190, [ segmentP( sk2, sk3 ), ~( neq( sk2, nil ) ) ] )
% 2.30/2.70 , 0, 2, substitution( 0, [] ), substitution( 1, [] )).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 resolution(
% 2.30/2.70 clause( 25192, [ segmentP( sk2, sk1 ) ] )
% 2.30/2.70 , clause( 25191, [ segmentP( sk2, sk1 ), ~( neq( sk2, nil ) ) ] )
% 2.30/2.70 , 1, clause( 188, [ neq( sk2, nil ) ] )
% 2.30/2.70 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 subsumption(
% 2.30/2.70 clause( 190, [ segmentP( sk2, sk1 ) ] )
% 2.30/2.70 , clause( 25192, [ segmentP( sk2, sk1 ) ] )
% 2.30/2.70 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 paramod(
% 2.30/2.70 clause( 26167, [ ~( neq( sk2, nil ) ), ~( neq( sk1, nil ) ), ~( segmentP(
% 2.30/2.70 sk2, sk1 ) ) ] )
% 2.30/2.70 , clause( 186, [ =( sk4, sk2 ) ] )
% 2.30/2.70 , 0, clause( 20368, [ ~( neq( sk1, nil ) ), ~( segmentP( sk2, sk1 ) ), ~(
% 2.30/2.70 neq( sk4, nil ) ) ] )
% 2.30/2.70 , 2, 2, substitution( 0, [] ), substitution( 1, [] )).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 resolution(
% 2.30/2.70 clause( 26168, [ ~( neq( sk2, nil ) ), ~( segmentP( sk2, sk1 ) ) ] )
% 2.30/2.70 , clause( 26167, [ ~( neq( sk2, nil ) ), ~( neq( sk1, nil ) ), ~( segmentP(
% 2.30/2.70 sk2, sk1 ) ) ] )
% 2.30/2.70 , 1, clause( 189, [ neq( sk1, nil ) ] )
% 2.30/2.70 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 subsumption(
% 2.30/2.70 clause( 191, [ ~( segmentP( sk2, sk1 ) ), ~( neq( sk2, nil ) ) ] )
% 2.30/2.70 , clause( 26168, [ ~( neq( sk2, nil ) ), ~( segmentP( sk2, sk1 ) ) ] )
% 2.30/2.70 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 2.30/2.70 ).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 resolution(
% 2.30/2.70 clause( 26169, [ ~( neq( sk2, nil ) ) ] )
% 2.30/2.70 , clause( 191, [ ~( segmentP( sk2, sk1 ) ), ~( neq( sk2, nil ) ) ] )
% 2.30/2.70 , 0, clause( 190, [ segmentP( sk2, sk1 ) ] )
% 2.30/2.70 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 resolution(
% 2.30/2.70 clause( 26170, [] )
% 2.30/2.70 , clause( 26169, [ ~( neq( sk2, nil ) ) ] )
% 2.30/2.70 , 0, clause( 188, [ neq( sk2, nil ) ] )
% 2.30/2.70 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 subsumption(
% 2.30/2.70 clause( 20168, [] )
% 2.30/2.70 , clause( 26170, [] )
% 2.30/2.70 , substitution( 0, [] ), permutation( 0, [] ) ).
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 end.
% 2.30/2.70
% 2.30/2.70 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 2.30/2.70
% 2.30/2.70 Memory use:
% 2.30/2.70
% 2.30/2.70 space for terms: 337815
% 2.30/2.70 space for clauses: 948785
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 clauses generated: 77046
% 2.30/2.70 clauses kept: 20169
% 2.30/2.70 clauses selected: 592
% 2.30/2.70 clauses deleted: 1107
% 2.30/2.70 clauses inuse deleted: 5
% 2.30/2.70
% 2.30/2.70 subsentry: 244353
% 2.30/2.70 literals s-matched: 135206
% 2.30/2.70 literals matched: 90220
% 2.30/2.70 full subsumption: 51272
% 2.30/2.70
% 2.30/2.70 checksum: 288018139
% 2.30/2.70
% 2.30/2.70
% 2.30/2.70 Bliksem ended
%------------------------------------------------------------------------------