%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT003-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 : 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 : Thu Sep 24 01:25:12 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 12
% Syntax : Number of formulae : 50 ( 17 unt; 0 def)
% Number of atoms : 173 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 252 ( 129 ~; 123 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 104 ( 104 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B,C] :
( reorganization_free(A,B,B)
| ~ reorganization_free(A,B,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B,C] :
( reorganization_free(A,C,C)
| ~ reorganization_free(A,B,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] :
( inertia(A,sk1(B,A),B)
| ~ organization(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,hypothesis,
! [A,B,C,D,E,F,G,H] :
( greater(H,G)
| ~ greater(F,E)
| ~ survival_chance(C,H,D)
| ~ survival_chance(A,G,B)
| ~ inertia(C,F,D)
| ~ inertia(A,E,B)
| ~ reorganization_free(C,D,D)
| ~ reorganization_free(A,B,B)
| ~ organization(C,D)
| ~ organization(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,hypothesis,
! [A,B,C,D,E] :
( greater(E,D)
| ~ greater(C,B)
| ~ inertia(A,E,C)
| ~ inertia(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
organization(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,negated_conjecture,
organization(sk2,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
survival_chance(sk2,sk3,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,negated_conjecture,
survival_chance(sk2,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,negated_conjecture,
greater(sk6,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,negated_conjecture,
~ greater(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f13,plain,
! [A,B] :
( reorganization_free(A,B,B)
| ! [C] : ~ reorganization_free(A,B,C) ),
inference(miniscoping,[status(thm)],[f1]) ).
fof(f14,plain,
! [X0,X1,X2] :
( reorganization_free(X0,X1,X1)
| ~ reorganization_free(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f15,plain,
! [A,C] :
( reorganization_free(A,C,C)
| ! [B] : ~ reorganization_free(A,B,C) ),
inference(miniscoping,[status(thm)],[f2]) ).
fof(f16,plain,
! [X0,X1,X2] :
( reorganization_free(X0,X2,X2)
| ~ reorganization_free(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f15]) ).
fof(f17,plain,
! [X0,X1] :
( inertia(X0,sk1(X1,X0),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f18,plain,
! [G,H] :
( greater(H,G)
| ! [E,F] :
( ~ greater(F,E)
| ! [C,D] :
( ~ survival_chance(C,H,D)
| ! [A,B] :
( ~ survival_chance(A,G,B)
| ~ inertia(C,F,D)
| ~ inertia(A,E,B)
| ~ reorganization_free(C,D,D)
| ~ reorganization_free(A,B,B)
| ~ organization(C,D)
| ~ organization(A,B) ) ) ) ),
inference(miniscoping,[status(thm)],[f4]) ).
fof(f19,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( greater(X7,X6)
| ~ greater(X5,X4)
| ~ survival_chance(X2,X7,X3)
| ~ survival_chance(X0,X6,X1)
| ~ inertia(X2,X5,X3)
| ~ inertia(X0,X4,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X2,X3)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f20,plain,
! [D,E] :
( greater(E,D)
| ! [B,C] :
( ~ greater(C,B)
| ! [A] :
( ~ inertia(A,E,C)
| ~ inertia(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ) ) ),
inference(miniscoping,[status(thm)],[f5]) ).
fof(f21,plain,
! [X0,X1,X2,X3,X4] :
( greater(X4,X3)
| ~ greater(X2,X1)
| ~ inertia(X0,X4,X2)
| ~ inertia(X0,X3,X1)
| ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f20]) ).
fof(f22,plain,
organization(sk2,sk5),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f23,plain,
organization(sk2,sk6),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f24,plain,
reorganization_free(sk2,sk5,sk6),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f25,plain,
survival_chance(sk2,sk3,sk5),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f26,plain,
survival_chance(sk2,sk4,sk6),
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f27,plain,
greater(sk6,sk5),
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f28,plain,
~ greater(sk4,sk3),
inference(cnf_transformation,[status(thm)],[f12]) ).
fof(f29,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( greater(X6,X5)
| ~ greater(sk1(X1,X0),X4)
| ~ survival_chance(X0,X6,X1)
| ~ survival_chance(X2,X5,X3)
| ~ inertia(X2,X4,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f17,f19]) ).
fof(f30,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( greater(X6,X5)
| ~ greater(sk1(X1,X0),X4)
| ~ survival_chance(X0,X6,X1)
| ~ survival_chance(X2,X5,X3)
| ~ inertia(X2,X4,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ organization(X2,X3)
| ~ organization(X0,X1) ),
inference(duplicate_literals_removal,[status(thm)],[f29]) ).
fof(f31,plain,
! [X0,X1,X2] :
( greater(X2,X1)
| ~ inertia(X0,X2,sk6)
| ~ inertia(X0,X1,sk5)
| ~ reorganization_free(X0,sk5,sk6)
| ~ organization(X0,sk6)
| ~ organization(X0,sk5) ),
inference(resolution,[status(thm)],[f21,f27]) ).
fof(f32,plain,
! [X0,X1] :
( greater(X1,X0)
| ~ inertia(sk2,X1,sk6)
| ~ inertia(sk2,X0,sk5)
| ~ reorganization_free(sk2,sk5,sk6)
| ~ organization(sk2,sk5) ),
inference(resolution,[status(thm)],[f31,f23]) ).
fof(f33,plain,
! [X0,X1] :
( greater(X1,X0)
| ~ inertia(sk2,X1,sk6)
| ~ inertia(sk2,X0,sk5)
| ~ reorganization_free(sk2,sk5,sk6) ),
inference(forward_subsumption_resolution,[status(thm)],[f32,f22]) ).
fof(f34,plain,
! [X0,X1] :
( greater(X1,X0)
| ~ inertia(sk2,X1,sk6)
| ~ inertia(sk2,X0,sk5) ),
inference(forward_subsumption_resolution,[status(thm)],[f33,f24]) ).
fof(f35,plain,
! [X0] :
( ~ organization(sk2,sk6)
| greater(sk1(sk6,sk2),X0)
| ~ inertia(sk2,X0,sk5) ),
inference(resolution,[status(thm)],[f34,f17]) ).
fof(f36,plain,
! [X0] :
( greater(sk1(sk6,sk2),X0)
| ~ inertia(sk2,X0,sk5) ),
inference(forward_subsumption_resolution,[status(thm)],[f35,f23]) ).
fof(f37,plain,
( ~ organization(sk2,sk5)
| greater(sk1(sk6,sk2),sk1(sk5,sk2)) ),
inference(resolution,[status(thm)],[f36,f17]) ).
fof(f38,plain,
greater(sk1(sk6,sk2),sk1(sk5,sk2)),
inference(forward_subsumption_resolution,[status(thm)],[f37,f22]) ).
fof(f39,plain,
! [X0,X1,X2,X3] :
( greater(X3,X2)
| ~ survival_chance(sk2,X3,sk6)
| ~ survival_chance(X0,X2,X1)
| ~ inertia(X0,sk1(sk5,sk2),X1)
| ~ reorganization_free(sk2,sk6,sk6)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X0,X1)
| ~ organization(sk2,sk6) ),
inference(resolution,[status(thm)],[f38,f30]) ).
fof(f41,plain,
! [X0,X1,X2,X3] :
( greater(X3,X2)
| ~ survival_chance(sk2,X3,sk6)
| ~ survival_chance(X0,X2,X1)
| ~ inertia(X0,sk1(sk5,sk2),X1)
| ~ reorganization_free(sk2,sk6,sk6)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f39,f23]) ).
fof(f42,plain,
! [X0,X1,X2] :
( greater(sk4,X2)
| ~ survival_chance(X0,X2,X1)
| ~ inertia(X0,sk1(sk5,sk2),X1)
| ~ reorganization_free(sk2,sk6,sk6)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f41,f26]) ).
fof(f43,plain,
! [X0] :
( ~ organization(sk2,sk5)
| greater(sk4,X0)
| ~ survival_chance(sk2,X0,sk5)
| ~ reorganization_free(sk2,sk6,sk6)
| ~ reorganization_free(sk2,sk5,sk5)
| ~ organization(sk2,sk5) ),
inference(resolution,[status(thm)],[f42,f17]) ).
fof(f44,plain,
! [X0] :
( greater(sk4,X0)
| ~ survival_chance(sk2,X0,sk5)
| ~ reorganization_free(sk2,sk6,sk6)
| ~ reorganization_free(sk2,sk5,sk5)
| ~ organization(sk2,sk5) ),
inference(duplicate_literals_removal,[status(thm)],[f43]) ).
fof(f45,plain,
! [X0] :
( greater(sk4,X0)
| ~ survival_chance(sk2,X0,sk5)
| ~ reorganization_free(sk2,sk6,sk6)
| ~ reorganization_free(sk2,sk5,sk5) ),
inference(forward_subsumption_resolution,[status(thm)],[f44,f22]) ).
fof(f46,plain,
( greater(sk4,sk3)
| ~ reorganization_free(sk2,sk6,sk6)
| ~ reorganization_free(sk2,sk5,sk5) ),
inference(resolution,[status(thm)],[f45,f25]) ).
fof(f47,plain,
( ~ reorganization_free(sk2,sk6,sk6)
| ~ reorganization_free(sk2,sk5,sk5) ),
inference(forward_subsumption_resolution,[status(thm)],[f46,f28]) ).
fof(f48,plain,
! [X0] :
( ~ reorganization_free(sk2,X0,sk6)
| ~ reorganization_free(sk2,sk5,sk5) ),
inference(resolution,[status(thm)],[f47,f16]) ).
fof(f51,plain,
! [X0,X1] :
( ~ reorganization_free(sk2,sk5,X1)
| ~ reorganization_free(sk2,X0,sk6) ),
inference(resolution,[status(thm)],[f48,f14]) ).
fof(f54,plain,
! [X0] : ~ reorganization_free(sk2,X0,sk6),
inference(resolution,[status(thm)],[f51,f24]) ).
fof(f58,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f24,f54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : MGT003-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 % Computer : n009.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 01:20:27 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.46 % Drodi V4.1.1
% 0.19/0.47 % Refutation found
% 0.19/0.47 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.19/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.24/0.56 % Elapsed time: 0.107591 seconds
% 0.24/0.56 % CPU time: 0.091112 seconds
% 0.24/0.56 % Total memory used: 1.790 MB
% 0.24/0.56 % Net memory used: 1.782 MB
%------------------------------------------------------------------------------