TPTP Problem File: SWC316+1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SWC316+1 : TPTP v8.2.0. Released v2.4.0.
% Domain : Software Creation
% Problem : cond_rot_r1_x_rot_r2
% 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_rot_r1_x_rot_r2 [Wei00]
% Status : Theorem
% Rating : 0.56 v8.1.0, 0.47 v7.5.0, 0.56 v7.4.0, 0.47 v7.3.0, 0.52 v7.0.0, 0.53 v6.4.0, 0.62 v6.2.0, 0.76 v6.1.0, 0.80 v6.0.0, 0.78 v5.5.0, 0.96 v5.4.0, 0.93 v5.3.0, 0.96 v5.2.0, 0.95 v5.1.0, 0.90 v5.0.0, 0.88 v4.1.0, 0.87 v4.0.0, 0.83 v3.7.0, 0.80 v3.5.0, 0.79 v3.4.0, 0.74 v3.3.0, 0.79 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 : 419 ( 80 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 353 ( 30 ~; 14 |; 50 &)
% ( 26 <=>; 233 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 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 : 213 ( 196 !; 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
| ( ( ~ neq(V,nil)
| ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ( app(cons(Y,nil),Z) != W
| app(Z,cons(Y,nil)) != X ) ) )
| ( ? [X1] :
( ssList(X1)
& V = X1
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& tl(U) = X2
& app(X2,X3) = X1
& ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X3
& hd(U) = X4
& neq(nil,U) )
& neq(nil,U) ) ) )
& neq(U,nil) ) )
& ( ~ neq(V,nil)
| neq(X,nil) ) ) ) ) ) ) ) ).
%--------------------------------------------------------------------------