%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN951+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 : n017.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:26 AM UTC 2026
% Result : Theorem 0.18s 0.45s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 36 ( 11 ~; 6 |; 13 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 9 ( 1 sgn 3 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ? [X] : p(X)
=> ( ( a
=> ( ( q
=> q )
& ( ~ b
| b ) ) )
& ? [X] : p(X) ) ),
file('theBenchmark.p',prove_this) ).
fof(prove_this_neg,negated_conjecture,
~ ( ? [X] : p(X)
=> ( ( a
=> ( ( q
=> q )
& ( ~ b
| b ) ) )
& ? [X] : p(X) ) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(nnf_1,plain,
( ( ( ( ( ~ q
& q )
| ( b
& ~ b ) )
& a )
| ! [X] : ~ p(X) )
& ? [X0] : p(X0) ),
inference(fof_nnf,[status(thm)],[prove_this_neg]) ).
fof(sk_prove_this_neg_sk,plain,
( ( ( ( ( ~ q
& q )
| ( b
& ~ b ) )
& a )
| ! [X] : ~ p(X) )
& p(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[nnf_1]) ).
fof(sk_prove_this_neg,plain,
( ! [VAR_0] : ~ p(VAR_0)
& p(sK0) ),
inference(cnf_transformation,[status(thm)],[sk_prove_this_neg_sk]) ).
cnf(c_2,negated_conjecture,
~ p(A),
inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).
cnf(c_3,negated_conjecture,
p(sK0),
inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).
cnf(c_4,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_2,c_3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN951+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.18/0.43 % Computer : n017.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Sat Sep 26 18:47:04 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.44 % Process 1422840 was started by sandbox on n017,
% 0.18/0.44 % Sat Sep 26 18:47:04 2026
% 0.18/0.44 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.18/0.45
% 0.18/0.45 % From the command line: assign(max_seconds, 300).
% 0.18/0.45
% 0.18/0.45 % SZS status Theorem for theBenchmark
% 0.18/0.45
% 0.18/0.45 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.18/0.45 % Length of proof is 4.
% 0.18/0.45 % Level of proof is 2.
% 0.18/0.45 % Maximum clause weight is 0.000.
% 0.18/0.45 % Given clauses 0.
% 0.18/0.45
% 0.18/0.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------