TPTP Problem File: SWW448-1.p

View Solutions - Solve Problem

%------------------------------------------------------------------------------
% File     : SWW448-1 : TPTP v8.2.0. Released v5.2.0.
% Domain   : Software Verification
% Problem  : Randomly generated entailment of the form F -> G (n = 10)
% Version  : Especial.
% English  : A randomly generated entailment with n program variables.
%            A random graph with pointers and list segments is generated,
%            and then some of the segments are folded. The task is to
%            prove whether the unfolded version entails the folded one.
%            Parameters are chosen so that about half of the generated
%            entailments are valid.
%            These entailments stress the role of unfolding axioms.

% Refs     : [RN11]  Rybalchenko & Navarro Perez (2011), Separation Logic +
%          : [Nav11] Navarro Perez (2011), Email to Geoff Sutcliffe
% Source   : [Nav11]
% Names    : bolognesa-10-e02 [Nav11]

% Status   : Unsatisfiable
% Rating   : 0.95 v8.2.0, 0.90 v8.1.0, 0.84 v7.5.0, 0.95 v7.4.0, 0.94 v7.3.0, 0.92 v7.0.0, 0.93 v6.3.0, 0.91 v6.2.0, 0.90 v6.1.0, 0.93 v6.0.0, 0.90 v5.5.0, 0.95 v5.4.0, 1.00 v5.2.0
% Syntax   : Number of clauses     :   13 (   6 unt;   3 nHn;  11 RR)
%            Number of literals    :   23 (   8 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :   12 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   0 prp; 1-2 aty)
%            Number of functors    :   15 (  15 usr;  12 con; 0-2 aty)
%            Number of variables   :   38 (   9 sgn)
% SPC      : CNF_UNS_RFO_SEQ_NHN

% Comments :
%------------------------------------------------------------------------------
%----Include axioms for Lists in Separation Logic
include('Axioms/SWV013-0.ax').
%------------------------------------------------------------------------------
cnf(premise_1,hypothesis,
    heap(sep(next(x5,x10),sep(lseg(x9,x7),sep(next(x2,x7),sep(next(x4,x7),sep(next(x6,x4),sep(next(x7,x3),sep(next(x1,x2),sep(next(x10,x1),sep(next(x8,x4),sep(next(x3,x5),emp))))))))))) ).

cnf(conclusion_1,negated_conjecture,
    ~ heap(sep(lseg(x3,x5),sep(lseg(x8,x4),sep(lseg(x9,x7),sep(lseg(x6,x7),sep(lseg(x5,x3),emp)))))) ).

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