TSTP Solution File: SWW409-1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SWW409-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n001.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 : Thu Sep 29 20:58:32 EDT 2022

% Result   : Unsatisfiable 0.13s 0.40s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   34
% Syntax   : Number of formulae    :   75 (  30 unt;   9 typ;   0 def)
%            Number of atoms       :  175 (  55 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  172 (  68   ~;  82   |;   0   &)
%                                         (  22 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of FOOLs       :    5 (   5 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   4   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :  158 ( 141   !;   0   ?; 158   :)

% Comments : 
%------------------------------------------------------------------------------
tff(heap_type,type,
    heap: $i > $o ).

tff(sep_type,type,
    sep: ( $i * $i ) > $i ).

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

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

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

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

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

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

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

tff(1,plain,
    ^ [Sigma: $i,S: $i,T: $i] :
      refl(
        ( ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) )
      <=> ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ) )),
    inference(bind,[status(th)],]) ).

tff(2,plain,
    ( ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) )
  <=> ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ) ),
    inference(quant_intro,[status(thm)],[1]) ).

tff(3,plain,
    ( ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) )
  <=> ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(4,axiom,
    ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).

tff(5,plain,
    ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ),
    inference(modus_ponens,[status(thm)],[4,3]) ).

tff(6,plain,
    ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ),
    inference(skolemize,[status(sab)],[5]) ).

tff(7,plain,
    ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ),
    inference(modus_ponens,[status(thm)],[6,2]) ).

tff(8,plain,
    ( ~ ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) )
    | ( sep(lseg(x1,nil),sep(lseg(x2,x1),emp)) = sep(lseg(x2,x1),sep(lseg(x1,nil),emp)) ) ),
    inference(quant_inst,[status(thm)],]) ).

tff(9,plain,
    sep(lseg(x1,nil),sep(lseg(x2,x1),emp)) = sep(lseg(x2,x1),sep(lseg(x1,nil),emp)),
    inference(unit_resolution,[status(thm)],[8,7]) ).

tff(10,plain,
    sep(lseg(x2,x1),sep(lseg(x1,nil),emp)) = sep(lseg(x1,nil),sep(lseg(x2,x1),emp)),
    inference(symmetry,[status(thm)],[9]) ).

tff(11,plain,
    ( heap(sep(lseg(x2,x1),sep(lseg(x1,nil),emp)))
  <=> heap(sep(lseg(x1,nil),sep(lseg(x2,x1),emp))) ),
    inference(monotonicity,[status(thm)],[10]) ).

tff(12,plain,
    ( heap(sep(lseg(x1,nil),sep(lseg(x2,x1),emp)))
  <=> heap(sep(lseg(x2,x1),sep(lseg(x1,nil),emp))) ),
    inference(symmetry,[status(thm)],[11]) ).

tff(13,plain,
    ( ~ ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) )
    | ( sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp))) = sep(lseg(x3,nil),sep(lseg(x2,x1),sep(next(x1,x3),emp))) ) ),
    inference(quant_inst,[status(thm)],]) ).

tff(14,plain,
    sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp))) = sep(lseg(x3,nil),sep(lseg(x2,x1),sep(next(x1,x3),emp))),
    inference(unit_resolution,[status(thm)],[13,7]) ).

tff(15,plain,
    sep(lseg(x3,nil),sep(lseg(x2,x1),sep(next(x1,x3),emp))) = sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp))),
    inference(symmetry,[status(thm)],[14]) ).

tff(16,plain,
    ( ~ ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) )
    | ( sep(lseg(x2,x1),sep(next(x1,x3),emp)) = sep(next(x1,x3),sep(lseg(x2,x1),emp)) ) ),
    inference(quant_inst,[status(thm)],]) ).

tff(17,plain,
    sep(lseg(x2,x1),sep(next(x1,x3),emp)) = sep(next(x1,x3),sep(lseg(x2,x1),emp)),
    inference(unit_resolution,[status(thm)],[16,7]) ).

tff(18,plain,
    sep(next(x1,x3),sep(lseg(x2,x1),emp)) = sep(lseg(x2,x1),sep(next(x1,x3),emp)),
    inference(symmetry,[status(thm)],[17]) ).

