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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWW409-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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n025.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 44.63s 33.48s
% Output   : CNFRefutation 44.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   34 (  16 unt;   9 typ;   0 def)
%            Number of atoms       :   38 (  13 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   25 (  12   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 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   :   46 (;  46   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ heap > sep > next > lseg > #nlpp > 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(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_131,axiom,
    ~ heap(sep(lseg(x2,nil),emp)),
    file(unknown,unknown) ).

tff(f_126,axiom,
    x1 != x3,
    file(unknown,unknown) ).

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

tff(f_52,axiom,
    ! [S,T,Sigma] : ( sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)) ),
    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_102,axiom,
    ! [X,Y,Sigma] :
      ( ~ heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))
      | heap(sep(lseg(X,nil),Sigma)) ),
    file(unknown,unknown) ).

tff(c_34,plain,
    ~ heap(sep(lseg(x2,nil),emp)),
    inference(cnfTransformation,[status(thm)],[f_131]) ).

tff(c_28,plain,
    x3 != x1,
    inference(cnfTransformation,[status(thm)],[f_126]) ).

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

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_52,plain,
    ! [T_49,S_50,Sigma_51] : ( sep(T_49,sep(S_50,Sigma_51)) = sep(S_50,sep(T_49,Sigma_51)) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_119,plain,
    ! [T_49,T_2,S_1,Sigma_3] : ( sep(T_49,sep(T_2,sep(S_1,Sigma_3))) = sep(S_1,sep(T_49,sep(T_2,Sigma_3))) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_52]) ).

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_1017,plain,
    ! [X_109,Z_110,Sigma_111,Y_112] :
      ( heap(sep(lseg(X_109,Z_110),Sigma_111))
      | ( Y_112 = X_109 )
      | ~ heap(sep(next(X_109,Y_112),sep(lseg(Y_112,Z_110),Sigma_111))) ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_1108,plain,
    ! [X_118,X_119,Sigma_120] :
      ( heap(sep(lseg(X_118,X_119),Sigma_120))
      | ( X_119 = X_118 )
      | ~ heap(sep(next(X_118,X_119),Sigma_120)) ),
    inference(superposition,[status(thm),theory(equality)],[c_4,c_1017]) ).

tff(c_61789,plain,
    ! [X_568,T_571,T_569,Sigma_570,X_572] :
      ( heap(sep(lseg(X_572,X_568),sep(T_571,sep(T_569,Sigma_570))))
      | ( X_572 = X_568 )
      | ~ heap(sep(T_571,sep(T_569,sep(next(X_572,X_568),Sigma_570)))) ),
    inference(superposition,[status(thm),theory(equality)],[c_119,c_1108]) ).

tff(c_62103,plain,
    ( heap(sep(lseg(x1,x3),sep(lseg(x2,x1),sep(lseg(x3,nil),emp))))
    | ( x3 = x1 ) ),
    inference(resolution,[status(thm)],[c_32,c_61789]) ).

tff(c_62138,plain,
    heap(sep(lseg(x1,x3),sep(lseg(x2,x1),sep(lseg(x3,nil),emp)))),
    inference(negUnitSimplification,[status(thm)],[c_28,c_62103]) ).

tff(c_459,plain,
    ! [X_93,Sigma_94,Y_95] :
      ( heap(sep(lseg(X_93,nil),Sigma_94))
      | ~ heap(sep(lseg(X_93,Y_95),sep(lseg(Y_95,nil),Sigma_94))) ),
    inference(cnfTransformation,[status(thm)],[f_102]) ).

tff(c_463,plain,
    ! [X_93,T_2,Sigma_3,Y_95] :
      ( heap(sep(lseg(X_93,nil),sep(T_2,Sigma_3)))
      | ~ heap(sep(lseg(X_93,Y_95),sep(T_2,sep(lseg(Y_95,nil),Sigma_3)))) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_459]) ).

tff(c_62168,plain,
    heap(sep(lseg(x1,nil),sep(lseg(x2,x1),emp))),
    inference(resolution,[status(thm)],[c_62138,c_463]) ).

tff(c_467,plain,
    ! [X_93,Sigma_3,Y_95] :
      ( heap(sep(lseg(X_93,nil),Sigma_3))
      | ~ heap(sep(lseg(Y_95,nil),sep(lseg(X_93,Y_95),Sigma_3))) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_459]) ).

tff(c_62173,plain,
    heap(sep(lseg(x2,nil),emp)),
    inference(resolution,[status(thm)],[c_62168,c_467]) ).

tff(c_62179,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_34,c_62173]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SWW409-1 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.14  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35  % Computer : n025.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 19:44:50 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 44.63/33.48  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 44.63/33.48  
% 44.63/33.48  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 44.63/33.51  
% 44.63/33.51  Inference rules
% 44.63/33.51  ----------------------
% 44.63/33.51  #Ref     : 0
% 44.63/33.51  #Sup     : 16856
% 44.63/33.51  #Fact    : 0
% 44.63/33.51  #Define  : 0
% 44.63/33.51  #Split   : 0
% 44.63/33.51  #Chain   : 0
% 44.63/33.51  #Close   : 0
% 44.63/33.51  
% 44.63/33.51  Ordering : KBO
% 44.63/33.51  
% 44.63/33.51  Simplification rules
% 44.63/33.51  ----------------------
% 44.63/33.51  #Subsume      : 7128
% 44.63/33.51  #Demod        : 993
% 44.63/33.51  #Tautology    : 621
% 44.63/33.51  #SimpNegUnit  : 2
% 44.63/33.51  #BackRed      : 0
% 44.63/33.51  
% 44.63/33.51  #Partial instantiations: 0
% 44.63/33.51  #Strategies tried      : 1
% 44.63/33.51  
% 44.63/33.51  Timing (in seconds)
% 44.63/33.51  ----------------------
% 44.63/33.52  Preprocessing        : 0.46
% 44.63/33.52  Parsing              : 0.24
% 44.63/33.52  CNF conversion       : 0.02
% 44.63/33.52  Main loop            : 32.00
% 44.63/33.52  Inferencing          : 2.40
% 44.63/33.52  Reduction            : 27.69
% 44.63/33.52  Demodulation         : 27.30
% 44.63/33.52  BG Simplification    : 0.25
% 44.63/33.52  Subsumption          : 1.38
% 44.63/33.52  Abstraction          : 0.33
% 44.63/33.52  MUC search           : 0.00
% 44.63/33.52  Cooper               : 0.00
% 44.63/33.52  Total                : 32.51
% 44.63/33.52  Index Insertion      : 0.00
% 44.63/33.52  Index Deletion       : 0.00
% 44.63/33.52  Index Matching       : 0.00
% 44.63/33.52  BG Taut test         : 0.00
%------------------------------------------------------------------------------