TPTP Problem File: SWC268-1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SWC268-1 : TPTP v9.0.0. Released v2.4.0.
% Domain : Software Creation
% Problem : cond_pst_sorted1_x_run_eq_max1
% 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 : Satisfiable
% Rating : 1.00 v6.3.0, 0.88 v6.2.0, 0.90 v6.1.0, 1.00 v2.4.0
% Syntax : Number of clauses : 195 ( 63 unt; 33 nHn; 152 RR)
% Number of literals : 618 ( 100 equ; 404 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 : 53 ( 53 usr; 7 con; 0-2 aty)
% Number of variables : 327 ( 49 sgn)
% SPC : CNF_SAT_RFO_EQU_NUE
% Comments : Created by CNF conversion from SWC268+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,
segmentP(sk4,sk3) ).
cnf(co1_8,negated_conjecture,
equalelemsP(sk3) ).
cnf(co1_9,negated_conjecture,
( ~ ssList(A)
| ~ neq(sk3,A)
| ~ segmentP(sk4,A)
| ~ segmentP(A,sk3)
| ~ equalelemsP(A) ) ).
cnf(co1_10,negated_conjecture,
~ totalorderedP(sk1) ).
%--------------------------------------------------------------------------