%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN963+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 : n013.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:28 AM UTC 2026
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 3 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 23 ( 10 ~; 8 |; 3 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 15 ( 3 sgn 6 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ? [X] : p(X)
<=> ? [Y] : p(Y) ),
file('theBenchmark.p',prove_this) ).
fof(prove_this_neg,negated_conjecture,
~ ( ? [X] : p(X)
<=> ? [Y] : p(Y) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(nnf_1,plain,
( ( ! [Y] : ~ p(Y)
| ! [X] : ~ p(X) )
& ( ? [X1] : p(X1)
| ? [X0] : p(X0) ) ),
inference(fof_nnf,[status(thm)],[prove_this_neg]) ).
fof(sk_prove_this_neg_sk,plain,
( ( ! [Y] : ~ p(Y)
| ! [X] : ~ p(X) )
& ( p(sK1)
| p(sK0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[nnf_1]) ).
fof(sk_prove_this_neg,plain,
( ! [VAR_0,VAR_1] :
( ~ p(VAR_1)
| ~ p(VAR_0) )
& ( p(sK1)
| p(sK0) ) ),
inference(cnf_transformation,[status(thm)],[sk_prove_this_neg_sk]) ).
cnf(c_2,negated_conjecture,
( p(sK1)
| p(sK0) ),
inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).
cnf(c_3,negated_conjecture,
( ~ p(B)
| ~ p(A) ),
inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).
cnf(c_4,plain,
~ p(A),
inference(factor,[status(thm)],[c_3]) ).
cnf(c_6,negated_conjecture,
p(sK1),
inference(resolve,[status(thm)],[c_4,c_2]) ).
cnf(c_5,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_4,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN963+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n013.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 18:51:51 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 3395420 was started by sandbox on n013,
% 0.09/0.35 % Sat Sep 26 18:51:51 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.13/0.36
% 0.13/0.36 % SZS status Theorem for theBenchmark
% 0.13/0.36
% 0.13/0.36 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.36 % Length of proof is 5.
% 0.13/0.36 % Level of proof is 3.
% 0.13/0.36 % Maximum clause weight is 4.000.
% 0.13/0.36 % Given clauses 0.
% 0.13/0.36
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------