%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN728-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 : n001.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:11 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 2 unt; 4 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 66 ( 34 ~; 28 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 29 ( 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [C,A,B] :
( ~ p(A,B)
| p(C,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
! [A] :
( p(A,sk1(A))
| m(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
! [A] :
( p(A,sk1(A))
| q(f(A,sk1(A))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
! [A] :
( ~ q(A)
| ~ m(g(A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
! [A] :
( ~ p(g(sk2),A)
| ~ p(sk2,sk2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,plain,
( ! [A,B] : ~ p(A,B)
| ! [C] : p(C,C) ),
inference(miniscoping,[status(thm)],[f1]) ).
fof(f7,plain,
! [X0,X1,X2] :
( ~ p(X1,X2)
| p(X0,X0) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f8,plain,
! [X0] :
( p(X0,sk1(X0))
| m(X0) ),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f9,plain,
! [X0] :
( p(X0,sk1(X0))
| q(f(X0,sk1(X0))) ),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f10,plain,
! [X0] :
( ~ q(X0)
| ~ m(g(X0)) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f11,plain,
( ! [A] : ~ p(g(sk2),A)
| ~ p(sk2,sk2) ),
inference(miniscoping,[status(thm)],[f5]) ).
fof(f12,plain,
! [X0] :
( ~ p(g(sk2),X0)
| ~ p(sk2,sk2) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f13,definition,
! [X0] :
( sQ0_spl
<=> p(X0,X0) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f14,plain,
! [X0] :
( ~ sQ0_spl
| p(X0,X0) ),
inference(component_clause,[status(thm)],[f13]) ).
fof(f16,definition,
! [X1,X2] :
( sQ1_spl
<=> ~ p(X1,X2) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f17,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ p(X0,X1) ),
inference(component_clause,[status(thm)],[f16]) ).
fof(f19,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f7,f13,f16]) ).
fof(f20,definition,
( sQ2_spl
<=> p(sk2,sk2) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f22,plain,
( sQ2_spl
| ~ p(sk2,sk2) ),
inference(component_clause,[status(thm)],[f20]) ).
fof(f23,definition,
! [X0] :
( sQ3_spl
<=> ~ p(g(sk2),X0) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f24,plain,
! [X0] :
( ~ sQ3_spl
| ~ p(g(sk2),X0) ),
inference(component_clause,[status(thm)],[f23]) ).
fof(f26,plain,
( sQ3_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f12,f20,f23]) ).
fof(f27,plain,
( sQ2_spl
| ~ sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f22,f14]) ).
fof(f28,plain,
( sQ2_spl
| ~ sQ0_spl ),
inference(contradiction_clause,[status(thm)],[f27]) ).
fof(f29,plain,
! [X0] :
( ~ sQ1_spl
| m(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f8,f17]) ).
fof(f30,plain,
! [X0] :
( ~ sQ1_spl
| ~ q(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f10,f29]) ).
fof(f31,plain,
! [X0] :
( ~ sQ1_spl
| p(X0,sk1(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[f9,f30]) ).
fof(f32,plain,
( ~ sQ1_spl
| $false ),
inference(resolution,[status(thm)],[f31,f17]) ).
fof(f33,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f32]) ).
fof(f34,plain,
( ~ sQ0_spl
| ~ sQ3_spl
| $false ),
inference(resolution,[status(thm)],[f24,f14]) ).
fof(f35,plain,
( ~ sQ0_spl
| ~ sQ3_spl ),
inference(contradiction_clause,[status(thm)],[f34]) ).
fof(f36,plain,
$false,
inference(sat_refutation,[status(thm)],[f19,f26,f28,f33,f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN728-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 11:19:15 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Drodi V4.1.1
% 0.09/0.38 % Refutation found
% 0.09/0.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.41 % Elapsed time: 0.042276 seconds
% 0.09/0.41 % CPU time: 0.110250 seconds
% 0.09/0.41 % Total memory used: 16.493 MB
% 0.09/0.41 % Net memory used: 15.882 MB
%------------------------------------------------------------------------------