%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN051-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n002.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:02 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 1 unt; 5 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 61 ( 29 ~; 27 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 7 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 10 ( 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( big_f(a)
| ~ p ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
( p
| ~ big_f(b) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
! [X] :
( big_f(X)
| p ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
! [X] :
( ~ p
| ~ big_f(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,plain,
( big_f(a)
| ~ p ),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f6,plain,
( p
| ~ big_f(b) ),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f7,plain,
( ! [X] : big_f(X)
| p ),
inference(miniscoping,[status(thm)],[f3]) ).
fof(f8,plain,
! [X0] :
( big_f(X0)
| p ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f9,plain,
( ~ p
| ! [X] : ~ big_f(X) ),
inference(miniscoping,[status(thm)],[f4]) ).
fof(f10,plain,
! [X0] :
( ~ p
| ~ big_f(X0) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f11,definition,
( sQ0_spl
<=> p ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f14,definition,
( sQ1_spl
<=> big_f(a) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f15,plain,
( ~ sQ1_spl
| big_f(a) ),
inference(component_clause,[status(thm)],[f14]) ).
fof(f17,plain,
( sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f5,f11,f14]) ).
fof(f18,definition,
( sQ2_spl
<=> big_f(b) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f20,plain,
( sQ2_spl
| ~ big_f(b) ),
inference(component_clause,[status(thm)],[f18]) ).
fof(f21,plain,
( sQ0_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f6,f18,f11]) ).
fof(f22,definition,
! [X0] :
( sQ3_spl
<=> big_f(X0) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f23,plain,
! [X0] :
( ~ sQ3_spl
| big_f(X0) ),
inference(component_clause,[status(thm)],[f22]) ).
fof(f25,plain,
( sQ3_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f8,f11,f22]) ).
fof(f26,definition,
! [X0] :
( sQ4_spl
<=> ~ big_f(X0) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f27,plain,
! [X0] :
( ~ sQ4_spl
| ~ big_f(X0) ),
inference(component_clause,[status(thm)],[f26]) ).
fof(f29,plain,
( ~ sQ0_spl
| sQ4_spl ),
inference(split_clause,[status(thm)],[f10,f26,f11]) ).
fof(f30,plain,
( ~ sQ3_spl
| ~ sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f23,f27]) ).
fof(f31,plain,
( ~ sQ3_spl
| ~ sQ4_spl ),
inference(contradiction_clause,[status(thm)],[f30]) ).
fof(f32,plain,
( sQ2_spl
| ~ sQ3_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f20,f23]) ).
fof(f33,plain,
( sQ2_spl
| ~ sQ3_spl ),
inference(contradiction_clause,[status(thm)],[f32]) ).
fof(f34,plain,
( ~ sQ1_spl
| ~ sQ4_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f15,f27]) ).
fof(f35,plain,
( ~ sQ1_spl
| ~ sQ4_spl ),
inference(contradiction_clause,[status(thm)],[f34]) ).
fof(f36,plain,
$false,
inference(sat_refutation,[status(thm)],[f17,f21,f25,f29,f31,f33,f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN051-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n002.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 10:42:49 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.13/0.37 % Drodi V4.1.1
% 0.13/0.37 % Refutation found
% 0.13/0.37 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.39 % Elapsed time: 0.026772 seconds
% 0.13/0.39 % CPU time: 0.045066 seconds
% 0.13/0.39 % Total memory used: 2.049 MB
% 0.13/0.39 % Net memory used: 1.982 MB
%------------------------------------------------------------------------------