%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV077+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 : n019.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.12s 0.39s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 8 unt; 5 def)
% Number of atoms : 88 ( 10 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 94 ( 34 ~; 28 |; 21 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f51,axiom,
true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) )
=> ( ( n0 = pv40
=> true )
& ( n0 != pv40
=> ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) )
& leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) )
=> ( ( n0 = pv40
=> true )
& ( n0 != pv40
=> ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) )
& leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f242,plain,
true,
inference(cnf_transformation,[status(thm)],[f51]) ).
fof(f244,plain,
( ( ( ~ true
& n0 = pv40 )
| ( ( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31) )
& n0 != pv40 )
| ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31) )
& 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 != pv40 ) ),
introduced(definition,[new_symbols(definition,[sP3_prd])],[]) ).
fof(f246,plain,
( ( ( ~ true
& n0 = pv40 )
| sP3_prd
| ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31) )
& 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
| ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31) ),
inference(cnf_transformation,[status(thm)],[f246]) ).
fof(f317,plain,
( ( ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) )
| n0 = pv40
| sP3_prd )
& ( ( ( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31) )
& n0 != pv40 )
| ~ 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
<=> leq(n0,pv31) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f332,plain,
( sQ0_spl
| ~ leq(n0,pv31) ),
inference(component_clause,[status(thm)],[f330]) ).
fof(f333,definition,
( sQ1_spl
<=> leq(pv31,minus(n5,n1)) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f335,plain,
( sQ1_spl
| ~ leq(pv31,minus(n5,n1)) ),
inference(component_clause,[status(thm)],[f333]) ).
fof(f336,definition,
( sQ2_spl
<=> sP3_prd ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f343,definition,
( sQ4_spl
<=> true ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f345,plain,
( sQ4_spl
| ~ true ),
inference(component_clause,[status(thm)],[f343]) ).
fof(f346,plain,
( ~ sQ4_spl
| sQ2_spl
| ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f250,f330,f333,f336,f343]) ).
fof(f348,plain,
( ~ sQ1_spl
| ~ sQ0_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f319,f336,f330,f333]) ).
fof(f354,plain,
( sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f242,f345]) ).
fof(f355,plain,
sQ4_spl,
inference(contradiction_clause,[status(thm)],[f354]) ).
fof(f359,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f335,f248]) ).
fof(f360,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f359]) ).
fof(f386,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f332,f247]) ).
fof(f387,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f386]) ).
fof(f388,plain,
$false,
inference(sat_refutation,[status(thm)],[f346,f348,f355,f360,f387]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV077+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n019.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Mon Sep 21 08:29:50 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.12/0.37 % Drodi V4.1.1
% 0.12/0.39 % Refutation found
% 0.12/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.43 % Elapsed time: 0.059071 seconds
% 0.12/0.43 % CPU time: 0.162724 seconds
% 0.12/0.43 % Total memory used: 108.506 MB
% 0.12/0.43 % Net memory used: 108.330 MB
%------------------------------------------------------------------------------