%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : MGT013-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n013.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 : Thu Sep 24 01:25:40 PM UTC 2026
% Result : Unsatisfiable 0.01s 0.59s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT013-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.01/0.56 % Computer : n013.cluster.edu
% 0.01/0.56 % Model : x86_64 x86_64
% 0.01/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.01/0.56 % Memory : 8046.5625MB
% 0.01/0.56 % OS : Linux 6.8.0-71-generic
% 0.01/0.56 % CPULimit : 300
% 0.01/0.56 % WCLimit : 300
% 0.01/0.56 % DateTime : Mon Sep 21 01:20:37 UTC 2026
% 0.01/0.57 % CPUTime :
% 0.01/0.58 % Drodi V4.1.1
% 0.01/0.59 % Refutation found
% 0.01/0.59 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.01/0.59 % SZS output start CNFRefutation for theBenchmark
% 0.01/0.59 fof(f1,axiom,(
% 0.01/0.59 (![A,B]: (( ~ greater(A,B)| A != B ) ))),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f3,axiom,(
% 0.01/0.59 (![A,B]: (( ~ organization(A,B)| time(B) ) ))),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f4,axiom,(
% 0.01/0.59 (![A,B]: (( ~ time(A)| ~ time(B)| greater(A,B)| A = B| greater(B,A) ) ))),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f5,axiom,(
% 0.01/0.59 (![A,B,C]: (( ~ reorganization_free(A,B,C)| reorganization_free(A,C,B) ) ))),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f6,axiom,(
% 0.01/0.59 (![A,B,C,D,E]: (( ~ organization(A,B)| ~ organization(A,C)| ~ complexity(A,D,B)| ~ complexity(A,E,C)| B != C| D = E ) ))),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f7,hypothesis,(
% 0.01/0.59 (![A,B,C,D,E]: (( ~ 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) ) ))),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f8,hypothesis,(
% 0.01/0.59 (![A,B,C,D,E]: (( ~ 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) ) ))),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f9,negated_conjecture,(
% 0.01/0.59 organization(sk1,sk6) ),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f10,negated_conjecture,(
% 0.01/0.59 organization(sk1,sk7) ),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f11,negated_conjecture,(
% 0.01/0.59 reorganization_free(sk1,sk6,sk7) ),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f12,negated_conjecture,(
% 0.01/0.59 complexity(sk1,sk2,sk6) ),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f13,negated_conjecture,(
% 0.01/0.59 complexity(sk1,sk3,sk7) ),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f14,negated_conjecture,(
% 0.01/0.59 size(sk1,sk4,sk6) ),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f15,negated_conjecture,(
% 0.01/0.59 size(sk1,sk5,sk7) ),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f16,negated_conjecture,(
% 0.01/0.59 greater(sk3,sk2) ),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f17,negated_conjecture,(
% 0.01/0.59 greater(sk4,sk5) ),
% 0.01/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.01/0.59 fof(f18,plain,(
% 0.01/0.59 ![X0,X1]: (~greater(X0,X1)|~X0=X1)),
% 0.01/0.59 inference(cnf_transformation,[status(thm)],[f1])).
% 0.01/0.59 fof(f20,plain,(
% 0.01/0.59 ![B]: ((![A]: ~organization(A,B))|time(B))),
% 0.01/0.59 inference(miniscoping,[status(thm)],[f3])).
% 0.01/0.59 fof(f21,plain,(
% 0.01/0.59 ![X0,X1]: (~organization(X0,X1)|time(X1))),
% 0.01/0.59 inference(cnf_transformation,[status(thm)],[f20])).
% 0.01/0.59 fof(f22,plain,(
% 0.01/0.59 ![X0,X1]: (~time(X0)|~time(X1)|greater(X0,X1)|X0=X1|greater(X1,X0))),
% 0.01/0.59 inference(cnf_transformation,[status(thm)],[f4])).
% 0.01/0.59 fof(f23,plain,(
% 0.01/0.59 ![X0,X1,X2]: (~reorganization_free(X0,X1,X2)|reorganization_free(X0,X2,X1))),
% 0.01/0.59 inference(cnf_transformation,[status(thm)],[f5])).
% 0.01/0.60 fof(f24,plain,(
% 0.01/0.60 ![D,E]: ((![B,C]: ((![A]: (((~organization(A,B)|~organization(A,C))|~complexity(A,D,B))|~complexity(A,E,C)))|~B=C))|D=E)),
% 0.01/0.60 inference(miniscoping,[status(thm)],[f6])).
% 0.01/0.60 fof(f25,plain,(
% 0.01/0.60 ![X0,X1,X2,X3,X4]: (~organization(X0,X1)|~organization(X0,X2)|~complexity(X0,X3,X1)|~complexity(X0,X4,X2)|~X1=X2|X3=X4)),
% 0.01/0.60 inference(cnf_transformation,[status(thm)],[f24])).
% 0.01/0.60 fof(f26,plain,(
% 0.01/0.60 ![D,E]: ((![B,C]: ((![A]: ((((~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))),
% 0.01/0.60 inference(miniscoping,[status(thm)],[f7])).
% 0.01/0.60 fof(f27,plain,(
% 0.01/0.60 ![X0,X1,X2,X3,X4]: (~organization(X0,X1)|~organization(X0,X2)|~reorganization_free(X0,X1,X2)|~size(X0,X3,X1)|~size(X0,X4,X2)|~greater(X2,X1)|~greater(X3,X4))),
% 0.01/0.60 inference(cnf_transformation,[status(thm)],[f26])).
% 0.01/0.60 fof(f28,plain,(
% 0.01/0.60 ![D,E]: ((![B,C]: ((![A]: ((((~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))),
% 0.01/0.60 inference(miniscoping,[status(thm)],[f8])).
% 0.01/0.60 fof(f29,plain,(
% 0.01/0.60 ![X0,X1,X2,X3,X4]: (~organization(X0,X1)|~organization(X0,X2)|~reorganization_free(X0,X1,X2)|~complexity(X0,X3,X1)|~complexity(X0,X4,X2)|~greater(X2,X1)|~greater(X3,X4))),
% 0.01/0.60 inference(cnf_transformation,[status(thm)],[f28])).
% 0.01/0.60 fof(f30,plain,(
% 0.01/0.60 organization(sk1,sk6)),
% 0.01/0.60 inference(cnf_transformation,[status(thm)],[f9])).
% 0.01/0.60 fof(f31,plain,(
% 0.01/0.60 organization(sk1,sk7)),
% 0.01/0.60 inference(cnf_transformation,[status(thm)],[f10])).
% 0.01/0.60 fof(f32,plain,(
% 0.01/0.60 reorganization_free(sk1,sk6,sk7)),
% 0.01/0.60 inference(cnf_transformation,[status(thm)],[f11])).
% 0.01/0.60 fof(f33,plain,(
% 0.01/0.60 complexity(sk1,sk2,sk6)),
% 0.01/0.60 inference(cnf_transformation,[status(thm)],[f12])).
% 0.01/0.60 fof(f34,plain,(
% 0.01/0.60 complexity(sk1,sk3,sk7)),
% 0.01/0.60 inference(cnf_transformation,[status(thm)],[f13])).
% 0.01/0.60 fof(f35,plain,(
% 0.01/0.60 size(sk1,sk4,sk6)),
% 0.01/0.60 inference(cnf_transformation,[status(thm)],[f14])).
% 0.01/0.60 fof(f36,plain,(
% 0.01/0.60 size(sk1,sk5,sk7)),
% 0.01/0.60 inference(cnf_transformation,[status(thm)],[f15])).
% 0.01/0.60 fof(f37,plain,(
% 0.01/0.60 greater(sk3,sk2)),
% 0.01/0.60 inference(cnf_transformation,[status(thm)],[f16])).
% 0.01/0.60 fof(f38,plain,(
% 0.01/0.60 greater(sk4,sk5)),
% 0.01/0.60 inference(cnf_transformation,[status(thm)],[f17])).
% 0.01/0.60 fof(f39,plain,(
% 0.01/0.60 ![X0]: (~greater(X0,X0))),
% 0.01/0.60 inference(destructive_equality_resolution,[status(thm)],[f18])).
% 0.01/0.60 fof(f40,plain,(
% 0.01/0.60 ![X0,X2,X3,X4]: (~organization(X0,X2)|~organization(X0,X2)|~complexity(X0,X3,X2)|~complexity(X0,X4,X2)|X3=X4)),
% 0.01/0.60 inference(destructive_equality_resolution,[status(thm)],[f25])).
% 0.01/0.60 fof(f41,plain,(
% 0.01/0.60 ![X0,X1,X2,X3]: (~organization(X0,X1)|~complexity(X0,X2,X1)|~complexity(X0,X3,X1)|X2=X3)),
% 0.01/0.60 inference(duplicate_literals_removal,[status(thm)],[f40])).
% 0.01/0.60 fof(f43,plain,(
% 0.01/0.60 reorganization_free(sk1,sk7,sk6)),
% 0.01/0.60 inference(resolution,[status(thm)],[f23,f32])).
% 0.01/0.60 fof(f45,plain,(
% 0.01/0.60 time(sk7)),
% 0.01/0.60 inference(resolution,[status(thm)],[f21,f31])).
% 0.01/0.60 fof(f46,plain,(
% 0.01/0.60 time(sk6)),
% 0.01/0.60 inference(resolution,[status(thm)],[f21,f30])).
% 0.01/0.60 fof(f48,plain,(
% 0.01/0.60 ![X0,X1]: (~organization(sk1,X0)|~organization(sk1,sk6)|~reorganization_free(sk1,X0,sk6)|~complexity(sk1,X1,X0)|~greater(sk6,X0)|~greater(X1,sk2))),
% 0.01/0.60 inference(resolution,[status(thm)],[f33,f29])).
% 0.01/0.60 fof(f51,plain,(
% 0.01/0.60 ![X0]: (~organization(sk1,sk6)|~complexity(sk1,X0,sk6)|X0=sk2)),
% 0.01/0.60 inference(resolution,[status(thm)],[f33,f41])).
% 0.01/0.60 fof(f53,plain,(
% 0.01/0.60 ![X0,X1]: (~organization(sk1,X0)|~reorganization_free(sk1,X0,sk6)|~complexity(sk1,X1,X0)|~greater(sk6,X0)|~greater(X1,sk2))),
% 0.01/0.60 inference(forward_subsumption_resolution,[status(thm)],[f48,f30])).
% 0.01/0.60 fof(f56,plain,(
% 0.01/0.60 ![X0]: (~complexity(sk1,X0,sk6)|X0=sk2)),
% 0.01/0.60 inference(forward_subsumption_resolution,[status(thm)],[f51,f30])).
% 0.01/0.60 fof(f70,plain,(
% 0.01/0.60 ![X0,X1]: (~organization(sk1,sk6)|~organization(sk1,X0)|~reorganization_free(sk1,sk6,X0)|~size(sk1,X1,X0)|~greater(X0,sk6)|~greater(sk4,X1))),
% 0.01/0.60 inference(resolution,[status(thm)],[f35,f27])).
% 0.01/0.60 fof(f74,plain,(
% 0.01/0.60 ![X0,X1]: (~organization(sk1,X0)|~reorganization_free(sk1,sk6,X0)|~size(sk1,X1,X0)|~greater(X0,sk6)|~greater(sk4,X1))),
% 0.01/0.60 inference(forward_subsumption_resolution,[status(thm)],[f70,f30])).
% 0.01/0.60 fof(f75,plain,(
% 0.01/0.60 ![X0]: (~time(X0)|greater(sk7,X0)|sk7=X0|greater(X0,sk7))),
% 0.01/0.60 inference(resolution,[status(thm)],[f45,f22])).
% 0.01/0.60 fof(f87,plain,(
% 0.01/0.60 ~organization(sk1,sk7)|~reorganization_free(sk1,sk7,sk6)|~greater(sk6,sk7)|~greater(sk3,sk2)),
% 0.01/0.60 inference(resolution,[status(thm)],[f53,f34])).
% 0.01/0.60 fof(f89,plain,(
% 0.01/0.60 ~reorganization_free(sk1,sk7,sk6)|~greater(sk6,sk7)|~greater(sk3,sk2)),
% 0.01/0.60 inference(forward_subsumption_resolution,[status(thm)],[f87,f31])).
% 0.01/0.60 fof(f98,plain,(
% 0.01/0.60 greater(sk7,sk6)|sk7=sk6|greater(sk6,sk7)),
% 0.01/0.60 inference(resolution,[status(thm)],[f75,f46])).
% 0.01/0.60 fof(f104,plain,(
% 0.01/0.60 ~organization(sk1,sk7)|~reorganization_free(sk1,sk6,sk7)|~greater(sk7,sk6)|~greater(sk4,sk5)),
% 0.01/0.60 inference(resolution,[status(thm)],[f74,f36])).
% 0.01/0.60 fof(f106,plain,(
% 0.01/0.60 ~reorganization_free(sk1,sk6,sk7)|~greater(sk7,sk6)|~greater(sk4,sk5)),
% 0.01/0.60 inference(forward_subsumption_resolution,[status(thm)],[f104,f31])).
% 0.01/0.60 fof(f112,plain,(
% 0.01/0.60 ~greater(sk6,sk7)|~greater(sk3,sk2)),
% 0.01/0.60 inference(forward_subsumption_resolution,[status(thm)],[f89,f43])).
% 0.01/0.60 fof(f113,plain,(
% 0.01/0.60 ~greater(sk6,sk7)),
% 0.01/0.60 inference(resolution,[status(thm)],[f112,f37])).
% 0.01/0.60 fof(f114,plain,(
% 0.01/0.60 ~greater(sk7,sk6)|~greater(sk4,sk5)),
% 0.01/0.60 inference(forward_subsumption_resolution,[status(thm)],[f106,f32])).
% 0.01/0.60 fof(f115,plain,(
% 0.01/0.60 ~greater(sk7,sk6)),
% 0.01/0.60 inference(resolution,[status(thm)],[f114,f38])).
% 0.01/0.60 fof(f116,plain,(
% 0.01/0.60 sk7=sk6|greater(sk6,sk7)),
% 0.01/0.60 inference(forward_subsumption_resolution,[status(thm)],[f98,f115])).
% 0.01/0.60 fof(f117,plain,(
% 0.01/0.60 sk7=sk6),
% 0.01/0.60 inference(resolution,[status(thm)],[f116,f113])).
% 0.01/0.60 fof(f131,plain,(
% 0.01/0.60 complexity(sk1,sk3,sk6)),
% 0.01/0.60 inference(backward_demodulation,[status(thm)],[f117,f34])).
% 0.01/0.60 fof(f150,plain,(
% 0.01/0.60 sk3=sk2),
% 0.01/0.60 inference(resolution,[status(thm)],[f131,f56])).
% 0.01/0.60 fof(f165,plain,(
% 0.01/0.60 greater(sk2,sk2)),
% 0.01/0.60 inference(backward_demodulation,[status(thm)],[f150,f37])).
% 0.01/0.60 fof(f166,plain,(
% 0.01/0.60 $false),
% 0.01/0.60 inference(forward_subsumption_resolution,[status(thm)],[f165,f39])).
% 0.01/0.60 % SZS output end CNFRefutation for theBenchmark.p
% 0.01/0.62 % Elapsed time: 0.047335 seconds
% 0.01/0.62 % CPU time: 0.134424 seconds
% 0.01/0.62 % Total memory used: 70.351 MB
% 0.01/0.62 % Net memory used: 69.999 MB
%------------------------------------------------------------------------------