%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN063+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:55 AM UTC 2026
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 4 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 34 ( 10 ~; 14 |; 4 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 9 ( 5 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel33,conjecture,
( ! [X] :
( ( ( big_p(X)
=> big_p(b) )
& big_p(a) )
=> big_p(c) )
<=> ! [X1] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ) ),
file('theBenchmark.p',pel33) ).
fof(pel33_neg,negated_conjecture,
~ ( ! [X] :
( ( ( big_p(X)
=> big_p(b) )
& big_p(a) )
=> big_p(c) )
<=> ! [X1] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ) ),
inference(assume_negation,[status(cth)],[pel33]) ).
cnf(c_2,negated_conjecture,
( big_p(B)
| big_p(c)
| big_p(A)
| ~ big_p(a) ),
inference(clausify,[status(thm)],[pel33_neg]) ).
cnf(c_4,negated_conjecture,
big_p(a),
inference(clausify,[status(thm)],[pel33_neg]) ).
cnf(c_6,negated_conjecture,
~ big_p(c),
inference(clausify,[status(thm)],[pel33_neg]) ).
cnf(c_9,plain,
( big_p(A)
| big_p(c)
| ~ big_p(a) ),
inference(factor,[status(thm)],[c_2]) ).
cnf(c_10,negated_conjecture,
( big_p(A)
| big_p(c) ),
inference(resolve,[status(thm)],[c_4,c_9]) ).
cnf(c_7,negated_conjecture,
big_p(A),
inference(resolve,[status(thm)],[c_6,c_10]) ).
cnf(c_8,plain,
$false,
inference(resolve,[status(thm)],[c_7,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN063+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n003.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 26 17:09:55 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.12/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.35 % Process 3378086 was started by sandbox on n003,
% 0.12/0.35 % Sat Sep 26 17:09:55 2026
% 0.12/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.12/0.36
% 0.12/0.36 % From the command line: assign(max_seconds, 300).
% 0.12/0.37
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37
% 0.12/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.12/0.37 % Length of proof is 6.
% 0.12/0.37 % Level of proof is 3.
% 0.12/0.37 % Maximum clause weight is 8.000.
% 0.12/0.37 % Given clauses 0.
% 0.12/0.37
% 0.12/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------