↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LCL414+1 : TPTP v9.3.1. Released v2.5.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 : n016.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:53 AM UTC 2026

% Result   : Theorem 3.31s 2.22s
% Output   : CNFRefutation 3.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   24 (  12   ~;   8   |;   4   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    4 (   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    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   26 (  25   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ a_truth > implies > #nlpp > not > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

tff(f_47,negated_conjecture,
    ~ ~ ( ! [P,Q] :
            ( ~ a_truth(implies(P,Q))
            | ~ a_truth(P)
            | a_truth(Q) )
        & ! [P,Q] : a_truth(implies(P,implies(Q,P)))
        & ! [P,Q,R] : a_truth(implies(implies(P,implies(Q,R)),implies(implies(P,Q),implies(P,R))))
        & ! [P,Q] : a_truth(implies(implies(not(P),not(Q)),implies(Q,P)))
        & ? [A] : ~ a_truth(implies(A,A)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm147) ).

tff(c_8,plain,
    ! [P_3,Q_4] : a_truth(implies(P_3,implies(Q_4,P_3))),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_49,plain,
    ! [P_22,Q_23,R_24] : a_truth(implies(implies(P_22,implies(Q_23,R_24)),implies(implies(P_22,Q_23),implies(P_22,R_24)))),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_10,plain,
    ! [Q_2,P_1] :
      ( a_truth(Q_2)
      | ~ a_truth(P_1)
      | ~ a_truth(implies(P_1,Q_2)) ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_57,plain,
    ! [P_28,Q_29,R_30] :
      ( a_truth(implies(implies(P_28,Q_29),implies(P_28,R_30)))
      | ~ a_truth(implies(P_28,implies(Q_29,R_30))) ),
    inference(resolution,[status(thm)],[c_49,c_10]) ).

tff(c_62,plain,
    ! [P_31,R_32,Q_33] :
      ( a_truth(implies(P_31,R_32))
      | ~ a_truth(implies(P_31,Q_33))
      | ~ a_truth(implies(P_31,implies(Q_33,R_32))) ),
    inference(resolution,[status(thm)],[c_57,c_10]) ).

tff(c_89,plain,
    ! [P_34,Q_35] :
      ( a_truth(implies(P_34,P_34))
      | ~ a_truth(implies(P_34,Q_35)) ),
    inference(resolution,[status(thm)],[c_8,c_62]) ).

tff(c_107,plain,
    ! [P_3] : a_truth(implies(P_3,P_3)),
    inference(resolution,[status(thm)],[c_8,c_89]) ).

tff(c_2,plain,
    ~ a_truth(implies('#skF_1','#skF_1')),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL414+1 : TPTP v9.3.1. Released v2.5.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.08/0.37  % Computer : n016.cluster.edu
% 0.08/0.37  % Model    : x86_64 x86_64
% 0.08/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37  % Memory   : 8046.5625MB
% 0.08/0.37  % OS       : Linux 6.8.0-71-generic
% 0.08/0.37  % CPULimit : 300
% 0.08/0.37  % WCLimit  : 300
% 0.08/0.37  % DateTime : Sat Sep  5 13:04:14 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 3.31/2.22  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.31/2.22  
% 3.31/2.22  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------