%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT093+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/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 : n019.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 4.72s 2.52s
% Output : CNFRefutation 4.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of formulae : 10 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 16 ( 7 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 10 ( 4 ~; 2 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 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 : 12 ( 10 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 2 ( 2 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ axis_subsumes > axis_conflict > axis_compatible > in_ropen > in_open > in_lopen > in_closed > less > leq > is_verdict > xone_verdict > or_verdict > box_verdict > #nlpp > unknown > conflict > compatible > #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(in_lopen,type,
in_lopen: ( $i * $i * $i ) > $o ).
tff(box_verdict,type,
box_verdict: ( $i * $i ) > $i ).
tff(unknown,type,
unknown: $i ).
tff(xone_verdict,type,
xone_verdict: ( $i * $i ) > $i ).
tff(in_ropen,type,
in_ropen: ( $i * $i * $i ) > $o ).
tff(in_open,type,
in_open: ( $i * $i * $i ) > $o ).
tff(compatible,type,
compatible: $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(or_verdict,type,
or_verdict: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i * $i ) > $i ).
tff(in_closed,type,
in_closed: ( $i * $i * $i ) > $o ).
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(axis_compatible,type,
axis_compatible: ( $i * $i * $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i * $i ) > $i ).
tff(conflict,type,
conflict: $i ).
tff(f_443,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl644) ).
tff(f_376,axiom,
is_verdict(compatible),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',compatible_is_verdict) ).
tff(f_375,axiom,
is_verdict(conflict),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',conflict_is_verdict) ).
tff(f_225,axiom,
! [Vm,Vr] :
( ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
=> ( xone_verdict(Vm,Vr) = compatible ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+3.ax',xone_compat) ).
tff(c_126,plain,
xone_verdict(compatible,conflict) != compatible,
inference(cnfTransformation,[status(thm)],[f_443]) ).
tff(c_102,plain,
is_verdict(compatible),
inference(cnfTransformation,[status(thm)],[f_376]) ).
tff(c_100,plain,
is_verdict(conflict),
inference(cnfTransformation,[status(thm)],[f_375]) ).
tff(c_36,plain,
( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(conflict)
| ~ is_verdict(compatible) ),
inference(cnfTransformation,[status(thm)],[f_225]) ).
tff(c_142,plain,
xone_verdict(compatible,conflict) = compatible,
inference(demodulation,[status(thm),theory(equality)],[c_102,c_100,c_36]) ).
tff(c_143,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_126,c_142]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.03 % 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.09/0.35 % Computer : n019.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 7 14:01:22 UTC 2026
% 0.09/0.35 % CPUTime :
% 4.72/2.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.72/2.52
% 4.72/2.52 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------