tff(19,plain,
    sep(lseg(x3,nil),sep(next(x1,x3),sep(lseg(x2,x1),emp))) = sep(lseg(x3,nil),sep(lseg(x2,x1),sep(next(x1,x3),emp))),
    inference(monotonicity,[status(thm)],[18]) ).

tff(20,plain,
    ( ~ ! [Sigma: $i,S: $i,T: $i] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) )
    | ( sep(lseg(x3,nil),sep(next(x1,x3),sep(lseg(x2,x1),emp))) = sep(next(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp))) ) ),
    inference(quant_inst,[status(thm)],]) ).

tff(21,plain,
    sep(lseg(x3,nil),sep(next(x1,x3),sep(lseg(x2,x1),emp))) = sep(next(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp))),
    inference(unit_resolution,[status(thm)],[20,7]) ).

tff(22,plain,
    sep(next(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp))) = sep(lseg(x3,nil),sep(next(x1,x3),sep(lseg(x2,x1),emp))),
    inference(symmetry,[status(thm)],[21]) ).

tff(23,plain,
    sep(next(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp))) = sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp))),
    inference(transitivity,[status(thm)],[22,19,15]) ).

tff(24,plain,
    ( heap(sep(next(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp))))
  <=> heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))) ),
    inference(monotonicity,[status(thm)],[23]) ).

tff(25,plain,
    ( heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp))))
  <=> heap(sep(next(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp)))) ),
    inference(symmetry,[status(thm)],[24]) ).

tff(26,plain,
    ( heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp))))
  <=> heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))) ),
    inference(rewrite,[status(thm)],]) ).

tff(27,axiom,
    heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_5) ).

tff(28,plain,
    heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))),
    inference(modus_ponens,[status(thm)],[27,26]) ).

tff(29,plain,
    heap(sep(next(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp)))),
    inference(modus_ponens,[status(thm)],[28,25]) ).

tff(30,plain,
    ( ( x1 != x3 )
  <=> ( x1 != x3 ) ),
    inference(rewrite,[status(thm)],]) ).

tff(31,axiom,
    x1 != x3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_3) ).

tff(32,plain,
    x1 != x3,
    inference(modus_ponens,[status(thm)],[31,30]) ).

tff(33,plain,
    ^ [Sigma: $i,Z: $i,Y: $i,X: $i] :
      refl(
        ( ( ( X = Y )
          | heap(sep(lseg(X,Z),Sigma))
          | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
      <=> ( ( X = Y )
          | heap(sep(lseg(X,Z),Sigma))
          | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ) )),
    inference(bind,[status(th)],]) ).

tff(34,plain,
    ( ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
        ( ( X = Y )
        | heap(sep(lseg(X,Z),Sigma))
        | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
  <=> ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
        ( ( X = Y )
        | heap(sep(lseg(X,Z),Sigma))
        | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ) ),
    inference(quant_intro,[status(thm)],[33]) ).

tff(35,plain,
    ( ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
        ( ( X = Y )
        | heap(sep(lseg(X,Z),Sigma))
        | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
  <=> ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
        ( ( X = Y )
        | heap(sep(lseg(X,Z),Sigma))
        | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(36,plain,
    ^ [Sigma: $i,Z: $i,Y: $i,X: $i] :
      rewrite(
        ( ( ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))
          | ( X = Y )
          | heap(sep(lseg(X,Z),Sigma)) )
      <=> ( ( X = Y )
          | heap(sep(lseg(X,Z),Sigma))
          | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ) )),
    inference(bind,[status(th)],]) ).

tff(37,plain,
    ( ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
        ( ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))
        | ( X = Y )
        | heap(sep(lseg(X,Z),Sigma)) )
  <=> ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
        ( ( X = Y )
        | heap(sep(lseg(X,Z),Sigma))
        | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ) ),
    inference(quant_intro,[status(thm)],[36]) ).

