%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN394+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 : n005.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:59 PM UTC 2026
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 4 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 20 ( 7 ~; 3 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 14 ( 13 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X] :
( f(X)
=> g(X) )
=> ( ! [Y] : f(Y)
=> ! [Z] : g(Z) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ ( ! [X] :
( f(X)
=> g(X) )
=> ( ! [Y] : f(Y)
=> ! [Z] : g(Z) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ? [Z] : ~ g(Z)
& ! [Y] : f(Y)
& ! [X] :
( g(X)
| ~ f(X) ) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f4,plain,
( ~ g(sK0_skl)
& ! [Y] : f(Y)
& ! [X] :
( g(X)
| ~ f(X) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(Z,sK0_skl)],[f3]) ).
fof(f5,plain,
! [X0] :
( g(X0)
| ~ f(X0) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f6,plain,
! [X0] : f(X0),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f7,plain,
~ g(sK0_skl),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f9,plain,
! [X0] : g(X0),
inference(forward_subsumption_resolution,[status(thm)],[f5,f6]) ).
fof(f10,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f7,f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN394+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.36 % Computer : n005.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 10:52:49 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.14/0.37 % Drodi V4.1.1
% 0.14/0.40 % Refutation found
% 0.14/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.43 % Elapsed time: 0.051244 seconds
% 0.14/0.43 % CPU time: 0.140565 seconds
% 0.14/0.43 % Total memory used: 55.207 MB
% 0.14/0.43 % Net memory used: 54.531 MB
%------------------------------------------------------------------------------