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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWW421-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 : n031.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 6.50s 2.60s
% Output   : CNFRefutation 6.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   22 (   9 unt;   9 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    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   18 (;  18   !;   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_124,axiom,
    x2 != x1,
    file(unknown,unknown) ).

tff(f_129,axiom,
    ~ heap(sep(lseg(x1,x3),emp)),
    file(unknown,unknown) ).

tff(f_127,axiom,
    heap(sep(lseg(x2,x3),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_32,plain,
    ~ heap(sep(lseg(x1,x3),emp)),
    inference(cnfTransformation,[status(thm)],[f_129]) ).

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

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_482,plain,
    ! [X_96,Z_97,Sigma_98,Y_99] :
      ( heap(sep(lseg(X_96,Z_97),Sigma_98))
      | ( Y_99 = X_96 )
      | ~ heap(sep(next(X_96,Y_99),sep(lseg(Y_99,Z_97),Sigma_98))) ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_4180,plain,
    ! [X_190,Z_191,Sigma_192,Y_193] :
      ( heap(sep(lseg(X_190,Z_191),Sigma_192))
      | ( Y_193 = X_190 )
      | ~ heap(sep(lseg(Y_193,Z_191),sep(next(X_190,Y_193),Sigma_192))) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_482]) ).

tff(c_4235,plain,
    ( heap(sep(lseg(x1,x3),emp))
    | ( x2 = x1 ) ),
    inference(resolution,[status(thm)],[c_30,c_4180]) ).

tff(c_4259,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_26,c_32,c_4235]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SWW421-1 : TPTP v8.1.2. Released v5.2.0.
% 0.14/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.15/0.36  % Computer : n031.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 20:01:00 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 6.50/2.60  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.50/2.61  
% 6.50/2.61  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.70/2.63  
% 6.70/2.63  Inference rules
% 6.70/2.63  ----------------------
% 6.70/2.63  #Ref     : 0
% 6.70/2.63  #Sup     : 1085
% 6.70/2.63  #Fact    : 0
% 6.70/2.63  #Define  : 0
% 6.70/2.63  #Split   : 0
% 6.70/2.63  #Chain   : 0
% 6.70/2.63  #Close   : 0
% 6.70/2.63  
% 6.70/2.63  Ordering : KBO
% 6.70/2.63  
% 6.70/2.63  Simplification rules
% 6.70/2.63  ----------------------
% 6.70/2.63  #Subsume      : 497
% 6.70/2.63  #Demod        : 69
% 6.70/2.63  #Tautology    : 111
% 6.70/2.63  #SimpNegUnit  : 1
% 6.70/2.63  #BackRed      : 0
% 6.70/2.63  
% 6.70/2.63  #Partial instantiations: 0
% 6.70/2.63  #Strategies tried      : 1
% 6.70/2.63  
% 6.70/2.63  Timing (in seconds)
% 6.70/2.63  ----------------------
% 6.70/2.63  Preprocessing        : 0.48
% 6.70/2.63  Parsing              : 0.25
% 6.70/2.63  CNF conversion       : 0.02
% 6.70/2.63  Main loop            : 1.10
% 6.70/2.63  Inferencing          : 0.33
% 6.70/2.63  Reduction            : 0.53
% 6.70/2.63  Demodulation         : 0.47
% 6.70/2.64  BG Simplification    : 0.04
% 6.70/2.64  Subsumption          : 0.15
% 6.70/2.64  Abstraction          : 0.04
% 6.70/2.64  MUC search           : 0.00
% 6.70/2.64  Cooper               : 0.00
% 6.70/2.64  Total                : 1.61
% 6.70/2.64  Index Insertion      : 0.00
% 6.70/2.64  Index Deletion       : 0.00
% 6.70/2.64  Index Matching       : 0.00
% 6.70/2.64  BG Taut test         : 0.00
%------------------------------------------------------------------------------