↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LCL682+1.001 : TPTP v9.3.1. Released v4.0.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 : n027.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:12:31 AM UTC 2026

% Result   : Theorem 2.87s 1.61s
% Output   : CNFRefutation 2.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    8 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :   21 (   3 avg)
%            Number of connectives :   49 (  26   ~;  23   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   9 con; 0-0 aty)
%            Number of variables   :   16 (  15   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ r1 > p16 > p15 > p14 > p13 > p12 > p11 > #nlpp > #skF_7 > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_9 > #skF_8 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_111,negated_conjecture,
    ~ ~ ? [X] :
          ~ ( ~ ! [Y] :
                  ( ~ r1(X,Y)
                  | ~ ( ~ ! [X] :
                            ( ~ r1(Y,X)
                            | p16(X) )
                      | ~ ! [X] :
                            ( ~ r1(Y,X)
                            | p12(X) )
                      | ~ ! [X] :
                            ( ~ r1(Y,X)
                            | p14(X) )
                      | ~ ! [X] :
                            ( ~ r1(Y,X)
                            | p12(X) ) ) )
            | ! [Y] :
                ( ~ r1(X,Y)
                | ! [X] :
                    ( ~ r1(Y,X)
                    | p15(X) ) )
            | ! [Y] :
                ( ~ r1(X,Y)
                | ! [X] :
                    ( ~ r1(Y,X)
                    | p13(X) ) )
            | ! [Y] :
                ( ~ r1(X,Y)
                | ! [X] :
                    ( ~ r1(Y,X)
                    | p12(X) ) )
            | ! [Y] :
                ( ~ r1(X,Y)
                | ! [X] :
                    ( ~ r1(Y,X)
                    | p11(X) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).

tff(c_12,plain,
    ~ p12('#skF_7'),
    inference(cnfTransformation,[status(thm)],[f_111]) ).

tff(c_16,plain,
    r1('#skF_1','#skF_6'),
    inference(cnfTransformation,[status(thm)],[f_111]) ).

tff(c_14,plain,
    r1('#skF_6','#skF_7'),
    inference(cnfTransformation,[status(thm)],[f_111]) ).

tff(c_38,plain,
    ! [X_40,Y_41] :
      ( p12(X_40)
      | ~ r1(Y_41,X_40)
      | ~ r1('#skF_1',Y_41) ),
    inference(cnfTransformation,[status(thm)],[f_111]) ).

tff(c_48,plain,
    ( p12('#skF_7')
    | ~ r1('#skF_1','#skF_6') ),
    inference(resolution,[status(thm)],[c_14,c_38]) ).

tff(c_71,plain,
    p12('#skF_7'),
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_48]) ).

tff(c_73,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_12,c_71]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL682+1.001 : TPTP v9.3.1. Released v4.0.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.09/0.35  % Computer : n027.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Fri Sep  4 16:09:27 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 2.87/1.61  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.87/1.62  
% 2.87/1.62  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------