%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT070+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 : n006.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:04 AM UTC 2026
% Result : Theorem 5.89s 2.98s
% Output : CNFRefutation 5.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 11 ~; 6 |; 3 &)
% ( 0 <=>; 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 ( 12 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-4 aty)
% Number of variables : 15 ( 14 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ completion_conflict > axis_subsumes > axis_conflict > axis_compatible > in_ropen > in_open > in_lopen > in_closed > completion_compatible > less > leq > is_verdict > box_verdict > #nlpp > unknown > nsup > ninf > n0 > 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(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(completion_compatible,type,
completion_compatible: ( $i * $i * $i ) > $o ).
tff(in_open,type,
in_open: ( $i * $i * $i ) > $o ).
tff(completion_conflict,type,
completion_conflict: ( $i * $i * $i * $i ) > $o ).
tff(ninf,type,
ninf: $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(n0,type,
n0: $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('#skF_3',type,
'#skF_3': ( $i * $i * $i * $i ) > $i ).
tff(nsup,type,
nsup: $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_414,hypothesis,
! [X] : leq(ninf,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_inf_lb) ).
tff(f_416,hypothesis,
! [X] : leq(X,nsup),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_sup_ub) ).
tff(f_342,axiom,
! [V,InfD,SupD] :
( ( leq(InfD,V)
& leq(V,SupD) )
=> completion_compatible(V,InfD,SupD) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+4.ax',completion_compat) ).
tff(f_429,negated_conjecture,
~ ? [V] :
( leq(ninf,V)
& leq(V,nsup)
& completion_compatible(V,ninf,nsup) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown_sound_compatible) ).
tff(c_112,plain,
! [X_94] : leq(ninf,X_94),
inference(cnfTransformation,[status(thm)],[f_414]) ).
tff(c_114,plain,
! [X_95] : leq(X_95,nsup),
inference(cnfTransformation,[status(thm)],[f_416]) ).
tff(c_733,plain,
! [V_176,InfD_177,SupD_178] :
( completion_compatible(V_176,InfD_177,SupD_178)
| ~ leq(V_176,SupD_178)
| ~ leq(InfD_177,V_176) ),
inference(cnfTransformation,[status(thm)],[f_342]) ).
tff(c_118,plain,
! [V_96] :
( ~ completion_compatible(V_96,ninf,nsup)
| ~ leq(V_96,nsup)
| ~ leq(ninf,V_96) ),
inference(cnfTransformation,[status(thm)],[f_429]) ).
tff(c_120,plain,
! [V_96] :
( ~ completion_compatible(V_96,ninf,nsup)
| ~ leq(ninf,V_96) ),
inference(demodulation,[status(thm),theory(equality)],[c_114,c_118]) ).
tff(c_122,plain,
! [V_96] : ~ completion_compatible(V_96,ninf,nsup),
inference(demodulation,[status(thm),theory(equality)],[c_112,c_120]) ).
tff(c_737,plain,
! [V_176] :
( ~ leq(V_176,nsup)
| ~ leq(ninf,V_176) ),
inference(resolution,[status(thm)],[c_733,c_122]) ).
tff(c_741,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_112,c_114,c_737]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT070+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 : n006.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 13:54:01 UTC 2026
% 0.09/0.37 % CPUTime :
% 5.89/2.98 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.89/2.99
% 5.89/2.99 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------