%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT077+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 : n027.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.99s 3.68s
% Output : CNFRefutation 9.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 62 ( 1 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 63 ( 31 ~; 24 |; 5 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 13 ( 13 usr; 8 con; 0-4 aty)
% Number of variables : 31 ( 29 !; 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 > v500 > v200 > v100 > v0 > unknown > 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(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(v500,type,
v500: $i ).
tff(compatible,type,
compatible: $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i * $i ) > $i ).
tff(in_closed,type,
in_closed: ( $i * $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i * $i ) > $i ).
tff(axis_subsumes,type,
axis_subsumes: ( $i * $i * $i * $i ) > $o ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(v100,type,
v100: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i * $i ) > $i ).
tff(axis_compatible,type,
axis_compatible: ( $i * $i * $i * $i ) > $o ).
tff(v800,type,
v800: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(conflict,type,
conflict: $i ).
tff(f_83,axiom,
! [X,Y] :
( leq(X,Y)
<=> ( less(X,Y)
| ( X = Y ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_def) ).
tff(f_314,axiom,
less(v0,v200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v200) ).
tff(f_320,axiom,
less(v200,v500),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v200_v500) ).
tff(f_317,axiom,
less(v100,v200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v100_v200) ).
tff(f_103,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_216,axiom,
! [X,A,B] :
( in_open(X,A,B)
<=> ( less(A,X)
& less(X,B) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_open) ).
tff(f_315,axiom,
less(v0,v500),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v500) ).
tff(f_322,axiom,
less(v500,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v500_v800) ).
tff(f_360,negated_conjecture,
~ ? [X,Y] :
( less(v200,X)
& in_open(X,v0,v800)
& less(v100,Y)
& in_open(Y,v0,v500) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl327) ).
tff(c_10,plain,
! [Y_8] : leq(Y_8,Y_8),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_108,plain,
less(v0,v200),
inference(cnfTransformation,[status(thm)],[f_314]) ).
tff(c_120,plain,
less(v200,v500),
inference(cnfTransformation,[status(thm)],[f_320]) ).
tff(c_114,plain,
less(v100,v200),
inference(cnfTransformation,[status(thm)],[f_317]) ).
tff(c_1577,plain,
! [X_197,Z_198,Y_199] :
( less(X_197,Z_198)
| ~ less(Y_199,Z_198)
| ~ leq(X_197,Y_199) ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_1619,plain,
! [X_197] :
( less(X_197,v200)
| ~ leq(X_197,v100) ),
inference(resolution,[status(thm)],[c_114,c_1577]) ).
tff(c_2252,plain,
! [X_233,A_234,B_235] :
( in_open(X_233,A_234,B_235)
| ~ less(X_233,B_235)
| ~ less(A_234,X_233) ),
inference(cnfTransformation,[status(thm)],[f_216]) ).
tff(c_110,plain,
less(v0,v500),
inference(cnfTransformation,[status(thm)],[f_315]) ).
tff(c_124,plain,
less(v500,v800),
inference(cnfTransformation,[status(thm)],[f_322]) ).
tff(c_426,plain,
! [X_112,Z_113,Y_114] :
( less(X_112,Z_113)
| ~ less(Y_114,Z_113)
| ~ leq(X_112,Y_114) ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_462,plain,
! [X_112] :
( less(X_112,v500)
| ~ leq(X_112,v200) ),
inference(resolution,[status(thm)],[c_120,c_426]) ).
tff(c_1101,plain,
! [X_148,A_149,B_150] :
( in_open(X_148,A_149,B_150)
| ~ less(X_148,B_150)
| ~ less(A_149,X_148) ),
inference(cnfTransformation,[status(thm)],[f_216]) ).
tff(c_146,plain,
! [Y_68,X_67] :
( ~ in_open(Y_68,v0,v500)
| ~ less(v100,Y_68)
| ~ in_open(X_67,v0,v800)
| ~ less(v200,X_67) ),
inference(cnfTransformation,[status(thm)],[f_360]) ).
tff(c_159,plain,
! [X_67] :
( ~ in_open(X_67,v0,v800)
| ~ less(v200,X_67) ),
inference(splitLeft,[status(thm)],[c_146]) ).
tff(c_1196,plain,
! [X_153] :
( ~ less(v200,X_153)
| ~ less(X_153,v800)
| ~ less(v0,X_153) ),
inference(resolution,[status(thm)],[c_1101,c_159]) ).
tff(c_1235,plain,
( ~ less(v500,v800)
| ~ less(v0,v500)
| ~ leq(v200,v200) ),
inference(resolution,[status(thm)],[c_462,c_1196]) ).
tff(c_1309,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_110,c_124,c_1235]) ).
tff(c_1310,plain,
! [Y_68] :
( ~ in_open(Y_68,v0,v500)
| ~ less(v100,Y_68) ),
inference(splitRight,[status(thm)],[c_146]) ).
tff(c_2347,plain,
! [X_238] :
( ~ less(v100,X_238)
| ~ less(X_238,v500)
| ~ less(v0,X_238) ),
inference(resolution,[status(thm)],[c_2252,c_1310]) ).
tff(c_2383,plain,
( ~ less(v200,v500)
| ~ less(v0,v200)
| ~ leq(v100,v100) ),
inference(resolution,[status(thm)],[c_1619,c_2347]) ).
tff(c_2459,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_108,c_120,c_2383]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT077+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 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 : n027.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 14:16:03 UTC 2026
% 0.10/0.37 % CPUTime :
% 8.99/3.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.99/3.69
% 8.99/3.69 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------