%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN389+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 : n011.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:57 PM UTC 2026
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 4 unt; 1 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 20 ( 7 ~; 4 |; 2 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ( p
=> q )
=> p )
=> p ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ( ( p
=> q )
=> p )
=> p ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ~ p
& ( p
| ( ~ q
& p ) ) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f4,plain,
( p
| p ),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f6,plain,
~ p,
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f7,definition,
( sQ0_spl
<=> p ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f8,plain,
( ~ sQ0_spl
| p ),
inference(component_clause,[status(thm)],[f7]) ).
fof(f10,plain,
sQ0_spl,
inference(split_clause,[status(thm)],[f4,f7]) ).
fof(f15,plain,
( ~ sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f8,f6]) ).
fof(f16,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f15]) ).
fof(f17,plain,
$false,
inference(sat_refutation,[status(thm)],[f10,f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN389+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n011.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 10:52:26 UTC 2026
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Drodi V4.1.1
% 0.13/0.38 % Refutation found
% 0.13/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.40 % Elapsed time: 0.039074 seconds
% 0.13/0.40 % CPU time: 0.107700 seconds
% 0.13/0.40 % Total memory used: 15.874 MB
% 0.13/0.40 % Net memory used: 15.263 MB
%------------------------------------------------------------------------------