TSTP Solution File: SWW410-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWW410-1 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n004.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 : Fri Sep  1 00:17:40 EDT 2023

% Result   : Unsatisfiable 0.18s 0.69s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   36 (  17 unt;   9 typ;   0 def)
%            Number of atoms       :   45 (  16 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   32 (  14   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   4   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   56 (   0 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    sep: ( $i * $i ) > $i ).

tff(decl_23,type,
    lseg: ( $i * $i ) > $i ).

tff(decl_24,type,
    nil: $i ).

tff(decl_25,type,
    next: ( $i * $i ) > $i ).

tff(decl_26,type,
    heap: $i > $o ).

tff(decl_27,type,
    x1: $i ).

tff(decl_28,type,
    x2: $i ).

tff(decl_29,type,
    x3: $i ).

tff(decl_30,type,
    emp: $i ).

cnf(unfolding_2,axiom,
    ( X1 = X2
    | heap(sep(lseg(X1,X3),X4))
    | ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',unfolding_2) ).

cnf(normalization,axiom,
    sep(lseg(X1,X1),X2) = X2,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',normalization) ).

cnf(associative_commutative,axiom,
    sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).

cnf(premise_5,hypothesis,
    heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_5) ).

cnf(unfolding_5,axiom,
    ( X3 = X4
    | heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5)))) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',unfolding_5) ).

cnf(premise_3,hypothesis,
    x1 != x3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_3) ).

cnf(conclusion_1,negated_conjecture,
    ~ heap(sep(lseg(x3,nil),sep(lseg(x2,x3),emp))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conclusion_1) ).

cnf(unfolding_3,axiom,
    ( heap(sep(lseg(X1,nil),X3))
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',unfolding_3) ).

cnf(c_0_8,axiom,
    ( X1 = X2
    | heap(sep(lseg(X1,X3),X4))
    | ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
    unfolding_2 ).

cnf(c_0_9,axiom,
    sep(lseg(X1,X1),X2) = X2,
    normalization ).

cnf(c_0_10,axiom,
    sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
    associative_commutative ).

cnf(c_0_11,plain,
    ( X1 = X2
    | heap(sep(lseg(X1,X2),X3))
    | ~ heap(sep(next(X1,X2),X3)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,plain,
    sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
    inference(spm,[status(thm)],[c_0_10,c_0_10]) ).

cnf(c_0_13,hypothesis,
    heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))),
    premise_5 ).

cnf(c_0_14,axiom,
    ( X3 = X4
    | heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5)))) ),
    unfolding_5 ).

cnf(c_0_15,plain,
    ( X1 = X2
    | heap(sep(lseg(X1,X2),sep(X3,sep(X4,X5))))
    | ~ heap(sep(X3,sep(X4,sep(next(X1,X2),X5)))) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,hypothesis,
    heap(sep(lseg(x3,nil),sep(lseg(x2,x1),sep(next(x1,x3),emp)))),
    inference(rw,[status(thm)],[c_0_13,c_0_10]) ).

cnf(c_0_17,hypothesis,
    x1 != x3,
    premise_3 ).

cnf(c_0_18,plain,
    ( X1 = X2
    | heap(sep(lseg(X1,X3),sep(X4,X5)))
    | ~ heap(sep(lseg(X2,X3),sep(X4,sep(next(X1,X2),X5)))) ),
    inference(spm,[status(thm)],[c_0_8,c_0_12]) ).

cnf(c_0_19,plain,
    ( X1 = X2
    | heap(sep(lseg(X3,X1),sep(lseg(X1,X2),X4)))
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X3,X5),sep(lseg(X5,X1),X4)))) ),
    inference(spm,[status(thm)],[c_0_14,c_0_12]) ).

cnf(c_0_20,hypothesis,
    heap(sep(lseg(x3,nil),sep(lseg(x2,x1),sep(lseg(x1,x3),emp)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_10]),c_0_10]) ).

cnf(c_0_21,negated_conjecture,
    ~ heap(sep(lseg(x3,nil),sep(lseg(x2,x3),emp))),
    conclusion_1 ).

cnf(c_0_22,axiom,
    ( heap(sep(lseg(X1,nil),X3))
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))) ),
    unfolding_3 ).

cnf(c_0_23,hypothesis,
    heap(sep(lseg(x2,x1),sep(lseg(x1,nil),emp))),
    inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_17]),c_0_10]) ).

cnf(c_0_24,hypothesis,
    x3 = nil,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10]),c_0_21]) ).

cnf(c_0_25,hypothesis,
    heap(sep(lseg(x2,nil),emp)),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_24]),c_0_9]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SWW410-1 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.11/0.33  % Computer : n004.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Sun Aug 27 20:43:07 EDT 2023
% 0.11/0.33  % CPUTime  : 
% 0.18/0.52  start to proof: theBenchmark
% 0.18/0.69  % Version  : CSE_E---1.5
% 0.18/0.69  % Problem  : theBenchmark.p
% 0.18/0.69  % Proof found
% 0.18/0.69  % SZS status Theorem for theBenchmark.p
% 0.18/0.69  % SZS output start Proof
% See solution above
% 0.18/0.69  % Total time : 0.155000 s
% 0.18/0.69  % SZS output end Proof
% 0.18/0.69  % Total time : 0.158000 s
%------------------------------------------------------------------------------