%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN009-3 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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:15 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.37s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 150 ( 72 ~; 78 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 70 ( 3 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause_9,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_9) ).
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_9]) ).
fof(clause_1,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ t(VAR_0,VAR_1,VAR_2)
| ~ p(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',clause_1) ).
cnf(c_2,plain,
( ~ t(A,B,C)
| ~ p(A,B,C) ),
inference(clausify,[status(thm)],[clause_1]) ).
fof(clause_10,axiom,
! [VAR_0,VAR_1,VAR_2] :
( v(VAR_0,VAR_1,VAR_2)
| t(VAR_0,VAR_1,VAR_2)
| ~ u(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',clause_10) ).
cnf(c_3,plain,
( v(A,B,C)
| t(A,B,C)
| ~ u(A,B,C) ),
inference(clausify,[status(thm)],[clause_10]) ).
cnf(c_4,plain,
( ~ t(A,B,C)
| r(A,B,C)
| q(A,B,C)
| ~ s(C)
| ~ s(B)
| ~ s(A) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(clause_3,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ t(VAR_0,VAR_1,VAR_2)
| ~ r(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',clause_3) ).
cnf(c_5,plain,
( ~ t(A,B,C)
| ~ r(A,B,C) ),
inference(clausify,[status(thm)],[clause_3]) ).
fof(clause_2,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ t(VAR_0,VAR_1,VAR_2)
| ~ q(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',clause_2) ).
cnf(c_6,plain,
( ~ t(A,B,C)
| ~ q(A,B,C) ),
inference(clausify,[status(thm)],[clause_2]) ).
cnf(c_7,plain,
( r(A,B,C)
| q(A,B,C)
| ~ s(C)
| ~ s(B)
| ~ s(A)
| v(A,B,C)
| ~ u(A,B,C) ),
inference(resolve,[status(thm)],[c_3,c_4]) ).
cnf(c_8,plain,
( v(A,B,C)
| ~ u(A,B,C)
| ~ q(A,B,C) ),
inference(resolve,[status(thm)],[c_6,c_3]) ).
cnf(c_9,plain,
( v(A,B,C)
| ~ u(A,B,C)
| ~ r(A,B,C) ),
inference(resolve,[status(thm)],[c_5,c_3]) ).
cnf(c_10,plain,
( v(A,B,C)
| ~ u(A,B,C)
| r(A,B,C)
| ~ s(C)
| ~ s(B)
| ~ s(A)
| v(A,B,C)
| ~ u(A,B,C) ),
inference(resolve,[status(thm)],[c_7,c_8]) ).
cnf(c_11,plain,
( v(A,B,C)
| ~ u(A,B,C)
| ~ s(C)
| ~ s(B)
| ~ s(A)
| v(A,B,C)
| ~ u(A,B,C)
| v(A,B,C)
| ~ u(A,B,C) ),
inference(resolve,[status(thm)],[c_9,c_10]) ).
cnf(c_24,plain,
( v(A,B,C)
| ~ u(A,B,C)
| ~ s(C)
| ~ s(B)
| ~ s(A)
| v(A,B,C)
| v(A,B,C)
| ~ u(A,B,C) ),
inference(copy,[status(thm)],[c_11]) ).
cnf(c_25,plain,
( v(A,B,C)
| ~ u(A,B,C)
| ~ s(C)
| ~ s(B)
| ~ s(A)
| v(A,B,C)
| ~ u(A,B,C) ),
inference(copy,[status(thm)],[c_24]) ).
cnf(c_26,plain,
( v(A,B,C)
| ~ s(C)
| ~ s(B)
| ~ s(A)
| v(A,B,C)
| ~ u(A,B,C) ),
inference(copy,[status(thm)],[c_25]) ).
cnf(c_12,plain,
( ~ s(C)
| ~ s(B)
| ~ s(A)
| v(A,B,C)
| ~ u(A,B,C) ),
inference(copy,[status(thm)],[c_26]) ).
fof(clause_6,axiom,
s(c),
file('theBenchmark.p',clause_6) ).
cnf(c_15,plain,
s(c),
inference(clausify,[status(thm)],[clause_6]) ).
fof(clause_7,axiom,
! [VAR_0,VAR_1,VAR_2] : ~ v(VAR_0,VAR_1,VAR_2),
file('theBenchmark.p',clause_7) ).
cnf(c_16,plain,
~ v(A,B,C),
inference(clausify,[status(thm)],[clause_7]) ).
fof(clause_8,axiom,
u(c,c,c),
file('theBenchmark.p',clause_8) ).
cnf(c_17,plain,
u(c,c,c),
inference(clausify,[status(thm)],[clause_8]) ).
cnf(c_27,plain,
( ~ s(B)
| ~ s(A)
| v(A,A,B)
| ~ u(A,A,B) ),
inference(factor,[status(thm)],[c_12]) ).
cnf(c_18,plain,
( ~ s(B)
| ~ s(A)
| ~ u(A,A,B) ),
inference(resolve,[status(thm)],[c_16,c_27]) ).
cnf(c_28,plain,
( ~ s(c)
| ~ s(c) ),
inference(resolve,[status(thm)],[c_18,c_17]) ).
cnf(c_29,plain,
~ s(c),
inference(copy,[status(thm)],[c_28]) ).
cnf(c_23,plain,
$false,
inference(resolve,[status(thm)],[c_15,c_29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN009-3 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n018.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 17:06:07 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 946411 was started by sandbox on n018,
% 0.09/0.36 % Sat Sep 26 17:06:07 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.36
% 0.09/0.36 % From the command line: assign(max_seconds, 300).
% 0.09/0.37
% 0.09/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.37
% 0.09/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.37 % Length of proof is 17.
% 0.09/0.37 % Level of proof is 7.
% 0.09/0.37 % Maximum clause weight is 14.000.
% 0.09/0.37 % Given clauses 6.
% 0.09/0.37
% 0.09/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------