%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT076+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 : n017.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:04 AM UTC 2026
% Result : Theorem 5.92s 2.85s
% Output : CNFRefutation 5.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 6 ~; 4 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 12 ( 11 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-4 aty)
% Number of variables : 12 ( 12 !; 0 ?; 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 > v400 > v0 > unknown > conflict > compatible > #skF_2 > #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(in_open,type,
in_open: ( $i * $i * $i ) > $o ).
tff(val,type,
val: $i > $o ).
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('#skF_4',type,
'#skF_4': $i ).
tff(leq,type,
leq: ( $i * $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(v800,type,
v800: $i ).
tff(conflict,type,
conflict: $i ).
tff(f_288,negated_conjecture,
~ ! [X] :
( leq(v800,X)
=> leq(v400,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl311) ).
tff(f_275,axiom,
less(v400,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v400_v800) ).
tff(f_94,axiom,
! [X,Y] :
( less(X,Y)
=> leq(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
tff(f_113,axiom,
! [X,Y,Z] :
( ( leq(X,Y)
& leq(Y,Z) )
=> leq(X,Z) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
tff(c_110,plain,
~ leq(v400,'#skF_4'),
inference(cnfTransformation,[status(thm)],[f_288]) ).
tff(c_102,plain,
less(v400,v800),
inference(cnfTransformation,[status(thm)],[f_275]) ).
tff(c_127,plain,
! [X_66,Y_67] :
( leq(X_66,Y_67)
| ~ less(X_66,Y_67) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_139,plain,
leq(v400,v800),
inference(resolution,[status(thm)],[c_102,c_127]) ).
tff(c_112,plain,
leq(v800,'#skF_4'),
inference(cnfTransformation,[status(thm)],[f_288]) ).
tff(c_543,plain,
! [X_117,Z_118,Y_119] :
( leq(X_117,Z_118)
| ~ leq(Y_119,Z_118)
| ~ leq(X_117,Y_119) ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_590,plain,
! [X_120] :
( leq(X_120,'#skF_4')
| ~ leq(X_120,v800) ),
inference(resolution,[status(thm)],[c_112,c_543]) ).
tff(c_593,plain,
leq(v400,'#skF_4'),
inference(resolution,[status(thm)],[c_139,c_590]) ).
tff(c_604,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_110,c_593]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT076+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/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.08/0.35 % Computer : n017.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 7 14:07:09 UTC 2026
% 0.08/0.35 % CPUTime :
% 5.92/2.85 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.92/2.85
% 5.92/2.85 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------