↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : MGT086+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/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 : n020.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:06 AM UTC 2026

% Result   : Theorem 8.83s 3.46s
% Output   : CNFRefutation 8.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   37 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :   85 (  16 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   91 (  43   ~;  27   |;  16   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   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    :   12 (  12 usr;   8 con; 0-4 aty)
%            Number of variables   :   41 (  39   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ axis_subsumes > axis_conflict > axis_compatible > in_ropen > in_open > in_lopen > in_closed > less > leq > val > is_verdict > box_verdict > #nlpp > v800 > v600 > v400 > v200 > v0 > unknown > conflict > compatible > #skF_2 > #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(in_open,type,
    in_open: ( $i * $i * $i ) > $o ).

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

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

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

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

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

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

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

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

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

tff(v600,type,
    v600: $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(v800,type,
    v800: $i ).

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

tff(f_313,axiom,
    ( ( v0 != v200 )
    & ( v0 != v400 )
    & ( v0 != v600 )
    & ( v0 != v800 )
    & ( v200 != v400 )
    & ( v200 != v600 )
    & ( v200 != v800 )
    & ( v400 != v600 )
    & ( v400 != v800 )
    & ( v600 != v800 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).

tff(f_284,axiom,
    less(v600,v800),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v800) ).

tff(f_95,axiom,
    ! [X,Y] :
      ( less(X,Y)
     => leq(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).

tff(f_82,axiom,
    ! [X,Y] :
      ( leq(X,Y)
    <=> ( less(X,Y)
        | ( X = Y ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).

tff(f_279,axiom,
    less(v200,v400),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v200_v400) ).

tff(f_275,axiom,
    less(v0,v200),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v200) ).

tff(f_102,axiom,
    ! [X,Y,Z] :
      ( ( leq(X,Y)
        & less(Y,Z) )
     => less(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).

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

tff(f_328,negated_conjecture,
    ~ ? [X,Y] :
        ( leq(v800,X)
        & in_lopen(Y,v0,v200)
        & ( ( in_lopen(X,v0,v600)
            & ~ in_lopen(Y,v0,v400) )
          | ( ~ in_lopen(X,v0,v600)
            & in_lopen(Y,v0,v400) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl462) ).

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

tff(c_122,plain,
    v800 != v600,
    inference(cnfTransformation,[status(thm)],[f_313]) ).

tff(c_120,plain,
    less(v600,v800),
    inference(cnfTransformation,[status(thm)],[f_284]) ).

tff(c_1840,plain,
    ! [X_170,Y_171] :
      ( leq(X_170,Y_171)
      | ~ less(X_170,Y_171) ),
    inference(cnfTransformation,[status(thm)],[f_95]) ).

tff(c_1876,plain,
    leq(v600,v800),
    inference(resolution,[status(thm)],[c_120,c_1840]) ).

tff(c_10,plain,
    ! [Y_8] : leq(Y_8,Y_8),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_110,plain,
    less(v200,v400),
    inference(cnfTransformation,[status(thm)],[f_279]) ).

tff(c_214,plain,
    ! [X_72,Y_73] :
      ( leq(X_72,Y_73)
      | ~ less(X_72,Y_73) ),
    inference(cnfTransformation,[status(thm)],[f_95]) ).

tff(c_254,plain,
    leq(v200,v400),
    inference(resolution,[status(thm)],[c_110,c_214]) ).

tff(c_102,plain,
    less(v0,v200),
    inference(cnfTransformation,[status(thm)],[f_275]) ).

tff(c_453,plain,
    ! [X_109,Z_110,Y_111] :
      ( less(X_109,Z_110)
      | ~ less(Y_111,Z_110)
      | ~ leq(X_109,Y_111) ),
    inference(cnfTransformation,[status(thm)],[f_102]) ).

tff(c_488,plain,
    ! [X_109] :
      ( less(X_109,v200)
      | ~ leq(X_109,v0) ),
    inference(resolution,[status(thm)],[c_102,c_453]) ).

tff(c_30,plain,
    ! [X_25,A_26,B_27] :
      ( in_lopen(X_25,A_26,B_27)
      | ~ leq(X_25,B_27)
      | ~ less(A_26,X_25) ),
    inference(cnfTransformation,[status(thm)],[f_166]) ).

tff(c_899,plain,
    ! [X_133,A_134,B_135] :
      ( in_lopen(X_133,A_134,B_135)
      | ~ leq(X_133,B_135)
      | ~ less(A_134,X_133) ),
    inference(cnfTransformation,[status(thm)],[f_166]) ).

tff(c_142,plain,
    ! [Y_65,X_64] :
      ( ~ in_lopen(Y_65,v0,v400)
      | in_lopen(X_64,v0,v600)
      | ~ in_lopen(Y_65,v0,v200)
      | ~ leq(v800,X_64) ),
    inference(cnfTransformation,[status(thm)],[f_328]) ).

tff(c_157,plain,
    ! [Y_65] :
      ( ~ in_lopen(Y_65,v0,v400)
      | ~ in_lopen(Y_65,v0,v200) ),
    inference(splitLeft,[status(thm)],[c_142]) ).

tff(c_1365,plain,
    ! [X_146] :
      ( ~ in_lopen(X_146,v0,v200)
      | ~ leq(X_146,v400)
      | ~ less(v0,X_146) ),
    inference(resolution,[status(thm)],[c_899,c_157]) ).

tff(c_1603,plain,
    ! [X_157] :
      ( ~ leq(X_157,v400)
      | ~ leq(X_157,v200)
      | ~ less(v0,X_157) ),
    inference(resolution,[status(thm)],[c_30,c_1365]) ).

tff(c_1659,plain,
    ( ~ leq(v200,v400)
    | ~ leq(v200,v200)
    | ~ leq(v0,v0) ),
    inference(resolution,[status(thm)],[c_488,c_1603]) ).

tff(c_1750,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_10,c_254,c_1659]) ).

tff(c_1751,plain,
    ! [X_64] :
      ( in_lopen(X_64,v0,v600)
      | ~ leq(v800,X_64) ),
    inference(splitRight,[status(thm)],[c_142]) ).

tff(c_1887,plain,
    ! [X_178,B_179,A_180] :
      ( leq(X_178,B_179)
      | ~ in_lopen(X_178,A_180,B_179) ),
    inference(cnfTransformation,[status(thm)],[f_166]) ).

tff(c_1896,plain,
    ! [X_181] :
      ( leq(X_181,v600)
      | ~ leq(v800,X_181) ),
    inference(resolution,[status(thm)],[c_1751,c_1887]) ).

tff(c_1900,plain,
    leq(v800,v600),
    inference(resolution,[status(thm)],[c_10,c_1896]) ).

tff(c_2024,plain,
    ! [Y_204,X_205] :
      ( ( Y_204 = X_205 )
      | ~ leq(Y_204,X_205)
      | ~ leq(X_205,Y_204) ),
    inference(cnfTransformation,[status(thm)],[f_90]) ).

tff(c_2026,plain,
    ( ( v800 = v600 )
    | ~ leq(v600,v800) ),
    inference(resolution,[status(thm)],[c_1900,c_2024]) ).

tff(c_2051,plain,
    v800 = v600,
    inference(demodulation,[status(thm),theory(equality)],[c_1876,c_2026]) ).

tff(c_2053,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_122,c_2051]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT086+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 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 : n020.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 : Mon Sep  7 14:20:43 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 8.83/3.46  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.83/3.46  
% 8.83/3.46  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------