%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN724-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.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:17:10 PM UTC 2026
% Result : Unsatisfiable 0.08s 5.39s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 29 ( 1 unt; 4 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 66 ( 30 ~; 32 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 5 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 2 ( 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [A] :
( ~ r(A)
| s(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
( r(sk2)
| r(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
( ~ s(sk2)
| ~ r(sk2)
| r(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
( ~ s(sk1)
| r(sk2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
( ~ s(sk2)
| ~ s(sk1)
| ~ r(sk2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,plain,
! [X0] :
( ~ r(X0)
| s(X0) ),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f7,plain,
( r(sk2)
| r(sk1) ),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f8,plain,
( ~ s(sk2)
| ~ r(sk2)
| r(sk1) ),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f9,plain,
( ~ s(sk1)
| r(sk2) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f10,plain,
( ~ s(sk2)
| ~ s(sk1)
| ~ r(sk2) ),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f11,definition,
( sQ0_spl
<=> r(sk1) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f12,plain,
( ~ sQ0_spl
| r(sk1) ),
inference(component_clause,[status(thm)],[f11]) ).
fof(f14,definition,
( sQ1_spl
<=> r(sk2) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f15,plain,
( ~ sQ1_spl
| r(sk2) ),
inference(component_clause,[status(thm)],[f14]) ).
fof(f17,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f7,f11,f14]) ).
fof(f18,definition,
( sQ2_spl
<=> s(sk2) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f20,plain,
( sQ2_spl
| ~ s(sk2) ),
inference(component_clause,[status(thm)],[f18]) ).
fof(f21,plain,
( ~ sQ2_spl
| ~ sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f8,f11,f14,f18]) ).
fof(f22,definition,
( sQ3_spl
<=> s(sk1) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f24,plain,
( sQ3_spl
| ~ s(sk1) ),
inference(component_clause,[status(thm)],[f22]) ).
fof(f25,plain,
( ~ sQ3_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f9,f14,f22]) ).
fof(f26,plain,
( ~ sQ2_spl
| ~ sQ3_spl
| ~ sQ1_spl ),
inference(split_clause,[status(thm)],[f10,f14,f22,f18]) ).
fof(f27,plain,
( ~ sQ0_spl
| s(sk1) ),
inference(resolution,[status(thm)],[f6,f12]) ).
fof(f28,plain,
( ~ sQ0_spl
| sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f27,f24]) ).
fof(f29,plain,
( ~ sQ0_spl
| sQ3_spl ),
inference(contradiction_clause,[status(thm)],[f28]) ).
fof(f30,plain,
( ~ sQ1_spl
| s(sk2) ),
inference(resolution,[status(thm)],[f15,f6]) ).
fof(f31,plain,
( ~ sQ1_spl
| sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f30,f20]) ).
fof(f32,plain,
( ~ sQ1_spl
| sQ2_spl ),
inference(contradiction_clause,[status(thm)],[f31]) ).
fof(f33,plain,
$false,
inference(sat_refutation,[status(thm)],[f17,f21,f25,f26,f29,f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN724-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/5.36 % Computer : n020.cluster.edu
% 0.08/5.36 % Model : x86_64 x86_64
% 0.08/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.36 % Memory : 8046.5625MB
% 0.08/5.36 % OS : Linux 6.8.0-71-generic
% 0.08/5.36 % CPULimit : 300
% 0.08/5.36 % WCLimit : 300
% 0.08/5.36 % DateTime : Mon Sep 21 11:14:24 UTC 2026
% 0.08/5.36 % CPUTime :
% 0.08/5.37 % Drodi V4.1.1
% 0.08/5.39 % Refutation found
% 0.08/5.39 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.08/5.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/5.42 % Elapsed time: 0.045340 seconds
% 0.12/5.42 % CPU time: 0.112273 seconds
% 0.12/5.42 % Total memory used: 16.444 MB
% 0.12/5.42 % Net memory used: 15.854 MB
%------------------------------------------------------------------------------