%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN060+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 : n005.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:54 AM UTC 2026
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 8 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 5 |; 1 &)
% ( 0 <=>; 3 =>; 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 : 9 ( 0 sgn 4 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel30_1,axiom,
! [X] :
( ( big_g(X)
| big_f(X) )
=> ~ big_h(X) ),
file('theBenchmark.p',pel30_1) ).
fof(pel30_2,axiom,
! [X] :
( ( big_g(X)
=> ~ big_i(X) )
=> ( big_h(X)
& big_f(X) ) ),
file('theBenchmark.p',pel30_2) ).
fof(pel30,conjecture,
! [X] : big_i(X),
file('theBenchmark.p',pel30) ).
fof(pel30_neg,negated_conjecture,
~ ! [X] : big_i(X),
inference(assume_negation,[status(cth)],[pel30]) ).
cnf(c_5,plain,
( ~ big_h(A)
| ~ big_f(A) ),
inference(clausify,[status(thm)],[pel30_1]) ).
cnf(c_6,plain,
( big_f(A)
| big_i(A) ),
inference(clausify,[status(thm)],[pel30_2]) ).
fof(nnf_3,plain,
? [X] : ~ big_i(X),
inference(fof_nnf,[status(thm)],[pel30_neg]) ).
fof(sk_pel30_neg,plain,
~ big_i(sK0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X,sK0)],[nnf_3]) ).
cnf(c_10,negated_conjecture,
~ big_i(sK0),
inference(split_conjunct,[status(thm)],[sk_pel30_neg]) ).
cnf(c_11,plain,
( big_h(A)
| big_i(A) ),
inference(clausify,[status(thm)],[pel30_2]) ).
cnf(c_12,plain,
( ~ big_h(A)
| big_i(A) ),
inference(resolve,[status(thm)],[c_6,c_5]) ).
cnf(c_13,negated_conjecture,
~ big_h(sK0),
inference(resolve,[status(thm)],[c_12,c_10]) ).
cnf(c_14,negated_conjecture,
big_h(sK0),
inference(resolve,[status(thm)],[c_10,c_11]) ).
cnf(c_15,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_13,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN060+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 % Computer : n005.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Sat Sep 26 17:07:47 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.20/0.46 % Process 2616673 was started by sandbox2 on n005,
% 0.20/0.46 % Sat Sep 26 17:07:47 2026
% 0.20/0.46 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.20/0.47
% 0.20/0.47 % From the command line: assign(max_seconds, 300).
% 0.20/0.48
% 0.20/0.48 % SZS status Theorem for theBenchmark
% 0.20/0.48
% 0.20/0.48 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.20/0.48 % Length of proof is 11.
% 0.20/0.48 % Level of proof is 4.
% 0.20/0.48 % Maximum clause weight is 2.000.
% 0.20/0.48 % Given clauses 0.
% 0.20/0.48
% 0.20/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------