%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV069+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 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 02:46:34 PM UTC 2026
% Result : Theorem 0.08s 0.39s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 51 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 51 ( 22 ~; 14 |; 12 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 14 ( 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X] : leq(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X,Y] :
( leq(X,pred(Y))
<=> gt(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f39,axiom,
! [X] : minus(X,n1) = pred(X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,minus(n5,n1))
& leq(n0,pv10)
& leq(n0,n0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,minus(n5,n1))
& leq(n0,pv10)
& leq(n0,n0) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f66,axiom,
gt(n5,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f99,plain,
! [X0] : leq(X0,X0),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f115,plain,
! [X,Y] :
( ( ~ gt(Y,X)
| leq(X,pred(Y)) )
& ( gt(Y,X)
| ~ leq(X,pred(Y)) ) ),
inference(NNF_transformation,[status(thm)],[f10]) ).
fof(f116,plain,
( ! [X,Y] :
( ~ gt(Y,X)
| leq(X,pred(Y)) )
& ! [X,Y] :
( gt(Y,X)
| ~ leq(X,pred(Y)) ) ),
inference(miniscoping,[status(thm)],[f115]) ).
fof(f118,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,pred(X1)) ),
inference(cnf_transformation,[status(thm)],[f116]) ).
fof(f217,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[status(thm)],[f39]) ).
fof(f251,plain,
( ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,n0) )
& leq(pv10,minus(n135300,n1))
& 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(pv10,minus(n135300,n1)),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f254,plain,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f266,plain,
gt(n5,n0),
inference(cnf_transformation,[status(thm)],[f66]) ).
fof(f338,plain,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,n0) ),
inference(forward_subsumption_resolution,[status(thm)],[f254,f252]) ).
fof(f339,plain,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1)) ),
inference(backward_subsumption_resolution,[status(thm)],[f338,f99]) ).
fof(f340,plain,
~ leq(n0,minus(n5,n1)),
inference(forward_subsumption_resolution,[status(thm)],[f339,f253]) ).
fof(f346,plain,
~ leq(n0,pred(n5)),
inference(forward_demodulation,[status(thm)],[f217,f340]) ).
fof(f405,plain,
~ gt(n5,n0),
inference(resolution,[status(thm)],[f118,f346]) ).
fof(f411,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f405,f266]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV069+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n003.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Mon Sep 21 08:31:16 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.36 % Drodi V4.1.1
% 0.08/0.39 % Refutation found
% 0.08/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.42 % Elapsed time: 0.065502 seconds
% 0.13/0.42 % CPU time: 0.187949 seconds
% 0.13/0.42 % Total memory used: 98.959 MB
% 0.13/0.42 % Net memory used: 98.791 MB
%------------------------------------------------------------------------------