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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWV888-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 : n018.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:52 EDT 2023

% Result   : Unsatisfiable 3.87s 2.17s
% Output   : CNFRefutation 3.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   31
% Syntax   : Number of formulae    :   36 (   6 unt;  28 typ;   0 def)
%            Number of atoms       :   10 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   4   ~;   2   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   48 (  21   >;  27   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   2 prp; 0-4 aty)
%            Number of functors    :   24 (  24 usr;   6 con; 0-5 aty)
%            Number of variables   :    6 (;   6   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ c_Natural_Oevaln > c_Natural_Oevalc > c_Com_OWT > c_Natural_Osko__Natural__Xevaln__elim__cases__4__1 > c_Natural_Osko__Natural__Xevaln__elim__cases__6__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_Option_Othe > c_Option_Ooption_OSome > c_Fun_Oid > c_Com_Ocom_OSemi > c_ATP__Linkup_Osko__Option__Xoption__Xnchotomy__1__1 > c_ATP__Linkup_Osko__Option__Xoption__Xexhaust__1__1 > c_ATP__Linkup_Osko__Option__Xnot__Some__eq__1__1 > c_ATP__Linkup_Osko__Option__Xnot__None__eq__1__1 > #nlpp > c_Suc > c_Option_Ooption_ONone > c_Com_Osko__Com__XWTs__elim__cases__7__1 > c_Com_Ocom_OBODY > c_Com_Obody > v_xa > v_x > v_pn > tc_Com_Ocom > t_a > c_Com_Ocom_OSKIP > c_Com_OWT__bodies

%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(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(c_ATP__Linkup_Osko__Option__Xnot__Some__eq__1__1,type,
    c_ATP__Linkup_Osko__Option__Xnot__Some__eq__1__1: ( $i * $i ) > $i ).

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

tff(c_Natural_Osko__Natural__Xevaln__elim__cases__6__1,type,
    c_Natural_Osko__Natural__Xevaln__elim__cases__6__1: ( $i * $i * $i * $i ) > $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(v_pn,type,
    v_pn: $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_258,axiom,
    ~ c_Natural_Oevalc(c_Com_Ocom_OBODY(v_pn),v_x,v_xa),
    file(unknown,unknown) ).

tff(f_256,axiom,
    c_Natural_Oevalc(c_Option_Othe(c_Com_Obody(v_pn),tc_Com_Ocom),v_x,v_xa),
    file(unknown,unknown) ).

tff(f_187,axiom,
    ! [V_pn,V_s0,V_s1] :
      ( c_Natural_Oevalc(c_Com_Ocom_OBODY(V_pn),V_s0,V_s1)
      | ~ c_Natural_Oevalc(c_Option_Othe(c_Com_Obody(V_pn),tc_Com_Ocom),V_s0,V_s1) ),
    file(unknown,unknown) ).

tff(c_110,plain,
    ~ c_Natural_Oevalc(c_Com_Ocom_OBODY(v_pn),v_x,v_xa),
    inference(cnfTransformation,[status(thm)],[f_258]) ).

tff(c_108,plain,
    c_Natural_Oevalc(c_Option_Othe(c_Com_Obody(v_pn),tc_Com_Ocom),v_x,v_xa),
    inference(cnfTransformation,[status(thm)],[f_256]) ).

tff(c_695,plain,
    ! [V_pn_235,V_s0_236,V_s1_237] :
      ( ~ c_Natural_Oevalc(c_Option_Othe(c_Com_Obody(V_pn_235),tc_Com_Ocom),V_s0_236,V_s1_237)
      | c_Natural_Oevalc(c_Com_Ocom_OBODY(V_pn_235),V_s0_236,V_s1_237) ),
    inference(cnfTransformation,[status(thm)],[f_187]) ).

tff(c_713,plain,
    c_Natural_Oevalc(c_Com_Ocom_OBODY(v_pn),v_x,v_xa),
    inference(resolution,[status(thm)],[c_108,c_695]) ).

tff(c_718,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_110,c_713]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SWV888-1 : TPTP v8.1.2. Released v4.1.0.
% 0.15/0.15  % 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.15/0.37  % Computer : n018.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Thu Aug  3 22:52:06 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 3.87/2.17  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.87/2.18  
% 3.87/2.18  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.87/2.20  
% 3.87/2.20  Inference rules
% 3.87/2.20  ----------------------
% 3.87/2.20  #Ref     : 5
% 3.87/2.20  #Sup     : 143
% 3.87/2.20  #Fact    : 0
% 3.87/2.20  #Define  : 0
% 3.87/2.20  #Split   : 1
% 3.87/2.20  #Chain   : 0
% 3.87/2.20  #Close   : 0
% 3.87/2.20  
% 3.87/2.20  Ordering : KBO
% 3.87/2.20  
% 3.87/2.20  Simplification rules
% 3.87/2.20  ----------------------
% 3.87/2.20  #Subsume      : 21
% 3.87/2.20  #Demod        : 14
% 3.87/2.20  #Tautology    : 74
% 3.87/2.20  #SimpNegUnit  : 21
% 3.87/2.20  #BackRed      : 0
% 3.87/2.20  
% 3.87/2.20  #Partial instantiations: 0
% 3.87/2.20  #Strategies tried      : 1
% 3.87/2.20  
% 3.87/2.20  Timing (in seconds)
% 3.87/2.20  ----------------------
% 3.87/2.21  Preprocessing        : 0.57
% 3.87/2.21  Parsing              : 0.31
% 3.87/2.21  CNF conversion       : 0.03
% 3.87/2.21  Main loop            : 0.40
% 3.87/2.21  Inferencing          : 0.16
% 3.87/2.21  Reduction            : 0.11
% 3.87/2.21  Demodulation         : 0.07
% 3.87/2.21  BG Simplification    : 0.03
% 3.87/2.21  Subsumption          : 0.07
% 3.87/2.21  Abstraction          : 0.02
% 3.87/2.21  MUC search           : 0.00
% 3.87/2.21  Cooper               : 0.00
% 3.87/2.21  Total                : 1.02
% 3.87/2.21  Index Insertion      : 0.00
% 3.87/2.21  Index Deletion       : 0.00
% 3.87/2.21  Index Matching       : 0.00
% 3.87/2.21  BG Taut test         : 0.00
%------------------------------------------------------------------------------