%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV078+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 : n018.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:35 PM UTC 2026
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 11 unt; 5 def)
% Number of atoms : 81 ( 12 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 76 ( 27 ~; 21 |; 17 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 2 ( 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f39,axiom,
! [X] : minus(X,n1) = pred(X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f51,axiom,
true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) )
=> ( ( n0 = pv70
=> true )
& ( n0 != pv70
=> ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) )
=> ( ( n0 = pv70
=> true )
& ( n0 != pv70
=> ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f210,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[status(thm)],[f39]) ).
fof(f242,plain,
true,
inference(cnf_transformation,[status(thm)],[f51]) ).
fof(f244,plain,
( ( ( ~ true
& n0 = pv70 )
| ( ( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31) )
& n0 != pv70 ) )
& leq(pv31,minus(n5,n1))
& leq(n0,pv31) ),
inference(pre_NNF_transformation,[status(thm)],[f54]) ).
fof(f245,definition,
( sP3_prd
<=> ( ( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31) )
& n0 != pv70 ) ),
introduced(definition,[new_symbols(definition,[sP3_prd])],[]) ).
fof(f246,plain,
( ( ( ~ true
& n0 = pv70 )
| sP3_prd )
& leq(pv31,minus(n5,n1))
& leq(n0,pv31) ),
inference(formula_renaming,[status(thm)],[f244,f245]) ).
fof(f247,plain,
leq(n0,pv31),
inference(cnf_transformation,[status(thm)],[f246]) ).
fof(f248,plain,
leq(pv31,minus(n5,n1)),
inference(cnf_transformation,[status(thm)],[f246]) ).
fof(f250,plain,
( ~ true
| sP3_prd ),
inference(cnf_transformation,[status(thm)],[f246]) ).
fof(f317,plain,
( ( ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) )
| n0 = pv70
| sP3_prd )
& ( ( ( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31) )
& n0 != pv70 )
| ~ sP3_prd ) ),
inference(NNF_transformation,[status(thm)],[f245]) ).
fof(f319,plain,
( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31)
| ~ sP3_prd ),
inference(cnf_transformation,[status(thm)],[f317]) ).
fof(f330,definition,
( sQ0_spl
<=> sP3_prd ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f337,definition,
( sQ2_spl
<=> true ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f339,plain,
( sQ2_spl
| ~ true ),
inference(component_clause,[status(thm)],[f337]) ).
fof(f340,plain,
( ~ sQ2_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f250,f330,f337]) ).
fof(f342,definition,
( sQ3_spl
<=> leq(n0,pv31) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f344,plain,
( sQ3_spl
| ~ leq(n0,pv31) ),
inference(component_clause,[status(thm)],[f342]) ).
fof(f345,definition,
( sQ4_spl
<=> leq(pv31,minus(n5,n1)) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f347,plain,
( sQ4_spl
| ~ leq(pv31,minus(n5,n1)) ),
inference(component_clause,[status(thm)],[f345]) ).
fof(f348,plain,
( ~ sQ4_spl
| ~ sQ3_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f319,f330,f342,f345]) ).
fof(f354,plain,
( sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f242,f339]) ).
fof(f355,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f354]) ).
fof(f356,plain,
leq(pv31,pred(n5)),
inference(backward_demodulation,[status(thm)],[f210,f248]) ).
fof(f365,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f247,f344]) ).
fof(f366,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f365]) ).
fof(f367,plain,
( sQ4_spl
| ~ leq(pv31,pred(n5)) ),
inference(forward_demodulation,[status(thm)],[f210,f347]) ).
fof(f371,plain,
( sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f367,f356]) ).
fof(f372,plain,
sQ4_spl,
inference(contradiction_clause,[status(thm)],[f371]) ).
fof(f373,plain,
$false,
inference(sat_refutation,[status(thm)],[f340,f348,f355,f366,f372]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV078+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n018.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:31:44 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.38 % Drodi V4.1.1
% 0.14/0.40 % Refutation found
% 0.14/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.41 % Elapsed time: 0.042520 seconds
% 0.14/0.41 % CPU time: 0.107208 seconds
% 0.14/0.41 % Total memory used: 47.491 MB
% 0.14/0.41 % Net memory used: 47.423 MB
%------------------------------------------------------------------------------