%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN922+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 : n026.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:22 AM UTC 2026
% Result : Theorem 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 4 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 62 ( 23 ~; 23 |; 14 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 29 ( 6 sgn 20 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ! [X] :
( q(X)
& p(X) )
<=> ( ! [X] : q(X)
& ! [X] : p(X) ) ),
file('theBenchmark.p',prove_this) ).
fof(prove_this_neg,negated_conjecture,
~ ( ! [X] :
( q(X)
& p(X) )
<=> ( ! [X] : q(X)
& ! [X] : p(X) ) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(nnf_1,plain,
( ( ? [X] : ~ q(X)
| ? [X4] : ~ p(X4)
| ? [X3] :
( ~ q(X3)
| ~ p(X3) ) )
& ( ( ! [X2] : q(X2)
& ! [X1] : p(X1) )
| ! [X0] :
( q(X0)
& p(X0) ) ) ),
inference(fof_nnf,[status(thm)],[prove_this_neg]) ).
fof(sk_prove_this_neg_sk,plain,
( ( ~ q(sK2)
| ~ p(sK1)
| ~ q(sK0)
| ~ p(sK0) )
& ( ( ! [X2] : q(X2)
& ! [X1] : p(X1) )
| ! [X0] :
( q(X0)
& p(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X3,sK0),skolemize(X4,sK1),skolemize(X,sK2)],[nnf_1]) ).
fof(sk_prove_this_neg,plain,
( ( ~ q(sK2)
| ~ p(sK1)
| ~ q(sK0)
| ~ p(sK0) )
& ! [VAR_0,VAR_1] :
( q(VAR_1)
| q(VAR_0) )
& ! [VAR_0,VAR_1] :
( p(VAR_1)
| q(VAR_0) )
& ! [VAR_0,VAR_1] :
( q(VAR_1)
| p(VAR_0) )
& ! [VAR_0,VAR_1] :
( p(VAR_1)
| p(VAR_0) ) ),
inference(cnf_transformation,[status(thm)],[sk_prove_this_neg_sk]) ).
cnf(c_2,negated_conjecture,
( p(B)
| p(A) ),
inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).
cnf(c_4,negated_conjecture,
( q(B)
| q(A) ),
inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).
cnf(c_5,negated_conjecture,
( ~ q(sK2)
| ~ p(sK1)
| ~ q(sK0)
| ~ p(sK0) ),
inference(split_conjunct,[status(thm)],[sk_prove_this_neg]) ).
cnf(c_6,plain,
p(A),
inference(factor,[status(thm)],[c_2]) ).
cnf(c_7,plain,
q(A),
inference(factor,[status(thm)],[c_4]) ).
cnf(c_9,negated_conjecture,
( ~ q(sK2)
| ~ p(sK1)
| ~ q(sK0) ),
inference(resolve,[status(thm)],[c_6,c_5]) ).
cnf(c_10,negated_conjecture,
( ~ q(sK2)
| ~ p(sK1) ),
inference(resolve,[status(thm)],[c_7,c_9]) ).
cnf(c_11,negated_conjecture,
~ q(sK2),
inference(resolve,[status(thm)],[c_6,c_10]) ).
cnf(c_8,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_7,c_11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN922+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 18:52:40 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 1706992 was started by sandbox on n026,
% 0.10/0.37 % Sat Sep 26 18:52:40 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.37
% 0.10/0.37 % From the command line: assign(max_seconds, 300).
% 0.14/0.38
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38
% 0.14/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.14/0.38 % Length of proof is 7.
% 0.14/0.38 % Level of proof is 3.
% 0.14/0.38 % Maximum clause weight is 8.000.
% 0.14/0.38 % Given clauses 0.
% 0.14/0.38
% 0.14/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------