%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN934+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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 03:18:21 PM UTC 2026
% Result : Theorem 0.07s 0.37s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 3 unt; 4 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 83 ( 33 ~; 30 |; 9 &)
% ( 6 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 20 ( 10 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ? [X] :
( c
=> p(X) )
<=> ( c
=> ? [X] : p(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ? [X] :
( c
=> p(X) )
<=> ( c
=> ? [X] : p(X) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ? [X] :
( p(X)
| ~ c )
<~> ( ? [X] : p(X)
| ~ c ) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f4,plain,
( ( ( ! [X] : ~ p(X)
& c )
| ! [X] :
( ~ p(X)
& c ) )
& ( ? [X] : p(X)
| ~ c
| ? [X] :
( p(X)
| ~ c ) ) ),
inference(NNF_transformation,[status(thm)],[f3]) ).
fof(f5,plain,
( ( ( ! [X] : ~ p(X)
& c )
| ( ! [X] : ~ p(X)
& c ) )
& ( ? [X] : p(X)
| ~ c
| ? [X] : p(X)
| ~ c ) ),
inference(miniscoping,[status(thm)],[f4]) ).
fof(f6,plain,
( ( ( ! [X] : ~ p(X)
& c )
| ( ! [X] : ~ p(X)
& c ) )
& ( p(sK1_skl)
| ~ c
| p(sK0_skl)
| ~ c ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(X,sK0_skl),skolemize(X,sK1_skl)],[f5]) ).
fof(f7,plain,
( p(sK1_skl)
| ~ c
| p(sK0_skl)
| ~ c ),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f8,plain,
( c
| c ),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f11,plain,
! [X0,X1] :
( ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f12,definition,
( sQ0_spl
<=> c ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f15,definition,
( sQ1_spl
<=> p(sK0_skl) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f16,plain,
( ~ sQ1_spl
| p(sK0_skl) ),
inference(component_clause,[status(thm)],[f15]) ).
fof(f18,definition,
( sQ2_spl
<=> p(sK1_skl) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f19,plain,
( ~ sQ2_spl
| p(sK1_skl) ),
inference(component_clause,[status(thm)],[f18]) ).
fof(f21,plain,
( sQ2_spl
| sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f7,f12,f15,f18]) ).
fof(f22,plain,
sQ0_spl,
inference(split_clause,[status(thm)],[f8,f12]) ).
fof(f23,definition,
! [X0] :
( sQ3_spl
<=> ~ p(X0) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f24,plain,
! [X0] :
( ~ sQ3_spl
| ~ p(X0) ),
inference(component_clause,[status(thm)],[f23]) ).
fof(f28,plain,
sQ3_spl,
inference(split_clause,[status(thm)],[f11,f23]) ).
fof(f29,plain,
( ~ sQ1_spl
| ~ sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f16,f24]) ).
fof(f30,plain,
( ~ sQ1_spl
| ~ sQ3_spl ),
inference(contradiction_clause,[status(thm)],[f29]) ).
fof(f31,plain,
( ~ sQ2_spl
| ~ sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f19,f24]) ).
fof(f32,plain,
( ~ sQ2_spl
| ~ sQ3_spl ),
inference(contradiction_clause,[status(thm)],[f31]) ).
fof(f33,plain,
$false,
inference(sat_refutation,[status(thm)],[f21,f22,f28,f30,f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN934+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n003.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Mon Sep 21 11:31:46 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 % Drodi V4.1.1
% 0.07/0.37 % Refutation found
% 0.07/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.07/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.39 % Elapsed time: 0.036630 seconds
% 0.12/0.39 % CPU time: 0.088331 seconds
% 0.12/0.39 % Total memory used: 11.847 MB
% 0.12/0.39 % Net memory used: 11.413 MB
%------------------------------------------------------------------------------