%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT014+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.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 : Theorem 0.11s 0.38s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 67 ( 20 unt; 0 def)
% Number of atoms : 243 ( 23 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 306 ( 130 ~; 114 |; 54 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 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 : 143 ( 129 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] :
~ ( X = Y
& greater(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,T] :
( organization(X,T)
=> time(T) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [T1,T2] :
( ( time(T2)
& time(T1) )
=> ( greater(T2,T1)
| T1 = T2
| greater(T1,T2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X,T1,T2] :
( reorganization_free(X,T1,T2)
=> reorganization_free(X,T2,T1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X,S1,S2,T1,T2] :
( ( T1 = T2
& size(X,S2,T2)
& size(X,S1,T1)
& organization(X,T2)
& organization(X,T1) )
=> S1 = S2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,hypothesis,
! [X,S1,S2,T1,T2] :
( ( greater(T2,T1)
& size(X,S2,T2)
& size(X,S1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(S1,S2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,hypothesis,
! [X,C1,C2,T1,T2] :
( ( greater(T2,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(C1,C2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,conjecture,
! [X,C1,C2,S1,S2,T1,T2] :
( ( greater(S2,S1)
& size(X,S2,T2)
& size(X,S1,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(C1,C2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,negated_conjecture,
~ ! [X,C1,C2,S1,S2,T1,T2] :
( ( greater(S2,S1)
& size(X,S2,T2)
& size(X,S1,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(C1,C2) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
! [X,Y] :
( X != Y
| ~ greater(X,Y) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f12,plain,
! [X0,X1] :
( X0 != X1
| ~ greater(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f15,plain,
! [X,T] :
( time(T)
| ~ organization(X,T) ),
inference(pre_NNF_transformation,[status(thm)],[f3]) ).
fof(f16,plain,
! [T] :
( time(T)
| ! [X] : ~ organization(X,T) ),
inference(miniscoping,[status(thm)],[f15]) ).
fof(f17,plain,
! [X0,X1] :
( time(X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f18,plain,
! [T1,T2] :
( greater(T2,T1)
| T1 = T2
| greater(T1,T2)
| ~ time(T2)
| ~ time(T1) ),
inference(pre_NNF_transformation,[status(thm)],[f4]) ).
fof(f19,plain,
! [X0,X1] :
( greater(X1,X0)
| X0 = X1
| greater(X0,X1)
| ~ time(X1)
| ~ time(X0) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f20,plain,
! [X,T1,T2] :
( reorganization_free(X,T2,T1)
| ~ reorganization_free(X,T1,T2) ),
inference(pre_NNF_transformation,[status(thm)],[f5]) ).
fof(f21,plain,
! [X0,X1,X2] :
( reorganization_free(X0,X2,X1)
| ~ reorganization_free(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f20]) ).
fof(f22,plain,
! [X,S1,S2,T1,T2] :
( S1 = S2
| T1 != T2
| ~ size(X,S2,T2)
| ~ size(X,S1,T1)
| ~ organization(X,T2)
| ~ organization(X,T1) ),
inference(pre_NNF_transformation,[status(thm)],[f6]) ).
fof(f23,plain,
! [S1,S2] :
( S1 = S2
| ! [T1,T2] :
( T1 != T2
| ! [X] :
( ~ size(X,S2,T2)
| ~ size(X,S1,T1)
| ~ organization(X,T2)
| ~ organization(X,T1) ) ) ),
inference(miniscoping,[status(thm)],[f22]) ).
fof(f24,plain,
! [X0,X1,X2,X3,X4] :
( X3 = X4
| X1 != X2
| ~ size(X0,X4,X2)
| ~ size(X0,X3,X1)
| ~ organization(X0,X2)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f23]) ).
fof(f25,plain,
! [X,S1,S2,T1,T2] :
( ~ greater(S1,S2)
| ~ greater(T2,T1)
| ~ size(X,S2,T2)
| ~ size(X,S1,T1)
| ~ reorganization_free(X,T1,T2)
| ~ organization(X,T2)
| ~ organization(X,T1) ),
inference(pre_NNF_transformation,[status(thm)],[f7]) ).
fof(f26,plain,
! [S1,S2] :
( ~ greater(S1,S2)
| ! [T1,T2] :
( ~ greater(T2,T1)
| ! [X] :
( ~ size(X,S2,T2)
| ~ size(X,S1,T1)
| ~ reorganization_free(X,T1,T2)
| ~ organization(X,T2)
| ~ organization(X,T1) ) ) ),
inference(miniscoping,[status(thm)],[f25]) ).
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,
! [X,C1,C2,T1,T2] :
( ~ greater(C1,C2)
| ~ greater(T2,T1)
| ~ complexity(X,C2,T2)
| ~ complexity(X,C1,T1)
| ~ reorganization_free(X,T1,T2)
| ~ organization(X,T2)
| ~ organization(X,T1) ),
inference(pre_NNF_transformation,[status(thm)],[f8]) ).
fof(f29,plain,
! [C1,C2] :
( ~ greater(C1,C2)
| ! [T1,T2] :
( ~ greater(T2,T1)
| ! [X] :
( ~ complexity(X,C2,T2)
| ~ complexity(X,C1,T1)
| ~ reorganization_free(X,T1,T2)
| ~ organization(X,T2)
| ~ organization(X,T1) ) ) ),
inference(miniscoping,[status(thm)],[f28]) ).
fof(f30,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)],[f29]) ).
fof(f31,plain,
? [X,C1,C2,S1,S2,T1,T2] :
( greater(C1,C2)
& greater(S2,S1)
& size(X,S2,T2)
& size(X,S1,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) ),
inference(pre_NNF_transformation,[status(thm)],[f10]) ).
fof(f32,plain,
? [C1,C2] :
( greater(C1,C2)
& ? [S1,S2] :
( greater(S2,S1)
& ? [X,T2] :
( size(X,S2,T2)
& ? [T1] :
( size(X,S1,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) ) ) ) ),
inference(miniscoping,[status(thm)],[f31]) ).
fof(f33,plain,
( greater(sK0_skl,sK1_skl)
& greater(sK3_skl,sK2_skl)
& size(sK4_skl,sK3_skl,sK5_skl)
& size(sK4_skl,sK2_skl,sK6_skl)
& complexity(sK4_skl,sK1_skl,sK5_skl)
& complexity(sK4_skl,sK0_skl,sK6_skl)
& reorganization_free(sK4_skl,sK6_skl,sK5_skl)
& organization(sK4_skl,sK5_skl)
& organization(sK4_skl,sK6_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl,sK3_skl,sK4_skl,sK5_skl,sK6_skl]),skolemize(C1,sK0_skl),skolemize(C2,sK1_skl),skolemize(S1,sK2_skl),skolemize(S2,sK3_skl),skolemize(X,sK4_skl),skolemize(T2,sK5_skl),skolemize(T1,sK6_skl)],[f32]) ).
fof(f34,plain,
organization(sK4_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f35,plain,
organization(sK4_skl,sK5_skl),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f36,plain,
reorganization_free(sK4_skl,sK6_skl,sK5_skl),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f37,plain,
complexity(sK4_skl,sK0_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f38,plain,
complexity(sK4_skl,sK1_skl,sK5_skl),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f39,plain,
size(sK4_skl,sK2_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f40,plain,
size(sK4_skl,sK3_skl,sK5_skl),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f41,plain,
greater(sK3_skl,sK2_skl),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f42,plain,
greater(sK0_skl,sK1_skl),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f43,plain,
! [X0] : ~ greater(X0,X0),
inference(destructive_equality_resolution,[status(thm)],[f12]) ).
fof(f44,plain,
! [X0,X2,X3,X4] :
( X3 = X4
| ~ size(X0,X4,X2)
| ~ size(X0,X3,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X2) ),
inference(destructive_equality_resolution,[status(thm)],[f24]) ).
fof(f45,plain,
! [X0,X1,X2,X3] :
( X2 = X3
| ~ size(X0,X3,X1)
| ~ size(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(duplicate_literals_removal,[status(thm)],[f44]) ).
fof(f48,plain,
reorganization_free(sK4_skl,sK5_skl,sK6_skl),
inference(resolution,[status(thm)],[f21,f36]) ).
fof(f51,plain,
! [X0] :
( sK2_skl = X0
| ~ size(sK4_skl,X0,sK6_skl)
| ~ organization(sK4_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f45,f39]) ).
fof(f53,plain,
! [X0] :
( sK2_skl = X0
| ~ size(sK4_skl,X0,sK6_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f51,f34]) ).
fof(f56,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(sK6_skl,sK5_skl)
| ~ size(sK4_skl,X1,sK6_skl)
| ~ size(sK4_skl,X0,sK5_skl)
| ~ organization(sK4_skl,sK6_skl)
| ~ organization(sK4_skl,sK5_skl) ),
inference(resolution,[status(thm)],[f27,f48]) ).
fof(f58,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(sK6_skl,sK5_skl)
| ~ size(sK4_skl,X1,sK6_skl)
| ~ size(sK4_skl,X0,sK5_skl)
| ~ organization(sK4_skl,sK6_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f56,f35]) ).
fof(f61,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(sK5_skl,sK6_skl)
| ~ complexity(sK4_skl,X1,sK5_skl)
| ~ complexity(sK4_skl,X0,sK6_skl)
| ~ organization(sK4_skl,sK5_skl)
| ~ organization(sK4_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f30,f36]) ).
fof(f63,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(sK5_skl,sK6_skl)
| ~ complexity(sK4_skl,X1,sK5_skl)
| ~ complexity(sK4_skl,X0,sK6_skl)
| ~ organization(sK4_skl,sK5_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f61,f34]) ).
fof(f66,plain,
time(sK5_skl),
inference(resolution,[status(thm)],[f17,f35]) ).
fof(f67,plain,
time(sK6_skl),
inference(resolution,[status(thm)],[f17,f34]) ).
fof(f68,plain,
! [X0] :
( greater(X0,sK6_skl)
| sK6_skl = X0
| greater(sK6_skl,X0)
| ~ time(X0) ),
inference(resolution,[status(thm)],[f19,f67]) ).
fof(f71,plain,
( greater(sK5_skl,sK6_skl)
| sK6_skl = sK5_skl
| greater(sK6_skl,sK5_skl) ),
inference(resolution,[status(thm)],[f68,f66]) ).
fof(f76,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(sK6_skl,sK5_skl)
| ~ size(sK4_skl,X1,sK6_skl)
| ~ size(sK4_skl,X0,sK5_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f58,f34]) ).
fof(f77,plain,
! [X0] :
( ~ greater(sK3_skl,X0)
| ~ greater(sK6_skl,sK5_skl)
| ~ size(sK4_skl,X0,sK6_skl) ),
inference(resolution,[status(thm)],[f76,f40]) ).
fof(f78,plain,
( ~ greater(sK3_skl,sK2_skl)
| ~ greater(sK6_skl,sK5_skl) ),
inference(resolution,[status(thm)],[f77,f39]) ).
fof(f79,plain,
~ greater(sK6_skl,sK5_skl),
inference(forward_subsumption_resolution,[status(thm)],[f78,f41]) ).
fof(f80,plain,
( greater(sK5_skl,sK6_skl)
| sK6_skl = sK5_skl ),
inference(backward_subsumption_resolution,[status(thm)],[f71,f79]) ).
fof(f82,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(sK5_skl,sK6_skl)
| ~ complexity(sK4_skl,X1,sK5_skl)
| ~ complexity(sK4_skl,X0,sK6_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f63,f35]) ).
fof(f83,plain,
! [X0] :
( ~ greater(sK0_skl,X0)
| ~ greater(sK5_skl,sK6_skl)
| ~ complexity(sK4_skl,X0,sK5_skl) ),
inference(resolution,[status(thm)],[f82,f37]) ).
fof(f84,plain,
( ~ greater(sK0_skl,sK1_skl)
| ~ greater(sK5_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f83,f38]) ).
fof(f85,plain,
~ greater(sK5_skl,sK6_skl),
inference(forward_subsumption_resolution,[status(thm)],[f84,f42]) ).
fof(f86,plain,
sK6_skl = sK5_skl,
inference(backward_subsumption_resolution,[status(thm)],[f80,f85]) ).
fof(f93,plain,
size(sK4_skl,sK3_skl,sK6_skl),
inference(backward_demodulation,[status(thm)],[f86,f40]) ).
fof(f99,plain,
sK2_skl = sK3_skl,
inference(resolution,[status(thm)],[f93,f53]) ).
fof(f110,plain,
greater(sK3_skl,sK3_skl),
inference(backward_demodulation,[status(thm)],[f99,f41]) ).
fof(f111,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f110,f43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT014+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n005.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 01:20:50 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.11/0.36 % Drodi V4.1.1
% 0.11/0.38 % Refutation found
% 0.11/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.41 % Elapsed time: 0.051979 seconds
% 0.11/0.41 % CPU time: 0.154730 seconds
% 0.11/0.41 % Total memory used: 80.710 MB
% 0.11/0.41 % Net memory used: 80.311 MB
%------------------------------------------------------------------------------