↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : MGT082+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n029.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 : Tue Sep  8 06:03:05 AM UTC 2026

% Result   : Theorem 6.21s 2.79s
% Output   : CNFRefutation 6.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   55 (  29 equ)
%            Maximal formula atoms :   21 (   2 avg)
%            Number of connectives :   66 (  31   ~;   6   |;  27   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   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  :   13 (  11 usr;   1 prp; 0-4 aty)
%            Number of functors    :   17 (  17 usr;  13 con; 0-4 aty)
%            Number of variables   :   16 (  13   !;   3   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ axis_subsumes > axis_conflict > axis_compatible > in_ropen > in_open > in_lopen > in_closed > less > leq > val > is_verdict > box_verdict > #nlpp > v601 > v600 > v500 > v32 > v300 > v16 > v0 > unknown > conflict > compatible > #skF_5 > #skF_2 > #skF_6 > #skF_4 > #skF_3 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_373,negated_conjecture,
    ~ ~ ? [X,Y,Z] :
          ( in_closed(X,v600,v600)
          & in_closed(X,v601,v601)
          & less(v300,Y)
          & in_open(Y,v0,v500)
          & leq(v16,Z)
          & in_lopen(Z,v0,v32) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl411) ).

tff(f_160,axiom,
    ! [X,A,B] :
      ( in_closed(X,A,B)
    <=> ( leq(A,X)
        & leq(X,B) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_closed) ).

tff(f_90,axiom,
    ! [X,Y] :
      ( ( leq(X,Y)
        & leq(Y,X) )
     => ( X = Y ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).

tff(f_359,axiom,
    ( ( v0 != v16 )
    & ( v0 != v32 )
    & ( v0 != v300 )
    & ( v0 != v500 )
    & ( v0 != v600 )
    & ( v0 != v601 )
    & ( v16 != v32 )
    & ( v16 != v300 )
    & ( v16 != v500 )
    & ( v16 != v600 )
    & ( v16 != v601 )
    & ( v32 != v300 )
    & ( v32 != v500 )
    & ( v32 != v600 )
    & ( v32 != v601 )
    & ( v300 != v500 )
    & ( v300 != v600 )
    & ( v300 != v601 )
    & ( v500 != v600 )
    & ( v500 != v601 )
    & ( v600 != v601 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).

tff(c_198,plain,
    in_closed('#skF_4',v601,v601),
    inference(cnfTransformation,[status(thm)],[f_373]) ).

tff(c_353,plain,
    ! [A_79,X_80,B_81] :
      ( leq(A_79,X_80)
      | ~ in_closed(X_80,A_79,B_81) ),
    inference(cnfTransformation,[status(thm)],[f_160]) ).

tff(c_360,plain,
    leq(v601,'#skF_4'),
    inference(resolution,[status(thm)],[c_198,c_353]) ).

tff(c_398,plain,
    ! [X_91,B_92,A_93] :
      ( leq(X_91,B_92)
      | ~ in_closed(X_91,A_93,B_92) ),
    inference(cnfTransformation,[status(thm)],[f_160]) ).

tff(c_405,plain,
    leq('#skF_4',v601),
    inference(resolution,[status(thm)],[c_198,c_398]) ).

tff(c_503,plain,
    ! [Y_100,X_101] :
      ( ( Y_100 = X_101 )
      | ~ leq(Y_100,X_101)
      | ~ leq(X_101,Y_100) ),
    inference(cnfTransformation,[status(thm)],[f_90]) ).

tff(c_507,plain,
    ( ( v601 = '#skF_4' )
    | ~ leq(v601,'#skF_4') ),
    inference(resolution,[status(thm)],[c_405,c_503]) ).

tff(c_573,plain,
    v601 = '#skF_4',
    inference(demodulation,[status(thm),theory(equality)],[c_360,c_507]) ).

tff(c_200,plain,
    in_closed('#skF_4',v600,v600),
    inference(cnfTransformation,[status(thm)],[f_373]) ).

tff(c_361,plain,
    leq(v600,'#skF_4'),
    inference(resolution,[status(thm)],[c_200,c_353]) ).

tff(c_406,plain,
    leq('#skF_4',v600),
    inference(resolution,[status(thm)],[c_200,c_398]) ).

tff(c_505,plain,
    ( ( v600 = '#skF_4' )
    | ~ leq(v600,'#skF_4') ),
    inference(resolution,[status(thm)],[c_406,c_503]) ).

tff(c_570,plain,
    v600 = '#skF_4',
    inference(demodulation,[status(thm),theory(equality)],[c_361,c_505]) ).

tff(c_148,plain,
    v601 != v600,
    inference(cnfTransformation,[status(thm)],[f_359]) ).

tff(c_671,plain,
    v601 != '#skF_4',
    inference(demodulation,[status(thm),theory(equality)],[c_570,c_148]) ).

tff(c_740,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_573,c_671]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT082+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.10/0.36  % Computer : n029.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 : Mon Sep  7 14:19:12 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 6.21/2.79  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.21/2.79  
% 6.21/2.79  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------