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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LAT272-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 : 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 10:46:35 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ c_Tarski_OisLub > c_in > c_Pair > tc_prod > #nlpp > v_x > v_r > v_cl > v_S > v_L > t_a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

tff(f_26,axiom,
    c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
    file(unknown,unknown) ).

tff(f_27,axiom,
    c_in(v_x,v_S,t_a),
    file(unknown,unknown) ).

tff(f_37,axiom,
    ! [V_S,V_L,V_y] :
      ( ~ c_Tarski_OisLub(V_S,v_cl,V_L,t_a)
      | ~ c_in(V_y,V_S,t_a)
      | c_in(c_Pair(V_y,V_L,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    file(unknown,unknown) ).

tff(f_29,axiom,
    ~ c_in(c_Pair(v_x,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    file(unknown,unknown) ).

tff(c_2,plain,
    c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_4,plain,
    c_in(v_x,v_S,t_a),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_9,plain,
    ! [V_y_4,V_L_5,V_S_6] :
      ( c_in(c_Pair(V_y_4,V_L_5,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(V_y_4,V_S_6,t_a)
      | ~ c_Tarski_OisLub(V_S_6,v_cl,V_L_5,t_a) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_13,plain,
    ! [V_L_7] :
      ( c_in(c_Pair(v_x,V_L_7,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_Tarski_OisLub(v_S,v_cl,V_L_7,t_a) ),
    inference(resolution,[status(thm)],[c_4,c_9]) ).

tff(c_6,plain,
    ~ c_in(c_Pair(v_x,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_16,plain,
    ~ c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
    inference(resolution,[status(thm)],[c_13,c_6]) ).

tff(c_20,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : LAT272-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/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 12:33:20 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 2.58/1.65  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.58/1.66  
% 2.58/1.66  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.64/1.69  
% 2.64/1.69  Inference rules
% 2.64/1.69  ----------------------
% 2.64/1.69  #Ref     : 0
% 2.64/1.69  #Sup     : 2
% 2.64/1.69  #Fact    : 0
% 2.64/1.69  #Define  : 0
% 2.64/1.69  #Split   : 0
% 2.64/1.69  #Chain   : 0
% 2.64/1.69  #Close   : 0
% 2.64/1.69  
% 2.64/1.69  Ordering : KBO
% 2.64/1.69  
% 2.64/1.69  Simplification rules
% 2.64/1.69  ----------------------
% 2.64/1.69  #Subsume      : 0
% 2.64/1.69  #Demod        : 1
% 2.64/1.69  #Tautology    : 0
% 2.64/1.69  #SimpNegUnit  : 0
% 2.64/1.69  #BackRed      : 0
% 2.64/1.69  
% 2.64/1.69  #Partial instantiations: 0
% 2.64/1.69  #Strategies tried      : 1
% 2.64/1.69  
% 2.64/1.69  Timing (in seconds)
% 2.64/1.69  ----------------------
% 2.64/1.69  Preprocessing        : 0.39
% 2.64/1.69  Parsing              : 0.21
% 2.64/1.69  CNF conversion       : 0.02
% 2.64/1.69  Main loop            : 0.13
% 2.64/1.69  Inferencing          : 0.06
% 2.64/1.69  Reduction            : 0.03
% 2.64/1.69  Demodulation         : 0.02
% 2.64/1.69  BG Simplification    : 0.01
% 2.64/1.69  Subsumption          : 0.03
% 2.64/1.69  Abstraction          : 0.00
% 2.64/1.69  MUC search           : 0.00
% 2.64/1.70  Cooper               : 0.00
% 2.64/1.70  Total                : 0.58
% 2.64/1.70  Index Insertion      : 0.00
% 2.64/1.70  Index Deletion       : 0.00
% 2.64/1.70  Index Matching       : 0.00
% 2.64/1.70  BG Taut test         : 0.00
%------------------------------------------------------------------------------