tff(38,axiom,
    ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
      ( ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))
      | ( X = Y )
      | heap(sep(lseg(X,Z),Sigma)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',unfolding_2) ).

tff(39,plain,
    ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
      ( ( X = Y )
      | heap(sep(lseg(X,Z),Sigma))
      | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
    inference(modus_ponens,[status(thm)],[38,37]) ).

tff(40,plain,
    ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
      ( ( X = Y )
      | heap(sep(lseg(X,Z),Sigma))
      | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
    inference(modus_ponens,[status(thm)],[39,35]) ).

tff(41,plain,
    ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
      ( ( X = Y )
      | heap(sep(lseg(X,Z),Sigma))
      | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
    inference(skolemize,[status(sab)],[40]) ).

tff(42,plain,
    ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
      ( ( X = Y )
      | heap(sep(lseg(X,Z),Sigma))
      | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
    inference(modus_ponens,[status(thm)],[41,34]) ).

tff(43,plain,
    ( ( ~ ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
            ( ( X = Y )
            | heap(sep(lseg(X,Z),Sigma))
            | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
      | ( x1 = x3 )
      | heap(sep(lseg(x1,nil),sep(lseg(x2,x1),emp)))
      | ~ heap(sep(next(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp)))) )
  <=> ( ~ ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
            ( ( X = Y )
            | heap(sep(lseg(X,Z),Sigma))
            | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
      | ( x1 = x3 )
      | heap(sep(lseg(x1,nil),sep(lseg(x2,x1),emp)))
      | ~ heap(sep(next(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp)))) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(44,plain,
    ( ~ ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
          ( ( X = Y )
          | heap(sep(lseg(X,Z),Sigma))
          | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
    | ( x1 = x3 )
    | heap(sep(lseg(x1,nil),sep(lseg(x2,x1),emp)))
    | ~ heap(sep(next(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp)))) ),
    inference(quant_inst,[status(thm)],]) ).

tff(45,plain,
    ( ~ ! [Sigma: $i,Z: $i,Y: $i,X: $i] :
          ( ( X = Y )
          | heap(sep(lseg(X,Z),Sigma))
          | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) )
    | ( x1 = x3 )
    | heap(sep(lseg(x1,nil),sep(lseg(x2,x1),emp)))
    | ~ heap(sep(next(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp)))) ),
    inference(modus_ponens,[status(thm)],[44,43]) ).

tff(46,plain,
    ( heap(sep(lseg(x1,nil),sep(lseg(x2,x1),emp)))
    | ~ heap(sep(next(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp)))) ),
    inference(unit_resolution,[status(thm)],[45,42,32]) ).

tff(47,plain,
    heap(sep(lseg(x1,nil),sep(lseg(x2,x1),emp))),
    inference(unit_resolution,[status(thm)],[46,29]) ).

tff(48,plain,
    heap(sep(lseg(x2,x1),sep(lseg(x1,nil),emp))),
    inference(modus_ponens,[status(thm)],[47,12]) ).

tff(49,plain,
    ( ~ heap(sep(lseg(x2,nil),emp))
  <=> ~ heap(sep(lseg(x2,nil),emp)) ),
    inference(rewrite,[status(thm)],]) ).

tff(50,axiom,
    ~ heap(sep(lseg(x2,nil),emp)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conclusion_1) ).

tff(51,plain,
    ~ heap(sep(lseg(x2,nil),emp)),
    inference(modus_ponens,[status(thm)],[50,49]) ).

tff(52,plain,
    ^ [Sigma: $i,Y: $i,X: $i] :
      refl(
        ( ( heap(sep(lseg(X,nil),Sigma))
          | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) )
      <=> ( heap(sep(lseg(X,nil),Sigma))
          | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) ) )),
    inference(bind,[status(th)],]) ).

tff(53,plain,
    ( ! [Sigma: $i,Y: $i,X: $i] :
        ( heap(sep(lseg(X,nil),Sigma))
        | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) )
  <=> ! [Sigma: $i,Y: $i,X: $i] :
        ( heap(sep(lseg(X,nil),Sigma))
        | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) ) ),
    inference(quant_intro,[status(thm)],[52]) ).

tff(54,plain,
    ( ! [Sigma: $i,Y: $i,X: $i] :
        ( heap(sep(lseg(X,nil),Sigma))
        | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) )
  <=> ! [Sigma: $i,Y: $i,X: $i] :
        ( heap(sep(lseg(X,nil),Sigma))
        | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(55,plain,
    ^ [Sigma: $i,Y: $i,X: $i] :
      rewrite(
        ( ( ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))
          | heap(sep(lseg(X,nil),Sigma)) )
      <=> ( heap(sep(lseg(X,nil),Sigma))
          | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) ) )),
    inference(bind,[status(th)],]) ).

