%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN055+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 : n014.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:36:53 AM UTC 2026
% Result : Theorem 0.10s 0.39s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 6 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 5 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 10 ( 1 sgn 2 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel25_1,axiom,
? [X] : big_p(X),
file('theBenchmark.p',pel25_1) ).
fof(pel25_2,axiom,
! [X] :
( big_f(X)
=> ( big_r(X)
& ~ big_g(X) ) ),
file('theBenchmark.p',pel25_2) ).
fof(pel25_3,axiom,
! [X] :
( big_p(X)
=> ( big_f(X)
& big_g(X) ) ),
file('theBenchmark.p',pel25_3) ).
cnf(c_6,plain,
( big_f(A)
| ~ big_p(A) ),
inference(clausify,[status(thm)],[pel25_3]) ).
cnf(c_8,plain,
( ~ big_g(A)
| ~ big_f(A) ),
inference(clausify,[status(thm)],[pel25_2]) ).
cnf(c_9,plain,
( big_g(A)
| ~ big_p(A) ),
inference(clausify,[status(thm)],[pel25_3]) ).
cnf(c_10,plain,
( ~ big_g(A)
| ~ big_p(A) ),
inference(resolve,[status(thm)],[c_6,c_8]) ).
cnf(c_13,plain,
( ~ big_p(A)
| ~ big_p(A) ),
inference(resolve,[status(thm)],[c_9,c_10]) ).
cnf(c_14,plain,
~ big_p(A),
inference(copy,[status(thm)],[c_13]) ).
fof(nnf_1,plain,
? [X] : big_p(X),
inference(fof_nnf,[status(thm)],[pel25_1]) ).
fof(sk_pel25_1,plain,
big_p(sK0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X,sK0)],[nnf_1]) ).
cnf(c_15,plain,
big_p(sK0),
inference(split_conjunct,[status(thm)],[sk_pel25_1]) ).
cnf(c_16,plain,
$false,
inference(resolve,[status(thm)],[c_14,c_15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN055+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n014.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 17:07:18 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.38 % Process 3685058 was started by sandbox2 on n014,
% 0.10/0.38 % Sat Sep 26 17:07:18 2026
% 0.10/0.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 0.10/0.39
% 0.10/0.39 % SZS status Theorem for theBenchmark
% 0.10/0.39
% 0.10/0.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.39 % Length of proof is 11.
% 0.10/0.39 % Level of proof is 5.
% 0.10/0.39 % Maximum clause weight is 2.000.
% 0.10/0.39 % Given clauses 0.
% 0.10/0.39
% 0.10/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------