TPTP Problem File: SWW440-1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SWW440-1 : TPTP v9.0.0. Released v5.2.0.
% Domain : Software Verification
% Problem : Randomly generated entailment of the form F -> \bot (n = 17)
% Version : Especial.
% English : A randomly generated entailment with n program variables.
% Negated equalities and list segments are added at random, with
% specific paramenters so that about half of the generated
% entailments are valid (or, equivalently, F is unsatisfiable).
% Normalization and well-formedness axioms should be enough to
% decide these entailments.
% Refs : [RN11] Rybalchenko & Navarro Perez (2011), Separation Logic +
% : [Nav11] Navarro Perez (2011), Email to Geoff Sutcliffe
% Source : [Nav11]
% Names : spaguetti-17-e02 [Nav11]
% Status : Satisfiable
% Rating : 1.00 v5.2.0
% Syntax : Number of clauses : 31 ( 23 unt; 3 nHn; 29 RR)
% Number of literals : 42 ( 27 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 19 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 0 prp; 1-2 aty)
% Number of functors : 22 ( 22 usr; 19 con; 0-2 aty)
% Number of variables : 38 ( 9 sgn)
% SPC : CNF_SAT_RFO_EQU_NUE
% Comments :
%------------------------------------------------------------------------------
%----Include axioms for Lists in Separation Logic
include('Axioms/SWV013-0.ax').
%------------------------------------------------------------------------------
cnf(premise_1,hypothesis,
x6 != x11 ).
cnf(premise_2,hypothesis,
x6 != x13 ).
cnf(premise_3,hypothesis,
x11 != x17 ).
cnf(premise_4,hypothesis,
x11 != x12 ).
cnf(premise_5,hypothesis,
x3 != x11 ).
cnf(premise_6,hypothesis,
x3 != x14 ).
cnf(premise_7,hypothesis,
x9 != x11 ).
cnf(premise_8,hypothesis,
x2 != x11 ).
cnf(premise_9,hypothesis,
x2 != x7 ).
cnf(premise_10,hypothesis,
x2 != x16 ).
cnf(premise_11,hypothesis,
x2 != x13 ).
cnf(premise_12,hypothesis,
x2 != x12 ).
cnf(premise_13,hypothesis,
x14 != x16 ).
cnf(premise_14,hypothesis,
x1 != x6 ).
cnf(premise_15,hypothesis,
x1 != x16 ).
cnf(premise_16,hypothesis,
x4 != x6 ).
cnf(premise_17,hypothesis,
x4 != x15 ).
cnf(premise_18,hypothesis,
x5 != x14 ).
cnf(premise_19,hypothesis,
heap(sep(lseg(x10,x5),sep(lseg(x10,x9),sep(lseg(x13,x10),sep(lseg(x4,x17),sep(lseg(x8,x12),sep(lseg(x15,x12),sep(lseg(x15,x17),sep(lseg(x15,x13),sep(lseg(x14,x9),sep(lseg(x12,x7),sep(lseg(x12,x4),sep(lseg(x2,x4),sep(lseg(x7,x15),sep(lseg(x3,x14),sep(lseg(x3,x1),sep(lseg(x11,x3),sep(lseg(x6,x17),emp)))))))))))))))))) ).
cnf(conclusion_1,negated_conjecture,
( x1 = x1
| ~ heap(emp) ) ).
%------------------------------------------------------------------------------