%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT013-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 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 : Thu Sep 24 01:25:15 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.40s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 64 ( 29 unt; 0 def)
% Number of atoms : 176 ( 19 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 236 ( 124 ~; 112 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% 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 : 91 ( 91 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B] :
( A != B
| ~ greater(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] :
( time(B)
| ~ organization(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B] :
( greater(B,A)
| A = B
| greater(A,B)
| ~ time(B)
| ~ time(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B,C] :
( reorganization_free(A,C,B)
| ~ reorganization_free(A,B,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [A,B,C,D,E] :
( D = E
| B != C
| ~ complexity(A,E,C)
| ~ complexity(A,D,B)
| ~ organization(A,C)
| ~ organization(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,hypothesis,
! [A,B,C,D,E] :
( ~ greater(D,E)
| ~ greater(C,B)
| ~ size(A,E,C)
| ~ size(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,hypothesis,
! [A,B,C,D,E] :
( ~ greater(D,E)
| ~ greater(C,B)
| ~ complexity(A,E,C)
| ~ complexity(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
organization(sk1,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,negated_conjecture,
organization(sk1,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,negated_conjecture,
complexity(sk1,sk2,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f13,negated_conjecture,
complexity(sk1,sk3,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,negated_conjecture,
size(sk1,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,negated_conjecture,
size(sk1,sk5,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,negated_conjecture,
greater(sk3,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,negated_conjecture,
greater(sk4,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,plain,
! [X0,X1] :
( X0 != X1
| ~ greater(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f20,plain,
! [B] :
( time(B)
| ! [A] : ~ organization(A,B) ),
inference(miniscoping,[status(thm)],[f3]) ).
fof(f21,plain,
! [X0,X1] :
( time(X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( greater(X1,X0)
| X0 = X1
| greater(X0,X1)
| ~ time(X1)
| ~ time(X0) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f23,plain,
! [X0,X1,X2] :
( reorganization_free(X0,X2,X1)
| ~ reorganization_free(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f24,plain,
! [D,E] :
( D = E
| ! [B,C] :
( B != C
| ! [A] :
( ~ complexity(A,E,C)
| ~ complexity(A,D,B)
| ~ organization(A,C)
| ~ organization(A,B) ) ) ),
inference(miniscoping,[status(thm)],[f6]) ).
fof(f25,plain,
! [X0,X1,X2,X3,X4] :
( X3 = X4
| X1 != X2
| ~ complexity(X0,X4,X2)
| ~ complexity(X0,X3,X1)
| ~ organization(X0,X2)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f26,plain,
! [D,E] :
( ~ greater(D,E)
| ! [B,C] :
( ~ greater(C,B)
| ! [A] :
( ~ size(A,E,C)
| ~ size(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ) ) ),
inference(miniscoping,[status(thm)],[f7]) ).
fof(f27,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X3,X4)
| ~ greater(X2,X1)
| ~ size(X0,X4,X2)
| ~ size(X0,X3,X1)
| ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f26]) ).
fof(f28,plain,
! [D,E] :
( ~ greater(D,E)
| ! [B,C] :
( ~ greater(C,B)
| ! [A] :
( ~ complexity(A,E,C)
| ~ complexity(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ) ) ),
inference(miniscoping,[status(thm)],[f8]) ).
fof(f29,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X3,X4)
| ~ greater(X2,X1)
| ~ complexity(X0,X4,X2)
| ~ complexity(X0,X3,X1)
| ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f28]) ).
fof(f30,plain,
organization(sk1,sk6),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f31,plain,
organization(sk1,sk7),
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f32,plain,
reorganization_free(sk1,sk6,sk7),
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f33,plain,
complexity(sk1,sk2,sk6),
inference(cnf_transformation,[status(thm)],[f12]) ).
fof(f34,plain,
complexity(sk1,sk3,sk7),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f35,plain,
size(sk1,sk4,sk6),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f36,plain,
size(sk1,sk5,sk7),
inference(cnf_transformation,[status(thm)],[f15]) ).
fof(f37,plain,
greater(sk3,sk2),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f38,plain,
greater(sk4,sk5),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f39,plain,
! [X0] : ~ greater(X0,X0),
inference(destructive_equality_resolution,[status(thm)],[f18]) ).
fof(f40,plain,
! [X0,X2,X3,X4] :
( X3 = X4
| ~ complexity(X0,X4,X2)
| ~ complexity(X0,X3,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X2) ),
inference(destructive_equality_resolution,[status(thm)],[f25]) ).
fof(f41,plain,
! [X0,X1,X2,X3] :
( X2 = X3
| ~ complexity(X0,X3,X1)
| ~ complexity(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(duplicate_literals_removal,[status(thm)],[f40]) ).
fof(f44,plain,
reorganization_free(sk1,sk7,sk6),
inference(resolution,[status(thm)],[f23,f32]) ).
fof(f46,plain,
! [X0] :
( sk3 = X0
| ~ complexity(sk1,X0,sk7)
| ~ organization(sk1,sk7) ),
inference(resolution,[status(thm)],[f41,f34]) ).
fof(f48,plain,
! [X0] :
( sk3 = X0
| ~ complexity(sk1,X0,sk7) ),
inference(forward_subsumption_resolution,[status(thm)],[f46,f31]) ).
fof(f53,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(sk7,sk6)
| ~ size(sk1,X1,sk7)
| ~ size(sk1,X0,sk6)
| ~ organization(sk1,sk7)
| ~ organization(sk1,sk6) ),
inference(resolution,[status(thm)],[f27,f32]) ).
fof(f55,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(sk7,sk6)
| ~ size(sk1,X1,sk7)
| ~ size(sk1,X0,sk6)
| ~ organization(sk1,sk7) ),
inference(forward_subsumption_resolution,[status(thm)],[f53,f30]) ).
fof(f56,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(sk6,sk7)
| ~ complexity(sk1,X1,sk6)
| ~ complexity(sk1,X0,sk7)
| ~ organization(sk1,sk6)
| ~ organization(sk1,sk7) ),
inference(resolution,[status(thm)],[f29,f44]) ).
fof(f58,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(sk6,sk7)
| ~ complexity(sk1,X1,sk6)
| ~ complexity(sk1,X0,sk7)
| ~ organization(sk1,sk6) ),
inference(forward_subsumption_resolution,[status(thm)],[f56,f31]) ).
fof(f60,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(sk7,sk6)
| ~ size(sk1,X1,sk7)
| ~ size(sk1,X0,sk6) ),
inference(forward_subsumption_resolution,[status(thm)],[f55,f31]) ).
fof(f61,plain,
! [X0] :
( ~ greater(sk4,X0)
| ~ greater(sk7,sk6)
| ~ size(sk1,X0,sk7) ),
inference(resolution,[status(thm)],[f60,f35]) ).
fof(f62,plain,
time(sk7),
inference(resolution,[status(thm)],[f21,f31]) ).
fof(f63,plain,
time(sk6),
inference(resolution,[status(thm)],[f21,f30]) ).
fof(f64,plain,
! [X0] :
( greater(X0,sk6)
| sk6 = X0
| greater(sk6,X0)
| ~ time(X0) ),
inference(resolution,[status(thm)],[f22,f63]) ).
fof(f67,plain,
( greater(sk7,sk6)
| sk6 = sk7
| greater(sk6,sk7) ),
inference(resolution,[status(thm)],[f64,f62]) ).
fof(f71,plain,
( ~ greater(sk4,sk5)
| ~ greater(sk7,sk6) ),
inference(resolution,[status(thm)],[f61,f36]) ).
fof(f72,plain,
~ greater(sk7,sk6),
inference(forward_subsumption_resolution,[status(thm)],[f71,f38]) ).
fof(f73,plain,
( sk6 = sk7
| greater(sk6,sk7) ),
inference(backward_subsumption_resolution,[status(thm)],[f67,f72]) ).
fof(f78,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(sk6,sk7)
| ~ complexity(sk1,X1,sk6)
| ~ complexity(sk1,X0,sk7) ),
inference(forward_subsumption_resolution,[status(thm)],[f58,f30]) ).
fof(f79,plain,
! [X0] :
( ~ greater(sk3,X0)
| ~ greater(sk6,sk7)
| ~ complexity(sk1,X0,sk6) ),
inference(resolution,[status(thm)],[f78,f34]) ).
fof(f80,plain,
( ~ greater(sk3,sk2)
| ~ greater(sk6,sk7) ),
inference(resolution,[status(thm)],[f79,f33]) ).
fof(f81,plain,
~ greater(sk6,sk7),
inference(forward_subsumption_resolution,[status(thm)],[f80,f37]) ).
fof(f82,plain,
sk6 = sk7,
inference(backward_subsumption_resolution,[status(thm)],[f73,f81]) ).
fof(f90,plain,
complexity(sk1,sk2,sk7),
inference(backward_demodulation,[status(thm)],[f82,f33]) ).
fof(f100,plain,
sk3 = sk2,
inference(resolution,[status(thm)],[f90,f48]) ).
fof(f105,plain,
greater(sk3,sk3),
inference(backward_demodulation,[status(thm)],[f100,f37]) ).
fof(f106,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f105,f39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT013-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 01:19:06 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Drodi V4.1.1
% 0.09/0.40 % Refutation found
% 0.09/0.40 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.42 % Elapsed time: 0.054657 seconds
% 0.09/0.42 % CPU time: 0.151668 seconds
% 0.09/0.42 % Total memory used: 80.583 MB
% 0.09/0.42 % Net memory used: 80.202 MB
%------------------------------------------------------------------------------