%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT084+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 : n028.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:05 AM UTC 2026
% Result : Theorem 5.46s 2.32s
% Output : CNFRefutation 5.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 32 ( 4 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 24 ( 9 ~; 5 |; 7 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 13 ( 11 usr; 1 prp; 0-4 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-4 aty)
% Number of variables : 19 ( 16 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ axis_subsumes > axis_conflict > axis_compatible > in_ropen > in_open > in_lopen > in_closed > less > leq > val > is_verdict > box_verdict > #nlpp > v600 > v400 > v200 > v0 > unknown > conflict > compatible > #skF_5 > #skF_2 > #skF_6 > #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(v200,type,
v200: $i ).
tff(compatible,type,
compatible: $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': $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(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(conflict,type,
conflict: $i ).
tff(f_59,axiom,
! [X] : ~ less(X,X),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
tff(f_309,negated_conjecture,
~ ~ ? [X,Y,Z] :
( in_lopen(X,v0,v600)
& leq(v600,X)
& in_lopen(Y,v0,v400)
& less(v400,Y)
& in_lopen(Z,v0,v200)
& leq(v200,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl432) ).
tff(f_165,axiom,
! [X,A,B] :
( in_lopen(X,A,B)
<=> ( less(A,X)
& leq(X,B) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_lopen) ).
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_89,axiom,
! [X,Y] :
( ( leq(X,Y)
& leq(Y,X) )
=> ( X = Y ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
tff(c_2,plain,
! [X_1] : ~ less(X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_130,plain,
in_lopen('#skF_5',v0,v400),
inference(cnfTransformation,[status(thm)],[f_309]) ).
tff(c_260,plain,
! [X_91,B_92,A_93] :
( leq(X_91,B_92)
| ~ in_lopen(X_91,A_93,B_92) ),
inference(cnfTransformation,[status(thm)],[f_165]) ).
tff(c_271,plain,
leq('#skF_5',v400),
inference(resolution,[status(thm)],[c_130,c_260]) ).
tff(c_128,plain,
less(v400,'#skF_5'),
inference(cnfTransformation,[status(thm)],[f_309]) ).
tff(c_200,plain,
! [X_68,Y_69] :
( leq(X_68,Y_69)
| ~ less(X_68,Y_69) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_224,plain,
leq(v400,'#skF_5'),
inference(resolution,[status(thm)],[c_128,c_200]) ).
tff(c_273,plain,
! [Y_94,X_95] :
( ( Y_94 = X_95 )
| ~ leq(Y_94,X_95)
| ~ leq(X_95,Y_94) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_299,plain,
( ( v400 = '#skF_5' )
| ~ leq('#skF_5',v400) ),
inference(resolution,[status(thm)],[c_224,c_273]) ).
tff(c_338,plain,
v400 = '#skF_5',
inference(demodulation,[status(thm),theory(equality)],[c_271,c_299]) ).
tff(c_441,plain,
less('#skF_5','#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_338,c_128]) ).
tff(c_449,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2,c_441]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT084+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.09/0.37 % Computer : n028.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 7 14:20:47 UTC 2026
% 0.09/0.37 % CPUTime :
% 5.46/2.32 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.46/2.32
% 5.46/2.32 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------