%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV067+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 : n013.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.10s 0.41s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 10 unt; 1 def)
% Number of atoms : 124 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 149 ( 57 ~; 47 |; 36 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 19 ( 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X,Y,Z] :
( ( leq(Y,Z)
& leq(X,Y) )
=> leq(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( leq(pv63,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n1,pv63)
& leq(n0,pv10) )
=> ( ( gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) )
& ( ~ gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) )
& leq(pv63,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv63)
& leq(n0,pv10) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(pv63,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n1,pv63)
& leq(n0,pv10) )
=> ( ( gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) )
& ( ~ gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) )
& leq(pv63,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv63)
& leq(n0,pv10) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f68,axiom,
gt(n1,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f100,plain,
! [X,Y,Z] :
( leq(X,Z)
| ~ leq(Y,Z)
| ~ leq(X,Y) ),
inference(pre_NNF_transformation,[status(thm)],[f5]) ).
fof(f101,plain,
! [X,Z] :
( leq(X,Z)
| ! [Y] :
( ~ leq(Y,Z)
| ~ leq(X,Y) ) ),
inference(miniscoping,[status(thm)],[f100]) ).
fof(f102,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f101]) ).
fof(f111,plain,
! [X,Y] :
( leq(X,Y)
| ~ gt(Y,X) ),
inference(pre_NNF_transformation,[status(thm)],[f8]) ).
fof(f112,plain,
! [X0,X1] :
( leq(X1,X0)
| ~ gt(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f111]) ).
fof(f251,plain,
( ( ( ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) )
& gt(a_select3(q,pv10,pv63),pv78) )
| ( ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) )
& ~ gt(a_select3(q,pv10,pv63),pv78) )
| ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63)
| ~ leq(n0,pv10) )
& leq(pv63,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n1,pv63)
& leq(n0,pv10) ),
inference(pre_NNF_transformation,[status(thm)],[f54]) ).
fof(f252,definition,
( sP3_prd
<=> ( ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) )
& ~ gt(a_select3(q,pv10,pv63),pv78) ) ),
introduced(definition,[new_symbols(definition,[sP3_prd])],[]) ).
fof(f253,plain,
( ( ( ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) )
& gt(a_select3(q,pv10,pv63),pv78) )
| sP3_prd
| ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63)
| ~ leq(n0,pv10) )
& leq(pv63,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n1,pv63)
& leq(n0,pv10) ),
inference(formula_renaming,[status(thm)],[f251,f252]) ).
fof(f254,plain,
leq(n0,pv10),
inference(cnf_transformation,[status(thm)],[f253]) ).
fof(f255,plain,
leq(n1,pv63),
inference(cnf_transformation,[status(thm)],[f253]) ).
fof(f256,plain,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[status(thm)],[f253]) ).
fof(f257,plain,
leq(pv63,minus(n5,n1)),
inference(cnf_transformation,[status(thm)],[f253]) ).
fof(f259,plain,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| sP3_prd
| ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63)
| ~ leq(n0,pv10) ),
inference(cnf_transformation,[status(thm)],[f253]) ).
fof(f273,plain,
gt(n1,n0),
inference(cnf_transformation,[status(thm)],[f68]) ).
fof(f333,plain,
( ( ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
| gt(a_select3(q,pv10,pv63),pv78)
| sP3_prd )
& ( ( ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) )
& ~ gt(a_select3(q,pv10,pv63),pv78) )
| ~ sP3_prd ) ),
inference(NNF_transformation,[status(thm)],[f252]) ).
fof(f335,plain,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| ~ sP3_prd ),
inference(cnf_transformation,[status(thm)],[f333]) ).
fof(f348,plain,
( sP3_prd
| ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63)
| ~ leq(n0,pv10) ),
inference(duplicate_literals_removal,[status(thm)],[f259]) ).
fof(f369,plain,
! [X0] :
( leq(X0,pv63)
| ~ leq(X0,n1) ),
inference(resolution,[status(thm)],[f102,f255]) ).
fof(f389,plain,
leq(n0,n1),
inference(resolution,[status(thm)],[f112,f273]) ).
fof(f436,plain,
( sP3_prd
| ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63) ),
inference(forward_subsumption_resolution,[status(thm)],[f348,f254]) ).
fof(f437,plain,
( sP3_prd
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63) ),
inference(resolution,[status(thm)],[f436,f257]) ).
fof(f440,plain,
( sP3_prd
| ~ leq(n0,pv63) ),
inference(forward_subsumption_resolution,[status(thm)],[f437,f256]) ).
fof(f495,plain,
( ~ leq(n0,n1)
| sP3_prd ),
inference(resolution,[status(thm)],[f440,f369]) ).
fof(f497,plain,
sP3_prd,
inference(forward_subsumption_resolution,[status(thm)],[f495,f389]) ).
fof(f499,plain,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10) ),
inference(forward_subsumption_resolution,[status(thm)],[f335,f497]) ).
fof(f500,plain,
~ leq(n0,pv10),
inference(resolution,[status(thm)],[f499,f256]) ).
fof(f503,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f500,f254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV067+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 08:29:06 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 % Drodi V4.1.1
% 0.10/0.41 % Refutation found
% 0.10/0.41 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.44 % Elapsed time: 0.058349 seconds
% 0.10/0.44 % CPU time: 0.183202 seconds
% 0.10/0.44 % Total memory used: 99.360 MB
% 0.10/0.44 % Net memory used: 99.146 MB
%------------------------------------------------------------------------------