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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWW425-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 : n016.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:14 EDT 2023

% Result   : Unsatisfiable 160.90s 140.73s
% Output   : CNFRefutation 160.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   54 (  29 unt;  16 typ;   0 def)
%            Number of atoms       :   51 (  34 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   23 (  10   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :   10 (   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    :   15 (  15 usr;  12 con; 0-2 aty)
%            Number of variables   :   33 (;  33   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ heap > sep > next > lseg > #nlpp > x9 > x8 > x7 > x6 > x5 > x4 > x3 > x2 > x10 > x1 > nil > emp

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(x9,type,
    x9: $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(x5,type,
    x5: $i ).

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

tff(f_138,axiom,
    x7 != x10,
    file(unknown,unknown) ).

tff(f_128,axiom,
    x1 != x10,
    file(unknown,unknown) ).

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

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

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

tff(f_145,axiom,
    heap(sep(lseg(x5,x7),sep(lseg(x2,x5),sep(lseg(x2,x10),sep(lseg(x2,x1),sep(lseg(x9,x1),sep(lseg(x7,x6),sep(lseg(x3,x10),sep(lseg(x6,x9),emp))))))))),
    file(unknown,unknown) ).

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

tff(c_38,plain,
    x7 != x10,
    inference(cnfTransformation,[status(thm)],[f_138]) ).

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

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

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_54]) ).

tff(c_67,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_54]) ).

tff(c_82,plain,
    ! [T_45,T_2,S_46,Sigma_47] : ( sep(T_45,sep(T_2,sep(S_46,Sigma_47))) = sep(T_2,sep(S_46,sep(T_45,Sigma_47))) ),
    inference(superposition,[status(thm),theory(equality)],[c_67,c_2]) ).

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

tff(c_46,plain,
    heap(sep(lseg(x5,x7),sep(lseg(x2,x5),sep(lseg(x2,x10),sep(lseg(x2,x1),sep(lseg(x9,x1),sep(lseg(x7,x6),sep(lseg(x3,x10),sep(lseg(x6,x9),emp))))))))),
    inference(cnfTransformation,[status(thm)],[f_145]) ).

tff(c_50,plain,
    heap(sep(lseg(x2,x1),sep(lseg(x2,x10),sep(lseg(x2,x5),sep(lseg(x3,x10),sep(lseg(x5,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),emp))))))))),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_2,c_2,c_2,c_2,c_2,c_2,c_2,c_2,c_2,c_2,c_46]) ).

tff(c_14,plain,
    ! [Z_20,X_18,Y_19,Sigma_21] :
      ( ( Z_20 = X_18 )
      | ( Y_19 = X_18 )
      | ~ heap(sep(lseg(X_18,Y_19),sep(lseg(X_18,Z_20),Sigma_21))) ),
    inference(cnfTransformation,[status(thm)],[f_85]) ).

tff(c_2016,plain,
    ( ( x2 = x10 )
    | ( x2 = x1 ) ),
    inference(resolution,[status(thm)],[c_50,c_14]) ).

tff(c_2017,plain,
    x2 = x1,
    inference(splitLeft,[status(thm)],[c_2016]) ).

tff(c_2018,plain,
    heap(sep(lseg(x1,x1),sep(lseg(x1,x10),sep(lseg(x1,x5),sep(lseg(x3,x10),sep(lseg(x5,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),emp))))))))),
    inference(demodulation,[status(thm),theory(equality)],[c_2017,c_2017,c_2017,c_50]) ).

tff(c_2022,plain,
    heap(sep(lseg(x1,x10),sep(lseg(x1,x5),sep(lseg(x3,x10),sep(lseg(x5,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),emp)))))))),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_2018]) ).

tff(c_315,plain,
    ! [Z_71,X_72,Y_73,Sigma_74] :
      ( ( Z_71 = X_72 )
      | ( Y_73 = X_72 )
      | ~ heap(sep(lseg(X_72,Y_73),sep(lseg(X_72,Z_71),Sigma_74))) ),
    inference(cnfTransformation,[status(thm)],[f_85]) ).

tff(c_331,plain,
    ! [Z_71,X_72,Y_73,Sigma_3] :
      ( ( Z_71 = X_72 )
      | ( Y_73 = X_72 )
      | ~ heap(sep(lseg(X_72,Z_71),sep(lseg(X_72,Y_73),Sigma_3))) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_315]) ).

tff(c_8181,plain,
    ( ( x10 = x1 )
    | ( x5 = x1 ) ),
    inference(resolution,[status(thm)],[c_2022,c_331]) ).

tff(c_8197,plain,
    x5 = x1,
    inference(negUnitSimplification,[status(thm)],[c_28,c_8181]) ).

