%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN011-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/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:14:55 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 34 ( 4 unt; 7 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 61 ( 25 ~; 29 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 3 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,negated_conjecture,
( ~ t
| ~ n ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
( n
| q
| m ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
( ~ m
| l ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
( ~ q
| l ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
( ~ p
| ~ l ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
( n
| p
| r ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,negated_conjecture,
( ~ l
| ~ r ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,negated_conjecture,
t,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,plain,
( ~ t
| ~ n ),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f10,plain,
( n
| q
| m ),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f11,plain,
( ~ m
| l ),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f12,plain,
( ~ q
| l ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f13,plain,
( ~ p
| ~ l ),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f14,plain,
( n
| p
| r ),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f15,plain,
( ~ l
| ~ r ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f16,plain,
t,
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f17,definition,
( sQ0_spl
<=> n ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f20,definition,
( sQ1_spl
<=> t ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f22,plain,
( sQ1_spl
| ~ t ),
inference(component_clause,[status(thm)],[f20]) ).
fof(f23,plain,
( ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f9,f17,f20]) ).
fof(f24,definition,
( sQ2_spl
<=> m ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f27,definition,
( sQ3_spl
<=> q ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f30,plain,
( sQ0_spl
| sQ3_spl
| sQ2_spl ),
inference(split_clause,[status(thm)],[f10,f24,f27,f17]) ).
fof(f31,definition,
( sQ4_spl
<=> l ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f34,plain,
( ~ sQ2_spl
| sQ4_spl ),
inference(split_clause,[status(thm)],[f11,f31,f24]) ).
fof(f35,plain,
( ~ sQ3_spl
| sQ4_spl ),
inference(split_clause,[status(thm)],[f12,f31,f27]) ).
fof(f36,definition,
( sQ5_spl
<=> p ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f39,plain,
( ~ sQ5_spl
| ~ sQ4_spl ),
inference(split_clause,[status(thm)],[f13,f31,f36]) ).
fof(f40,definition,
( sQ6_spl
<=> r ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f43,plain,
( sQ0_spl
| sQ5_spl
| sQ6_spl ),
inference(split_clause,[status(thm)],[f14,f40,f36,f17]) ).
fof(f44,plain,
( ~ sQ4_spl
| ~ sQ6_spl ),
inference(split_clause,[status(thm)],[f15,f40,f31]) ).
fof(f45,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f22,f16]) ).
fof(f46,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f45]) ).
fof(f47,plain,
$false,
inference(sat_refutation,[status(thm)],[f23,f30,f34,f35,f39,f43,f44,f46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN011-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n020.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 10:40:02 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 % Drodi V4.1.1
% 0.13/0.39 % Refutation found
% 0.13/0.39 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.41 % Elapsed time: 0.045415 seconds
% 0.13/0.41 % CPU time: 0.116915 seconds
% 0.13/0.41 % Total memory used: 16.468 MB
% 0.13/0.41 % Net memory used: 15.939 MB
%------------------------------------------------------------------------------