%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT073+1 : TPTP v9.3.0. Released v9.3.0.
% 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 : n027.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 6.44s 2.83s
% Output : CNFRefutation 6.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 49 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 45 ( 21 ~; 17 |; 3 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 16 ( 14 usr; 1 prp; 0-9 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 30 ( 29 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in_box3 > box2_conflict > box2_compatible > in_box2 > axis_subsumes > axis_conflict > axis_compatible > in_ropen > in_open > in_lopen > in_closed > less > leq > is_verdict > box_verdict > #nlpp > unknown > n5 > n10 > n0 > 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(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(compatible,type,
compatible: $i ).
tff(in_box3,type,
in_box3: ( $i * $i * $i * $i * $i * $i * $i * $i * $i ) > $o ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(box2_conflict,type,
box2_conflict: ( $i * $i * $i * $i * $i * $i * $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i * $i ) > $i ).
tff(n0,type,
n0: $i ).
tff(in_closed,type,
in_closed: ( $i * $i * $i ) > $o ).
tff(n10,type,
n10: $i ).
tff(axis_subsumes,type,
axis_subsumes: ( $i * $i * $i * $i ) > $o ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(box2_compatible,type,
box2_compatible: ( $i * $i * $i * $i * $i * $i * $i * $i ) > $o ).
tff(in_box2,type,
in_box2: ( $i * $i * $i * $i * $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(n5,type,
n5: $i ).
tff(conflict,type,
conflict: $i ).
tff(f_383,hypothesis,
less(n0,n5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order_0_5) ).
tff(f_93,axiom,
! [X,Y] :
( less(X,Y)
=> leq(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
tff(f_384,hypothesis,
less(n5,n10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order_5_10) ).
tff(f_100,axiom,
! [X,Y,Z] :
( ( leq(X,Y)
& less(Y,Z) )
=> less(X,Z) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).
tff(f_80,axiom,
! [X,Y] :
( leq(X,Y)
<=> ( less(X,Y)
| ( X = Y ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_def) ).
tff(f_356,axiom,
! [X,A,B] :
( in_closed(X,A,B)
<=> ( leq(A,X)
& leq(X,B) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+6.ax',shape_closed) ).
tff(f_397,negated_conjecture,
~ ? [X] :
( in_closed(X,n0,n10)
& in_closed(X,n5,n10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_false_compatible) ).
tff(c_146,plain,
less(n0,n5),
inference(cnfTransformation,[status(thm)],[f_383]) ).
tff(c_204,plain,
! [X_117,Y_118] :
( leq(X_117,Y_118)
| ~ less(X_117,Y_118) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_211,plain,
leq(n0,n5),
inference(resolution,[status(thm)],[c_146,c_204]) ).
tff(c_148,plain,
less(n5,n10),
inference(cnfTransformation,[status(thm)],[f_384]) ).
tff(c_384,plain,
! [X_153,Z_154,Y_155] :
( less(X_153,Z_154)
| ~ less(Y_155,Z_154)
| ~ leq(X_153,Y_155) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_417,plain,
! [X_157] :
( less(X_157,n10)
| ~ leq(X_157,n5) ),
inference(resolution,[status(thm)],[c_148,c_384]) ).
tff(c_16,plain,
! [X_11,Y_12] :
( leq(X_11,Y_12)
| ~ less(X_11,Y_12) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_451,plain,
! [X_162] :
( leq(X_162,n10)
| ~ leq(X_162,n5) ),
inference(resolution,[status(thm)],[c_417,c_16]) ).
tff(c_463,plain,
leq(n0,n10),
inference(resolution,[status(thm)],[c_211,c_451]) ).
tff(c_10,plain,
! [Y_8] : leq(Y_8,Y_8),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_212,plain,
leq(n5,n10),
inference(resolution,[status(thm)],[c_148,c_204]) ).
tff(c_122,plain,
! [X_97,A_98,B_99] :
( in_closed(X_97,A_98,B_99)
| ~ leq(X_97,B_99)
| ~ leq(A_98,X_97) ),
inference(cnfTransformation,[status(thm)],[f_356]) ).
tff(c_728,plain,
! [X_184,A_185,B_186] :
( in_closed(X_184,A_185,B_186)
| ~ leq(X_184,B_186)
| ~ leq(A_185,X_184) ),
inference(cnfTransformation,[status(thm)],[f_356]) ).
tff(c_152,plain,
! [X_109] :
( ~ in_closed(X_109,n5,n10)
| ~ in_closed(X_109,n0,n10) ),
inference(cnfTransformation,[status(thm)],[f_397]) ).
tff(c_857,plain,
! [X_191] :
( ~ in_closed(X_191,n0,n10)
| ~ leq(X_191,n10)
| ~ leq(n5,X_191) ),
inference(resolution,[status(thm)],[c_728,c_152]) ).
tff(c_1034,plain,
! [X_199] :
( ~ leq(n5,X_199)
| ~ leq(X_199,n10)
| ~ leq(n0,X_199) ),
inference(resolution,[status(thm)],[c_122,c_857]) ).
tff(c_1054,plain,
( ~ leq(n10,n10)
| ~ leq(n0,n10) ),
inference(resolution,[status(thm)],[c_212,c_1034]) ).
tff(c_1073,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_463,c_10,c_1054]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT073+1 : TPTP v9.3.0. Released v9.3.0.
% 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.35 % Computer : n027.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 7 14:00:30 UTC 2026
% 0.10/0.35 % CPUTime :
% 6.44/2.83 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.44/2.83
% 6.44/2.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------