%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV141+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 : n002.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:44 PM UTC 2026
% Result : Theorem 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 97 ( 2 equ)
% Maximal formula atoms : 27 ( 6 avg)
% Number of connectives : 109 ( 27 ~; 15 |; 40 &)
% ( 0 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-1 aty)
% Number of variables : 6 ( 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f43,axiom,
! [X,Y] :
( leq(succ(X),Y)
=> gt(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) )
=> leq(n0,s_worst7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) )
=> leq(n0,s_worst7) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f84,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f217,plain,
! [X,Y] :
( gt(Y,X)
| ~ leq(succ(X),Y) ),
inference(pre_NNF_transformation,[status(thm)],[f43]) ).
fof(f218,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(succ(X0),X1) ),
inference(cnf_transformation,[status(thm)],[f217]) ).
fof(f244,plain,
( ~ leq(n0,s_worst7)
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) ),
inference(pre_NNF_transformation,[status(thm)],[f54]) ).
fof(f246,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[status(thm)],[f244]) ).
fof(f255,plain,
( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) ),
inference(cnf_transformation,[status(thm)],[f244]) ).
fof(f259,plain,
~ leq(n0,s_worst7),
inference(cnf_transformation,[status(thm)],[f244]) ).
fof(f295,plain,
succ(n0) = n1,
inference(cnf_transformation,[status(thm)],[f84]) ).
fof(f528,plain,
~ gt(loopcounter,n0),
inference(forward_subsumption_resolution,[status(thm)],[f255,f259]) ).
fof(f529,plain,
~ leq(succ(n0),loopcounter),
inference(resolution,[status(thm)],[f528,f218]) ).
fof(f534,plain,
~ leq(n1,loopcounter),
inference(forward_demodulation,[status(thm)],[f295,f529]) ).
fof(f535,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f534,f246]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV141+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n002.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:35:47 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.13/0.38 % Drodi V4.1.1
% 0.13/0.43 % Refutation found
% 0.13/0.43 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.45 % Elapsed time: 0.074166 seconds
% 0.13/0.45 % CPU time: 0.219521 seconds
% 0.13/0.45 % Total memory used: 110.107 MB
% 0.13/0.45 % Net memory used: 109.848 MB
%------------------------------------------------------------------------------