%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN943+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:18:32 PM UTC 2026
% Result : Theorem 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 5 unt; 3 def)
% Number of atoms : 120 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 135 ( 44 ~; 50 |; 30 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 4 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 35 ( 23 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [A] :
? [X,X2,X3,X4,Y] :
( ( ( s(A,Y)
=> p(Y) )
& ( e(X2)
=> ( c(f(X2))
| g(X2) ) )
& ( e(X)
=> ( s(X,f(X))
| g(X) ) )
& e(A)
& p(A) )
=> ( ( c(X4)
& p(X4) )
| ( g(X3)
& p(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ! [A] :
? [X,X2,X3,X4,Y] :
( ( ( s(A,Y)
=> p(Y) )
& ( e(X2)
=> ( c(f(X2))
| g(X2) ) )
& ( e(X)
=> ( s(X,f(X))
| g(X) ) )
& e(A)
& p(A) )
=> ( ( c(X4)
& p(X4) )
| ( g(X3)
& p(X3) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [A] :
! [X,X2,X3,X4,Y] :
( ( ~ c(X4)
| ~ p(X4) )
& ( ~ g(X3)
| ~ p(X3) )
& ( p(Y)
| ~ s(A,Y) )
& ( c(f(X2))
| g(X2)
| ~ e(X2) )
& ( s(X,f(X))
| g(X)
| ~ e(X) )
& e(A)
& p(A) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f4,plain,
( ! [X4] :
( ~ c(X4)
| ~ p(X4) )
& ! [X3] :
( ~ g(X3)
| ~ p(X3) )
& ? [A] :
( ! [Y] :
( p(Y)
| ~ s(A,Y) )
& ! [X2] :
( c(f(X2))
| g(X2)
| ~ e(X2) )
& ! [X] :
( s(X,f(X))
| g(X)
| ~ e(X) )
& e(A)
& p(A) ) ),
inference(miniscoping,[status(thm)],[f3]) ).
fof(f5,plain,
( ! [X4] :
( ~ c(X4)
| ~ p(X4) )
& ! [X3] :
( ~ g(X3)
| ~ p(X3) )
& ! [Y] :
( p(Y)
| ~ s(sK0_skl,Y) )
& ! [X2] :
( c(f(X2))
| g(X2)
| ~ e(X2) )
& ! [X] :
( s(X,f(X))
| g(X)
| ~ e(X) )
& e(sK0_skl)
& p(sK0_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(A,sK0_skl)],[f4]) ).
fof(f6,plain,
p(sK0_skl),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f7,plain,
e(sK0_skl),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f8,plain,
! [X0] :
( s(X0,f(X0))
| g(X0)
| ~ e(X0) ),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f9,plain,
! [X0] :
( c(f(X0))
| g(X0)
| ~ e(X0) ),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f10,plain,
! [X0] :
( p(X0)
| ~ s(sK0_skl,X0) ),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f11,plain,
! [X0] :
( ~ g(X0)
| ~ p(X0) ),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f12,plain,
! [X0] :
( ~ c(X0)
| ~ p(X0) ),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f13,plain,
( g(sK0_skl)
| ~ e(sK0_skl)
| p(f(sK0_skl)) ),
inference(resolution,[status(thm)],[f10,f8]) ).
fof(f14,definition,
( sQ0_spl
<=> p(f(sK0_skl)) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f15,plain,
( ~ sQ0_spl
| p(f(sK0_skl)) ),
inference(component_clause,[status(thm)],[f14]) ).
fof(f17,definition,
( sQ1_spl
<=> e(sK0_skl) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f19,plain,
( sQ1_spl
| ~ e(sK0_skl) ),
inference(component_clause,[status(thm)],[f17]) ).
fof(f20,definition,
( sQ2_spl
<=> g(sK0_skl) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f21,plain,
( ~ sQ2_spl
| g(sK0_skl) ),
inference(component_clause,[status(thm)],[f20]) ).
fof(f23,plain,
( sQ2_spl
| ~ sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f13,f14,f17,f20]) ).
fof(f24,plain,
( ~ sQ2_spl
| ~ p(sK0_skl) ),
inference(resolution,[status(thm)],[f21,f11]) ).
fof(f25,plain,
( ~ sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f24,f6]) ).
fof(f26,plain,
~ sQ2_spl,
inference(contradiction_clause,[status(thm)],[f25]) ).
fof(f27,plain,
! [X0] :
( ~ p(f(X0))
| g(X0)
| ~ e(X0) ),
inference(resolution,[status(thm)],[f9,f12]) ).
fof(f28,plain,
( ~ sQ0_spl
| g(sK0_skl)
| ~ e(sK0_skl) ),
inference(resolution,[status(thm)],[f27,f15]) ).
fof(f29,plain,
( ~ sQ0_spl
| sQ2_spl
| ~ sQ1_spl ),
inference(split_clause,[status(thm)],[f28,f17,f20,f14]) ).
fof(f30,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f19,f7]) ).
fof(f31,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f30]) ).
fof(f32,plain,
$false,
inference(sat_refutation,[status(thm)],[f23,f26,f29,f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN943+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n003.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Mon Sep 21 11:32:16 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Drodi V4.1.1
% 0.12/0.38 % Refutation found
% 0.12/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.41 % Elapsed time: 0.043691 seconds
% 0.12/0.41 % CPU time: 0.110656 seconds
% 0.12/0.41 % Total memory used: 16.595 MB
% 0.12/0.41 % Net memory used: 16.046 MB
%------------------------------------------------------------------------------