TSTP Solution File: DAT006_1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : DAT006_1 : TPTP v8.1.2. Released v5.0.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 : n006.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 10:36:56 EDT 2023

% Result   : Theorem 2.90s 1.73s
% Output   : CNFRefutation 3.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   18 (   5 unt;   5 typ;   0 def)
%            Number of atoms       :   27 (  26 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   16 (   2   ~;  13   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number arithmetic     :   65 (   0 atm;   0 fun;  50 num;  15 var)
%            Number of types       :    2 (   1 usr;   1 ari)
%            Number of type conns  :    5 (   2   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (   4 usr;   9 con; 0-3 aty)
%            Number of variables   :   21 (;  20   !;   1   ?;  21   :)

% Comments : 
%------------------------------------------------------------------------------
%$ write > read > #nlpp > #skF_1 > #skF_2

%Foreground sorts:
tff(array,type,
    array: $tType ).

%Background operators:

%Foreground operators:
tff(write,type,
    write: ( array * $int * $int ) > array ).

tff('#skF_1',type,
    '#skF_1': array ).

tff('#skF_2',type,
    '#skF_2': array ).

tff(read,type,
    read: ( array * $int ) > $int ).

tff(f_71,negated_conjecture,
    ~ ! [U: array,V: array] :
        ( ( U = write(write(write(write(V,3,33),4,444),5,55),4,44) )
       => ? [Wa: $int] : ( read(U,Wa) = 33 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

tff(f_63,axiom,
    ! [X: array,Ya: $int,Za: $int,X1a: $int] :
      ( ( Ya = Za )
      | ( read(write(X,Ya,X1a),Za) = read(X,Za) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/DAT001_0.ax',ax2) ).

tff(f_59,axiom,
    ! [U: array,Va: $int,Wa: $int] : ( read(write(U,Va,Wa),Va) = Wa ),
    file('/export/starexec/sandbox/benchmark/Axioms/DAT001_0.ax',ax1) ).

tff(c_9,plain,
    ! [W_9a: $int] : ( read('#skF_1',W_9a) != 33 ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_10,plain,
    ! [X_4: array,Y_5a: $int,X1_7a: $int,Z_6a: $int] :
      ( ( read(write(X_4,Y_5a,X1_7a),Z_6a) = read(X_4,Z_6a) )
      | ( Z_6a = Y_5a ) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_8,plain,
    write(write(write(write('#skF_2',3,33),4,444),5,55),4,44) = '#skF_1',
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_68,plain,
    ! [Z_18a: $int] :
      ( ( read(write(write(write('#skF_2',3,33),4,444),5,55),Z_18a) = read('#skF_1',Z_18a) )
      | ( Z_18a = 4 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_10]) ).

tff(c_111,plain,
    ! [Z_19a: $int] :
      ( ( read(write(write('#skF_2',3,33),4,444),Z_19a) = read('#skF_1',Z_19a) )
      | ( Z_19a = 4 )
      | ( Z_19a = 5 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_10,c_68]) ).

tff(c_145,plain,
    ! [Z_20a: $int] :
      ( ( read(write('#skF_2',3,33),Z_20a) = read('#skF_1',Z_20a) )
      | ( Z_20a = 4 )
      | ( Z_20a = 4 )
      | ( Z_20a = 5 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_111,c_10]) ).

tff(c_11,plain,
    ! [U_1: array,V_2a: $int,W_3a: $int] : ( read(write(U_1,V_2a,W_3a),V_2a) = W_3a ),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_155,plain,
    ( ( read('#skF_1',3) = 33 )
    | ( 4 = 3 )
    | ( 4 = 3 )
    | ( 5 = 3 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_145,c_11]) ).

tff(c_170,plain,
    ( ( 4 = 3 )
    | ( 4 = 3 )
    | ( 5 = 3 ) ),
    inference(negUnitSimplification,[status(thm)],[c_9,c_155]) ).

tff(c_173,plain,
    $false,
    inference(backgroundSimplification,[status(thm),theory('LIA')],[c_170]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : DAT006_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.14  % 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.13/0.35  % Computer : n006.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 13:10:28 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 2.90/1.73  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.90/1.74  
% 2.90/1.74  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.06/1.76  
% 3.06/1.76  Inference rules
% 3.06/1.76  ----------------------
% 3.06/1.76  #Ref     : 0
% 3.06/1.76  #Sup     : 34
% 3.06/1.76  #Fact    : 0
% 3.06/1.76  #Define  : 0
% 3.06/1.76  #Split   : 0
% 3.06/1.76  #Chain   : 0
% 3.06/1.76  #Close   : 0
% 3.06/1.76  
% 3.06/1.76  Ordering : LPO
% 3.06/1.76  
% 3.06/1.76  Simplification rules
% 3.06/1.76  ----------------------
% 3.06/1.76  #Subsume      : 1
% 3.06/1.76  #Demod        : 3
% 3.06/1.76  #Tautology    : 22
% 3.06/1.76  #SimpNegUnit  : 1
% 3.06/1.76  #BackRed      : 0
% 3.06/1.76  
% 3.06/1.76  #Partial instantiations: 0
% 3.06/1.76  #Strategies tried      : 1
% 3.06/1.76  
% 3.06/1.76  Timing (in seconds)
% 3.06/1.76  ----------------------
% 3.06/1.76  Preprocessing        : 0.50
% 3.06/1.76  Parsing              : 0.27
% 3.06/1.76  CNF conversion       : 0.02
% 3.06/1.76  Main loop            : 0.21
% 3.06/1.76  Inferencing          : 0.09
% 3.06/1.76  Reduction            : 0.05
% 3.06/1.76  Demodulation         : 0.03
% 3.06/1.76  BG Simplification    : 0.03
% 3.06/1.76  Subsumption          : 0.04
% 3.06/1.76  Abstraction          : 0.01
% 3.06/1.76  MUC search           : 0.00
% 3.06/1.76  Cooper               : 0.00
% 3.06/1.76  Total                : 0.75
% 3.06/1.76  Index Insertion      : 0.00
% 3.06/1.76  Index Deletion       : 0.00
% 3.06/1.76  Index Matching       : 0.00
% 3.06/1.76  BG Taut test         : 0.00
%------------------------------------------------------------------------------