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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWV817-1 : TPTP v8.1.2. Released v4.1.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 : n017.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:05:43 EDT 2023

% Result   : Unsatisfiable 2.69s 1.62s
% Output   : CNFRefutation 2.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   18 (   8 unt;   8 typ;   0 def)
%            Number of atoms       :   12 (   7 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    7 (   5   ~;   2   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   1   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   2 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    3 (;   3   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ c_Fun_Oid > #nlpp > v_x > v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__2 > v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__1 > v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2 > v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1 > t_a > c_Hoare__Mirabelle_Ostate__not__singleton

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(v_x,type,
    v_x: $i ).

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

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

tff(c_Hoare__Mirabelle_Ostate__not__singleton,type,
    c_Hoare__Mirabelle_Ostate__not__singleton: $o ).

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

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

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

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

tff(f_44,axiom,
    ! [V_s] : ( V_s = v_x ),
    file(unknown,unknown) ).

tff(f_42,axiom,
    c_Hoare__Mirabelle_Ostate__not__singleton,
    file(unknown,unknown) ).

tff(f_41,axiom,
    ( ( v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1 != v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2 )
    | ~ c_Hoare__Mirabelle_Ostate__not__singleton ),
    file(unknown,unknown) ).

tff(c_42,plain,
    v_x = v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1,
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_20,plain,
    ! [V_s_6] : ( v_x = V_s_6 ),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_82,plain,
    ! [V_s_49] : ( v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1 = V_s_49 ),
    inference(superposition,[status(thm),theory(equality)],[c_42,c_20]) ).

tff(c_12,plain,
    c_Hoare__Mirabelle_Ostate__not__singleton,
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_10,plain,
    ( ~ c_Hoare__Mirabelle_Ostate__not__singleton
    | ( v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2 != v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1 ) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_16,plain,
    v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2 != v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1,
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_10]) ).

tff(c_100,plain,
    $false,
    inference(superposition,[status(thm),theory(equality)],[c_82,c_16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SWV817-1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/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.14/0.35  % Computer : n017.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 22:23:22 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 2.69/1.62  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.69/1.62  
% 2.69/1.62  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.69/1.64  
% 2.69/1.64  Inference rules
% 2.69/1.64  ----------------------
% 2.69/1.64  #Ref     : 0
% 2.69/1.64  #Sup     : 28
% 2.69/1.64  #Fact    : 0
% 2.69/1.64  #Define  : 0
% 2.69/1.64  #Split   : 0
% 2.69/1.64  #Chain   : 0
% 2.69/1.64  #Close   : 0
% 2.69/1.64  
% 2.69/1.64  Ordering : KBO
% 2.69/1.64  
% 2.69/1.64  Simplification rules
% 2.69/1.64  ----------------------
% 2.69/1.64  #Subsume      : 6
% 2.69/1.64  #Demod        : 3
% 2.69/1.64  #Tautology    : 3
% 2.69/1.64  #SimpNegUnit  : 0
% 2.69/1.64  #BackRed      : 0
% 2.69/1.64  
% 2.69/1.64  #Partial instantiations: 64
% 2.69/1.64  #Strategies tried      : 1
% 2.69/1.64  
% 2.69/1.64  Timing (in seconds)
% 2.69/1.64  ----------------------
% 2.69/1.65  Preprocessing        : 0.41
% 2.69/1.65  Parsing              : 0.22
% 2.69/1.65  CNF conversion       : 0.02
% 2.69/1.65  Main loop            : 0.17
% 2.69/1.65  Inferencing          : 0.08
% 2.69/1.65  Reduction            : 0.04
% 2.69/1.65  Demodulation         : 0.02
% 2.69/1.65  BG Simplification    : 0.01
% 2.69/1.65  Subsumption          : 0.03
% 2.69/1.65  Abstraction          : 0.01
% 2.69/1.65  MUC search           : 0.00
% 2.69/1.65  Cooper               : 0.00
% 2.69/1.65  Total                : 0.63
% 2.69/1.65  Index Insertion      : 0.00
% 2.69/1.65  Index Deletion       : 0.00
% 2.69/1.65  Index Matching       : 0.00
% 2.69/1.65  BG Taut test         : 0.00
%------------------------------------------------------------------------------