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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWV864-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/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 : n022.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:49 EDT 2023

% Result   : Unsatisfiable 3.64s 1.90s
% Output   : CNFRefutation 3.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   44 (   9 unt;  20 typ;   0 def)
%            Number of atoms       :   47 (  32 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   39 (  16   ~;  23   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   28 (  10   >;  18   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-4 aty)
%            Number of functors    :   17 (  17 usr;   9 con; 0-5 aty)
%            Number of variables   :   28 (;  28   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ c_Natural_Oevaln > c_Natural_Oevalc > c_Natural_Osko__Natural__Xevaln__elim__cases__4__1 > c_Natural_Osko__Natural__Xevalc__elim__cases__4__1 > c_Natural_Osko__Natural__Xevalc__evaln__1__1 > c_Natural_Osko__Natural__Xeval__eq__1__1 > c_Fun_Oid > c_Com_Ocom_OSemi > #nlpp > v_xb > v_sko__Hoare__Mirabelle__Xsingle__stateE__1 > v_xa > 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 > v_c > t_a > c_Hoare__Mirabelle_Ostate__not__singleton > c_Com_Ocom_OSKIP

%Foreground sorts:

%Background operators:

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

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

tff(v_xb,type,
    v_xb: $i > $i ).

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

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

tff(v_xa,type,
    v_xa: $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_Natural_Osko__Natural__Xeval__eq__1__1,type,
    c_Natural_Osko__Natural__Xeval__eq__1__1: ( $i * $i * $i ) > $i ).

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

tff(c_Com_Ocom_OSKIP,type,
    c_Com_Ocom_OSKIP: $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(c_Natural_Osko__Natural__Xevalc__evaln__1__1,type,
    c_Natural_Osko__Natural__Xevalc__evaln__1__1: ( $i * $i * $i ) > $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__Xsingle__stateE__1,type,
    v_sko__Hoare__Mirabelle__Xsingle__stateE__1: $i > $i ).

tff(c_Com_Ocom_OSemi,type,
    c_Com_Ocom_OSemi: ( $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(c_Natural_Oevaln,type,
    c_Natural_Oevaln: ( $i * $i * $i * $i ) > $o ).

tff(f_144,axiom,
    ~ c_Natural_Oevalc(v_c,v_x,v_xa),
    file(unknown,unknown) ).

tff(f_148,axiom,
    ! [V_Z_H] :
      ( ( V_Z_H = v_xa )
      | c_Natural_Oevalc(v_c,v_x,v_xb(V_Z_H)) ),
    file(unknown,unknown) ).

tff(f_95,axiom,
    ! [V_u,V_t,V_c,V_s] :
      ( ( V_u = V_t )
      | ~ c_Natural_Oevalc(V_c,V_s,V_u)
      | ~ c_Natural_Oevalc(V_c,V_s,V_t) ),
    file(unknown,unknown) ).

tff(f_153,axiom,
    ! [V_Z_H] :
      ( ( V_Z_H != v_xb(V_Z_H) )
      | ( V_Z_H = v_xa ) ),
    file(unknown,unknown) ).

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

tff(f_113,axiom,
    ! [V_t] :
      ( ( v_sko__Hoare__Mirabelle__Xsingle__stateE__1(V_t) != V_t )
      | ~ c_Hoare__Mirabelle_Ostate__not__singleton ),
    file(unknown,unknown) ).

tff(c_54,plain,
    ~ c_Natural_Oevalc(v_c,v_x,v_xa),
    inference(cnfTransformation,[status(thm)],[f_144]) ).

tff(c_56,plain,
    ! [V_Z_H_73] :
      ( c_Natural_Oevalc(v_c,v_x,v_xb(V_Z_H_73))
      | ( v_xa = V_Z_H_73 ) ),
    inference(cnfTransformation,[status(thm)],[f_148]) ).

tff(c_110,plain,
    ! [V_c_102,V_s_103,V_t_104,V_u_105] :
      ( ~ c_Natural_Oevalc(V_c_102,V_s_103,V_t_104)
      | ~ c_Natural_Oevalc(V_c_102,V_s_103,V_u_105)
      | ( V_u_105 = V_t_104 ) ),
    inference(cnfTransformation,[status(thm)],[f_95]) ).

tff(c_117,plain,
    ! [V_u_106,V_Z_H_107] :
      ( ~ c_Natural_Oevalc(v_c,v_x,V_u_106)
      | ( v_xb(V_Z_H_107) = V_u_106 )
      | ( v_xa = V_Z_H_107 ) ),
    inference(resolution,[status(thm)],[c_56,c_110]) ).

tff(c_123,plain,
    ! [V_Z_H_109,V_Z_H_108] :
      ( ( v_xb(V_Z_H_109) = v_xb(V_Z_H_108) )
      | ( v_xa = V_Z_H_109 )
      | ( v_xa = V_Z_H_108 ) ),
    inference(resolution,[status(thm)],[c_56,c_117]) ).

tff(c_58,plain,
    ! [V_Z_H_74] :
      ( ( v_xa = V_Z_H_74 )
      | ( v_xb(V_Z_H_74) != V_Z_H_74 ) ),
    inference(cnfTransformation,[status(thm)],[f_153]) ).

tff(c_144,plain,
    ! [V_Z_H_108,V_Z_H_109] :
      ( ( v_xa = V_Z_H_108 )
      | ( v_xb(V_Z_H_109) != V_Z_H_108 )
      | ( v_xa = V_Z_H_109 )
      | ( v_xa = V_Z_H_108 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_123,c_58]) ).

tff(c_173,plain,
    ! [V_Z_H_109] :
      ( ( v_xb(V_Z_H_109) = v_xa )
      | ( v_xa = V_Z_H_109 )
      | ( v_xb(V_Z_H_109) = v_xa ) ),
    inference(reflexivity,[status(thm),theory(equality)],[c_144]) ).

tff(c_225,plain,
    ! [V_Z_H_116] :
      ( ( v_xa = V_Z_H_116 )
      | ( v_xb(V_Z_H_116) = v_xa ) ),
    inference(factorization,[status(thm),theory(equality)],[c_173]) ).

tff(c_240,plain,
    ! [V_Z_H_116] :
      ( c_Natural_Oevalc(v_c,v_x,v_xa)
      | ( v_xa = V_Z_H_116 )
      | ( v_xa = V_Z_H_116 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_225,c_56]) ).

tff(c_254,plain,
    ! [V_Z_H_116] :
      ( ( v_xa = V_Z_H_116 )
      | ( v_xa = V_Z_H_116 ) ),
    inference(negUnitSimplification,[status(thm)],[c_54,c_240]) ).

tff(c_483,plain,
    ! [V_Z_H_1121] : ( v_xa = V_Z_H_1121 ),
    inference(factorization,[status(thm),theory(equality)],[c_254]) ).

tff(c_52,plain,
    c_Hoare__Mirabelle_Ostate__not__singleton,
    inference(cnfTransformation,[status(thm)],[f_142]) ).

tff(c_40,plain,
    ! [V_t_57] :
      ( ~ c_Hoare__Mirabelle_Ostate__not__singleton
      | ( v_sko__Hoare__Mirabelle__Xsingle__stateE__1(V_t_57) != V_t_57 ) ),
    inference(cnfTransformation,[status(thm)],[f_113]) ).

tff(c_62,plain,
    ! [V_t_57] : ( v_sko__Hoare__Mirabelle__Xsingle__stateE__1(V_t_57) != V_t_57 ),
    inference(demodulation,[status(thm),theory(equality)],[c_52,c_40]) ).

tff(c_524,plain,
    ! [V_t_57] : ( v_xa != V_t_57 ),
    inference(superposition,[status(thm),theory(equality)],[c_483,c_62]) ).

tff(c_276,plain,
    ! [V_Z_H_116] : ( v_xa = V_Z_H_116 ),
    inference(factorization,[status(thm),theory(equality)],[c_254]) ).

tff(c_618,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_524,c_276]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SWV864-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/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 : n022.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 22:50:03 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 3.64/1.90  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.64/1.91  
% 3.64/1.91  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.75/1.93  
% 3.75/1.93  Inference rules
% 3.75/1.93  ----------------------
% 3.75/1.93  #Ref     : 3
% 3.75/1.93  #Sup     : 88
% 3.75/1.93  #Fact    : 6
% 3.75/1.93  #Define  : 0
% 3.75/1.93  #Split   : 0
% 3.75/1.93  #Chain   : 0
% 3.75/1.93  #Close   : 0
% 3.75/1.93  
% 3.75/1.93  Ordering : KBO
% 3.75/1.93  
% 3.75/1.93  Simplification rules
% 3.75/1.93  ----------------------
% 3.75/1.93  #Subsume      : 31
% 3.75/1.93  #Demod        : 6
% 3.75/1.93  #Tautology    : 15
% 3.75/1.93  #SimpNegUnit  : 2
% 3.75/1.93  #BackRed      : 1
% 3.75/1.93  
% 3.75/1.93  #Partial instantiations: 620
% 3.75/1.93  #Strategies tried      : 1
% 3.75/1.93  
% 3.75/1.93  Timing (in seconds)
% 3.75/1.93  ----------------------
% 3.75/1.94  Preprocessing        : 0.50
% 3.75/1.94  Parsing              : 0.27
% 3.75/1.94  CNF conversion       : 0.03
% 3.75/1.94  Main loop            : 0.37
% 3.75/1.94  Inferencing          : 0.18
% 3.75/1.94  Reduction            : 0.08
% 3.75/1.94  Demodulation         : 0.05
% 3.75/1.94  BG Simplification    : 0.02
% 3.75/1.94  Subsumption          : 0.07
% 3.75/1.94  Abstraction          : 0.01
% 3.75/1.94  MUC search           : 0.00
% 3.75/1.94  Cooper               : 0.00
% 3.75/1.94  Total                : 0.92
% 3.75/1.94  Index Insertion      : 0.00
% 3.75/1.94  Index Deletion       : 0.00
% 3.75/1.94  Index Matching       : 0.00
% 3.75/1.94  BG Taut test         : 0.00
%------------------------------------------------------------------------------