%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN962+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n019.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:43:27 AM UTC 2026
% Result : Theorem 0.16s 15.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 17 ( 8 ~; 3 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 11 ( 1 sgn 8 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ! [X] : p(X)
=> ( ! [Y] : p(Y)
& ! [X] : p(X) ) ),
file('theBenchmark.p',prove_this) ).
fof(prove_this_neg,negated_conjecture,
~ ( ! [X] : p(X)
=> ( ! [Y] : p(Y)
& ! [X] : p(X) ) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(nnf_1,plain,
( ( ? [Y] : ~ p(Y)
| ? [X] : ~ p(X) )
& ! [X0] : p(X0) ),
inference(fof_nnf,[status(thm)],[prove_this_neg]) ).
fof(sk_prove_this_neg,plain,
( ( ~ p(sK1)
| ~ p(sK0) )
& ! [X0] : p(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X,sK0),skolemize(Y,sK1)],[nnf_1]) ).
cnf(c_2,negated_conjecture,
p(A),
inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).
cnf(c_3,negated_conjecture,
( ~ p(sK1)
| ~ p(sK0) ),
inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).
cnf(c_5,negated_conjecture,
~ p(sK1),
inference(resolve,[status(thm)],[c_2,c_3]) ).
cnf(c_4,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_2,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN962+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/15.44 % Computer : n019.cluster.edu
% 0.16/15.44 % Model : x86_64 x86_64
% 0.16/15.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/15.44 % Memory : 8046.5625MB
% 0.16/15.44 % OS : Linux 6.8.0-71-generic
% 0.16/15.44 % CPULimit : 300
% 0.16/15.44 % WCLimit : 300
% 0.16/15.44 % DateTime : Sat Sep 26 18:52:19 UTC 2026
% 0.16/15.45 % CPUTime :
% 0.16/15.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/15.45 % Process 1954387 was started by sandbox on n019,
% 0.16/15.45 % Sat Sep 26 18:52:19 2026
% 0.16/15.45 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.16/15.45
% 0.16/15.45 % From the command line: assign(max_seconds, 300).
% 0.16/15.46
% 0.16/15.46 % SZS status Theorem for theBenchmark
% 0.16/15.46
% 0.16/15.46 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.16/15.46 % Length of proof is 4.
% 0.16/15.46 % Level of proof is 2.
% 0.16/15.46 % Maximum clause weight is 2.000.
% 0.16/15.46 % Given clauses 0.
% 0.16/15.46
% 0.16/15.46 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------