%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN191-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/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:37:15 AM UTC 2026
% Result : Unsatisfiable 0.23s 0.64s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 33 ( 17 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 63 ( 35 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 41 ( 8 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,axiom,
~ r3(c,b,c),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ r3(c,b,c),
inference(clausify,[status(thm)],[prove_this]) ).
fof(rule_267,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p2(VAR_0,VAR_2,VAR_1)
| r3(VAR_0,VAR_1,VAR_0) ),
file('theBenchmark.p',rule_267) ).
cnf(c_294,plain,
( ~ p2(A,C,B)
| r3(A,B,A) ),
inference(clausify,[status(thm)],[rule_267]) ).
fof(rule_176,axiom,
! [VAR_0,VAR_1] :
( ~ m1(VAR_1,VAR_0,VAR_1)
| p2(VAR_0,VAR_1,VAR_0) ),
file('theBenchmark.p',rule_176) ).
cnf(c_335,plain,
( ~ m1(B,A,B)
| p2(A,B,A) ),
inference(clausify,[status(thm)],[rule_176]) ).
fof(rule_152,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p2(VAR_0,VAR_1,VAR_0)
| ~ p0(VAR_0,VAR_1)
| ~ n1(VAR_2,VAR_1,VAR_2)
| p2(VAR_0,VAR_1,VAR_1) ),
file('theBenchmark.p',rule_152) ).
cnf(c_354,plain,
( ~ p2(A,B,A)
| ~ p0(A,B)
| ~ n1(C,B,C)
| p2(A,B,B) ),
inference(clausify,[status(thm)],[rule_152]) ).
fof(rule_050,axiom,
! [VAR_0,VAR_1] :
( ~ p0(b,VAR_1)
| ~ l0(VAR_0)
| ~ s0(b)
| n1(VAR_0,VAR_1,VAR_0) ),
file('theBenchmark.p',rule_050) ).
cnf(c_431,plain,
( ~ p0(b,B)
| ~ l0(A)
| ~ s0(b)
| n1(A,B,A) ),
inference(clausify,[status(thm)],[rule_050]) ).
fof(rule_007,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ r0(VAR_0)
| ~ p0(VAR_2,VAR_1)
| m1(VAR_0,VAR_1,VAR_0) ),
file('theBenchmark.p',rule_007) ).
cnf(c_466,plain,
( ~ r0(A)
| ~ p0(C,B)
| m1(A,B,A) ),
inference(clausify,[status(thm)],[rule_007]) ).
fof(axiom_24,axiom,
l0(c),
file('theBenchmark.p',axiom_24) ).
cnf(c_480,plain,
l0(c),
inference(clausify,[status(thm)],[axiom_24]) ).
fof(axiom_18,axiom,
p0(c,b),
file('theBenchmark.p',axiom_18) ).
cnf(c_486,plain,
p0(c,b),
inference(clausify,[status(thm)],[axiom_18]) ).
fof(axiom_14,axiom,
! [VAR_0] : p0(b,VAR_0),
file('theBenchmark.p',axiom_14) ).
cnf(c_489,plain,
p0(b,A),
inference(clausify,[status(thm)],[axiom_14]) ).
fof(axiom_9,axiom,
r0(b),
file('theBenchmark.p',axiom_9) ).
cnf(c_492,plain,
r0(b),
inference(clausify,[status(thm)],[axiom_9]) ).
fof(axiom_5,axiom,
s0(b),
file('theBenchmark.p',axiom_5) ).
cnf(c_494,plain,
s0(b),
inference(clausify,[status(thm)],[axiom_5]) ).
cnf(c_833,plain,
( ~ p0(b,B)
| ~ l0(A)
| n1(A,B,A) ),
inference(resolve,[status(thm)],[c_494,c_431]) ).
cnf(c_591,plain,
( ~ l0(A)
| n1(A,B,A) ),
inference(resolve,[status(thm)],[c_489,c_833]) ).
cnf(c_642,plain,
~ p2(c,A,b),
inference(resolve,[status(thm)],[c_294,c_264]) ).
cnf(c_834,plain,
( ~ r0(A)
| m1(A,B,A) ),
inference(resolve,[status(thm)],[c_466,c_489]) ).
cnf(c_754,plain,
m1(b,A,b),
inference(resolve,[status(thm)],[c_834,c_492]) ).
cnf(c_767,plain,
n1(c,A,c),
inference(resolve,[status(thm)],[c_591,c_480]) ).
cnf(c_835,plain,
( ~ p2(c,b,c)
| ~ p0(c,b)
| ~ n1(A,b,A) ),
inference(resolve,[status(thm)],[c_642,c_354]) ).
cnf(c_773,plain,
( ~ p2(c,b,c)
| ~ n1(A,b,A) ),
inference(resolve,[status(thm)],[c_486,c_835]) ).
cnf(c_836,plain,
( ~ m1(b,c,b)
| ~ n1(A,b,A) ),
inference(resolve,[status(thm)],[c_773,c_335]) ).
cnf(c_831,plain,
~ n1(A,b,A),
inference(resolve,[status(thm)],[c_754,c_836]) ).
cnf(c_832,plain,
$false,
inference(resolve,[status(thm)],[c_831,c_767]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN191-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.43 % Computer : n018.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Sat Sep 26 17:22:06 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.44 % Process 980071 was started by sandbox2 on n018,
% 0.18/0.44 % Sat Sep 26 17:22:06 2026
% 0.18/0.44 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/0.46
% 0.18/0.46 % From the command line: assign(max_seconds, 300).
% 0.23/0.64
% 0.23/0.64 % SZS status Unsatisfiable for theBenchmark
% 0.23/0.64
% 0.23/0.64 % Proof 1 at 0.15 (+ 0.02) seconds.
% 0.23/0.64 % Length of proof is 18.
% 0.23/0.64 % Level of proof is 4.
% 0.23/0.64 % Maximum clause weight is 20.000.
% 0.23/0.64 % Given clauses 333.
% 0.23/0.64
% 0.23/0.64 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------