%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT084+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 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:34 PM UTC 2026
% Result : Theorem 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 78 ( 10 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 77 ( 24 ~; 20 |; 30 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 42 ( 33 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] : ~ less(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X,Y] :
( leq(X,Y)
<=> ( X = Y
| less(X,Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X,Y] :
( ( leq(Y,X)
& leq(X,Y) )
=> X = Y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X,A,B] :
( in_lopen(X,A,B)
<=> ( leq(X,B)
& less(A,X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f39,conjecture,
~ ? [X,Y,Z] :
( leq(v200,Z)
& in_lopen(Z,v0,v200)
& less(v400,Y)
& in_lopen(Y,v0,v400)
& leq(v600,X)
& in_lopen(X,v0,v600) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f40,negated_conjecture,
~ ~ ? [X,Y,Z] :
( leq(v200,Z)
& in_lopen(Z,v0,v200)
& less(v400,Y)
& in_lopen(Y,v0,v400)
& leq(v600,X)
& in_lopen(X,v0,v600) ),
inference(negated_conjecture,[status(cth)],[f39]) ).
fof(f41,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f46,plain,
! [X,Y] :
( ( ( X != Y
& ~ less(X,Y) )
| leq(X,Y) )
& ( X = Y
| less(X,Y)
| ~ leq(X,Y) ) ),
inference(NNF_transformation,[status(thm)],[f4]) ).
fof(f47,plain,
( ! [X,Y] :
( ( X != Y
& ~ less(X,Y) )
| leq(X,Y) )
& ! [X,Y] :
( X = Y
| less(X,Y)
| ~ leq(X,Y) ) ),
inference(miniscoping,[status(thm)],[f46]) ).
fof(f49,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f47]) ).
fof(f51,plain,
! [X,Y] :
( X = Y
| ~ leq(Y,X)
| ~ leq(X,Y) ),
inference(pre_NNF_transformation,[status(thm)],[f5]) ).
fof(f52,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X1,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f51]) ).
fof(f69,plain,
! [X,A,B] :
( ( ~ leq(X,B)
| ~ less(A,X)
| in_lopen(X,A,B) )
& ( ( leq(X,B)
& less(A,X) )
| ~ in_lopen(X,A,B) ) ),
inference(NNF_transformation,[status(thm)],[f11]) ).
fof(f70,plain,
( ! [X,A,B] :
( ~ leq(X,B)
| ~ less(A,X)
| in_lopen(X,A,B) )
& ! [X,A,B] :
( ( leq(X,B)
& less(A,X) )
| ~ in_lopen(X,A,B) ) ),
inference(miniscoping,[status(thm)],[f69]) ).
fof(f72,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f70]) ).
fof(f138,plain,
? [Z] :
( leq(v200,Z)
& in_lopen(Z,v0,v200)
& ? [Y] :
( less(v400,Y)
& in_lopen(Y,v0,v400)
& ? [X] :
( leq(v600,X)
& in_lopen(X,v0,v600) ) ) ),
inference(miniscoping,[status(thm)],[f40]) ).
fof(f139,plain,
( leq(v200,sK3_skl)
& in_lopen(sK3_skl,v0,v200)
& less(v400,sK4_skl)
& in_lopen(sK4_skl,v0,v400)
& leq(v600,sK5_skl)
& in_lopen(sK5_skl,v0,v600) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl,sK4_skl,sK5_skl]),skolemize(Z,sK3_skl),skolemize(Y,sK4_skl),skolemize(X,sK5_skl)],[f138]) ).
fof(f142,plain,
in_lopen(sK4_skl,v0,v400),
inference(cnf_transformation,[status(thm)],[f139]) ).
fof(f143,plain,
less(v400,sK4_skl),
inference(cnf_transformation,[status(thm)],[f139]) ).
fof(f167,plain,
leq(v400,sK4_skl),
inference(resolution,[status(thm)],[f49,f143]) ).
fof(f196,plain,
( v400 = sK4_skl
| ~ leq(sK4_skl,v400) ),
inference(resolution,[status(thm)],[f167,f52]) ).
fof(f251,plain,
leq(sK4_skl,v400),
inference(resolution,[status(thm)],[f72,f142]) ).
fof(f264,plain,
v400 = sK4_skl,
inference(backward_subsumption_resolution,[status(thm)],[f196,f251]) ).
fof(f275,plain,
less(v400,v400),
inference(backward_demodulation,[status(thm)],[f264,f143]) ).
fof(f276,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f275,f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT084+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 % 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:23:05 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.13/0.37 % Drodi V4.1.1
% 0.13/0.40 % Refutation found
% 0.13/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.44 % Elapsed time: 0.061176 seconds
% 0.13/0.44 % CPU time: 0.188699 seconds
% 0.13/0.44 % Total memory used: 82.361 MB
% 0.13/0.44 % Net memory used: 82.236 MB
%------------------------------------------------------------------------------