%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT088+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 : n020.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.11s 0.39s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 50 ( 13 unt; 4 def)
% Number of atoms : 118 ( 23 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 120 ( 52 ~; 44 |; 17 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 52 ( 50 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] : ~ less(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y,Z] :
( ( less(Y,Z)
& less(X,Y) )
=> less(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,Y] :
( less(Y,X)
| X = Y
| less(X,Y) ),
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(f12,axiom,
! [X,A,B] :
( in_lopen(X,A,B)
<=> ( leq(X,B)
& less(A,X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f33,axiom,
less(v0,v200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f36,axiom,
less(v200,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f39,axiom,
( v400 != v600
& v200 != v600
& v200 != v400
& v0 != v600
& v0 != v400
& v0 != v200 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f40,conjecture,
? [X] :
( in_lopen(X,v0,v400)
& less(v200,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f41,negated_conjecture,
~ ? [X] :
( in_lopen(X,v0,v400)
& less(v200,X) ),
inference(negated_conjecture,[status(cth)],[f40]) ).
fof(f42,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f43,plain,
! [X,Y,Z] :
( less(X,Z)
| ~ less(Y,Z)
| ~ less(X,Y) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f44,plain,
! [X,Z] :
( less(X,Z)
| ! [Y] :
( ~ less(Y,Z)
| ~ less(X,Y) ) ),
inference(miniscoping,[status(thm)],[f43]) ).
fof(f45,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f44]) ).
fof(f46,plain,
! [X0,X1] :
( less(X1,X0)
| X0 = X1
| less(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f47,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(f48,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)],[f47]) ).
fof(f51,plain,
! [X0,X1] :
( X0 != X1
| leq(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f48]) ).
fof(f74,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)],[f12]) ).
fof(f75,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)],[f74]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ~ leq(X0,X2)
| ~ less(X1,X0)
| in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f75]) ).
fof(f131,plain,
less(v0,v200),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f134,plain,
less(v200,v400),
inference(cnf_transformation,[status(thm)],[f36]) ).
fof(f138,plain,
v0 != v400,
inference(cnf_transformation,[status(thm)],[f39]) ).
fof(f140,plain,
v200 != v400,
inference(cnf_transformation,[status(thm)],[f39]) ).
fof(f143,plain,
! [X] :
( ~ in_lopen(X,v0,v400)
| ~ less(v200,X) ),
inference(pre_NNF_transformation,[status(thm)],[f41]) ).
fof(f144,plain,
! [X0] :
( ~ in_lopen(X0,v0,v400)
| ~ less(v200,X0) ),
inference(cnf_transformation,[status(thm)],[f143]) ).
fof(f145,plain,
! [X0] : leq(X0,X0),
inference(destructive_equality_resolution,[status(thm)],[f51]) ).
fof(f152,plain,
! [X0] :
( less(X0,v200)
| ~ less(X0,v0) ),
inference(resolution,[status(thm)],[f131,f45]) ).
fof(f154,plain,
! [X0] :
( less(X0,v400)
| ~ less(X0,v200) ),
inference(resolution,[status(thm)],[f134,f45]) ).
fof(f163,plain,
! [X0] :
( v0 = X0
| less(v0,X0)
| less(X0,v200) ),
inference(resolution,[status(thm)],[f152,f46]) ).
fof(f166,plain,
~ less(v400,v200),
inference(resolution,[status(thm)],[f154,f42]) ).
fof(f167,plain,
! [X0] :
( ~ less(v200,X0)
| ~ leq(X0,v400)
| ~ less(v0,X0) ),
inference(resolution,[status(thm)],[f78,f144]) ).
fof(f169,plain,
( v200 = v400
| less(v200,v400) ),
inference(resolution,[status(thm)],[f166,f46]) ).
fof(f170,definition,
( sQ0_spl
<=> less(v200,v400) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f173,definition,
( sQ1_spl
<=> v200 = v400 ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f174,plain,
( ~ sQ1_spl
| v200 = v400 ),
inference(component_clause,[status(thm)],[f173]) ).
fof(f176,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f169,f170,f173]) ).
fof(f179,plain,
( v0 = v400
| less(v0,v400) ),
inference(resolution,[status(thm)],[f163,f166]) ).
fof(f182,definition,
( sQ2_spl
<=> less(v0,v400) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f185,definition,
( sQ3_spl
<=> v0 = v400 ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f186,plain,
( ~ sQ3_spl
| v0 = v400 ),
inference(component_clause,[status(thm)],[f185]) ).
fof(f188,plain,
( sQ3_spl
| sQ2_spl ),
inference(split_clause,[status(thm)],[f179,f182,f185]) ).
fof(f205,plain,
( ~ less(v200,v400)
| ~ less(v0,v400) ),
inference(resolution,[status(thm)],[f167,f145]) ).
fof(f207,plain,
( ~ sQ0_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f205,f182,f170]) ).
fof(f208,plain,
( ~ sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f186,f138]) ).
fof(f209,plain,
~ sQ3_spl,
inference(contradiction_clause,[status(thm)],[f208]) ).
fof(f210,plain,
( ~ sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f174,f140]) ).
fof(f211,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f210]) ).
fof(f212,plain,
$false,
inference(sat_refutation,[status(thm)],[f176,f188,f207,f209,f211]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT088+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n020.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 01:26:18 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.38 % Drodi V4.1.1
% 0.11/0.39 % Refutation found
% 0.11/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.43 % Elapsed time: 0.056839 seconds
% 0.11/0.43 % CPU time: 0.140241 seconds
% 0.11/0.43 % Total memory used: 56.225 MB
% 0.11/0.43 % Net memory used: 56.170 MB
%------------------------------------------------------------------------------