%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT094+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 : n026.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:07 AM UTC 2026
% Result : Theorem 12.05s 4.23s
% Output : CNFRefutation 12.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 5 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 1 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-4 aty)
% Number of functors : 19 ( 19 usr; 13 con; 0-6 aty)
% Number of variables : 8 ( 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ axis_subsumes > axis_conflict > axis_compatible > in_ropen > in_open > in_lopen > in_closed > less > leq > val > is_verdict > is_presence > subs_verdict > box_verdict > box_subs > #nlpp > v800 > v600 > v400 > v32 > v300 > v16 > v150 > v0 > unknown > present > conflict > compatible > absent > #skF_2 > #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(is_presence,type,
is_presence: $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(box_subs,type,
box_subs: ( $i * $i ) > $i ).
tff(val,type,
val: $i > $o ).
tff(compatible,type,
compatible: $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(v300,type,
v300: $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i * $i ) > $i ).
tff(present,type,
present: $i ).
tff(absent,type,
absent: $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(v150,type,
v150: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(v600,type,
v600: $i ).
tff(v16,type,
v16: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i * $i ) > $i ).
tff(subs_verdict,type,
subs_verdict: ( $i * $i * $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_528,negated_conjecture,
subs_verdict(v0,v800,present,v0,v600,present) != conflict,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl653) ).
tff(f_334,axiom,
! [L1,H1,L2,H2] :
( ~ axis_subsumes(L1,H1,L2,H2)
=> ( subs_verdict(L1,H1,present,L2,H2,present) = conflict ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+7.ax',subs_present_no) ).
tff(f_526,axiom,
~ axis_subsumes(v0,v800,v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_subs_hint) ).
tff(c_254,plain,
subs_verdict(v0,v800,present,v0,v600,present) != conflict,
inference(cnfTransformation,[status(thm)],[f_528]) ).
tff(c_2211,plain,
! [L1_236,H1_237,L2_238,H2_239] :
( ( subs_verdict(L1_236,H1_237,present,L2_238,H2_239,present) = conflict )
| axis_subsumes(L1_236,H1_237,L2_238,H2_239) ),
inference(cnfTransformation,[status(thm)],[f_334]) ).
tff(c_252,plain,
~ axis_subsumes(v0,v800,v0,v600),
inference(cnfTransformation,[status(thm)],[f_526]) ).
tff(c_2214,plain,
subs_verdict(v0,v800,present,v0,v600,present) = conflict,
inference(resolution,[status(thm)],[c_2211,c_252]) ).
tff(c_2218,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_254,c_2214]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT094+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.11/0.37 % Computer : n026.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:27:57 UTC 2026
% 0.11/0.37 % CPUTime :
% 12.05/4.23 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.05/4.24
% 12.05/4.24 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------