%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN029-1 : 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 : n019.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:16 AM UTC 2026
% Result : Unsatisfiable 0.15s 5.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 24 ( 12 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause1,axiom,
( p
| q ),
file('theBenchmark.p',clause1) ).
cnf(c_1,plain,
( p
| q ),
inference(clausify,[status(thm)],[clause1]) ).
fof(clause2,axiom,
( q
| ~ p ),
file('theBenchmark.p',clause2) ).
cnf(c_2,plain,
( q
| ~ p ),
inference(clausify,[status(thm)],[clause2]) ).
fof(clause3,axiom,
( p
| ~ q
| ~ r ),
file('theBenchmark.p',clause3) ).
cnf(c_3,plain,
( p
| ~ q
| ~ r ),
inference(clausify,[status(thm)],[clause3]) ).
fof(clause4,axiom,
r,
file('theBenchmark.p',clause4) ).
cnf(c_4,plain,
r,
inference(clausify,[status(thm)],[clause4]) ).
fof(prove_something,axiom,
( ~ q
| ~ p ),
file('theBenchmark.p',prove_something) ).
cnf(c_5,plain,
( ~ q
| ~ p ),
inference(clausify,[status(thm)],[prove_something]) ).
cnf(c_6,plain,
( p
| ~ q ),
inference(resolve,[status(thm)],[c_4,c_3]) ).
cnf(c_10,plain,
( p
| p ),
inference(resolve,[status(thm)],[c_6,c_1]) ).
cnf(c_7,plain,
p,
inference(copy,[status(thm)],[c_10]) ).
cnf(c_8,plain,
~ q,
inference(resolve,[status(thm)],[c_7,c_5]) ).
cnf(c_11,plain,
q,
inference(resolve,[status(thm)],[c_7,c_2]) ).
cnf(c_9,plain,
$false,
inference(resolve,[status(thm)],[c_8,c_11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN029-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/5.38 % Computer : n019.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Sat Sep 26 17:04:54 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/5.38 % Process 1796389 was started by sandbox2 on n019,
% 0.11/5.38 % Sat Sep 26 17:04:54 2026
% 0.11/5.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/5.39
% 0.11/5.39 % From the command line: assign(max_seconds, 300).
% 0.15/5.40
% 0.15/5.40 % SZS status Unsatisfiable for theBenchmark
% 0.15/5.40
% 0.15/5.40 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/5.40 % Length of proof is 9.
% 0.15/5.40 % Level of proof is 4.
% 0.15/5.40 % Maximum clause weight is 3.000.
% 0.15/5.40 % Given clauses 5.
% 0.15/5.40
% 0.15/5.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------