%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN405+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /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 : Sun Sep 27 09:37:49 AM UTC 2026
% Result : Theorem 0.14s 0.36s
% 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 : 21 ( 8 ~; 3 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 ( 2 sgn 6 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish239,conjecture,
( ( ? [Y] : g(Y)
& ! [X] : f(X) )
=> ? [Z] :
( g(Z)
& f(Z) ) ),
file('theBenchmark.p',kalish239) ).
fof(kalish239_neg,negated_conjecture,
~ ( ( ? [Y] : g(Y)
& ! [X] : f(X) )
=> ? [Z] :
( g(Z)
& f(Z) ) ),
inference(assume_negation,[status(cth)],[kalish239]) ).
fof(nnf_1,plain,
( ! [Z] :
( ~ g(Z)
| ~ f(Z) )
& ? [Y] : g(Y)
& ! [X] : f(X) ),
inference(fof_nnf,[status(thm)],[kalish239_neg]) ).
fof(sk_kalish239_neg,plain,
( ! [Z] :
( ~ g(Z)
| ~ f(Z) )
& g(sK0)
& ! [X] : f(X) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(Y,sK0)],[nnf_1]) ).
cnf(c_2,negated_conjecture,
( ~ g(A)
| ~ f(A) ),
inference(split_conjunct,[status(thm)],[sk_kalish239_neg]) ).
cnf(c_3,negated_conjecture,
f(A),
inference(split_conjunct,[status(thm)],[sk_kalish239_neg]) ).
cnf(c_4,negated_conjecture,
g(sK0),
inference(split_conjunct,[status(thm)],[sk_kalish239_neg]) ).
cnf(c_5,negated_conjecture,
~ g(A),
inference(resolve,[status(thm)],[c_2,c_3]) ).
cnf(c_6,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_4,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN405+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n005.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Sat Sep 26 17:40:16 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35 % Process 2675166 was started by sandbox on n005,
% 0.09/0.35 % Sat Sep 26 17:40:16 2026
% 0.09/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.35
% 0.09/0.35 % From the command line: assign(max_seconds, 300).
% 0.14/0.36
% 0.14/0.36 % SZS status Theorem for theBenchmark
% 0.14/0.36
% 0.14/0.36 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.14/0.36 % Length of proof is 6.
% 0.14/0.36 % Level of proof is 3.
% 0.14/0.36 % Maximum clause weight is 0.000.
% 0.14/0.36 % Given clauses 0.
% 0.14/0.36
% 0.14/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------