%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT090+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 : n007.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 9.49s 3.68s
% Output : CNFRefutation 9.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 17 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 29 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 12 ~; 6 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 16 ( 14 usr; 1 prp; 0-4 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-4 aty)
% Number of variables : 10 ( 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ wf > sem_nonempty > axis_subsumes > axis_conflict > axis_compatible > in_ropen > in_open > in_lopen > in_closed > less > leq > val > is_verdict > is_op > box_verdict > #nlpp > v600 > v1200 > v0 > unknown > lteq > lt > gteq > gt > eq > 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(lteq,type,
lteq: $i ).
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(compatible,type,
compatible: $i ).
tff(eq,type,
eq: $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i * $i ) > $i ).
tff(lt,type,
lt: $i ).
tff(gteq,type,
gteq: $i ).
tff(in_closed,type,
in_closed: ( $i * $i * $i ) > $o ).
tff(axis_subsumes,type,
axis_subsumes: ( $i * $i * $i * $i ) > $o ).
tff(sem_nonempty,type,
sem_nonempty: ( $i * $i * $i * $i ) > $o ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(is_op,type,
is_op: $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 * $i ) > $i ).
tff(v1200,type,
v1200: $i ).
tff(conflict,type,
conflict: $i ).
tff(wf,type,
wf: ( $i * $i * $i * $i ) > $o ).
tff(gt,type,
gt: $i ).
tff(f_409,axiom,
( ( v0 != v600 )
& ( v0 != v1200 )
& ( v600 != v1200 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
tff(f_400,axiom,
less(v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v600) ).
tff(f_92,axiom,
! [X,Y] :
( less(X,Y)
=> leq(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
tff(f_401,axiom,
less(v600,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v1200) ).
tff(f_325,axiom,
! [V,InfD,SupD] :
( wf(lt,V,InfD,SupD)
<=> ( leq(InfD,V)
& leq(V,SupD)
& ( V != InfD ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+8.ax',wf_lt) ).
tff(f_411,negated_conjecture,
~ wf(lt,v600,v0,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl613) ).
tff(c_182,plain,
v600 != v0,
inference(cnfTransformation,[status(thm)],[f_409]) ).
tff(c_174,plain,
less(v0,v600),
inference(cnfTransformation,[status(thm)],[f_400]) ).
tff(c_205,plain,
! [X_101,Y_102] :
( leq(X_101,Y_102)
| ~ less(X_101,Y_102) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_213,plain,
leq(v0,v600),
inference(resolution,[status(thm)],[c_174,c_205]) ).
tff(c_176,plain,
less(v600,v1200),
inference(cnfTransformation,[status(thm)],[f_401]) ).
tff(c_212,plain,
leq(v600,v1200),
inference(resolution,[status(thm)],[c_176,c_205]) ).
tff(c_3853,plain,
! [V_326,InfD_327,SupD_328] :
( wf(lt,V_326,InfD_327,SupD_328)
| ( V_326 = InfD_327 )
| ~ leq(V_326,SupD_328)
| ~ leq(InfD_327,V_326) ),
inference(cnfTransformation,[status(thm)],[f_325]) ).
tff(c_184,plain,
~ wf(lt,v600,v0,v1200),
inference(cnfTransformation,[status(thm)],[f_411]) ).
tff(c_3869,plain,
( ( v600 = v0 )
| ~ leq(v600,v1200)
| ~ leq(v0,v600) ),
inference(resolution,[status(thm)],[c_3853,c_184]) ).
tff(c_3879,plain,
v600 = v0,
inference(demodulation,[status(thm),theory(equality)],[c_213,c_212,c_3869]) ).
tff(c_3881,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_182,c_3879]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT090+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.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % 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:20:41 UTC 2026
% 0.10/0.36 % CPUTime :
% 9.49/3.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.49/3.69
% 9.49/3.69 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------