%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV152+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 : n011.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:45 PM UTC 2026
% Result : Theorem 0.23s 5.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 49 ( 15 unt; 4 def)
% Number of atoms : 97 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 82 ( 34 ~; 30 |; 9 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 27 ( 26 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X,Y] :
( leq(X,pred(Y))
<=> gt(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f28,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f40,axiom,
! [X] : pred(succ(X)) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
! [A] :
( ( leq(A,tptp_minus_1)
& leq(n0,A) )
=> sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ! [A] :
( ( leq(A,tptp_minus_1)
& leq(n0,A) )
=> sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1 ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f58,axiom,
gt(n0,tptp_minus_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f78,axiom,
! [X] :
( ( leq(X,n0)
& leq(n0,X) )
=> X = n0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f91,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f104,plain,
! [X,Y] :
( leq(X,Y)
| ~ gt(Y,X) ),
inference(pre_NNF_transformation,[status(thm)],[f8]) ).
fof(f105,plain,
! [X0,X1] :
( leq(X1,X0)
| ~ gt(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f104]) ).
fof(f108,plain,
! [X,Y] :
( ( ~ gt(Y,X)
| leq(X,pred(Y)) )
& ( gt(Y,X)
| ~ leq(X,pred(Y)) ) ),
inference(NNF_transformation,[status(thm)],[f10]) ).
fof(f109,plain,
( ! [X,Y] :
( ~ gt(Y,X)
| leq(X,pred(Y)) )
& ! [X,Y] :
( gt(Y,X)
| ~ leq(X,pred(Y)) ) ),
inference(miniscoping,[status(thm)],[f108]) ).
fof(f110,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(X0,pred(X1)) ),
inference(cnf_transformation,[status(thm)],[f109]) ).
fof(f199,plain,
succ(tptp_minus_1) = n0,
inference(cnf_transformation,[status(thm)],[f28]) ).
fof(f211,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[status(thm)],[f40]) ).
fof(f244,plain,
? [A] :
( sum(n0,n4,a_select3(q,A,tptp_sum_index)) != n1
& leq(A,tptp_minus_1)
& leq(n0,A) ),
inference(pre_NNF_transformation,[status(thm)],[f54]) ).
fof(f245,plain,
( sum(n0,n4,a_select3(q,sK23_skl,tptp_sum_index)) != n1
& leq(sK23_skl,tptp_minus_1)
& leq(n0,sK23_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl]),skolemize(A,sK23_skl)],[f244]) ).
fof(f246,plain,
leq(n0,sK23_skl),
inference(cnf_transformation,[status(thm)],[f245]) ).
fof(f247,plain,
leq(sK23_skl,tptp_minus_1),
inference(cnf_transformation,[status(thm)],[f245]) ).
fof(f252,plain,
gt(n0,tptp_minus_1),
inference(cnf_transformation,[status(thm)],[f58]) ).
fof(f274,plain,
! [X] :
( X = n0
| ~ leq(X,n0)
| ~ leq(n0,X) ),
inference(pre_NNF_transformation,[status(thm)],[f78]) ).
fof(f275,plain,
! [X0] :
( X0 = n0
| ~ leq(X0,n0)
| ~ leq(n0,X0) ),
inference(cnf_transformation,[status(thm)],[f274]) ).
fof(f326,plain,
pred(n0) = tptp_minus_1,
inference(paramodulation,[status(thm)],[f199,f211]) ).
fof(f430,plain,
! [X0] :
( X0 = n0
| ~ leq(n0,X0)
| ~ gt(n0,X0) ),
inference(resolution,[status(thm)],[f105,f275]) ).
fof(f445,plain,
( sK23_skl = n0
| ~ gt(n0,sK23_skl) ),
inference(resolution,[status(thm)],[f430,f246]) ).
fof(f453,definition,
( sQ12_spl
<=> gt(n0,sK23_skl) ),
introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition]) ).
fof(f455,plain,
( sQ12_spl
| ~ gt(n0,sK23_skl) ),
inference(component_clause,[status(thm)],[f453]) ).
fof(f456,definition,
( sQ13_spl
<=> sK23_skl = n0 ),
introduced(definition,[new_symbols(definition,[sQ13_spl])],[split_symbol_definition]) ).
fof(f457,plain,
( ~ sQ13_spl
| sK23_skl = n0 ),
inference(component_clause,[status(thm)],[f456]) ).
fof(f459,plain,
( sQ13_spl
| ~ sQ12_spl ),
inference(split_clause,[status(thm)],[f445,f453,f456]) ).
fof(f465,plain,
( ~ sQ13_spl
| leq(n0,tptp_minus_1) ),
inference(backward_demodulation,[status(thm)],[f457,f247]) ).
fof(f480,plain,
( ~ sQ13_spl
| tptp_minus_1 = n0
| ~ gt(n0,tptp_minus_1) ),
inference(resolution,[status(thm)],[f465,f430]) ).
fof(f481,definition,
( sQ17_spl
<=> gt(n0,tptp_minus_1) ),
introduced(definition,[new_symbols(definition,[sQ17_spl])],[split_symbol_definition]) ).
fof(f483,plain,
( sQ17_spl
| ~ gt(n0,tptp_minus_1) ),
inference(component_clause,[status(thm)],[f481]) ).
fof(f484,definition,
( sQ18_spl
<=> tptp_minus_1 = n0 ),
introduced(definition,[new_symbols(definition,[sQ18_spl])],[split_symbol_definition]) ).
fof(f485,plain,
( ~ sQ18_spl
| tptp_minus_1 = n0 ),
inference(component_clause,[status(thm)],[f484]) ).
fof(f487,plain,
( ~ sQ13_spl
| sQ18_spl
| ~ sQ17_spl ),
inference(split_clause,[status(thm)],[f480,f481,f484,f456]) ).
fof(f488,plain,
( sQ17_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f483,f252]) ).
fof(f489,plain,
sQ17_spl,
inference(contradiction_clause,[status(thm)],[f488]) ).
fof(f495,plain,
( ~ sQ18_spl
| gt(n0,n0) ),
inference(backward_demodulation,[status(thm)],[f485,f252]) ).
fof(f499,plain,
( ~ sQ18_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f495,f91]) ).
fof(f500,plain,
~ sQ18_spl,
inference(contradiction_clause,[status(thm)],[f499]) ).
fof(f506,plain,
( sQ12_spl
| ~ leq(sK23_skl,pred(n0)) ),
inference(resolution,[status(thm)],[f455,f110]) ).
fof(f542,plain,
( sQ12_spl
| ~ leq(sK23_skl,tptp_minus_1) ),
inference(backward_demodulation,[status(thm)],[f326,f506]) ).
fof(f547,plain,
( sQ12_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f542,f247]) ).
fof(f548,plain,
sQ12_spl,
inference(contradiction_clause,[status(thm)],[f547]) ).
fof(f549,plain,
$false,
inference(sat_refutation,[status(thm)],[f459,f487,f489,f500,f548]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV152+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.07 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/5.45 % Computer : n011.cluster.edu
% 0.20/5.45 % Model : x86_64 x86_64
% 0.20/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/5.45 % Memory : 8046.5625MB
% 0.20/5.45 % OS : Linux 6.8.0-71-generic
% 0.20/5.45 % CPULimit : 300
% 0.20/5.45 % WCLimit : 300
% 0.20/5.45 % DateTime : Mon Sep 21 08:33:15 UTC 2026
% 0.20/5.45 % CPUTime :
% 0.20/5.48 % Drodi V4.1.1
% 0.23/5.54 % Refutation found
% 0.23/5.54 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.23/5.54 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.23/5.58 % Elapsed time: 0.109251 seconds
% 0.23/5.58 % CPU time: 0.357389 seconds
% 0.23/5.58 % Total memory used: 73.665 MB
% 0.23/5.58 % Net memory used: 73.277 MB
%------------------------------------------------------------------------------