TSTP Solution File: SWW407-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWW407-1 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n020.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 : Tue Aug 22 11:07:12 EDT 2023

% Result   : Unsatisfiable 90.74s 76.33s
% Output   : CNFRefutation 90.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   37 (  18 unt;  10 typ;   0 def)
%            Number of atoms       :   40 (  13 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  13   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    6 (   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    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   54 (;  54   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ heap > sep > next > lseg > #nlpp > x4 > x3 > x2 > x1 > nil > emp

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(lseg,type,
    lseg: ( $i * $i ) > $i ).

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

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

tff(x4,type,
    x4: $i ).

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

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

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

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

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

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

tff(f_52,axiom,
    ! [S,T,Sigma] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ),
    file(unknown,unknown) ).

tff(f_139,axiom,
    ~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
    file(unknown,unknown) ).

tff(f_130,axiom,
    x1 != x2,
    file(unknown,unknown) ).

tff(f_137,axiom,
    heap(sep(next(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
    file(unknown,unknown) ).

tff(f_55,axiom,
    ! [X,Sigma] : ( sep(lseg(X,X),Sigma) = Sigma ),
    file(unknown,unknown) ).

tff(f_96,axiom,
    ! [X,Y,Z,Sigma] :
      ( ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))
      | ( X = Y )
      | heap(sep(lseg(X,Z),Sigma)) ),
    file(unknown,unknown) ).

tff(f_109,axiom,
    ! [Sigma,W,Z,X,Y] :
      ( ~ heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(next(Z,W),Sigma))))
      | heap(sep(lseg(X,Z),sep(next(Z,W),Sigma))) ),
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [T_2,S_1,Sigma_3] : ( sep(T_2,sep(S_1,Sigma_3)) = sep(S_1,sep(T_2,Sigma_3)) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_42,plain,
    ~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
    inference(cnfTransformation,[status(thm)],[f_139]) ).

tff(c_43,plain,
    ~ heap(sep(lseg(x3,x2),sep(lseg(x4,nil),sep(next(x2,x4),emp)))),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_42]) ).

tff(c_32,plain,
    x2 != x1,
    inference(cnfTransformation,[status(thm)],[f_130]) ).

tff(c_40,plain,
    heap(sep(next(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
    inference(cnfTransformation,[status(thm)],[f_137]) ).

tff(c_44,plain,
    heap(sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x1,x2),sep(next(x2,x4),emp))))),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_40]) ).

tff(c_61,plain,
    ! [T_45,S_46,Sigma_47] : ( sep(T_45,sep(S_46,Sigma_47)) = sep(S_46,sep(T_45,Sigma_47)) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_112,plain,
    ! [T_45,T_2,S_1,Sigma_3] : ( sep(T_45,sep(T_2,sep(S_1,Sigma_3))) = sep(S_1,sep(T_45,sep(T_2,Sigma_3))) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_61]) ).

tff(c_4,plain,
    ! [X_4,Sigma_5] : ( sep(lseg(X_4,X_4),Sigma_5) = Sigma_5 ),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_970,plain,
    ! [X_104,Z_105,Sigma_106,Y_107] :
      ( heap(sep(lseg(X_104,Z_105),Sigma_106))
      | ( Y_107 = X_104 )
      | ~ heap(sep(next(X_104,Y_107),sep(lseg(Y_107,Z_105),Sigma_106))) ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_1061,plain,
    ! [X_113,X_114,Sigma_115] :
      ( heap(sep(lseg(X_113,X_114),Sigma_115))
      | ( X_114 = X_113 )
      | ~ heap(sep(next(X_113,X_114),Sigma_115)) ),
    inference(superposition,[status(thm),theory(equality)],[c_4,c_970]) ).

tff(c_82341,plain,
    ! [X_628,Sigma_630,T_629,T_627,X_631] :
      ( heap(sep(lseg(X_631,X_628),sep(T_629,sep(T_627,Sigma_630))))
      | ( X_631 = X_628 )
      | ~ heap(sep(T_629,sep(T_627,sep(next(X_631,X_628),Sigma_630)))) ),
    inference(superposition,[status(thm),theory(equality)],[c_112,c_1061]) ).

tff(c_82697,plain,
    ( heap(sep(lseg(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp)))))
    | ( x2 = x1 ) ),
    inference(resolution,[status(thm)],[c_44,c_82341]) ).

