TPTP Problem File: SWC120+1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SWC120+1 : TPTP v9.0.0. Released v2.4.0.
% Domain : Software Creation
% Problem : cond_ne_segment_x_head2
% 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_ne_segment_x_head2 [Wei00]
% Status : Theorem
% Rating : 0.58 v9.0.0, 0.56 v8.1.0, 0.53 v7.5.0, 0.59 v7.4.0, 0.47 v7.3.0, 0.59 v7.1.0, 0.61 v7.0.0, 0.60 v6.4.0, 0.62 v6.2.0, 0.68 v6.1.0, 0.80 v6.0.0, 0.78 v5.4.0, 0.79 v5.3.0, 0.81 v5.2.0, 0.70 v5.1.0, 0.71 v5.0.0, 0.75 v4.1.0, 0.78 v4.0.0, 0.79 v3.7.0, 0.85 v3.5.0, 0.84 v3.4.0, 0.79 v3.3.0, 0.86 v3.2.0, 0.82 v3.1.0, 0.78 v2.7.0, 0.67 v2.4.0
% Syntax : Number of formulae : 96 ( 9 unt; 0 def)
% Number of atoms : 411 ( 76 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 344 ( 29 ~; 13 |; 45 &)
% ( 26 <=>; 231 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 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 : 209 ( 194 !; 15 ?)
% 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
| ( ( ~ neq(V,nil)
| ? [Y] :
( ssList(Y)
& X != Y
& ? [Z] :
( ssList(Z)
& tl(X) = Z
& app(W,Z) = Y
& neq(nil,X) ) )
| ( neq(U,nil)
& segmentP(V,U) ) )
& ( ~ neq(V,nil)
| neq(X,nil) ) ) ) ) ) ) ) ).
%--------------------------------------------------------------------------