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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWW417-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 : n026.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:13 EDT 2023

% Result   : Unsatisfiable 6.89s 2.70s
% Output   : CNFRefutation 7.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   21 (   9 unt;   8 typ;   0 def)
%            Number of atoms       :   20 (   8 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   14 (   7   ~;   7   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   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    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   18 (;  18   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ heap > sep > next > lseg > #nlpp > 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(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_124,axiom,
    x2 != x1,
    file(unknown,unknown) ).

tff(f_127,axiom,
    ~ heap(sep(lseg(x1,nil),emp)),
    file(unknown,unknown) ).

tff(f_125,axiom,
    heap(sep(lseg(x2,nil),sep(next(x1,x2),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_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(c_26,plain,
    x2 != x1,
    inference(cnfTransformation,[status(thm)],[f_124]) ).

tff(c_30,plain,
    ~ heap(sep(lseg(x1,nil),emp)),
    inference(cnfTransformation,[status(thm)],[f_127]) ).

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

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_506,plain,
    ! [X_100,Z_101,Sigma_102,Y_103] :
      ( heap(sep(lseg(X_100,Z_101),Sigma_102))
      | ( Y_103 = X_100 )
      | ~ heap(sep(next(X_100,Y_103),sep(lseg(Y_103,Z_101),Sigma_102))) ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_4031,plain,
    ! [X_184,Z_185,Sigma_186,Y_187] :
      ( heap(sep(lseg(X_184,Z_185),Sigma_186))
      | ( Y_187 = X_184 )
      | ~ heap(sep(lseg(Y_187,Z_185),sep(next(X_184,Y_187),Sigma_186))) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_506]) ).

tff(c_4102,plain,
    ( heap(sep(lseg(x1,nil),emp))
    | ( x2 = x1 ) ),
    inference(resolution,[status(thm)],[c_28,c_4031]) ).

tff(c_4110,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_26,c_30,c_4102]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWW417-1 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.13  % 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.14/0.34  % Computer : n026.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu Aug  3 19:27:01 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 6.89/2.70  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.89/2.70  
% 6.89/2.70  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.04/2.72  
% 7.04/2.72  Inference rules
% 7.04/2.72  ----------------------
% 7.04/2.73  #Ref     : 0
% 7.04/2.73  #Sup     : 1049
% 7.04/2.73  #Fact    : 0
% 7.04/2.73  #Define  : 0
% 7.04/2.73  #Split   : 0
% 7.04/2.73  #Chain   : 0
% 7.04/2.73  #Close   : 0
% 7.04/2.73  
% 7.04/2.73  Ordering : KBO
% 7.04/2.73  
% 7.04/2.73  Simplification rules
% 7.04/2.73  ----------------------
% 7.04/2.73  #Subsume      : 467
% 7.04/2.73  #Demod        : 67
% 7.04/2.73  #Tautology    : 109
% 7.04/2.73  #SimpNegUnit  : 1
% 7.04/2.73  #BackRed      : 0
% 7.04/2.73  
% 7.04/2.73  #Partial instantiations: 0
% 7.04/2.73  #Strategies tried      : 1
% 7.04/2.73  
% 7.04/2.73  Timing (in seconds)
% 7.04/2.73  ----------------------
% 7.04/2.73  Preprocessing        : 0.51
% 7.04/2.73  Parsing              : 0.26
% 7.04/2.73  CNF conversion       : 0.03
% 7.04/2.73  Main loop            : 1.16
% 7.04/2.73  Inferencing          : 0.35
% 7.04/2.73  Reduction            : 0.58
% 7.04/2.73  Demodulation         : 0.51
% 7.04/2.73  BG Simplification    : 0.04
% 7.04/2.73  Subsumption          : 0.15
% 7.04/2.73  Abstraction          : 0.04
% 7.04/2.73  MUC search           : 0.00
% 7.04/2.73  Cooper               : 0.00
% 7.04/2.73  Total                : 1.71
% 7.04/2.73  Index Insertion      : 0.00
% 7.04/2.73  Index Deletion       : 0.00
% 7.04/2.73  Index Matching       : 0.00
% 7.04/2.73  BG Taut test         : 0.00
%------------------------------------------------------------------------------