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