↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LCL982+1 : TPTP v9.3.1. Released v9.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 : n028.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:13:05 AM UTC 2026

% Result   : Theorem 3.93s 2.56s
% Output   : CNFRefutation 4.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  16   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   6 avg)
%            Maximal term depth    :    7 (   2 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-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   64 (  64   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > #skF_2 > #skF_3 > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(is_a_theorem,type,
    is_a_theorem: $i > $o ).

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

tff('#skF_2',type,
    '#skF_2': $i ).

tff('#skF_3',type,
    '#skF_3': $i ).

tff('#skF_1',type,
    '#skF_1': $i ).

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

tff(f_35,axiom,
    ! [A,B,C,D,E] : is_a_theorem(implies(implies(A,B),implies(implies(implies(C,implies(D,E)),implies(B,implies(not(D),not(A)))),implies(A,D)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5) ).

tff(f_33,axiom,
    ! [X,Y] :
      ( ~ is_a_theorem(implies(X,Y))
      | ~ is_a_theorem(X)
      | is_a_theorem(Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

tff(f_38,negated_conjecture,
    ~ ! [A,B,C] : is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_1) ).

tff(c_4,plain,
    ! [A_3,D_6,C_5,E_7,B_4] : is_a_theorem(implies(implies(A_3,B_4),implies(implies(implies(C_5,implies(D_6,E_7)),implies(B_4,implies(not(D_6),not(A_3)))),implies(A_3,D_6)))),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_8,plain,
    ! [D_11,B_14,E_10,A_12,C_13] : is_a_theorem(implies(implies(A_12,B_14),implies(implies(implies(C_13,implies(D_11,E_10)),implies(B_14,implies(not(D_11),not(A_12)))),implies(A_12,D_11)))),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_2,plain,
    ! [Y_2,X_1] :
      ( is_a_theorem(Y_2)
      | ~ is_a_theorem(X_1)
      | ~ is_a_theorem(implies(X_1,Y_2)) ),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_12,plain,
    ! [D_11,B_14,E_10,A_12,C_13] :
      ( is_a_theorem(implies(implies(implies(C_13,implies(D_11,E_10)),implies(B_14,implies(not(D_11),not(A_12)))),implies(A_12,D_11)))
      | ~ is_a_theorem(implies(A_12,B_14)) ),
    inference(resolution,[status(thm)],[c_8,c_2]) ).

tff(c_13,plain,
    ! [E_18,D_19,C_16,A_17,B_15] :
      ( is_a_theorem(implies(implies(implies(C_16,implies(D_19,E_18)),implies(B_15,implies(not(D_19),not(A_17)))),implies(A_17,D_19)))
      | ~ is_a_theorem(implies(A_17,B_15)) ),
    inference(resolution,[status(thm)],[c_8,c_2]) ).

tff(c_18,plain,
    ! [A_21,D_24,C_22,E_20,B_23] :
      ( is_a_theorem(implies(A_21,D_24))
      | ~ is_a_theorem(implies(implies(C_22,implies(D_24,E_20)),implies(B_23,implies(not(D_24),not(A_21)))))
      | ~ is_a_theorem(implies(A_21,B_23)) ),
    inference(resolution,[status(thm)],[c_13,c_2]) ).

tff(c_29,plain,
    ! [A_25,B_26,A_27] :
      ( is_a_theorem(implies(A_25,B_26))
      | ~ is_a_theorem(implies(A_25,A_27))
      | ~ is_a_theorem(implies(A_27,B_26)) ),
    inference(resolution,[status(thm)],[c_12,c_18]) ).

tff(c_37,plain,
    ! [E_33,B_38,A_36,C_37,D_34,B_35] :
      ( is_a_theorem(implies(implies(A_36,B_38),B_35))
      | ~ is_a_theorem(implies(implies(implies(implies(C_37,implies(D_34,E_33)),implies(B_38,implies(not(D_34),not(A_36)))),implies(A_36,D_34)),B_35)) ),
    inference(resolution,[status(thm)],[c_4,c_29]) ).

tff(c_48,plain,
    ! [B_39,D_40,A_41] :
      ( is_a_theorem(implies(implies(B_39,D_40),implies(A_41,D_40)))
      | ~ is_a_theorem(implies(A_41,B_39)) ),
    inference(resolution,[status(thm)],[c_12,c_37]) ).

tff(c_35,plain,
    ! [A_3,D_6,C_5,E_7,B_4,B_26] :
      ( is_a_theorem(implies(implies(A_3,B_4),B_26))
      | ~ is_a_theorem(implies(implies(implies(implies(C_5,implies(D_6,E_7)),implies(B_4,implies(not(D_6),not(A_3)))),implies(A_3,D_6)),B_26)) ),
    inference(resolution,[status(thm)],[c_4,c_29]) ).

tff(c_357,plain,
    ! [A_143,C_144,D_142,E_141,B_145,A_140] :
      ( is_a_theorem(implies(implies(A_143,B_145),implies(A_140,implies(A_143,D_142))))
      | ~ is_a_theorem(implies(A_140,implies(implies(C_144,implies(D_142,E_141)),implies(B_145,implies(not(D_142),not(A_143)))))) ),
    inference(resolution,[status(thm)],[c_48,c_35]) ).

tff(c_377,plain,
    ! [A_143,A_3,B_4] : is_a_theorem(implies(implies(A_143,A_3),implies(implies(A_3,B_4),implies(A_143,B_4)))),
    inference(resolution,[status(thm)],[c_4,c_357]) ).

tff(c_6,plain,
    ~ is_a_theorem(implies(implies('#skF_1','#skF_2'),implies(implies('#skF_2','#skF_3'),implies('#skF_1','#skF_3')))),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_380,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_377,c_6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL982+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04  % 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.07/0.35  % Computer : n028.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Sat Sep  5 16:16:44 UTC 2026
% 0.14/0.36  % CPUTime  : 
% 3.93/2.56  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.93/2.57  
% 3.93/2.57  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------