%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT081+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/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 : n002.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 7.16s 3.24s
% Output : CNFRefutation 7.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 55 ( 16 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 53 ( 25 ~; 9 |; 15 &)
% ( 1 <=>; 3 =>; 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 : 23 ( 21 !; 2 ?; 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 > v600 > v400 > v200 > v0 > unknown > conflict > compatible > #skF_5 > #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(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(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(v800,type,
v800: $i ).
tff(conflict,type,
conflict: $i ).
tff(f_321,negated_conjecture,
~ ~ ? [X,Y] :
( in_lopen(X,v0,v400)
& leq(v800,X)
& in_lopen(Y,v0,v600)
& leq(v200,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl402) ).
tff(f_164,axiom,
! [X,A,B] :
( in_lopen(X,A,B)
<=> ( less(A,X)
& leq(X,B) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_lopen) ).
tff(f_88,axiom,
! [X,Y] :
( ( leq(X,Y)
& leq(Y,X) )
=> ( X = Y ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
tff(f_281,axiom,
less(v400,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_v800) ).
tff(f_93,axiom,
! [X,Y] :
( less(X,Y)
=> leq(X,Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
tff(f_112,axiom,
! [X,Y,Z] :
( ( leq(X,Y)
& leq(Y,Z) )
=> leq(X,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
tff(f_311,axiom,
( ( v0 != v200 )
& ( v0 != v400 )
& ( v0 != v600 )
& ( v0 != v800 )
& ( v200 != v400 )
& ( v200 != v600 )
& ( v200 != v800 )
& ( v400 != v600 )
& ( v400 != v800 )
& ( v600 != v800 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).
tff(c_146,plain,
leq(v800,'#skF_4'),
inference(cnfTransformation,[status(thm)],[f_321]) ).
tff(c_148,plain,
in_lopen('#skF_4',v0,v400),
inference(cnfTransformation,[status(thm)],[f_321]) ).
tff(c_234,plain,
! [X_70,B_71,A_72] :
( leq(X_70,B_71)
| ~ in_lopen(X_70,A_72,B_71) ),
inference(cnfTransformation,[status(thm)],[f_164]) ).
tff(c_241,plain,
leq('#skF_4',v400),
inference(resolution,[status(thm)],[c_148,c_234]) ).
tff(c_348,plain,
! [Y_97,X_98] :
( ( Y_97 = X_98 )
| ~ leq(Y_97,X_98)
| ~ leq(X_98,Y_97) ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_386,plain,
( ( v400 = '#skF_4' )
| ~ leq(v400,'#skF_4') ),
inference(resolution,[status(thm)],[c_241,c_348]) ).
tff(c_449,plain,
~ leq(v400,'#skF_4'),
inference(splitLeft,[status(thm)],[c_386]) ).
tff(c_118,plain,
less(v400,v800),
inference(cnfTransformation,[status(thm)],[f_281]) ).
tff(c_180,plain,
! [X_67,Y_68] :
( leq(X_67,Y_68)
| ~ less(X_67,Y_68) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_219,plain,
leq(v400,v800),
inference(resolution,[status(thm)],[c_118,c_180]) ).
tff(c_1115,plain,
! [X_127,Z_128,Y_129] :
( leq(X_127,Z_128)
| ~ leq(Y_129,Z_128)
| ~ leq(X_127,Y_129) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_1251,plain,
! [X_131] :
( leq(X_131,'#skF_4')
| ~ leq(X_131,v800) ),
inference(resolution,[status(thm)],[c_146,c_1115]) ).
tff(c_1265,plain,
leq(v400,'#skF_4'),
inference(resolution,[status(thm)],[c_219,c_1251]) ).
tff(c_1282,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_449,c_1265]) ).
tff(c_1283,plain,
v400 = '#skF_4',
inference(splitRight,[status(thm)],[c_386]) ).
tff(c_124,plain,
v800 != v400,
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_362,plain,
( ( v800 = v400 )
| ~ leq(v800,v400) ),
inference(resolution,[status(thm)],[c_219,c_348]) ).
tff(c_395,plain,
~ leq(v800,v400),
inference(negUnitSimplification,[status(thm)],[c_124,c_362]) ).
tff(c_1285,plain,
~ leq(v800,'#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_1283,c_395]) ).
tff(c_1306,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_146,c_1285]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT081+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/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.12/0.38 % Computer : n002.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 7 14:19:07 UTC 2026
% 0.12/0.38 % CPUTime :
% 7.16/3.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.16/3.25
% 7.16/3.25 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------