%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT071+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 : 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:04 AM UTC 2026
% Result : Theorem 6.66s 3.09s
% Output : CNFRefutation 6.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 56 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 19 ~; 14 |; 4 &)
% ( 1 <=>; 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 : 16 ( 14 usr; 1 prp; 0-9 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-4 aty)
% Number of variables : 32 ( 31 !; 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 > n15 > n10 > n0 > 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(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(n15,type,
n15: $i ).
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(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_58,axiom,
! [X] : ~ less(X,X),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
tff(f_399,negated_conjecture,
~ ~ ? [X] :
( in_closed(X,n0,n5)
& in_closed(X,n10,n15) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_false_conflict) ).
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_88,axiom,
! [X,Y] :
( ( leq(X,Y)
& leq(Y,X) )
=> ( X = Y ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
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_93,axiom,
! [X,Y] :
( less(X,Y)
=> leq(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
tff(c_2,plain,
! [X_1] : ~ less(X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_156,plain,
in_closed('#skF_4',n0,n5),
inference(cnfTransformation,[status(thm)],[f_399]) ).
tff(c_244,plain,
! [X_124,B_125,A_126] :
( leq(X_124,B_125)
| ~ in_closed(X_124,A_126,B_125) ),
inference(cnfTransformation,[status(thm)],[f_356]) ).
tff(c_257,plain,
leq('#skF_4',n5),
inference(resolution,[status(thm)],[c_156,c_244]) ).
tff(c_154,plain,
in_closed('#skF_4',n10,n15),
inference(cnfTransformation,[status(thm)],[f_399]) ).
tff(c_261,plain,
! [A_136,X_137,B_138] :
( leq(A_136,X_137)
| ~ in_closed(X_137,A_136,B_138) ),
inference(cnfTransformation,[status(thm)],[f_356]) ).
tff(c_273,plain,
leq(n10,'#skF_4'),
inference(resolution,[status(thm)],[c_154,c_261]) ).
tff(c_326,plain,
! [Y_144,X_145] :
( ( Y_144 = X_145 )
| ~ leq(Y_144,X_145)
| ~ leq(X_145,Y_144) ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_344,plain,
( ( n10 = '#skF_4' )
| ~ leq('#skF_4',n10) ),
inference(resolution,[status(thm)],[c_273,c_326]) ).
tff(c_381,plain,
~ leq('#skF_4',n10),
inference(splitLeft,[status(thm)],[c_344]) ).
tff(c_148,plain,
less(n5,n10),
inference(cnfTransformation,[status(thm)],[f_384]) ).
tff(c_578,plain,
! [X_162,Z_163,Y_164] :
( less(X_162,Z_163)
| ~ less(Y_164,Z_163)
| ~ leq(X_162,Y_164) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_628,plain,
! [X_165] :
( less(X_165,n10)
| ~ leq(X_165,n5) ),
inference(resolution,[status(thm)],[c_148,c_578]) ).
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_779,plain,
! [X_173] :
( leq(X_173,n10)
| ~ leq(X_173,n5) ),
inference(resolution,[status(thm)],[c_628,c_16]) ).
tff(c_782,plain,
leq('#skF_4',n10),
inference(resolution,[status(thm)],[c_257,c_779]) ).
tff(c_793,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_381,c_782]) ).
tff(c_794,plain,
n10 = '#skF_4',
inference(splitRight,[status(thm)],[c_344]) ).
tff(c_176,plain,
! [X_112,Y_113] :
( leq(X_112,Y_113)
| ~ less(X_112,Y_113) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_186,plain,
leq(n5,n10),
inference(resolution,[status(thm)],[c_148,c_176]) ).
tff(c_800,plain,
leq(n5,'#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_794,c_186]) ).
tff(c_14,plain,
! [Y_10,X_9] :
( ( Y_10 = X_9 )
| ~ leq(Y_10,X_9)
| ~ leq(X_9,Y_10) ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_813,plain,
( ( n5 = '#skF_4' )
| ~ leq('#skF_4',n5) ),
inference(resolution,[status(thm)],[c_800,c_14]) ).
tff(c_816,plain,
n5 = '#skF_4',
inference(demodulation,[status(thm),theory(equality)],[c_257,c_813]) ).
tff(c_803,plain,
less(n5,'#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_794,c_148]) ).
tff(c_829,plain,
less('#skF_4','#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_816,c_803]) ).
tff(c_830,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2,c_829]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT071+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.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 13:56:57 UTC 2026
% 0.10/0.37 % CPUTime :
% 6.66/3.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.66/3.10
% 6.66/3.10 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------