%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV064+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n004.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 02:46:33 PM UTC 2026
% Result : Theorem 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 93 ( 36 ~; 27 |; 28 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 2 ( 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X] : leq(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10) )
=> ( leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10)
& leq(n0,n0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10) )
=> ( leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10)
& leq(n0,n0) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f99,plain,
! [X0] : leq(X0,X0),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f251,plain,
( ( ~ leq(pv54,minus(n5,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv54)
| ~ leq(n0,pv53)
| ~ leq(n0,pv10)
| ~ leq(n0,n0) )
& leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10) ),
inference(pre_NNF_transformation,[status(thm)],[f54]) ).
fof(f252,plain,
leq(n0,pv10),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f253,plain,
leq(n0,pv53),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f254,plain,
leq(n0,pv54),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f255,plain,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f256,plain,
leq(pv53,minus(n5,n1)),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f257,plain,
leq(pv54,minus(n5,n1)),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f258,plain,
( ~ leq(pv54,minus(n5,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv54)
| ~ leq(n0,pv53)
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f346,plain,
( ~ leq(pv54,minus(n5,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv54)
| ~ leq(n0,pv53)
| ~ leq(n0,pv10) ),
inference(forward_subsumption_resolution,[status(thm)],[f258,f99]) ).
fof(f347,plain,
( ~ leq(pv54,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv54)
| ~ leq(n0,pv53)
| ~ leq(n0,pv10) ),
inference(resolution,[status(thm)],[f346,f256]) ).
fof(f351,plain,
( ~ leq(pv54,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv54)
| ~ leq(n0,pv53) ),
inference(forward_subsumption_resolution,[status(thm)],[f347,f252]) ).
fof(f360,plain,
( ~ leq(pv54,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv54) ),
inference(forward_subsumption_resolution,[status(thm)],[f351,f253]) ).
fof(f361,plain,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv54) ),
inference(resolution,[status(thm)],[f360,f257]) ).
fof(f363,plain,
~ leq(pv10,minus(n135300,n1)),
inference(forward_subsumption_resolution,[status(thm)],[f361,f254]) ).
fof(f365,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f363,f255]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV064+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.42 % Computer : n004.cluster.edu
% 0.18/0.42 % Model : x86_64 x86_64
% 0.18/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.42 % Memory : 8046.5625MB
% 0.18/0.42 % OS : Linux 6.8.0-71-generic
% 0.18/0.42 % CPULimit : 300
% 0.18/0.42 % WCLimit : 300
% 0.18/0.42 % DateTime : Mon Sep 21 08:29:19 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.45 % Drodi V4.1.1
% 0.18/0.48 % Refutation found
% 0.18/0.48 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.18/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.25/0.55 % Elapsed time: 0.113735 seconds
% 0.25/0.55 % CPU time: 0.114300 seconds
% 0.25/0.55 % Total memory used: 6.886 MB
% 0.25/0.55 % Net memory used: 6.878 MB
%------------------------------------------------------------------------------