%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN266-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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:26 AM UTC 2026
% Result : Unsatisfiable 0.16s 0.71s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of formulae : 51 ( 22 unt; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 96 ( 53 ~; 43 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 76 ( 21 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rule_001,axiom,
! [VAR_0,VAR_1] :
( ~ n0(VAR_1,VAR_0)
| k1(VAR_0) ),
file('theBenchmark.p',rule_001) ).
cnf(c_1,plain,
( ~ n0(B,A)
| k1(A) ),
inference(clausify,[status(thm)],[rule_001]) ).
fof(axiom_37,axiom,
n0(b,a),
file('theBenchmark.p',axiom_37) ).
cnf(c_2,plain,
n0(b,a),
inference(clausify,[status(thm)],[axiom_37]) ).
fof(axiom_26,axiom,
n0(d,c),
file('theBenchmark.p',axiom_26) ).
cnf(c_5,plain,
n0(d,c),
inference(clausify,[status(thm)],[axiom_26]) ).
fof(rule_063,axiom,
! [VAR_0,VAR_1] :
( ~ k0(VAR_1)
| ~ n0(d,VAR_0)
| p1(VAR_0,VAR_0,VAR_1) ),
file('theBenchmark.p',rule_063) ).
cnf(c_15,plain,
( ~ k0(B)
| ~ n0(d,A)
| p1(A,A,B) ),
inference(clausify,[status(thm)],[rule_063]) ).
fof(rule_137,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p1(VAR_1,VAR_2,VAR_0)
| n2(VAR_0) ),
file('theBenchmark.p',rule_137) ).
cnf(c_46,plain,
( ~ p1(B,C,A)
| n2(A) ),
inference(clausify,[status(thm)],[rule_137]) ).
fof(rule_234,axiom,
! [VAR_0] :
( ~ p2(VAR_0,e,e)
| ~ n2(e)
| m3(VAR_0,e,e) ),
file('theBenchmark.p',rule_234) ).
cnf(c_54,plain,
( ~ p2(A,e,e)
| ~ n2(e)
| m3(A,e,e) ),
inference(clausify,[status(thm)],[rule_234]) ).
cnf(c_178,plain,
( ~ p1(B,C,e)
| ~ p2(A,e,e)
| m3(A,e,e) ),
inference(resolve,[status(thm)],[c_54,c_46]) ).
cnf(c_242,plain,
( ~ k0(A)
| p1(c,c,A) ),
inference(resolve,[status(thm)],[c_15,c_5]) ).
cnf(c_263,plain,
k1(a),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(prove_this,axiom,
~ p3(b,e,e),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ p3(b,e,e),
inference(clausify,[status(thm)],[prove_this]) ).
fof(rule_251,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ p2(VAR_0,VAR_1,VAR_3)
| ~ m3(VAR_1,VAR_2,VAR_3)
| p3(VAR_0,VAR_1,VAR_1) ),
file('theBenchmark.p',rule_251) ).
cnf(c_302,plain,
( ~ p2(A,B,D)
| ~ m3(B,C,D)
| p3(A,B,B) ),
inference(clausify,[status(thm)],[rule_251]) ).
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_155,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p2(e,VAR_0,VAR_1)
| ~ k1(VAR_2)
| p2(VAR_0,VAR_1,VAR_1) ),
file('theBenchmark.p',rule_155) ).
cnf(c_351,plain,
( ~ p2(e,A,B)
| ~ k1(C)
| p2(A,B,B) ),
inference(clausify,[status(thm)],[rule_155]) ).
fof(rule_153,axiom,
! [VAR_0] :
( ~ n1(d,d,VAR_0)
| p2(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_153) ).
cnf(c_353,plain,
( ~ n1(d,d,A)
| p2(A,A,A) ),
inference(clausify,[status(thm)],[rule_153]) ).
fof(rule_059,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ m0(VAR_1,VAR_2,VAR_0)
| ~ m0(VAR_2,VAR_3,VAR_3)
| n1(VAR_0,VAR_0,VAR_1) ),
file('theBenchmark.p',rule_059) ).
cnf(c_424,plain,
( ~ m0(B,C,A)
| ~ m0(C,D,D)
| n1(A,A,B) ),
inference(clausify,[status(thm)],[rule_059]) ).
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_28,axiom,
k0(e),
file('theBenchmark.p',axiom_28) ).
cnf(c_477,plain,
k0(e),
inference(clausify,[status(thm)],[axiom_28]) ).
fof(axiom_19,axiom,
! [VAR_0,VAR_1] : m0(VAR_0,d,VAR_1),
file('theBenchmark.p',axiom_19) ).
cnf(c_485,plain,
m0(A,d,B),
inference(clausify,[status(thm)],[axiom_19]) ).
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]) ).
cnf(c_641,plain,
( ~ p2(b,e,B)
| ~ m3(e,A,B) ),
inference(resolve,[status(thm)],[c_302,c_264]) ).
cnf(c_854,plain,
( ~ m0(B,C,A)
| n1(A,A,B) ),
inference(resolve,[status(thm)],[c_424,c_485]) ).
cnf(c_696,plain,
n1(A,A,B),
inference(resolve,[status(thm)],[c_854,c_485]) ).
cnf(c_699,plain,
p2(A,A,A),
inference(resolve,[status(thm)],[c_696,c_353]) ).
cnf(c_855,plain,
( ~ r0(A)
| m1(A,B,A) ),
inference(resolve,[status(thm)],[c_466,c_489]) ).
cnf(c_753,plain,
m1(b,A,b),
inference(resolve,[status(thm)],[c_855,c_492]) ).
cnf(c_856,plain,
( ~ p1(A,B,e)
| ~ p2(e,e,e)
| ~ p2(b,e,e) ),
inference(resolve,[status(thm)],[c_641,c_178]) ).
cnf(c_826,plain,
( ~ p1(A,B,e)
| ~ p2(b,e,e) ),
inference(resolve,[status(thm)],[c_699,c_856]) ).
cnf(c_857,plain,
( ~ k0(e)
| ~ p2(b,e,e) ),
inference(resolve,[status(thm)],[c_826,c_242]) ).
cnf(c_842,plain,
~ p2(b,e,e),
inference(resolve,[status(thm)],[c_477,c_857]) ).
cnf(c_858,plain,
( ~ p2(e,b,e)
| ~ k1(A) ),
inference(resolve,[status(thm)],[c_351,c_842]) ).
cnf(c_847,plain,
~ p2(e,b,e),
inference(resolve,[status(thm)],[c_858,c_263]) ).
cnf(c_859,plain,
~ m1(b,e,b),
inference(resolve,[status(thm)],[c_847,c_335]) ).
cnf(c_853,plain,
$false,
inference(resolve,[status(thm)],[c_753,c_859]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN266-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.52 % Computer : n017.cluster.edu
% 0.09/0.52 % Model : x86_64 x86_64
% 0.09/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.52 % Memory : 8046.5625MB
% 0.09/0.52 % OS : Linux 6.8.0-71-generic
% 0.09/0.52 % CPULimit : 300
% 0.09/0.52 % WCLimit : 300
% 0.09/0.52 % DateTime : Sat Sep 26 17:23:34 UTC 2026
% 0.09/0.52 % CPUTime :
% 0.09/0.52 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.52 % Process 1256862 was started by sandbox on n017,
% 0.09/0.52 % Sat Sep 26 17:23:34 2026
% 0.09/0.52 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.54
% 0.09/0.54 % From the command line: assign(max_seconds, 300).
% 0.16/0.71
% 0.16/0.71 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.71
% 0.16/0.71 % Proof 1 at 0.11 (+ 0.01) seconds.
% 0.16/0.71 % Length of proof is 28.
% 0.16/0.71 % Level of proof is 6.
% 0.16/0.71 % Maximum clause weight is 17.000.
% 0.16/0.71 % Given clauses 343.
% 0.16/0.71
% 0.16/0.71 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------