%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN030-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n011.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.10s 0.38s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 49 ( 25 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 6 ( 5 usr; 6 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
| ~ s
| ~ t ),
file('theBenchmark.p',clause1) ).
cnf(c_1,plain,
( p
| ~ s
| ~ t ),
inference(clausify,[status(thm)],[clause1]) ).
fof(clause2,axiom,
( s
| ~ r ),
file('theBenchmark.p',clause2) ).
cnf(c_2,plain,
( s
| ~ r ),
inference(clausify,[status(thm)],[clause2]) ).
fof(clause4,axiom,
( t
| ~ q
| ~ r ),
file('theBenchmark.p',clause4) ).
cnf(c_4,plain,
( t
| ~ q
| ~ r ),
inference(clausify,[status(thm)],[clause4]) ).
fof(clause5,axiom,
( r
| ~ q ),
file('theBenchmark.p',clause5) ).
cnf(c_5,plain,
( r
| ~ q ),
inference(clausify,[status(thm)],[clause5]) ).
fof(clause6,axiom,
( r
| q ),
file('theBenchmark.p',clause6) ).
cnf(c_6,plain,
( r
| q ),
inference(clausify,[status(thm)],[clause6]) ).
fof(clause7,axiom,
( q
| ~ r ),
file('theBenchmark.p',clause7) ).
cnf(c_7,plain,
( q
| ~ r ),
inference(clausify,[status(thm)],[clause7]) ).
fof(theorem,axiom,
( ~ r
| ~ q
| ~ p ),
file('theBenchmark.p',theorem) ).
cnf(c_9,plain,
( ~ r
| ~ q
| ~ p ),
inference(clausify,[status(thm)],[theorem]) ).
cnf(c_17,plain,
( r
| r ),
inference(resolve,[status(thm)],[c_6,c_5]) ).
cnf(c_10,plain,
r,
inference(copy,[status(thm)],[c_17]) ).
cnf(c_11,plain,
( ~ q
| ~ p ),
inference(resolve,[status(thm)],[c_10,c_9]) ).
cnf(c_12,plain,
q,
inference(resolve,[status(thm)],[c_10,c_7]) ).
cnf(c_18,plain,
( t
| ~ q ),
inference(resolve,[status(thm)],[c_10,c_4]) ).
cnf(c_13,plain,
t,
inference(resolve,[status(thm)],[c_12,c_18]) ).
cnf(c_14,plain,
s,
inference(resolve,[status(thm)],[c_10,c_2]) ).
cnf(c_15,plain,
~ p,
inference(resolve,[status(thm)],[c_12,c_11]) ).
cnf(c_19,plain,
( p
| ~ s ),
inference(resolve,[status(thm)],[c_13,c_1]) ).
cnf(c_20,plain,
p,
inference(resolve,[status(thm)],[c_14,c_19]) ).
cnf(c_16,plain,
$false,
inference(resolve,[status(thm)],[c_15,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN030-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n011.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:04:29 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 1109008 was started by sandbox on n011,
% 0.10/0.37 % Sat Sep 26 17:04:29 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/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 14.
% 0.10/0.38 % Level of proof is 4.
% 0.10/0.38 % Maximum clause weight is 3.000.
% 0.10/0.38 % Given clauses 6.
% 0.10/0.38
% 0.10/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------