tff(c_82752,plain,
    heap(sep(lseg(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
    inference(negUnitSimplification,[status(thm)],[c_32,c_82697]) ).

tff(c_1006,plain,
    ! [Y_108,X_109,Sigma_111,Z_110,W_112] :
      ( heap(sep(lseg(X_109,Z_110),sep(next(Z_110,W_112),Sigma_111)))
      | ~ heap(sep(lseg(X_109,Y_108),sep(lseg(Y_108,Z_110),sep(next(Z_110,W_112),Sigma_111)))) ),
    inference(cnfTransformation,[status(thm)],[f_109]) ).

tff(c_5432,plain,
    ! [Sigma_243,Z_241,X_242,W_240,Y_244] :
      ( heap(sep(lseg(X_242,Z_241),sep(next(Z_241,W_240),Sigma_243)))
      | ~ heap(sep(lseg(Y_244,Z_241),sep(lseg(X_242,Y_244),sep(next(Z_241,W_240),Sigma_243)))) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_1006]) ).

tff(c_100341,plain,
    ! [Sigma_778,W_777,Y_774,Z_779,T_775,X_776] :
      ( heap(sep(lseg(X_776,Z_779),sep(next(Z_779,W_777),sep(T_775,Sigma_778))))
      | ~ heap(sep(lseg(Y_774,Z_779),sep(lseg(X_776,Y_774),sep(T_775,sep(next(Z_779,W_777),Sigma_778))))) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_5432]) ).

tff(c_100344,plain,
    heap(sep(lseg(x3,x2),sep(next(x2,x4),sep(lseg(x4,nil),emp)))),
    inference(resolution,[status(thm)],[c_82752,c_100341]) ).

tff(c_101056,plain,
    heap(sep(lseg(x3,x2),sep(lseg(x4,nil),sep(next(x2,x4),emp)))),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_100344]) ).

tff(c_101058,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_43,c_101056]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SWW407-1 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.15  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.16/0.36  % Computer : n020.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 300
% 0.16/0.36  % DateTime : Thu Aug  3 19:33:37 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 90.74/76.33  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 90.74/76.34  
% 90.74/76.34  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 90.82/76.37  
% 90.82/76.37  Inference rules
% 90.82/76.37  ----------------------
% 90.82/76.37  #Ref     : 0
% 90.82/76.37  #Sup     : 27183
% 90.82/76.37  #Fact    : 0
% 90.82/76.37  #Define  : 0
% 90.82/76.37  #Split   : 0
% 90.82/76.37  #Chain   : 0
% 90.82/76.37  #Close   : 0
% 90.82/76.37  
% 90.82/76.37  Ordering : KBO
% 90.82/76.37  
% 90.82/76.37  Simplification rules
% 90.82/76.37  ----------------------
% 90.82/76.37  #Subsume      : 10208
% 90.82/76.37  #Demod        : 1670
% 90.82/76.37  #Tautology    : 783
% 90.82/76.37  #SimpNegUnit  : 2
% 90.82/76.37  #BackRed      : 0
% 90.82/76.37  
% 90.82/76.37  #Partial instantiations: 0
% 90.82/76.37  #Strategies tried      : 1
% 90.82/76.37  
% 90.82/76.37  Timing (in seconds)
% 90.82/76.37  ----------------------
% 90.82/76.37  Preprocessing        : 0.49
% 90.82/76.37  Parsing              : 0.25
% 90.82/76.37  CNF conversion       : 0.03
% 90.82/76.37  Main loop            : 74.79
% 90.82/76.37  Inferencing          : 3.83
% 90.82/76.37  Reduction            : 66.71
% 90.82/76.37  Demodulation         : 65.96
% 90.82/76.37  BG Simplification    : 0.42
% 90.82/76.37  Subsumption          : 2.86
% 90.82/76.37  Abstraction          : 0.48
% 90.82/76.37  MUC search           : 0.00
% 90.82/76.37  Cooper               : 0.00
% 90.82/76.37  Total                : 75.34
% 90.82/76.37  Index Insertion      : 0.00
% 90.82/76.37  Index Deletion       : 0.00
% 90.82/76.37  Index Matching       : 0.00
% 90.82/76.37  BG Taut test         : 0.00
%------------------------------------------------------------------------------