%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN047+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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:15:00 PM UTC 2026
% Result : Theorem 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 52 ( 1 unt; 10 def)
% Number of atoms : 185 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 208 ( 75 ~; 93 |; 21 &)
% ( 12 <=>; 4 =>; 0 <=; 3 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 15 ( 14 usr; 15 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ( ( q
=> r )
& p )
=> s )
<=> ( ( s
| ~ r
| ~ p )
& ( s
| q
| ~ p ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ( ( ( q
=> r )
& p )
=> s )
<=> ( ( s
| ~ r
| ~ p )
& ( s
| q
| ~ p ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ( s
| ( ~ r
& q )
| ~ p )
<~> ( ( s
| ~ r
| ~ p )
& ( s
| q
| ~ p ) ) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f4,definition,
( sP0_prd
<=> ( ( ~ r
& q )
| ~ p ) ),
introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).
fof(f5,definition,
( sP1_prd
<=> ( s
| q
| ~ p ) ),
introduced(definition,[new_symbols(definition,[sP1_prd])],[]) ).
fof(f6,plain,
( ( s
| sP0_prd )
<~> ( ( s
| ~ r
| ~ p )
& sP1_prd ) ),
inference(formula_renaming,[status(thm)],[f3,f5,f4]) ).
fof(f7,definition,
( sP2_prd
<=> ( s
| ~ r
| ~ p ) ),
introduced(definition,[new_symbols(definition,[sP2_prd])],[]) ).
fof(f8,plain,
( ( s
| sP0_prd )
<~> ( sP2_prd
& sP1_prd ) ),
inference(formula_renaming,[status(thm)],[f6,f7]) ).
fof(f9,plain,
( ( ~ sP2_prd
| ~ sP1_prd
| ( ~ s
& ~ sP0_prd ) )
& ( ( sP2_prd
& sP1_prd )
| s
| sP0_prd ) ),
inference(NNF_transformation,[status(thm)],[f8]) ).
fof(f10,plain,
( sP1_prd
| s
| sP0_prd ),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f11,plain,
( sP2_prd
| s
| sP0_prd ),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f12,plain,
( ~ sP2_prd
| ~ sP1_prd
| ~ sP0_prd ),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f13,plain,
( ~ sP2_prd
| ~ sP1_prd
| ~ s ),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f14,plain,
( ( ( ( r
| ~ q )
& p )
| sP0_prd )
& ( ( ~ r
& q )
| ~ p
| ~ sP0_prd ) ),
inference(NNF_transformation,[status(thm)],[f4]) ).
fof(f15,plain,
( q
| ~ p
| ~ sP0_prd ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f16,plain,
( ~ r
| ~ p
| ~ sP0_prd ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f17,plain,
( p
| sP0_prd ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f18,plain,
( r
| ~ q
| sP0_prd ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f19,plain,
( ( ( ~ s
& ~ q
& p )
| sP1_prd )
& ( s
| q
| ~ p
| ~ sP1_prd ) ),
inference(NNF_transformation,[status(thm)],[f5]) ).
fof(f20,plain,
( s
| q
| ~ p
| ~ sP1_prd ),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f21,plain,
( p
| sP1_prd ),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f22,plain,
( ~ q
| sP1_prd ),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f23,plain,
( ~ s
| sP1_prd ),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f24,plain,
( ( ( ~ s
& r
& p )
| sP2_prd )
& ( s
| ~ r
| ~ p
| ~ sP2_prd ) ),
inference(NNF_transformation,[status(thm)],[f7]) ).
fof(f25,plain,
( s
| ~ r
| ~ p
| ~ sP2_prd ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f26,plain,
( p
| sP2_prd ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f27,plain,
( r
| sP2_prd ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f28,plain,
( ~ s
| sP2_prd ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f29,definition,
( sQ0_spl
<=> sP0_prd ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f32,definition,
( sQ1_spl
<=> s ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f35,definition,
( sQ2_spl
<=> sP1_prd ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f38,plain,
( sQ2_spl
| sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f10,f29,f32,f35]) ).
fof(f39,definition,
( sQ3_spl
<=> sP2_prd ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f42,plain,
( sQ3_spl
| sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f11,f29,f32,f39]) ).
fof(f43,plain,
( ~ sQ3_spl
| ~ sQ2_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f12,f29,f35,f39]) ).
fof(f44,plain,
( ~ sQ3_spl
| ~ sQ2_spl
| ~ sQ1_spl ),
inference(split_clause,[status(thm)],[f13,f32,f35,f39]) ).
fof(f45,definition,
( sQ4_spl
<=> p ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f48,definition,
( sQ5_spl
<=> q ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f51,plain,
( sQ5_spl
| ~ sQ4_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f15,f29,f45,f48]) ).
fof(f52,definition,
( sQ6_spl
<=> r ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f55,plain,
( ~ sQ6_spl
| ~ sQ4_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f16,f29,f45,f52]) ).
fof(f56,plain,
( sQ4_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f17,f29,f45]) ).
fof(f57,plain,
( sQ6_spl
| ~ sQ5_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f18,f29,f48,f52]) ).
fof(f58,plain,
( sQ1_spl
| sQ5_spl
| ~ sQ4_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f20,f35,f45,f48,f32]) ).
fof(f59,plain,
( sQ4_spl
| sQ2_spl ),
inference(split_clause,[status(thm)],[f21,f35,f45]) ).
fof(f60,plain,
( ~ sQ5_spl
| sQ2_spl ),
inference(split_clause,[status(thm)],[f22,f35,f48]) ).
fof(f61,plain,
( ~ sQ1_spl
| sQ2_spl ),
inference(split_clause,[status(thm)],[f23,f35,f32]) ).
fof(f62,plain,
( sQ1_spl
| ~ sQ6_spl
| ~ sQ4_spl
| ~ sQ3_spl ),
inference(split_clause,[status(thm)],[f25,f39,f45,f52,f32]) ).
fof(f63,plain,
( sQ4_spl
| sQ3_spl ),
inference(split_clause,[status(thm)],[f26,f39,f45]) ).
fof(f64,plain,
( sQ6_spl
| sQ3_spl ),
inference(split_clause,[status(thm)],[f27,f39,f52]) ).
fof(f65,plain,
( ~ sQ1_spl
| sQ3_spl ),
inference(split_clause,[status(thm)],[f28,f39,f32]) ).
fof(f66,plain,
$false,
inference(sat_refutation,[status(thm)],[f38,f42,f43,f44,f51,f55,f56,f57,f58,f59,f60,f61,f62,f63,f64,f65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN047+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n010.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 10:40:55 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.35 % Drodi V4.1.1
% 0.12/0.36 % Refutation found
% 0.12/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.39 % Elapsed time: 0.040109 seconds
% 0.12/0.39 % CPU time: 0.105885 seconds
% 0.12/0.39 % Total memory used: 16.668 MB
% 0.12/0.39 % Net memory used: 16.205 MB
%------------------------------------------------------------------------------