↑ Up

Beagle---0.9.52.UNS-CRf.s

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

% Result   : Unsatisfiable 4.68s 2.50s
% Output   : CNFRefutation 4.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    5 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :    5 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 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  :   15 (  14 usr;   1 prp; 0-4 aty)
%            Number of functors    :   14 (  14 usr;  10 con; 0-4 aty)
%            Number of variables   :    2 (   2   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ wf > sem_nonempty > axis_subsumes > axis_conflict > axis_compatible > in_ropen > in_open > in_lopen > in_closed > less > leq > val > is_verdict > is_op > box_verdict > #nlpp > v1200 > v0 > unknown > lteq > lt > gteq > gt > eq > 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(lteq,type,
    lteq: $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_59,axiom,
    ! [X] : ~ less(X,X),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).

tff(f_404,axiom,
    less(v0,v0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',contradiction) ).

tff(c_2,plain,
    ! [X_1] : ~ less(X_1,X_1),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_176,plain,
    less(v0,v0),
    inference(cnfTransformation,[status(thm)],[f_404]) ).

tff(c_189,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_2,c_176]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT104+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/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.36  % Computer : n005.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep  7 14:40:05 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 4.68/2.50  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.68/2.51  
% 4.68/2.51  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------