%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT092+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 : n003.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.16s 0.40s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 44 ( 18 unt; 4 def)
% Number of atoms : 96 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 88 ( 36 ~; 37 |; 8 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 35 ( 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X,Y,Z] :
( ( less(Y,Z)
& less(X,Y) )
=> less(X,Z) ),
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(f13,axiom,
! [U,V,InfD,SupD] :
( ( leq(V,SupD)
& less(U,V)
& leq(U,SupD)
& leq(InfD,U) )
=> completion_conflict(U,V,InfD,SupD) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f38,axiom,
less(v0,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f39,axiom,
less(v400,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f40,axiom,
less(v800,v1200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f42,conjecture,
completion_conflict(v400,v800,v0,v1200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f43,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
inference(negated_conjecture,[status(cth)],[f42]) ).
fof(f45,plain,
! [X,Y,Z] :
( less(X,Z)
| ~ less(Y,Z)
| ~ less(X,Y) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f46,plain,
! [X,Z] :
( less(X,Z)
| ! [Y] :
( ~ less(Y,Z)
| ~ less(X,Y) ) ),
inference(miniscoping,[status(thm)],[f45]) ).
fof(f47,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f46]) ).
fof(f49,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(f50,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)],[f49]) ).
fof(f52,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f50]) ).
fof(f74,plain,
! [U,V,InfD,SupD] :
( completion_conflict(U,V,InfD,SupD)
| ~ leq(V,SupD)
| ~ less(U,V)
| ~ leq(U,SupD)
| ~ leq(InfD,U) ),
inference(pre_NNF_transformation,[status(thm)],[f13]) ).
fof(f75,plain,
! [X0,X1,X2,X3] :
( completion_conflict(X1,X3,X0,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f74]) ).
fof(f143,plain,
less(v0,v400),
inference(cnf_transformation,[status(thm)],[f38]) ).
fof(f144,plain,
less(v400,v800),
inference(cnf_transformation,[status(thm)],[f39]) ).
fof(f145,plain,
less(v800,v1200),
inference(cnf_transformation,[status(thm)],[f40]) ).
fof(f152,plain,
~ completion_conflict(v400,v800,v0,v1200),
inference(cnf_transformation,[status(thm)],[f43]) ).
fof(f161,definition,
( sQ0_spl
<=> leq(v0,v400) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f163,plain,
( sQ0_spl
| ~ leq(v0,v400) ),
inference(component_clause,[status(thm)],[f161]) ).
fof(f164,definition,
( sQ1_spl
<=> leq(v400,v1200) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f166,plain,
( sQ1_spl
| ~ leq(v400,v1200) ),
inference(component_clause,[status(thm)],[f164]) ).
fof(f170,definition,
( sQ3_spl
<=> leq(v800,v1200) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f172,plain,
( sQ3_spl
| ~ leq(v800,v1200) ),
inference(component_clause,[status(thm)],[f170]) ).
fof(f173,definition,
( sQ4_spl
<=> less(v400,v800) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f175,plain,
( sQ4_spl
| ~ less(v400,v800) ),
inference(component_clause,[status(thm)],[f173]) ).
fof(f177,plain,
( sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f175,f144]) ).
fof(f178,plain,
sQ4_spl,
inference(contradiction_clause,[status(thm)],[f177]) ).
fof(f179,plain,
( ~ leq(v800,v1200)
| ~ less(v400,v800)
| ~ leq(v400,v1200)
| ~ leq(v0,v400) ),
inference(resolution,[status(thm)],[f75,f152]) ).
fof(f180,plain,
( ~ sQ3_spl
| ~ sQ4_spl
| ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f179,f161,f164,f173,f170]) ).
fof(f181,plain,
! [X0] :
( less(X0,v1200)
| ~ less(X0,v800) ),
inference(resolution,[status(thm)],[f47,f145]) ).
fof(f184,plain,
less(v400,v1200),
inference(resolution,[status(thm)],[f181,f144]) ).
fof(f186,plain,
leq(v800,v1200),
inference(resolution,[status(thm)],[f52,f145]) ).
fof(f187,plain,
leq(v400,v1200),
inference(resolution,[status(thm)],[f52,f184]) ).
fof(f189,plain,
leq(v0,v400),
inference(resolution,[status(thm)],[f52,f143]) ).
fof(f190,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f186,f172]) ).
fof(f191,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f190]) ).
fof(f192,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f163,f189]) ).
fof(f193,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f192]) ).
fof(f194,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f166,f187]) ).
fof(f195,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f194]) ).
fof(f196,plain,
$false,
inference(sat_refutation,[status(thm)],[f178,f180,f191,f193,f195]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT092+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n003.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:28:01 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 % Drodi V4.1.1
% 0.16/0.40 % Refutation found
% 0.16/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.43 % Elapsed time: 0.056052 seconds
% 0.16/0.43 % CPU time: 0.156754 seconds
% 0.16/0.43 % Total memory used: 81.745 MB
% 0.16/0.43 % Net memory used: 81.662 MB
%------------------------------------------------------------------------------