↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LCL435-2 : TPTP v9.3.1. 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 : n012.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 11:11:56 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%$ c_in > c_PropLog_Opl_Oop_A_N_62 > c_PropLog_Othms > #nlpp > tc_PropLog_Opl > v_q > v_pa > v_p > v_H > t_a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(c_PropLog_Opl_Oop_A_N_62,type,
    c_PropLog_Opl_Oop_A_N_62: ( $i * $i * $i ) > $i ).

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

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

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

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

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

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

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

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

tff(f_29,axiom,
    ! [V_p,V_q,T_a,V_H] : c_in(c_PropLog_Opl_Oop_A_N_62(V_p,c_PropLog_Opl_Oop_A_N_62(V_q,V_p,T_a),T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)),
    file(unknown,unknown) ).

tff(f_34,axiom,
    ! [V_q,V_H,T_a,V_p] :
      ( ~ c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
      | c_in(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ),
    file(unknown,unknown) ).

tff(f_27,axiom,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_pa,c_PropLog_Opl_Oop_A_N_62(v_q,v_pa,t_a),t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    file(unknown,unknown) ).

tff(c_4,plain,
    ! [V_p_1,V_q_2,T_a_3,V_H_4] : c_in(c_PropLog_Opl_Oop_A_N_62(V_p_1,c_PropLog_Opl_Oop_A_N_62(V_q_2,V_p_1,T_a_3),T_a_3),c_PropLog_Othms(V_H_4,T_a_3),tc_PropLog_Opl(T_a_3)),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_8,plain,
    ! [V_p_13,V_q_14,T_a_15,V_H_16] :
      ( c_in(c_PropLog_Opl_Oop_A_N_62(V_p_13,V_q_14,T_a_15),c_PropLog_Othms(V_H_16,T_a_15),tc_PropLog_Opl(T_a_15))
      | ~ c_in(V_q_14,c_PropLog_Othms(V_H_16,T_a_15),tc_PropLog_Opl(T_a_15)) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_2,plain,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_pa,c_PropLog_Opl_Oop_A_N_62(v_q,v_pa,t_a),t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_11,plain,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pa,c_PropLog_Opl_Oop_A_N_62(v_q,v_pa,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    inference(resolution,[status(thm)],[c_8,c_2]) ).

tff(c_15,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : LCL435-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.02  % 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.03/0.31  % Computer : n012.cluster.edu
% 0.03/0.31  % Model    : x86_64 x86_64
% 0.03/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31  % Memory   : 8046.5625MB
% 0.03/0.31  % OS       : Linux 6.8.0-71-generic
% 0.03/0.31  % CPULimit : 300
% 0.03/0.31  % WCLimit  : 300
% 0.03/0.31  % DateTime : Sat Sep  5 03:11:42 UTC 2026
% 0.03/0.31  % CPUTime  : 
% 1.29/1.08  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.29/1.08  
% 1.29/1.08  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------