%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT090+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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:35 PM UTC 2026
% Result : Theorem 0.13s 0.58s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 14 unt; 3 def)
% Number of atoms : 82 ( 18 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 81 ( 33 ~; 29 |; 14 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 25 ( 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X,Y] :
( leq(X,Y)
<=> ( X = Y
| less(X,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f31,axiom,
! [V,InfD,SupD] :
( wf(lt,V,InfD,SupD)
<=> ( V != InfD
& leq(V,SupD)
& leq(InfD,V) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f57,axiom,
less(v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f58,axiom,
less(v600,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f59,axiom,
( v600 != v1200
& v0 != v1200
& v0 != v600 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f60,conjecture,
wf(lt,v600,v0,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f61,negated_conjecture,
~ wf(lt,v600,v0,v1200),
inference(negated_conjecture,[status(cth)],[f60]) ).
fof(f67,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(f68,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)],[f67]) ).
fof(f70,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f68]) ).
fof(f158,plain,
! [V,InfD,SupD] :
( ( V = InfD
| ~ leq(V,SupD)
| ~ leq(InfD,V)
| wf(lt,V,InfD,SupD) )
& ( ( V != InfD
& leq(V,SupD)
& leq(InfD,V) )
| ~ wf(lt,V,InfD,SupD) ) ),
inference(NNF_transformation,[status(thm)],[f31]) ).
fof(f159,plain,
( ! [V,InfD,SupD] :
( V = InfD
| ~ leq(V,SupD)
| ~ leq(InfD,V)
| wf(lt,V,InfD,SupD) )
& ! [V,InfD,SupD] :
( ( V != InfD
& leq(V,SupD)
& leq(InfD,V) )
| ~ wf(lt,V,InfD,SupD) ) ),
inference(miniscoping,[status(thm)],[f158]) ).
fof(f163,plain,
! [X0,X1,X2] :
( X0 = X1
| ~ leq(X0,X2)
| ~ leq(X1,X0)
| wf(lt,X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f159]) ).
fof(f200,plain,
less(v0,v600),
inference(cnf_transformation,[status(thm)],[f57]) ).
fof(f201,plain,
less(v600,v1200),
inference(cnf_transformation,[status(thm)],[f58]) ).
fof(f202,plain,
v0 != v600,
inference(cnf_transformation,[status(thm)],[f59]) ).
fof(f205,plain,
~ wf(lt,v600,v0,v1200),
inference(cnf_transformation,[status(thm)],[f61]) ).
fof(f215,plain,
( v600 = v0
| ~ leq(v600,v1200)
| ~ leq(v0,v600) ),
inference(resolution,[status(thm)],[f163,f205]) ).
fof(f219,definition,
( sQ0_spl
<=> leq(v0,v600) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f221,plain,
( sQ0_spl
| ~ leq(v0,v600) ),
inference(component_clause,[status(thm)],[f219]) ).
fof(f222,definition,
( sQ1_spl
<=> leq(v600,v1200) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f224,plain,
( sQ1_spl
| ~ leq(v600,v1200) ),
inference(component_clause,[status(thm)],[f222]) ).
fof(f225,definition,
( sQ2_spl
<=> v600 = v0 ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f226,plain,
( ~ sQ2_spl
| v600 = v0 ),
inference(component_clause,[status(thm)],[f225]) ).
fof(f228,plain,
( sQ2_spl
| ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f215,f219,f222,f225]) ).
fof(f229,plain,
( ~ sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f226,f202]) ).
fof(f230,plain,
~ sQ2_spl,
inference(contradiction_clause,[status(thm)],[f229]) ).
fof(f238,plain,
leq(v600,v1200),
inference(resolution,[status(thm)],[f70,f201]) ).
fof(f239,plain,
leq(v0,v600),
inference(resolution,[status(thm)],[f70,f200]) ).
fof(f241,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f239,f221]) ).
fof(f242,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f241]) ).
fof(f250,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f238,f224]) ).
fof(f251,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f250]) ).
fof(f252,plain,
$false,
inference(sat_refutation,[status(thm)],[f228,f230,f242,f251]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT090+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.55 % Computer : n010.cluster.edu
% 0.09/0.55 % Model : x86_64 x86_64
% 0.09/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.55 % Memory : 8046.5625MB
% 0.09/0.55 % OS : Linux 6.8.0-71-generic
% 0.09/0.55 % CPULimit : 300
% 0.09/0.55 % WCLimit : 300
% 0.09/0.55 % DateTime : Mon Sep 21 01:25:42 UTC 2026
% 0.13/0.56 % CPUTime :
% 0.13/0.56 % Drodi V4.1.1
% 0.13/0.58 % Refutation found
% 0.13/0.58 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.58 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.62 % Elapsed time: 0.048939 seconds
% 0.13/0.62 % CPU time: 0.142794 seconds
% 0.13/0.62 % Total memory used: 82.830 MB
% 0.13/0.62 % Net memory used: 82.725 MB
%------------------------------------------------------------------------------