%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN055+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 : n026.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:03 PM UTC 2026
% Result : Theorem 0.11s 5.55s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 7 unt; 2 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 66 ( 29 ~; 23 |; 9 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 3 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 23 ( 18 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X] : big_p(X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X] :
( big_f(X)
=> ( big_r(X)
& ~ big_g(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X] :
( big_p(X)
=> ( big_f(X)
& big_g(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
( ? [Z] :
( big_r(Z)
& big_p(Z) )
| ! [X] :
( big_p(X)
=> big_q(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,conjecture,
? [X] :
( big_p(X)
& big_q(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
~ ? [X] :
( big_p(X)
& big_q(X) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
big_p(sK0_skl),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(X,sK0_skl)],[f1]) ).
fof(f8,plain,
big_p(sK0_skl),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f9,plain,
! [X] :
( ( big_r(X)
& ~ big_g(X) )
| ~ big_f(X) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f10,plain,
! [X0] :
( ~ big_g(X0)
| ~ big_f(X0) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f12,plain,
! [X] :
( ( big_f(X)
& big_g(X) )
| ~ big_p(X) ),
inference(pre_NNF_transformation,[status(thm)],[f3]) ).
fof(f13,plain,
! [X0] :
( big_g(X0)
| ~ big_p(X0) ),
inference(cnf_transformation,[status(thm)],[f12]) ).
fof(f14,plain,
! [X0] :
( big_f(X0)
| ~ big_p(X0) ),
inference(cnf_transformation,[status(thm)],[f12]) ).
fof(f15,plain,
( ? [Z] :
( big_r(Z)
& big_p(Z) )
| ! [X] :
( big_q(X)
| ~ big_p(X) ) ),
inference(pre_NNF_transformation,[status(thm)],[f4]) ).
fof(f16,plain,
( ( big_r(sK1_skl)
& big_p(sK1_skl) )
| ! [X] :
( big_q(X)
| ~ big_p(X) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl]),skolemize(Z,sK1_skl)],[f15]) ).
fof(f17,plain,
! [X0] :
( big_p(sK1_skl)
| big_q(X0)
| ~ big_p(X0) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f19,plain,
! [X] :
( ~ big_p(X)
| ~ big_q(X) ),
inference(pre_NNF_transformation,[status(thm)],[f6]) ).
fof(f20,plain,
! [X0] :
( ~ big_p(X0)
| ~ big_q(X0) ),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f21,definition,
! [X0] :
( sQ0_spl
<=> ( big_q(X0)
| ~ big_p(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f22,plain,
! [X0] :
( ~ sQ0_spl
| big_q(X0)
| ~ big_p(X0) ),
inference(component_clause,[status(thm)],[f21]) ).
fof(f24,definition,
( sQ1_spl
<=> big_p(sK1_skl) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f25,plain,
( ~ sQ1_spl
| big_p(sK1_skl) ),
inference(component_clause,[status(thm)],[f24]) ).
fof(f27,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f17,f21,f24]) ).
fof(f33,plain,
( ~ sQ0_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f8,f34]) ).
fof(f34,plain,
! [X0] :
( ~ sQ0_spl
| ~ big_p(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f22,f20]) ).
fof(f35,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f33]) ).
fof(f36,plain,
! [X0] :
( ~ big_f(X0)
| ~ big_p(X0) ),
inference(resolution,[status(thm)],[f13,f10]) ).
fof(f37,plain,
! [X0] : ~ big_p(X0),
inference(forward_subsumption_resolution,[status(thm)],[f36,f14]) ).
fof(f38,plain,
( ~ sQ1_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f25,f37]) ).
fof(f39,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f38]) ).
fof(f40,plain,
$false,
inference(sat_refutation,[status(thm)],[f27,f35,f39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN055+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/5.53 % Computer : n026.cluster.edu
% 0.11/5.53 % Model : x86_64 x86_64
% 0.11/5.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.53 % Memory : 8046.5625MB
% 0.11/5.53 % OS : Linux 6.8.0-71-generic
% 0.11/5.53 % CPULimit : 300
% 0.11/5.53 % WCLimit : 300
% 0.11/5.53 % DateTime : Mon Sep 21 10:43:42 UTC 2026
% 0.11/5.53 % CPUTime :
% 0.11/5.54 % Drodi V4.1.1
% 0.11/5.55 % Refutation found
% 0.11/5.55 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/5.55 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/5.57 % Elapsed time: 0.033831 seconds
% 0.11/5.57 % CPU time: 0.081914 seconds
% 0.11/5.57 % Total memory used: 8.786 MB
% 0.11/5.57 % Net memory used: 8.507 MB
%------------------------------------------------------------------------------