tff(56,plain,
    ( ! [Sigma: $i,Y: $i,X: $i] :
        ( ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))
        | heap(sep(lseg(X,nil),Sigma)) )
  <=> ! [Sigma: $i,Y: $i,X: $i] :
        ( heap(sep(lseg(X,nil),Sigma))
        | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) ) ),
    inference(quant_intro,[status(thm)],[55]) ).

tff(57,axiom,
    ! [Sigma: $i,Y: $i,X: $i] :
      ( ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))
      | heap(sep(lseg(X,nil),Sigma)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',unfolding_3) ).

tff(58,plain,
    ! [Sigma: $i,Y: $i,X: $i] :
      ( heap(sep(lseg(X,nil),Sigma))
      | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) ),
    inference(modus_ponens,[status(thm)],[57,56]) ).

tff(59,plain,
    ! [Sigma: $i,Y: $i,X: $i] :
      ( heap(sep(lseg(X,nil),Sigma))
      | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) ),
    inference(modus_ponens,[status(thm)],[58,54]) ).

tff(60,plain,
    ! [Sigma: $i,Y: $i,X: $i] :
      ( heap(sep(lseg(X,nil),Sigma))
      | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) ),
    inference(skolemize,[status(sab)],[59]) ).

tff(61,plain,
    ! [Sigma: $i,Y: $i,X: $i] :
      ( heap(sep(lseg(X,nil),Sigma))
      | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) ),
    inference(modus_ponens,[status(thm)],[60,53]) ).

tff(62,plain,
    ( ( ~ ! [Sigma: $i,Y: $i,X: $i] :
            ( heap(sep(lseg(X,nil),Sigma))
            | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) )
      | heap(sep(lseg(x2,nil),emp))
      | ~ heap(sep(lseg(x2,x1),sep(lseg(x1,nil),emp))) )
  <=> ( ~ ! [Sigma: $i,Y: $i,X: $i] :
            ( heap(sep(lseg(X,nil),Sigma))
            | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) )
      | heap(sep(lseg(x2,nil),emp))
      | ~ heap(sep(lseg(x2,x1),sep(lseg(x1,nil),emp))) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(63,plain,
    ( ~ ! [Sigma: $i,Y: $i,X: $i] :
          ( heap(sep(lseg(X,nil),Sigma))
          | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) )
    | heap(sep(lseg(x2,nil),emp))
    | ~ heap(sep(lseg(x2,x1),sep(lseg(x1,nil),emp))) ),
    inference(quant_inst,[status(thm)],]) ).

tff(64,plain,
    ( ~ ! [Sigma: $i,Y: $i,X: $i] :
          ( heap(sep(lseg(X,nil),Sigma))
          | ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma))) )
    | heap(sep(lseg(x2,nil),emp))
    | ~ heap(sep(lseg(x2,x1),sep(lseg(x1,nil),emp))) ),
    inference(modus_ponens,[status(thm)],[63,62]) ).

tff(65,plain,
    ~ heap(sep(lseg(x2,x1),sep(lseg(x1,nil),emp))),
    inference(unit_resolution,[status(thm)],[64,61,51]) ).

tff(66,plain,
    $false,
    inference(unit_resolution,[status(thm)],[65,48]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWW409-1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.14  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.35  % Computer : n001.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Sun Sep  4 16:43:13 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35  Usage: tptp [options] [-file:]file
% 0.13/0.35    -h, -?       prints this message.
% 0.13/0.35    -smt2        print SMT-LIB2 benchmark.
% 0.13/0.35    -m, -model   generate model.
% 0.13/0.35    -p, -proof   generate proof.
% 0.13/0.35    -c, -core    generate unsat core of named formulas.
% 0.13/0.35    -st, -statistics display statistics.
% 0.13/0.35    -t:timeout   set timeout (in second).
% 0.13/0.35    -smt2status  display status in smt2 format instead of SZS.
% 0.13/0.35    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35    -<param>:<value> configuration parameter and value.
% 0.13/0.35    -o:<output-file> file to place output in.
% 0.13/0.40  % SZS status Unsatisfiable
% 0.13/0.40  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------