tff(c_8201,plain,
    heap(sep(lseg(x1,x10),sep(lseg(x1,x1),sep(lseg(x3,x10),sep(lseg(x1,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),emp)))))))),
    inference(demodulation,[status(thm),theory(equality)],[c_8197,c_8197,c_2022]) ).

tff(c_8202,plain,
    heap(sep(lseg(x1,x10),sep(lseg(x1,x7),sep(lseg(x3,x10),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),emp))))))),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_4,c_8201]) ).

tff(c_96619,plain,
    ( ( x10 = x1 )
    | ( x7 = x1 ) ),
    inference(resolution,[status(thm)],[c_8202,c_331]) ).

tff(c_96636,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_26,c_28,c_96619]) ).

tff(c_96637,plain,
    x2 = x10,
    inference(splitRight,[status(thm)],[c_2016]) ).

tff(c_96639,plain,
    heap(sep(lseg(x10,x1),sep(lseg(x10,x10),sep(lseg(x10,x5),sep(lseg(x3,x10),sep(lseg(x5,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),emp))))))))),
    inference(demodulation,[status(thm),theory(equality)],[c_96637,c_96637,c_96637,c_50]) ).

tff(c_96643,plain,
    heap(sep(lseg(x10,x1),sep(lseg(x10,x5),sep(lseg(x3,x10),sep(lseg(x5,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),emp)))))))),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_96639]) ).

tff(c_102497,plain,
    ( ( x10 = x1 )
    | ( x5 = x10 ) ),
    inference(resolution,[status(thm)],[c_96643,c_331]) ).

tff(c_102511,plain,
    x5 = x10,
    inference(negUnitSimplification,[status(thm)],[c_28,c_102497]) ).

tff(c_102515,plain,
    heap(sep(lseg(x10,x1),sep(lseg(x10,x10),sep(lseg(x3,x10),sep(lseg(x10,x7),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),emp)))))))),
    inference(demodulation,[status(thm),theory(equality)],[c_102511,c_102511,c_96643]) ).

tff(c_102516,plain,
    heap(sep(lseg(x10,x1),sep(lseg(x10,x7),sep(lseg(x3,x10),sep(lseg(x6,x9),sep(lseg(x7,x6),sep(lseg(x9,x1),emp))))))),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_2,c_82,c_82,c_82,c_102515]) ).

tff(c_191228,plain,
    ( ( x10 = x1 )
    | ( x7 = x10 ) ),
    inference(resolution,[status(thm)],[c_102516,c_331]) ).

tff(c_191245,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_38,c_28,c_191228]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SWW425-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 : n016.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.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 19:54:53 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 160.90/140.73  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 160.90/140.74  
% 160.90/140.74  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 160.90/140.77  
% 160.90/140.77  Inference rules
% 160.90/140.77  ----------------------
% 160.90/140.77  #Ref     : 0
% 160.90/140.77  #Sup     : 51633
% 160.90/140.77  #Fact    : 0
% 160.90/140.77  #Define  : 0
% 160.90/140.77  #Split   : 1
% 160.90/140.77  #Chain   : 0
% 160.90/140.77  #Close   : 0
% 160.90/140.77  
% 160.90/140.77  Ordering : KBO
% 160.90/140.77  
% 160.90/140.77  Simplification rules
% 160.90/140.77  ----------------------
% 160.90/140.77  #Subsume      : 19813
% 160.90/140.77  #Demod        : 3288
% 160.90/140.77  #Tautology    : 1518
% 160.90/140.77  #SimpNegUnit  : 8
% 160.90/140.77  #BackRed      : 10
% 160.90/140.77  
% 160.90/140.77  #Partial instantiations: 0
% 160.90/140.77  #Strategies tried      : 1
% 160.90/140.77  
% 160.90/140.77  Timing (in seconds)
% 160.90/140.77  ----------------------
% 160.90/140.77  Preprocessing        : 0.51
% 160.90/140.77  Parsing              : 0.26
% 160.90/140.77  CNF conversion       : 0.03
% 160.90/140.77  Main loop            : 139.18
% 160.90/140.77  Inferencing          : 7.08
% 160.90/140.77  Reduction            : 124.45
% 160.90/140.77  Demodulation         : 123.14
% 160.90/140.77  BG Simplification    : 0.77
% 160.90/140.77  Subsumption          : 5.14
% 160.90/140.77  Abstraction          : 0.96
% 160.90/140.77  MUC search           : 0.00
% 160.90/140.77  Cooper               : 0.00
% 160.90/140.77  Total                : 139.74
% 160.90/140.77  Index Insertion      : 0.00
% 160.90/140.77  Index Deletion       : 0.00
% 160.90/140.77  Index Matching       : 0.00
% 160.90/140.77  BG Taut test         : 0.00
%------------------------------------------------------------------------------