%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT014-1 : TPTP v9.3.0. Released v2.4.0.
% 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 : n009.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:02:50 AM UTC 2026
% Result : Unsatisfiable 3.93s 2.47s
% Output : CNFRefutation 4.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of formulae : 52 ( 29 unt; 0 typ; 0 def)
% Number of atoms : 127 ( 12 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 158 ( 83 ~; 75 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 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 : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 56 ( 56 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ size > reorganization_free > complexity > organization > greater > time > #nlpp > sk7 > sk6 > sk5 > sk4 > sk3 > sk2 > sk1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(reorganization_free,type,
reorganization_free: ( $i * $i * $i ) > $o ).
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(size,type,
size: ( $i * $i * $i ) > $o ).
tff(time,type,
time: $i > $o ).
tff(sk2,type,
sk2: $i ).
tff(complexity,type,
complexity: ( $i * $i * $i ) > $o ).
tff(sk1,type,
sk1: $i ).
tff(sk6,type,
sk6: $i ).
tff(sk4,type,
sk4: $i ).
tff(sk5,type,
sk5: $i ).
tff(sk3,type,
sk3: $i ).
tff(organization,type,
organization: ( $i * $i ) > $o ).
tff(sk7,type,
sk7: $i ).
tff(f_31,axiom,
! [A,B] :
( ~ greater(A,B)
| ( A != B ) ),
file(unknown,unknown) ).
tff(f_120,axiom,
organization(sk1,sk7),
file(unknown,unknown) ).
tff(f_121,axiom,
reorganization_free(sk1,sk6,sk7),
file(unknown,unknown) ).
tff(f_59,axiom,
! [A,B,C] :
( ~ reorganization_free(A,B,C)
| reorganization_free(A,C,B) ),
file(unknown,unknown) ).
tff(f_125,axiom,
size(sk1,sk5,sk7),
file(unknown,unknown) ).
tff(f_119,axiom,
organization(sk1,sk6),
file(unknown,unknown) ).
tff(f_124,axiom,
size(sk1,sk4,sk6),
file(unknown,unknown) ).
tff(f_126,axiom,
greater(sk5,sk4),
file(unknown,unknown) ).
tff(f_97,axiom,
! [A,B,C,E,D] :
( ~ organization(A,B)
| ~ organization(A,C)
| ~ reorganization_free(A,B,C)
| ~ size(A,D,B)
| ~ size(A,E,C)
| ~ greater(C,B)
| ~ greater(D,E) ),
file(unknown,unknown) ).
tff(f_42,axiom,
! [A,B] :
( ~ organization(A,B)
| time(B) ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [A,B] :
( ~ time(A)
| ~ time(B)
| greater(A,B)
| ( A = B )
| greater(B,A) ),
file(unknown,unknown) ).
tff(f_122,axiom,
complexity(sk1,sk2,sk6),
file(unknown,unknown) ).
tff(f_123,axiom,
complexity(sk1,sk3,sk7),
file(unknown,unknown) ).
tff(f_127,axiom,
greater(sk2,sk3),
file(unknown,unknown) ).
tff(f_118,axiom,
! [A,B,C,E,D] :
( ~ organization(A,B)
| ~ organization(A,C)
| ~ reorganization_free(A,B,C)
| ~ complexity(A,D,B)
| ~ complexity(A,E,C)
| ~ greater(C,B)
| ~ greater(D,E) ),
file(unknown,unknown) ).
tff(f_76,axiom,
! [A,B,C,E,D] :
( ~ organization(A,B)
| ~ organization(A,C)
| ~ size(A,D,B)
| ~ size(A,E,C)
| ( B != C )
| ( D = E ) ),
file(unknown,unknown) ).
tff(c_2,plain,
! [B_2] : ~ greater(B_2,B_2),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_20,plain,
organization(sk1,sk7),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_22,plain,
reorganization_free(sk1,sk6,sk7),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_52,plain,
! [A_32,C_33,B_34] :
( reorganization_free(A_32,C_33,B_34)
| ~ reorganization_free(A_32,B_34,C_33) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_55,plain,
reorganization_free(sk1,sk7,sk6),
inference(resolution,[status(thm)],[c_22,c_52]) ).
tff(c_30,plain,
size(sk1,sk5,sk7),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_18,plain,
organization(sk1,sk6),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_28,plain,
size(sk1,sk4,sk6),
inference(cnfTransformation,[status(thm)],[f_124]) ).
tff(c_32,plain,
greater(sk5,sk4),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_126,plain,
! [C_43,A_44,E_46,B_45,D_47] :
( ~ greater(D_47,E_46)
| ~ greater(C_43,B_45)
| ~ size(A_44,E_46,C_43)
| ~ size(A_44,D_47,B_45)
| ~ reorganization_free(A_44,B_45,C_43)
| ~ organization(A_44,C_43)
| ~ organization(A_44,B_45) ),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_139,plain,
! [C_48,B_49,A_50] :
( ~ greater(C_48,B_49)
| ~ size(A_50,sk4,C_48)
| ~ size(A_50,sk5,B_49)
| ~ reorganization_free(A_50,B_49,C_48)
| ~ organization(A_50,C_48)
| ~ organization(A_50,B_49) ),
inference(resolution,[status(thm)],[c_32,c_126]) ).
tff(c_141,plain,
! [B_49] :
( ~ greater(sk6,B_49)
| ~ size(sk1,sk5,B_49)
| ~ reorganization_free(sk1,B_49,sk6)
| ~ organization(sk1,sk6)
| ~ organization(sk1,B_49) ),
inference(resolution,[status(thm)],[c_28,c_139]) ).
tff(c_145,plain,
! [B_51] :
( ~ greater(sk6,B_51)
| ~ size(sk1,sk5,B_51)
| ~ reorganization_free(sk1,B_51,sk6)
| ~ organization(sk1,B_51) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_141]) ).
tff(c_148,plain,
( ~ greater(sk6,sk7)
| ~ reorganization_free(sk1,sk7,sk6)
| ~ organization(sk1,sk7) ),
inference(resolution,[status(thm)],[c_30,c_145]) ).
tff(c_151,plain,
~ greater(sk6,sk7),
inference(demodulation,[status(thm),theory(equality)],[c_20,c_55,c_148]) ).
tff(c_36,plain,
! [B_28,A_29] :
( time(B_28)
| ~ organization(A_29,B_28) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_43,plain,
time(sk6),
inference(resolution,[status(thm)],[c_18,c_36]) ).
tff(c_44,plain,
time(sk7),
inference(resolution,[status(thm)],[c_20,c_36]) ).
tff(c_8,plain,
! [B_8,A_7] :
( greater(B_8,A_7)
| ( B_8 = A_7 )
| greater(A_7,B_8)
| ~ time(B_8)
| ~ time(A_7) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_24,plain,
complexity(sk1,sk2,sk6),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_26,plain,
complexity(sk1,sk3,sk7),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_34,plain,
greater(sk2,sk3),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_152,plain,
! [E_55,B_56,A_52,C_53,D_54] :
( ~ greater(D_54,E_55)
| ~ greater(C_53,B_56)
| ~ complexity(A_52,E_55,C_53)
| ~ complexity(A_52,D_54,B_56)
| ~ reorganization_free(A_52,B_56,C_53)
| ~ organization(A_52,C_53)
| ~ organization(A_52,B_56) ),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_167,plain,
! [C_57,B_58,A_59] :
( ~ greater(C_57,B_58)
| ~ complexity(A_59,sk3,C_57)
| ~ complexity(A_59,sk2,B_58)
| ~ reorganization_free(A_59,B_58,C_57)
| ~ organization(A_59,C_57)
| ~ organization(A_59,B_58) ),
inference(resolution,[status(thm)],[c_34,c_152]) ).
tff(c_173,plain,
( ~ greater(sk7,sk6)
| ~ complexity(sk1,sk3,sk7)
| ~ complexity(sk1,sk2,sk6)
| ~ organization(sk1,sk7)
| ~ organization(sk1,sk6) ),
inference(resolution,[status(thm)],[c_22,c_167]) ).
tff(c_179,plain,
~ greater(sk7,sk6),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_20,c_24,c_26,c_173]) ).
tff(c_182,plain,
( ( sk7 = sk6 )
| greater(sk6,sk7)
| ~ time(sk7)
| ~ time(sk6) ),
inference(resolution,[status(thm)],[c_8,c_179]) ).
tff(c_188,plain,
( ( sk7 = sk6 )
| greater(sk6,sk7) ),
inference(demodulation,[status(thm),theory(equality)],[c_43,c_44,c_182]) ).
tff(c_189,plain,
sk7 = sk6,
inference(negUnitSimplification,[status(thm)],[c_151,c_188]) ).
tff(c_212,plain,
size(sk1,sk5,sk6),
inference(demodulation,[status(thm),theory(equality)],[c_189,c_30]) ).
tff(c_103,plain,
! [E_37,D_38,A_39,C_40] :
( ( E_37 = D_38 )
| ~ size(A_39,E_37,C_40)
| ~ size(A_39,D_38,C_40)
| ~ organization(A_39,C_40) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_107,plain,
! [D_38] :
( ( sk4 = D_38 )
| ~ size(sk1,D_38,sk6)
| ~ organization(sk1,sk6) ),
inference(resolution,[status(thm)],[c_28,c_103]) ).
tff(c_113,plain,
! [D_38] :
( ( sk4 = D_38 )
| ~ size(sk1,D_38,sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_107]) ).
tff(c_251,plain,
sk5 = sk4,
inference(resolution,[status(thm)],[c_212,c_113]) ).
tff(c_261,plain,
greater(sk4,sk4),
inference(demodulation,[status(thm),theory(equality)],[c_251,c_32]) ).
tff(c_264,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2,c_261]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT014-1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04 % 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.11/0.36 % Computer : n009.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 7 11:53:22 UTC 2026
% 0.11/0.37 % CPUTime :
% 3.93/2.47 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.93/2.48
% 3.93/2.48 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------