↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LCL678+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 : n009.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:30 AM UTC 2026

% Result   : Theorem 2.96s 2.10s
% Output   : CNFRefutation 3.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    9 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   21 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   29 (  17   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   13 (  12   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ r1 > p1 > #nlpp > #skF_2 > #skF_1 > #skF_3

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_2',type,
    '#skF_2': $i > $i ).

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

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

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

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

tff(f_28,axiom,
    ! [X] : r1(X,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).

tff(f_63,negated_conjecture,
    ~ ~ ? [X] :
          ~ ( $false
            | ~ ! [Y] :
                  ( ~ r1(X,Y)
                  | $false
                  | ~ ! [X] :
                        ( ~ r1(Y,X)
                        | ! [Y] :
                            ( ~ r1(X,Y)
                            | p1(Y) )
                        | ~ ! [Y] :
                              ( ~ r1(X,Y)
                              | p1(Y) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).

tff(c_2,plain,
    ! [X_1] : r1(X_1,X_1),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_10,plain,
    ! [Y_16] :
      ( r1('#skF_2'(Y_16),'#skF_3'(Y_16))
      | ~ r1('#skF_1',Y_16) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_27,plain,
    ! [Y_32,Y_33] :
      ( p1(Y_32)
      | ~ r1('#skF_2'(Y_33),Y_32)
      | ~ r1('#skF_1',Y_33) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_42,plain,
    ! [Y_34] :
      ( p1('#skF_3'(Y_34))
      | ~ r1('#skF_1',Y_34) ),
    inference(resolution,[status(thm)],[c_10,c_27]) ).

tff(c_8,plain,
    ! [Y_16] :
      ( ~ p1('#skF_3'(Y_16))
      | ~ r1('#skF_1',Y_16) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_47,plain,
    ! [Y_35] : ~ r1('#skF_1',Y_35),
    inference(resolution,[status(thm)],[c_42,c_8]) ).

tff(c_52,plain,
    $false,
    inference(resolution,[status(thm)],[c_2,c_47]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL678+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.10/0.36  % Computer : n009.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep  5 23:56:52 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 2.96/2.10  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.96/2.10  
% 2.96/2.10  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------