%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT088+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:06 AM UTC 2026
% Result : Theorem 6.40s 3.12s
% Output : CNFRefutation 6.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 16 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 33 ( 1 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 31 ( 14 ~; 11 |; 3 &)
% ( 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 : 12 ( 12 usr; 7 con; 0-4 aty)
% Number of variables : 19 ( 18 !; 1 ?; 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_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_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('#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(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 ).
tff(conflict,type,
conflict: $i ).
tff(f_78,axiom,
! [X,Y] :
( leq(X,Y)
<=> ( less(X,Y)
| ( X = Y ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_def) ).
tff(f_308,axiom,
less(v0,v400),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v400) ).
tff(f_310,axiom,
less(v200,v400),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v200_v400) ).
tff(f_98,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_199,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_334,negated_conjecture,
~ ? [X] :
( less(v200,X)
& in_lopen(X,v0,v400) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl509) ).
tff(c_10,plain,
! [Y_8] : leq(Y_8,Y_8),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_106,plain,
less(v0,v400),
inference(cnfTransformation,[status(thm)],[f_308]) ).
tff(c_110,plain,
less(v200,v400),
inference(cnfTransformation,[status(thm)],[f_310]) ).
tff(c_391,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_98]) ).
tff(c_421,plain,
! [X_112] :
( less(X_112,v400)
| ~ leq(X_112,v200) ),
inference(resolution,[status(thm)],[c_110,c_391]) ).
tff(c_842,plain,
! [X_139,A_140,B_141] :
( in_lopen(X_139,A_140,B_141)
| ~ leq(X_139,B_141)
| ~ less(A_140,X_139) ),
inference(cnfTransformation,[status(thm)],[f_199]) ).
tff(c_128,plain,
! [X_67] :
( ~ in_lopen(X_67,v0,v400)
| ~ less(v200,X_67) ),
inference(cnfTransformation,[status(thm)],[f_334]) ).
tff(c_989,plain,
! [X_152] :
( ~ less(v200,X_152)
| ~ leq(X_152,v400)
| ~ less(v0,X_152) ),
inference(resolution,[status(thm)],[c_842,c_128]) ).
tff(c_1029,plain,
( ~ leq(v400,v400)
| ~ less(v0,v400)
| ~ leq(v200,v200) ),
inference(resolution,[status(thm)],[c_421,c_989]) ).
tff(c_1090,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_106,c_10,c_1029]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT088+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.10/0.35 % Computer : n028.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % 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:24:17 UTC 2026
% 0.14/0.36 % CPUTime :
% 6.40/3.12 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.40/3.13
% 6.40/3.13 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------