%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT078+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 : n031.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 8.55s 3.57s
% Output : CNFRefutation 8.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 71 ( 27 equ)
% Maximal formula atoms : 21 ( 2 avg)
% Number of connectives : 79 ( 37 ~; 10 |; 28 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 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 : 13 ( 11 usr; 1 prp; 0-4 aty)
% Number of functors : 17 ( 17 usr; 13 con; 0-4 aty)
% Number of variables : 26 ( 23 !; 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 > v800 > v8 > v600 > v32 > v200 > v1200 > 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(v32,type,
v32: $i ).
tff(in_open,type,
in_open: ( $i * $i * $i ) > $o ).
tff(v8,type,
v8: $i ).
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(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(v1200,type,
v1200: $i ).
tff(conflict,type,
conflict: $i ).
tff(f_376,negated_conjecture,
~ ~ ? [X,Y,Z] :
( in_lopen(X,v0,v600)
& leq(v1200,X)
& in_lopen(Y,v0,v800)
& leq(v200,Y)
& in_lopen(Z,v0,v32)
& leq(v8,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl341) ).
tff(f_169,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_93,axiom,
! [X,Y] :
( ( leq(X,Y)
& leq(Y,X) )
=> ( X = Y ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
tff(f_299,axiom,
less(v600,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v1200) ).
tff(f_111,axiom,
! [X,Y,Z] :
( ( less(X,Y)
& leq(Y,Z) )
=> less(X,Z) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_leq_trans) ).
tff(f_98,axiom,
! [X,Y] :
( less(X,Y)
=> leq(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
tff(f_362,axiom,
( ( v0 != v8 )
& ( v0 != v32 )
& ( v0 != v200 )
& ( v0 != v600 )
& ( v0 != v800 )
& ( v0 != v1200 )
& ( v8 != v32 )
& ( v8 != v200 )
& ( v8 != v600 )
& ( v8 != v800 )
& ( v8 != v1200 )
& ( v32 != v200 )
& ( v32 != v600 )
& ( v32 != v800 )
& ( v32 != v1200 )
& ( v200 != v600 )
& ( v200 != v800 )
& ( v200 != v1200 )
& ( v600 != v800 )
& ( v600 != v1200 )
& ( v800 != v1200 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
tff(c_198,plain,
leq(v1200,'#skF_4'),
inference(cnfTransformation,[status(thm)],[f_376]) ).
tff(c_200,plain,
in_lopen('#skF_4',v0,v600),
inference(cnfTransformation,[status(thm)],[f_376]) ).
tff(c_342,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_169]) ).
tff(c_353,plain,
leq('#skF_4',v600),
inference(resolution,[status(thm)],[c_200,c_342]) ).
tff(c_445,plain,
! [Y_96,X_97] :
( ( Y_96 = X_97 )
| ~ leq(Y_96,X_97)
| ~ leq(X_97,Y_96) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_550,plain,
( ( v600 = '#skF_4' )
| ~ leq(v600,'#skF_4') ),
inference(resolution,[status(thm)],[c_353,c_445]) ).
tff(c_657,plain,
~ leq(v600,'#skF_4'),
inference(splitLeft,[status(thm)],[c_550]) ).
tff(c_144,plain,
less(v600,v1200),
inference(cnfTransformation,[status(thm)],[f_299]) ).
tff(c_821,plain,
! [X_109,Z_110,Y_111] :
( less(X_109,Z_110)
| ~ leq(Y_111,Z_110)
| ~ less(X_109,Y_111) ),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_1132,plain,
! [X_118] :
( less(X_118,'#skF_4')
| ~ less(X_118,v1200) ),
inference(resolution,[status(thm)],[c_198,c_821]) ).
tff(c_1169,plain,
less(v600,'#skF_4'),
inference(resolution,[status(thm)],[c_144,c_1132]) ).
tff(c_16,plain,
! [X_11,Y_12] :
( leq(X_11,Y_12)
| ~ less(X_11,Y_12) ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_1184,plain,
leq(v600,'#skF_4'),
inference(resolution,[status(thm)],[c_1169,c_16]) ).
tff(c_1189,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_657,c_1184]) ).
tff(c_1190,plain,
v600 = '#skF_4',
inference(splitRight,[status(thm)],[c_550]) ).
tff(c_150,plain,
v600 != v1200,
inference(cnfTransformation,[status(thm)],[f_362]) ).
tff(c_257,plain,
! [X_68,Y_69] :
( leq(X_68,Y_69)
| ~ less(X_68,Y_69) ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_330,plain,
leq(v600,v1200),
inference(resolution,[status(thm)],[c_144,c_257]) ).
tff(c_463,plain,
( ( v600 = v1200 )
| ~ leq(v1200,v600) ),
inference(resolution,[status(thm)],[c_330,c_445]) ).
tff(c_528,plain,
~ leq(v1200,v600),
inference(negUnitSimplification,[status(thm)],[c_150,c_463]) ).
tff(c_1196,plain,
~ leq(v1200,'#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_1190,c_528]) ).
tff(c_1221,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_198,c_1196]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT078+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.11/0.37 % Computer : n031.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 7 14:16:41 UTC 2026
% 0.11/0.37 % CPUTime :
% 8.55/3.57 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.55/3.58
% 8.55/3.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------