%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT103+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 : n031.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 : Unsatisfiable 4.56s 2.32s
% Output : CNFRefutation 4.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 24 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 8 ~; 4 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 13 ( 11 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 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 > box_verdict > #nlpp > v800 > v600 > 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(in_open,type,
in_open: ( $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(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(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(v800,type,
v800: $i ).
tff(conflict,type,
conflict: $i ).
tff(f_281,axiom,
( ( v0 != v600 )
& ( v0 != v800 )
& ( v600 != v800 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
tff(f_284,axiom,
( less(v800,v600)
& less(v600,v800) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',contradiction) ).
tff(f_94,axiom,
! [X,Y] :
( less(X,Y)
=> leq(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
tff(f_89,axiom,
! [X,Y] :
( ( leq(X,Y)
& leq(Y,X) )
=> ( X = Y ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
tff(c_102,plain,
v800 != v600,
inference(cnfTransformation,[status(thm)],[f_281]) ).
tff(c_110,plain,
less(v800,v600),
inference(cnfTransformation,[status(thm)],[f_284]) ).
tff(c_130,plain,
! [X_66,Y_67] :
( leq(X_66,Y_67)
| ~ less(X_66,Y_67) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_140,plain,
leq(v800,v600),
inference(resolution,[status(thm)],[c_110,c_130]) ).
tff(c_108,plain,
less(v600,v800),
inference(cnfTransformation,[status(thm)],[f_284]) ).
tff(c_141,plain,
leq(v600,v800),
inference(resolution,[status(thm)],[c_108,c_130]) ).
tff(c_211,plain,
! [Y_96,X_97] :
( ( Y_96 = X_97 )
| ~ leq(Y_96,X_97)
| ~ leq(X_97,Y_96) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_213,plain,
( ( v800 = v600 )
| ~ leq(v800,v600) ),
inference(resolution,[status(thm)],[c_141,c_211]) ).
tff(c_222,plain,
v800 = v600,
inference(demodulation,[status(thm),theory(equality)],[c_140,c_213]) ).
tff(c_224,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_102,c_222]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT103+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.10/0.37 % Computer : n031.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:42:26 UTC 2026
% 0.10/0.38 % CPUTime :
% 4.56/2.32 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.56/2.32
% 4.56/2.32 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------