%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT075+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 : n017.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:33 PM UTC 2026
% Result : Theorem 0.12s 0.41s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 8 unt; 2 def)
% Number of atoms : 79 ( 11 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 79 ( 33 ~; 28 |; 13 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 38 ( 36 !; 2 ?)
% 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(f13,axiom,
! [X,A,B] :
( in_open(X,A,B)
<=> ( less(X,B)
& less(A,X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f32,conjecture,
~ ? [X] :
( leq(v600,X)
& in_open(X,v0,v600) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f33,negated_conjecture,
~ ~ ? [X] :
( leq(v600,X)
& in_open(X,v0,v600) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f34,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f39,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(f40,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)],[f39]) ).
fof(f42,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f40]) ).
fof(f44,plain,
! [X,Y] :
( X = Y
| ~ leq(Y,X)
| ~ leq(X,Y) ),
inference(pre_NNF_transformation,[status(thm)],[f5]) ).
fof(f45,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X1,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f44]) ).
fof(f72,plain,
! [X,A,B] :
( ( ~ less(X,B)
| ~ less(A,X)
| in_open(X,A,B) )
& ( ( less(X,B)
& less(A,X) )
| ~ in_open(X,A,B) ) ),
inference(NNF_transformation,[status(thm)],[f13]) ).
fof(f73,plain,
( ! [X,A,B] :
( ~ less(X,B)
| ~ less(A,X)
| in_open(X,A,B) )
& ! [X,A,B] :
( ( less(X,B)
& less(A,X) )
| ~ in_open(X,A,B) ) ),
inference(miniscoping,[status(thm)],[f72]) ).
fof(f75,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ in_open(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f73]) ).
fof(f119,plain,
( leq(v600,sK3_skl)
& in_open(sK3_skl,v0,v600) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl]),skolemize(X,sK3_skl)],[f33]) ).
fof(f120,plain,
in_open(sK3_skl,v0,v600),
inference(cnf_transformation,[status(thm)],[f119]) ).
fof(f121,plain,
leq(v600,sK3_skl),
inference(cnf_transformation,[status(thm)],[f119]) ).
fof(f129,plain,
( sK3_skl = v600
| ~ leq(sK3_skl,v600) ),
inference(resolution,[status(thm)],[f45,f121]) ).
fof(f132,definition,
( sQ0_spl
<=> leq(sK3_skl,v600) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f134,plain,
( sQ0_spl
| ~ leq(sK3_skl,v600) ),
inference(component_clause,[status(thm)],[f132]) ).
fof(f135,definition,
( sQ1_spl
<=> sK3_skl = v600 ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f136,plain,
( ~ sQ1_spl
| sK3_skl = v600 ),
inference(component_clause,[status(thm)],[f135]) ).
fof(f138,plain,
( sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f129,f132,f135]) ).
fof(f139,plain,
( sQ0_spl
| ~ less(sK3_skl,v600) ),
inference(resolution,[status(thm)],[f134,f42]) ).
fof(f140,plain,
! [X0] :
( sQ0_spl
| ~ in_open(sK3_skl,X0,v600) ),
inference(resolution,[status(thm)],[f139,f75]) ).
fof(f148,plain,
! [X0,X1] : ~ in_open(X0,X1,X0),
inference(resolution,[status(thm)],[f34,f75]) ).
fof(f151,plain,
( sQ0_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f120,f140]) ).
fof(f152,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f151]) ).
fof(f158,plain,
( ~ sQ1_spl
| in_open(v600,v0,v600) ),
inference(forward_demodulation,[status(thm)],[f136,f120]) ).
fof(f159,plain,
( ~ sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f158,f148]) ).
fof(f160,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f159]) ).
fof(f161,plain,
$false,
inference(sat_refutation,[status(thm)],[f138,f152,f160]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT075+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 % Computer : n017.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 01:20:12 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.38 % Drodi V4.1.1
% 0.12/0.41 % Refutation found
% 0.12/0.41 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.44 % Elapsed time: 0.056567 seconds
% 0.12/0.44 % CPU time: 0.153996 seconds
% 0.12/0.44 % Total memory used: 81.288 MB
% 0.12/0.44 % Net memory used: 81.206 MB
%------------------------------------------------------------------------------