%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT089+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/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 : n016.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:06 AM UTC 2026
% Result : Theorem 4.92s 2.68s
% Output : CNFRefutation 5.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 8 ( 4 ~; 2 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 18 ( 16 usr; 1 prp; 0-8 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-4 aty)
% Number of variables : 7 ( 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ disjoint > prec > axis_subsumes > axis_conflict > axis_compatible > in_ropen > in_open > in_lopen > in_closed > upper_tag > lower_tag > less > leq > val > is_verdict > is_ep_type > box_verdict > #nlpp > v5 > unknown > o > lteq > lt > gteq > gt > eq > conflict > compatible > c > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(lower_tag,type,
lower_tag: ( $i * $i ) > $o ).
tff(is_verdict,type,
is_verdict: $i > $o ).
tff(axis_conflict,type,
axis_conflict: ( $i * $i * $i * $i ) > $o ).
tff(upper_tag,type,
upper_tag: ( $i * $i ) > $o ).
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(disjoint,type,
disjoint: ( $i * $i * $i * $i * $i * $i * $i * $i ) > $o ).
tff(axis_subsumes,type,
axis_subsumes: ( $i * $i * $i * $i ) > $o ).
tff(v5,type,
v5: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(is_ep_type,type,
is_ep_type: $i > $o ).
tff(prec,type,
prec: ( $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(o,type,
o: $i ).
tff(conflict,type,
conflict: $i ).
tff(gt,type,
gt: $i ).
tff(c,type,
c: $i ).
tff(f_78,axiom,
! [X,Y] :
( leq(X,Y)
<=> ( less(X,Y)
| ( X = Y ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).
tff(f_324,axiom,
! [U,L] :
( prec(U,L,o,o)
<=> leq(U,L) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+5.ax',prec_oo) ).
tff(f_356,negated_conjecture,
~ prec(v5,v5,o,o),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl604) ).
tff(c_10,plain,
! [Y_8] : leq(Y_8,Y_8),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_311,plain,
! [U_126,L_127] :
( prec(U_126,L_127,o,o)
| ~ leq(U_126,L_127) ),
inference(cnfTransformation,[status(thm)],[f_324]) ).
tff(c_144,plain,
~ prec(v5,v5,o,o),
inference(cnfTransformation,[status(thm)],[f_356]) ).
tff(c_317,plain,
~ leq(v5,v5),
inference(resolution,[status(thm)],[c_311,c_144]) ).
tff(c_322,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_317]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT089+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/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 : n016.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:04:32 UTC 2026
% 0.13/0.36 % CPUTime :
% 4.92/2.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.92/2.68
% 4.92/2.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------