%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN003-1.006 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.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:14 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.38s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 42 ( 17 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 77 ( 42 ~; 35 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 13 ( 12 usr; 13 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pqp_1,axiom,
( p_2
| ~ q_1
| ~ p_1 ),
file('theBenchmark.p',pqp_1) ).
cnf(c_1,plain,
( p_2
| ~ q_1
| ~ p_1 ),
inference(clausify,[status(thm)],[pqp_1]) ).
fof(pqp_2,axiom,
( p_3
| ~ q_2
| ~ p_2 ),
file('theBenchmark.p',pqp_2) ).
cnf(c_2,plain,
( p_3
| ~ q_2
| ~ p_2 ),
inference(clausify,[status(thm)],[pqp_2]) ).
fof(pqp_3,axiom,
( p_4
| ~ q_3
| ~ p_3 ),
file('theBenchmark.p',pqp_3) ).
cnf(c_3,plain,
( p_4
| ~ q_3
| ~ p_3 ),
inference(clausify,[status(thm)],[pqp_3]) ).
fof(pqp_4,axiom,
( p_5
| ~ q_4
| ~ p_4 ),
file('theBenchmark.p',pqp_4) ).
cnf(c_4,plain,
( p_5
| ~ q_4
| ~ p_4 ),
inference(clausify,[status(thm)],[pqp_4]) ).
fof(pqp_5,axiom,
( p_6
| ~ q_5
| ~ p_5 ),
file('theBenchmark.p',pqp_5) ).
cnf(c_5,plain,
( p_6
| ~ q_5
| ~ p_5 ),
inference(clausify,[status(thm)],[pqp_5]) ).
fof(qq_1,axiom,
( q_1
| ~ q ),
file('theBenchmark.p',qq_1) ).
cnf(c_11,plain,
( q_1
| ~ q ),
inference(clausify,[status(thm)],[qq_1]) ).
fof(qq_2,axiom,
( q_2
| ~ q ),
file('theBenchmark.p',qq_2) ).
cnf(c_12,plain,
( q_2
| ~ q ),
inference(clausify,[status(thm)],[qq_2]) ).
fof(qq_3,axiom,
( q_3
| ~ q ),
file('theBenchmark.p',qq_3) ).
cnf(c_13,plain,
( q_3
| ~ q ),
inference(clausify,[status(thm)],[qq_3]) ).
fof(qq_4,axiom,
( q_4
| ~ q ),
file('theBenchmark.p',qq_4) ).
cnf(c_14,plain,
( q_4
| ~ q ),
inference(clausify,[status(thm)],[qq_4]) ).
fof(qq_5,axiom,
( q_5
| ~ q ),
file('theBenchmark.p',qq_5) ).
cnf(c_15,plain,
( q_5
| ~ q ),
inference(clausify,[status(thm)],[qq_5]) ).
fof(base_1,axiom,
p_1,
file('theBenchmark.p',base_1) ).
cnf(c_21,plain,
p_1,
inference(clausify,[status(thm)],[base_1]) ).
fof(base_2,axiom,
~ p_6,
file('theBenchmark.p',base_2) ).
cnf(c_22,plain,
~ p_6,
inference(clausify,[status(thm)],[base_2]) ).
fof(base_3,axiom,
q,
file('theBenchmark.p',base_3) ).
cnf(c_23,plain,
q,
inference(clausify,[status(thm)],[base_3]) ).
cnf(c_26,plain,
( ~ q_5
| ~ p_5 ),
inference(resolve,[status(thm)],[c_22,c_5]) ).
cnf(c_27,plain,
q_5,
inference(resolve,[status(thm)],[c_15,c_23]) ).
cnf(c_28,plain,
q_4,
inference(resolve,[status(thm)],[c_14,c_23]) ).
cnf(c_29,plain,
q_3,
inference(resolve,[status(thm)],[c_13,c_23]) ).
cnf(c_30,plain,
q_2,
inference(resolve,[status(thm)],[c_12,c_23]) ).
cnf(c_31,plain,
q_1,
inference(resolve,[status(thm)],[c_11,c_23]) ).
cnf(c_48,plain,
~ p_5,
inference(resolve,[status(thm)],[c_27,c_26]) ).
cnf(c_60,plain,
( p_2
| ~ q_1 ),
inference(resolve,[status(thm)],[c_1,c_21]) ).
cnf(c_50,plain,
p_2,
inference(resolve,[status(thm)],[c_60,c_31]) ).
cnf(c_61,plain,
( p_5
| ~ p_4 ),
inference(resolve,[status(thm)],[c_4,c_28]) ).
cnf(c_52,plain,
~ p_4,
inference(resolve,[status(thm)],[c_61,c_48]) ).
cnf(c_62,plain,
( p_4
| ~ p_3 ),
inference(resolve,[status(thm)],[c_3,c_29]) ).
cnf(c_55,plain,
~ p_3,
inference(resolve,[status(thm)],[c_62,c_52]) ).
cnf(c_63,plain,
( p_3
| ~ p_2 ),
inference(resolve,[status(thm)],[c_2,c_30]) ).
cnf(c_58,plain,
~ p_2,
inference(resolve,[status(thm)],[c_63,c_55]) ).
cnf(c_59,plain,
$false,
inference(resolve,[status(thm)],[c_58,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN003-1.006 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n015.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 17:06:45 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 347619 was started by sandbox2 on n015,
% 0.10/0.37 % Sat Sep 26 17:06:45 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.37
% 0.10/0.37 % From the command line: assign(max_seconds, 300).
% 0.10/0.38
% 0.10/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.38
% 0.10/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.38 % Length of proof is 25.
% 0.10/0.38 % Level of proof is 6.
% 0.10/0.38 % Maximum clause weight is 3.000.
% 0.10/0.38 % Given clauses 37.
% 0.10/0.38
% 0.10/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------