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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWV904-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 : n014.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:54 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ c_Com_OWT > c_Option_Ooption_OSome > c_Com_Ocom_OSemi > #nlpp > v_sko__Hoare__Mirabelle__Xsingle__stateE__1 > c_Option_Ooption_ONone > c_Com_Osko__Com__XWTs__elim__cases__7__1 > c_Com_Ocom_OBODY > c_Com_Obody > 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 > tc_Com_Ocom > c_Hoare__Mirabelle_Ostate__not__singleton > c_Com_Ocom_OSKIP > c_Com_OWT__bodies

%Foreground sorts:

%Background operators:

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

tff(c_Option_Ooption_OSome,type,
    c_Option_Ooption_OSome: ( $i * $i ) > $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(c_Com_OWT__bodies,type,
    c_Com_OWT__bodies: $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(tc_Com_Ocom,type,
    tc_Com_Ocom: $i ).

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

tff(c_Com_Obody,type,
    c_Com_Obody: $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_Com_Ocom_OBODY,type,
    c_Com_Ocom_OBODY: $i > $i ).

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

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_Com_Osko__Com__XWTs__elim__cases__7__1,type,
    c_Com_Osko__Com__XWTs__elim__cases__7__1: $i > $i ).

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

tff(f_135,axiom,
    ~ c_Hoare__Mirabelle_Ostate__not__singleton,
    file(unknown,unknown) ).

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

tff(c_58,plain,
    ~ c_Hoare__Mirabelle_Ostate__not__singleton,
    inference(cnfTransformation,[status(thm)],[f_135]) ).

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

tff(c_59,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_58,c_52]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SWV904-1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13  % 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.14/0.35  % Computer : n014.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:58:18 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 2.59/1.66  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.59/1.66  
% 2.59/1.66  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.59/1.68  
% 2.59/1.68  Inference rules
% 2.59/1.68  ----------------------
% 2.59/1.68  #Ref     : 0
% 2.59/1.68  #Sup     : 0
% 2.59/1.68  #Fact    : 0
% 2.59/1.68  #Define  : 0
% 2.59/1.68  #Split   : 0
% 2.59/1.68  #Chain   : 0
% 2.59/1.68  #Close   : 0
% 2.59/1.68  
% 2.59/1.68  Ordering : KBO
% 2.59/1.68  
% 2.59/1.68  Simplification rules
% 2.59/1.68  ----------------------
% 2.59/1.68  #Subsume      : 28
% 2.59/1.68  #Demod        : 0
% 2.59/1.68  #Tautology    : 0
% 2.59/1.68  #SimpNegUnit  : 1
% 2.59/1.68  #BackRed      : 0
% 2.59/1.68  
% 2.59/1.68  #Partial instantiations: 0
% 2.59/1.68  #Strategies tried      : 1
% 2.59/1.68  
% 2.59/1.68  Timing (in seconds)
% 2.59/1.68  ----------------------
% 2.59/1.68  Preprocessing        : 0.50
% 2.59/1.68  Parsing              : 0.27
% 2.59/1.68  CNF conversion       : 0.03
% 2.59/1.68  Main loop            : 0.05
% 2.59/1.68  Inferencing          : 0.00
% 2.59/1.68  Reduction            : 0.02
% 2.59/1.68  Demodulation         : 0.01
% 2.59/1.69  BG Simplification    : 0.01
% 2.59/1.69  Subsumption          : 0.02
% 2.59/1.69  Abstraction          : 0.01
% 2.59/1.69  MUC search           : 0.00
% 2.59/1.69  Cooper               : 0.00
% 2.59/1.69  Total                : 0.59
% 2.59/1.69  Index Insertion      : 0.00
% 2.59/1.69  Index Deletion       : 0.00
% 2.59/1.69  Index Matching       : 0.00
% 2.59/1.69  BG Taut test         : 0.00
%------------------------------------------------------------------------------