TSTP Solution File: SET856-2 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SET856-2 : TPTP v8.1.2. Released v3.2.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 : n008.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 10:57:13 EDT 2023

% Result   : Unsatisfiable 1.94s 1.52s
% Output   : CNFRefutation 1.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   13 (   5 unt;   8 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    :    3 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   4   >;   5   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :    0 (;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ c_lessequals > c_Zorn_Osucc > c_Union > #nlpp > tc_set > v_n > v_Y > v_S > t_a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_28,axiom,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    file(unknown,unknown) ).

tff(f_26,axiom,
    c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    file(unknown,unknown) ).

tff(c_4,plain,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_2,plain,
    c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_5,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_4,c_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SET856-2 : TPTP v8.1.2. Released v3.2.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.15/0.35  % Computer : n008.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu Aug  3 17:00:19 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 1.94/1.52  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.94/1.52  
% 1.94/1.52  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 1.94/1.56  
% 1.94/1.56  Inference rules
% 1.94/1.56  ----------------------
% 1.94/1.56  #Ref     : 0
% 1.94/1.56  #Sup     : 0
% 1.94/1.56  #Fact    : 0
% 1.94/1.56  #Define  : 0
% 1.94/1.56  #Split   : 0
% 1.94/1.56  #Chain   : 0
% 1.94/1.56  #Close   : 0
% 1.94/1.56  
% 1.94/1.56  Ordering : KBO
% 1.94/1.56  
% 1.94/1.56  Simplification rules
% 1.94/1.56  ----------------------
% 1.94/1.56  #Subsume      : 1
% 1.94/1.56  #Demod        : 0
% 1.94/1.56  #Tautology    : 0
% 1.94/1.56  #SimpNegUnit  : 1
% 1.94/1.56  #BackRed      : 0
% 1.94/1.56  
% 1.94/1.56  #Partial instantiations: 0
% 1.94/1.56  #Strategies tried      : 1
% 1.94/1.56  
% 1.94/1.56  Timing (in seconds)
% 1.94/1.56  ----------------------
% 1.94/1.56  Preprocessing        : 0.38
% 1.94/1.56  Parsing              : 0.21
% 1.94/1.56  CNF conversion       : 0.01
% 1.94/1.56  Main loop            : 0.04
% 1.94/1.56  Inferencing          : 0.00
% 1.94/1.56  Reduction            : 0.01
% 1.94/1.56  Demodulation         : 0.00
% 1.94/1.57  BG Simplification    : 0.01
% 1.94/1.57  Subsumption          : 0.02
% 1.94/1.57  Abstraction          : 0.00
% 1.94/1.57  MUC search           : 0.00
% 1.94/1.57  Cooper               : 0.00
% 1.94/1.57  Total                : 0.47
% 1.94/1.57  Index Insertion      : 0.00
% 1.94/1.57  Index Deletion       : 0.00
% 1.94/1.57  Index Matching       : 0.00
% 1.94/1.57  BG Taut test         : 0.00
%------------------------------------------------------------------------------