TSTP Solution File: SWV412+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWV412+1 : TPTP v8.1.2. Released v3.3.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 : n032.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:04:02 EDT 2023

% Result   : Theorem 3.82s 2.02s
% Output   : CNFRefutation 4.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   25 (   5 unt;  16 typ;   0 def)
%            Number of atoms       :   17 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   14 (   6   ~;   3   |;   3   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   20 (  10   >;  10   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :   14 (;  14   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ pair_in_list > strictly_less_than > less_than > contains_slb > isnonempty_slb > update_slb > remove_slb > pair > lookup_slb > insert_slb > #nlpp > create_slb > bottom > #skF_2 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

tff(pair_in_list,type,
    pair_in_list: ( $i * $i * $i ) > $o ).

tff(less_than,type,
    less_than: ( $i * $i ) > $o ).

tff('#skF_2',type,
    '#skF_2': $i ).

tff('#skF_3',type,
    '#skF_3': $i ).

tff('#skF_1',type,
    '#skF_1': $i ).

tff(strictly_less_than,type,
    strictly_less_than: ( $i * $i ) > $o ).

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

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

tff('#skF_4',type,
    '#skF_4': $i ).

tff(isnonempty_slb,type,
    isnonempty_slb: $i > $o ).

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

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

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

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

tff(f_168,negated_conjecture,
    ~ ! [U,V,W,X] :
        ( ( pair_in_list(U,V,W)
          & strictly_less_than(V,X)
          & strictly_less_than(W,X) )
       => pair_in_list(update_slb(U,X),V,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l48_co) ).

tff(f_158,lemma,
    ! [U,V,W,X] :
      ( ( pair_in_list(U,V,W)
        & strictly_less_than(W,X) )
     => pair_in_list(update_slb(U,X),V,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l48_li3839) ).

tff(c_60,plain,
    pair_in_list('#skF_1','#skF_2','#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_168]) ).

tff(c_56,plain,
    strictly_less_than('#skF_3','#skF_4'),
    inference(cnfTransformation,[status(thm)],[f_168]) ).

tff(c_1154,plain,
    ! [U_129,X_130,V_131,W_132] :
      ( pair_in_list(update_slb(U_129,X_130),V_131,X_130)
      | ~ strictly_less_than(W_132,X_130)
      | ~ pair_in_list(U_129,V_131,W_132) ),
    inference(cnfTransformation,[status(thm)],[f_158]) ).

tff(c_1164,plain,
    ! [U_133,V_134] :
      ( pair_in_list(update_slb(U_133,'#skF_4'),V_134,'#skF_4')
      | ~ pair_in_list(U_133,V_134,'#skF_3') ),
    inference(resolution,[status(thm)],[c_56,c_1154]) ).

tff(c_54,plain,
    ~ pair_in_list(update_slb('#skF_1','#skF_4'),'#skF_2','#skF_4'),
    inference(cnfTransformation,[status(thm)],[f_168]) ).

tff(c_1167,plain,
    ~ pair_in_list('#skF_1','#skF_2','#skF_3'),
    inference(resolution,[status(thm)],[c_1164,c_54]) ).

tff(c_1175,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_60,c_1167]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SWV412+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12  % 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.11/0.32  % Computer : n032.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Thu Aug  3 23:08:06 EDT 2023
% 0.11/0.32  % CPUTime  : 
% 3.82/2.02  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.82/2.03  
% 3.82/2.03  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.15/2.05  
% 4.15/2.05  Inference rules
% 4.15/2.05  ----------------------
% 4.15/2.05  #Ref     : 0
% 4.15/2.05  #Sup     : 211
% 4.15/2.05  #Fact    : 28
% 4.15/2.05  #Define  : 0
% 4.15/2.05  #Split   : 0
% 4.15/2.05  #Chain   : 0
% 4.15/2.05  #Close   : 0
% 4.15/2.05  
% 4.15/2.05  Ordering : KBO
% 4.15/2.05  
% 4.15/2.05  Simplification rules
% 4.15/2.05  ----------------------
% 4.15/2.05  #Subsume      : 81
% 4.15/2.05  #Demod        : 92
% 4.15/2.05  #Tautology    : 56
% 4.15/2.05  #SimpNegUnit  : 4
% 4.15/2.05  #BackRed      : 0
% 4.15/2.05  
% 4.15/2.05  #Partial instantiations: 0
% 4.15/2.05  #Strategies tried      : 1
% 4.15/2.05  
% 4.15/2.05  Timing (in seconds)
% 4.15/2.05  ----------------------
% 4.15/2.06  Preprocessing        : 0.54
% 4.15/2.06  Parsing              : 0.27
% 4.15/2.06  CNF conversion       : 0.03
% 4.15/2.06  Main loop            : 0.49
% 4.15/2.06  Inferencing          : 0.17
% 4.15/2.06  Reduction            : 0.14
% 4.15/2.06  Demodulation         : 0.10
% 4.15/2.06  BG Simplification    : 0.02
% 4.15/2.06  Subsumption          : 0.13
% 4.15/2.06  Abstraction          : 0.03
% 4.15/2.06  MUC search           : 0.00
% 4.15/2.06  Cooper               : 0.00
% 4.15/2.06  Total                : 1.08
% 4.15/2.06  Index Insertion      : 0.00
% 4.15/2.06  Index Deletion       : 0.00
% 4.15/2.06  Index Matching       : 0.00
% 4.15/2.06  BG Taut test         : 0.00
%------------------------------------------------------------------------------