TPTP Problem File: SWC370-1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SWC370-1 : TPTP v9.0.0. Released v2.4.0.
% Domain : Software Creation
% Problem : cond_segment_x_run_eq_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 : 0.10 v9.0.0, 0.15 v8.2.0, 0.10 v8.1.0, 0.11 v7.4.0, 0.18 v7.3.0, 0.17 v7.2.0, 0.08 v7.1.0, 0.00 v7.0.0, 0.07 v6.4.0, 0.13 v6.3.0, 0.18 v6.2.0, 0.10 v6.1.0, 0.29 v6.0.0, 0.20 v5.5.0, 0.60 v5.4.0, 0.65 v5.3.0, 0.72 v5.2.0, 0.56 v5.1.0, 0.53 v5.0.0, 0.43 v4.1.0, 0.31 v4.0.1, 0.27 v4.0.0, 0.18 v3.7.0, 0.10 v3.5.0, 0.27 v3.4.0, 0.25 v3.3.0, 0.21 v3.2.0, 0.15 v3.1.0, 0.36 v2.7.0, 0.42 v2.6.0, 0.33 v2.5.0, 0.44 v2.4.0
% Syntax : Number of clauses : 197 ( 64 unt; 33 nHn; 154 RR)
% Number of literals : 621 ( 105 equ; 405 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 : 54 ( 54 usr; 8 con; 0-2 aty)
% Number of variables : 329 ( 49 sgn)
% SPC : CNF_UNS_RFO_SEQ_NHN
% Comments : Created by CNF conversion from SWC370+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,
equalelemsP(sk3) ).
cnf(co1_10,negated_conjecture,
( ~ ssItem(A)
| ~ ssList(B)
| app(cons(A,nil),B) != sk5
| ~ ssList(C)
| app(C,cons(A,nil)) != sk3 ) ).
cnf(co1_11,negated_conjecture,
~ segmentP(sk2,sk1) ).
cnf(co1_12,negated_conjecture,
( nil = sk4
| nil != sk3 ) ).
%--------------------------------------------------------------------------