%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN054+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n009.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 : Theorem 0.08s 0.36s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 5 unt; 2 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 55 ( 25 ~; 21 |; 4 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 20 ( 13 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
~ ? [X] :
( big_q(X)
& big_s(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X] :
( big_p(X)
=> ( big_r(X)
| big_q(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
( ~ ? [X] : big_p(X)
=> ? [Y] : big_q(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X] :
( ( big_r(X)
| big_q(X) )
=> big_s(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,conjecture,
? [X] :
( big_r(X)
& big_p(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
~ ? [X] :
( big_r(X)
& big_p(X) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X] :
( ~ big_q(X)
| ~ big_s(X) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f8,plain,
! [X0] :
( ~ big_q(X0)
| ~ big_s(X0) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f9,plain,
! [X] :
( big_r(X)
| big_q(X)
| ~ big_p(X) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f10,plain,
! [X0] :
( big_r(X0)
| big_q(X0)
| ~ big_p(X0) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f11,plain,
( ? [Y] : big_q(Y)
| ? [X] : big_p(X) ),
inference(pre_NNF_transformation,[status(thm)],[f3]) ).
fof(f12,plain,
( big_q(sK1_skl)
| big_p(sK0_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(X,sK0_skl),skolemize(Y,sK1_skl)],[f11]) ).
fof(f13,plain,
( big_q(sK1_skl)
| big_p(sK0_skl) ),
inference(cnf_transformation,[status(thm)],[f12]) ).
fof(f14,plain,
! [X] :
( big_s(X)
| ( ~ big_r(X)
& ~ big_q(X) ) ),
inference(pre_NNF_transformation,[status(thm)],[f4]) ).
fof(f15,plain,
! [X0] :
( big_s(X0)
| ~ big_q(X0) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f17,plain,
! [X] :
( ~ big_r(X)
| ~ big_p(X) ),
inference(pre_NNF_transformation,[status(thm)],[f6]) ).
fof(f18,plain,
! [X0] :
( ~ big_r(X0)
| ~ big_p(X0) ),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f19,definition,
( sQ0_spl
<=> big_p(sK0_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f20,plain,
( ~ sQ0_spl
| big_p(sK0_skl) ),
inference(component_clause,[status(thm)],[f19]) ).
fof(f22,definition,
( sQ1_spl
<=> big_q(sK1_skl) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f23,plain,
( ~ sQ1_spl
| big_q(sK1_skl) ),
inference(component_clause,[status(thm)],[f22]) ).
fof(f25,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f13,f19,f22]) ).
fof(f26,plain,
! [X0] :
( big_r(X0)
| ~ big_p(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[f10,f27]) ).
fof(f27,plain,
! [X0] : ~ big_q(X0),
inference(forward_subsumption_resolution,[status(thm)],[f15,f8]) ).
fof(f28,plain,
( ~ sQ0_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f20,f29]) ).
fof(f29,plain,
! [X0] : ~ big_p(X0),
inference(forward_subsumption_resolution,[status(thm)],[f26,f18]) ).
fof(f30,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f28]) ).
fof(f31,plain,
( ~ sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f23,f27]) ).
fof(f32,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f31]) ).
fof(f33,plain,
$false,
inference(sat_refutation,[status(thm)],[f25,f30,f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN054+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n009.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:40:42 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.36 % Drodi V4.1.1
% 0.08/0.36 % Refutation found
% 0.08/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.40 % Elapsed time: 0.040197 seconds
% 0.12/0.40 % CPU time: 0.036453 seconds
% 0.12/0.40 % Total memory used: 1.547 MB
% 0.12/0.40 % Net memory used: 1.496 MB
%------------------------------------------------------------------------------