↑ Up

CSE---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : SWW421-1 : TPTP v8.2.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Jun 24 18:09:22 EDT 2024

% Result   : Unsatisfiable 0.16s 0.61s
% Output   : CNFRefutation 0.53s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10  % Problem    : SWW421-1 : TPTP v8.2.0. Released v5.2.0.
% 0.10/0.10  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.10/0.31  % Computer : n013.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.31  % CPULimit   : 300
% 0.16/0.31  % WCLimit    : 300
% 0.16/0.31  % DateTime   : Wed Jun 19 08:29:24 EDT 2024
% 0.16/0.31  % CPUTime    : 
% 0.16/0.55  start to proof:theBenchmark
% 0.16/0.60  %-------------------------------------------
% 0.16/0.60  % File        :CSE---1.7
% 0.16/0.60  % Problem     :theBenchmark
% 0.16/0.60  % Transform   :cnf
% 0.16/0.60  % Format      :tptp:raw
% 0.16/0.60  % Command     :java -jar mcs_scs.jar %d %s
% 0.16/0.60  
% 0.16/0.60  % Result      :Theorem 0.020000s
% 0.16/0.60  % Output      :CNFRefutation 0.020000s
% 0.16/0.60  %-------------------------------------------
% 0.16/0.61  %------------------------------------------------------------------------------
% 0.16/0.61  % File     : SWW421-1 : TPTP v8.2.0. Released v5.2.0.
% 0.16/0.61  % Domain   : Software Verification
% 0.16/0.61  % Problem  : Verification Condition generated by Smallfoot
% 0.16/0.61  % Version  : Especial.
% 0.16/0.61  % English  : This is one of the verification conditions that were gathered
% 0.16/0.61  %            from the output of Smallfoot when checking assertions on list
% 0.16/0.61  %            manipulating programs from its own benchmark suite.
% 0.16/0.61  
% 0.16/0.61  % Refs     : [BCO06] Berdine et al. (2006), Smallfoot: Modular Automatic As
% 0.16/0.61  %          : [RN11]  Rybalchenko & Navarro Perez (2011), Separation Logic +
% 0.16/0.61  %          : [Nav11] Navarro Perez (2011), Email to Geoff Sutcliffe
% 0.16/0.61  % Source   : [Nav11]
% 0.16/0.61  % Names    : smallfoot-vc71 [Nav11]
% 0.16/0.61  
% 0.16/0.61  % Status   : Unsatisfiable
% 0.16/0.61  % Rating   : 0.10 v8.1.0, 0.00 v7.5.0, 0.05 v7.4.0, 0.06 v7.3.0, 0.08 v7.1.0, 0.00 v7.0.0, 0.07 v6.4.0, 0.00 v6.3.0, 0.09 v6.2.0, 0.10 v6.1.0, 0.14 v6.0.0, 0.00 v5.5.0, 0.15 v5.3.0, 0.11 v5.2.0
% 0.16/0.61  % Syntax   : Number of clauses     :   16 (   9 unt;   3 nHn;  14 RR)
% 0.16/0.61  %            Number of literals    :   26 (  11 equ;  13 neg)
% 0.16/0.61  %            Maximal clause size   :    3 (   1 avg)
% 0.16/0.61  %            Maximal term depth    :    5 (   2 avg)
% 0.16/0.61  %            Number of predicates  :    2 (   1 usr;   0 prp; 1-2 aty)
% 0.16/0.61  %            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
% 0.16/0.61  %            Number of variables   :   38 (   9 sgn)
% 0.16/0.61  % SPC      : CNF_UNS_RFO_SEQ_NHN
% 0.16/0.61  
% 0.16/0.61  % Comments :
% 0.16/0.61  %------------------------------------------------------------------------------
% 0.16/0.61  %----Include axioms for Lists in Separation Logic
% 0.16/0.61  include('Axioms/SWV013-0.ax').
% 0.16/0.61  %------------------------------------------------------------------------------
% 0.16/0.61  cnf(premise_1,hypothesis,
% 0.16/0.61      nil != x1 ).
% 0.16/0.61  
% 0.16/0.61  cnf(premise_2,hypothesis,
% 0.16/0.61      x2 != x1 ).
% 0.16/0.61  
% 0.16/0.61  cnf(premise_3,hypothesis,
% 0.16/0.61      x1 != x3 ).
% 0.16/0.61  
% 0.16/0.61  cnf(premise_4,hypothesis,
% 0.16/0.61      heap(sep(lseg(x2,x3),sep(next(x1,x2),emp))) ).
% 0.16/0.61  
% 0.16/0.61  cnf(conclusion_1,negated_conjecture,
% 0.16/0.61      ~ heap(sep(lseg(x1,x3),emp)) ).
% 0.16/0.61  
% 0.16/0.61  %------------------------------------------------------------------------------
% 0.16/0.61  %-------------------------------------------
% 0.16/0.61  % Proof found
% 0.16/0.61  % SZS status Theorem for theBenchmark
% 0.16/0.61  % SZS output start Proof
% 0.53/0.61  %ClaNum:26(EqnAxiom:10)
% 0.53/0.61  %VarNum:78(SingletonVarNum:38)
% 0.53/0.61  %MaxLitNum:3
% 0.53/0.61  %MaxfuncDepth:4
% 0.53/0.61  %SharedTerms:16
% 0.53/0.61  %goalClause: 17
% 0.53/0.61  %singleGoalClaCount:1
% 0.53/0.61  [14]~E(a5,a7)
% 0.53/0.61  [15]~E(a7,a6)
% 0.53/0.61  [16]~E(a7,a8)
% 0.53/0.61  [17]~P1(f3(f1(a7,a8),a2))
% 0.53/0.61  [13]P1(f3(f1(a6,a8),f3(f4(a7,a6),a2)))
% 0.53/0.61  [11]E(f3(f1(x111,x111),x112),x112)
% 0.53/0.61  [18]~P1(f3(f4(a5,x181),x182))
% 0.53/0.61  [12]E(f3(x121,f3(x122,x123)),f3(x122,f3(x121,x123)))
% 0.53/0.61  [19]~P1(f3(f4(x191,x192),f3(f4(x191,x193),x194)))
% 0.53/0.61  [20]E(x201,a5)+~P1(f3(f1(a5,x201),x202))
% 0.53/0.61  [23]P1(f3(f1(x231,a5),x232))+~P1(f3(f1(x231,x233),f3(f1(x233,a5),x232)))
% 0.53/0.61  [21]E(x211,x212)+~P1(f3(f4(x211,x213),f3(f1(x211,x212),x214)))
% 0.53/0.61  [25]P1(f3(f1(x251,x252),f3(f4(x252,x253),x254)))+~P1(f3(f1(x251,x255),f3(f1(x255,x252),f3(f4(x252,x253),x254))))
% 0.53/0.61  [22]E(x221,x222)+E(x221,x223)+~P1(f3(f1(x221,x223),f3(f1(x221,x222),x224)))
% 0.53/0.61  [24]E(x241,x242)+P1(f3(f1(x241,x243),x244))+~P1(f3(f4(x241,x242),f3(f1(x242,x243),x244)))
% 0.53/0.61  [26]E(x261,x262)+P1(f3(f1(x263,x261),f3(f1(x261,x262),x264)))+~P1(f3(f1(x263,x265),f3(f1(x265,x261),f3(f1(x261,x262),x264))))
% 0.53/0.61  %EqnAxiom
% 0.53/0.61  [1]E(x11,x11)
% 0.53/0.61  [2]E(x22,x21)+~E(x21,x22)
% 0.53/0.61  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.53/0.61  [4]~E(x41,x42)+E(f1(x41,x43),f1(x42,x43))
% 0.53/0.61  [5]~E(x51,x52)+E(f1(x53,x51),f1(x53,x52))
% 0.53/0.61  [6]~E(x61,x62)+E(f3(x61,x63),f3(x62,x63))
% 0.53/0.61  [7]~E(x71,x72)+E(f3(x73,x71),f3(x73,x72))
% 0.53/0.61  [8]~E(x81,x82)+E(f4(x81,x83),f4(x82,x83))
% 0.53/0.61  [9]~E(x91,x92)+E(f4(x93,x91),f4(x93,x92))
% 0.53/0.61  [10]~P1(x101)+P1(x102)+~E(x101,x102)
% 0.53/0.61  
% 0.53/0.61  %-------------------------------------------
% 0.53/0.62  cnf(27,plain,
% 0.53/0.62     (E(x271,f3(f1(x272,x272),x271))),
% 0.53/0.62     inference(scs_inference,[],[11,2])).
% 0.53/0.62  cnf(37,plain,
% 0.53/0.62     (E(f1(f3(f1(x371,x371),x372),x373),f1(x372,x373))),
% 0.53/0.62     inference(scs_inference,[],[27,4,2])).
% 0.53/0.62  cnf(43,plain,
% 0.53/0.62     ($false),
% 0.53/0.62     inference(scs_inference,[],[13,17,37,15,12,11,2,3,10,24]),
% 0.53/0.62     ['proof']).
% 0.53/0.62  % SZS output end Proof
% 0.53/0.62  % Total time :0.020000s
%------------------------------------------------------------------------------