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