%--------------------------------------------------------------------------
% File     : SWC265+1 : TPTP v9.0.0. Released v2.4.0.
% Domain   : Software Creation
% Problem  : cond_pst_sorted1_x_pst_strict_sorted2
% Version  : [Wei00] axioms.
% English  : Find components in a software library that match a given target
%            specification given in first-order logic. The components are
%            specified in first-order logic as well. The problem represents
%            a test of one library module specification against a target
%            specification.

% Refs     : [Wei00] Weidenbach (2000), Software Reuse of List Functions Ve
%          : [FSS98] Fischer et al. (1998), Deduction-Based Software Compon
% Source   : [Wei00]
% Names    : cond_pst_sorted1_x_pst_strict_sorted2 [Wei00]

% Status   : Theorem
% Rating   : 0.88 v9.0.0, 0.92 v8.2.0, 0.94 v8.1.0, 0.97 v7.5.0, 1.00 v7.3.0, 0.97 v7.1.0, 0.96 v7.0.0, 0.93 v6.4.0, 0.92 v6.3.0, 0.96 v6.1.0, 1.00 v6.0.0, 0.96 v5.5.0, 1.00 v5.4.0, 0.96 v5.3.0, 1.00 v2.4.0
% Syntax   : Number of formulae    :   96 (   9 unt;   0 def)
%            Number of atoms       :  410 (  74 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  343 (  29   ~;  13   |;  45   &)
%                                         (  26 <=>; 230  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (   7 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   20 (  19 usr;   0 prp; 1-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :  211 ( 194   !;  17   ?)
% SPC      : FOF_THM_RFO_SEQ

% Comments :
%--------------------------------------------------------------------------
%----Include list specification axioms
include('Axioms/SWC001+0.ax').
%--------------------------------------------------------------------------
fof(co1,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ~ ssList(X)
                  | V != X
                  | U != W
                  | ? [Y] :
                      ( ssItem(Y)
                      & ? [Z] :
                          ( ssList(Z)
                          & ? [X1] :
                              ( ssList(X1)
                              & app(app(Z,cons(Y,nil)),X1) = W
                              & ? [X2] :
                                  ( ssItem(X2)
                                  & ( ( ~ lt(Y,X2)
                                      & memberP(X1,X2) )
                                    | ( ~ lt(X2,Y)
                                      & memberP(Z,X2) ) ) ) ) ) )
                  | totalorderedP(U) ) ) ) ) ).

%--------------------------------------------------------------------------