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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWV413+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/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:04:03 EDT 2023

% Result   : Theorem 4.32s 2.09s
% Output   : CNFRefutation 4.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   25 (   4 unt;  16 typ;   0 def)
%            Number of atoms       :   19 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   18 (   8   ~;   4   |;   4   &)
%                                         (   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   :   15 (;  14   !;   1   ?;   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_171,negated_conjecture,
    ~ ! [U,V,W,X] :
        ( ( pair_in_list(U,V,W)
          & strictly_less_than(V,X)
          & less_than(X,W) )
       => ? [Y] :
            ( pair_in_list(update_slb(U,X),V,Y)
            & less_than(X,Y) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l49_co) ).

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

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

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

tff(c_1430,plain,
    ! [U_138,X_139,V_140,W_141] :
      ( pair_in_list(update_slb(U_138,X_139),V_140,W_141)
      | ~ less_than(X_139,W_141)
      | ~ pair_in_list(U_138,V_140,W_141) ),
    inference(cnfTransformation,[status(thm)],[f_158]) ).

tff(c_54,plain,
    ! [Y_53] :
      ( ~ less_than('#skF_4',Y_53)
      | ~ pair_in_list(update_slb('#skF_1','#skF_4'),'#skF_2',Y_53) ),
    inference(cnfTransformation,[status(thm)],[f_171]) ).

tff(c_1440,plain,
    ! [W_142] :
      ( ~ less_than('#skF_4',W_142)
      | ~ pair_in_list('#skF_1','#skF_2',W_142) ),
    inference(resolution,[status(thm)],[c_1430,c_54]) ).

tff(c_1443,plain,
    ~ less_than('#skF_4','#skF_3'),
    inference(resolution,[status(thm)],[c_60,c_1440]) ).

tff(c_1447,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_56,c_1443]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SWV413+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.10  % 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.09/0.30  % Computer : n031.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Thu Aug  3 23:36:45 EDT 2023
% 0.09/0.30  % CPUTime  : 
% 4.32/2.09  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.32/2.09  
% 4.32/2.09  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.32/2.12  
% 4.32/2.12  Inference rules
% 4.32/2.12  ----------------------
% 4.32/2.12  #Ref     : 0
% 4.32/2.12  #Sup     : 288
% 4.32/2.12  #Fact    : 20
% 4.32/2.12  #Define  : 0
% 4.32/2.12  #Split   : 0
% 4.32/2.12  #Chain   : 0
% 4.32/2.12  #Close   : 0
% 4.32/2.12  
% 4.32/2.12  Ordering : KBO
% 4.32/2.12  
% 4.32/2.12  Simplification rules
% 4.32/2.12  ----------------------
% 4.32/2.12  #Subsume      : 146
% 4.32/2.12  #Demod        : 156
% 4.32/2.12  #Tautology    : 79
% 4.32/2.12  #SimpNegUnit  : 3
% 4.32/2.12  #BackRed      : 0
% 4.32/2.12  
% 4.32/2.12  #Partial instantiations: 0
% 4.32/2.12  #Strategies tried      : 1
% 4.32/2.12  
% 4.32/2.12  Timing (in seconds)
% 4.32/2.12  ----------------------
% 4.32/2.12  Preprocessing        : 0.55
% 4.32/2.12  Parsing              : 0.28
% 4.32/2.12  CNF conversion       : 0.03
% 4.32/2.12  Main loop            : 0.52
% 4.32/2.12  Inferencing          : 0.19
% 4.32/2.12  Reduction            : 0.15
% 4.32/2.12  Demodulation         : 0.11
% 4.32/2.12  BG Simplification    : 0.03
% 4.32/2.12  Subsumption          : 0.13
% 4.32/2.12  Abstraction          : 0.03
% 4.32/2.12  MUC search           : 0.00
% 4.32/2.12  Cooper               : 0.00
% 4.32/2.12  Total                : 1.11
% 4.32/2.12  Index Insertion      : 0.00
% 4.32/2.12  Index Deletion       : 0.00
% 4.32/2.12  Index Matching       : 0.00
% 4.32/2.12  BG Taut test         : 0.00
%------------------------------------------------------------------------------