%--------------------------------------------------------------------------
% File     : SWC281-1 : TPTP v9.0.0. Released v2.4.0.
% Domain   : Software Creation
% Problem  : cond_pst_sorted2_x_run_ord_front2
% 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   : [TPTP]
% Names    :

% Status   : Unsatisfiable
% Rating   : 1.00 v8.2.0, 0.95 v8.1.0, 1.00 v2.4.0
% Syntax   : Number of clauses     :  205 (  68 unt;  34 nHn; 162 RR)
%            Number of literals    :  635 ( 106 equ; 410 neg)
%            Maximal clause size   :   10 (   3 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   20 (  19 usr;   0 prp; 1-2 aty)
%            Number of functors    :   58 (  58 usr;  12 con; 0-2 aty)
%            Number of variables   :  330 (  49 sgn)
% SPC      : CNF_UNS_RFO_SEQ_NHN

% Comments : Created by CNF conversion from SWC281+1
%--------------------------------------------------------------------------
%----Include list specification axioms
include('Axioms/SWC001-0.ax').
%--------------------------------------------------------------------------
cnf(co1_1,negated_conjecture,
    ssList(sk1) ).

cnf(co1_2,negated_conjecture,
    ssList(sk2) ).

cnf(co1_3,negated_conjecture,
    ssList(sk3) ).

cnf(co1_4,negated_conjecture,
    ssList(sk4) ).

cnf(co1_5,negated_conjecture,
    sk2 = sk4 ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3 ).

cnf(co1_7,negated_conjecture,
    ssList(sk5) ).

cnf(co1_8,negated_conjecture,
    app(sk3,sk5) = sk4 ).

cnf(co1_9,negated_conjecture,
    totalorderedP(sk3) ).

cnf(co1_10,negated_conjecture,
    ( ~ ssItem(A)
    | ~ ssList(B)
    | app(cons(A,nil),B) != sk5
    | ~ ssItem(C)
    | ~ ssList(D)
    | app(D,cons(C,nil)) != sk3
    | ~ leq(C,A) ) ).

cnf(co1_11,negated_conjecture,
    ssItem(sk6) ).

cnf(co1_12,negated_conjecture,
    ssList(sk7) ).

cnf(co1_13,negated_conjecture,
    ssList(sk8) ).

cnf(co1_14,negated_conjecture,
    app(app(sk7,cons(sk6,nil)),sk8) = sk1 ).

cnf(co1_15,negated_conjecture,
    ssItem(sk9) ).

cnf(co1_16,negated_conjecture,
    ( memberP(sk7,sk9)
    | memberP(sk8,sk9) ) ).

cnf(co1_17,negated_conjecture,
    ( memberP(sk7,sk9)
    | ~ leq(sk6,sk9) ) ).

cnf(co1_18,negated_conjecture,
    ( ~ leq(sk9,sk6)
    | memberP(sk8,sk9) ) ).

cnf(co1_19,negated_conjecture,
    ( ~ leq(sk9,sk6)
    | ~ leq(sk6,sk9) ) ).

cnf(co1_20,negated_conjecture,
    ( nil = sk4
    | nil != sk3 ) ).

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