%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT092+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/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 : n020.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 7.85s 3.49s
% Output : CNFRefutation 8.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 34 ( 15 ~; 12 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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 : 14 ( 13 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-4 aty)
% Number of variables : 21 ( 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ completion_conflict > axis_subsumes > axis_conflict > axis_compatible > in_ropen > in_open > in_lopen > in_closed > completion_compatible > less > leq > val > is_verdict > box_verdict > #nlpp > v800 > v400 > v1200 > v0 > 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(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(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(val,type,
val: $i > $o ).
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(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(v800,type,
v800: $i ).
tff(v1200,type,
v1200: $i ).
tff(conflict,type,
conflict: $i ).
tff(f_373,axiom,
less(v0,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v400) ).
tff(f_93,axiom,
! [X,Y] :
( less(X,Y)
=> leq(X,Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
tff(f_374,axiom,
less(v400,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_v800) ).
tff(f_375,axiom,
less(v800,v1200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v800_v1200) ).
tff(f_65,axiom,
! [X,Y,Z] :
( ( less(X,Y)
& less(Y,Z) )
=> less(X,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',transitive) ).
tff(f_191,axiom,
! [U,V,InfD,SupD] :
( ( leq(InfD,U)
& leq(U,SupD)
& less(U,V)
& leq(V,SupD) )
=> completion_conflict(U,V,InfD,SupD) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+4.ax',sharpness_conflict) ).
tff(f_394,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl633) ).
tff(c_112,plain,
less(v0,v400),
inference(cnfTransformation,[status(thm)],[f_373]) ).
tff(c_149,plain,
! [X_93,Y_94] :
( leq(X_93,Y_94)
| ~ less(X_93,Y_94) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_160,plain,
leq(v0,v400),
inference(resolution,[status(thm)],[c_112,c_149]) ).
tff(c_114,plain,
less(v400,v800),
inference(cnfTransformation,[status(thm)],[f_374]) ).
tff(c_116,plain,
less(v800,v1200),
inference(cnfTransformation,[status(thm)],[f_375]) ).
tff(c_418,plain,
! [X_136,Z_137,Y_138] :
( less(X_136,Z_137)
| ~ less(Y_138,Z_137)
| ~ less(X_136,Y_138) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_584,plain,
! [X_147] :
( less(X_147,v1200)
| ~ less(X_147,v800) ),
inference(resolution,[status(thm)],[c_116,c_418]) ).
tff(c_615,plain,
less(v400,v1200),
inference(resolution,[status(thm)],[c_114,c_584]) ).
tff(c_16,plain,
! [X_11,Y_12] :
( leq(X_11,Y_12)
| ~ less(X_11,Y_12) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_625,plain,
leq(v400,v1200),
inference(resolution,[status(thm)],[c_615,c_16]) ).
tff(c_161,plain,
leq(v800,v1200),
inference(resolution,[status(thm)],[c_116,c_149]) ).
tff(c_2010,plain,
! [U_246,V_247,InfD_248,SupD_249] :
( completion_conflict(U_246,V_247,InfD_248,SupD_249)
| ~ leq(V_247,SupD_249)
| ~ less(U_246,V_247)
| ~ leq(U_246,SupD_249)
| ~ leq(InfD_248,U_246) ),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_130,plain,
~ completion_conflict(v400,v800,v0,v1200),
inference(cnfTransformation,[status(thm)],[f_394]) ).
tff(c_2013,plain,
( ~ leq(v800,v1200)
| ~ less(v400,v800)
| ~ leq(v400,v1200)
| ~ leq(v0,v400) ),
inference(resolution,[status(thm)],[c_2010,c_130]) ).
tff(c_2017,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_160,c_625,c_114,c_161,c_2013]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT092+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/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.10/0.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 7 14:25:28 UTC 2026
% 0.10/0.38 % CPUTime :
% 7.85/3.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.85/3.50
% 7.85/3.50 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------