%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN115-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 : n004.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:05 AM UTC 2026
% Result : Unsatisfiable 0.16s 10.54s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 42 ( 20 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 81 ( 44 ~; 37 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 51 ( 12 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_34,axiom,
n0(c,d),
file('theBenchmark.p',axiom_34) ).
cnf(c_3,plain,
n0(c,d),
inference(clausify,[status(thm)],[axiom_34]) ).
fof(axiom_30,axiom,
n0(e,e),
file('theBenchmark.p',axiom_30) ).
cnf(c_4,plain,
n0(e,e),
inference(clausify,[status(thm)],[axiom_30]) ).
fof(rule_255,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ n0(VAR_2,VAR_0)
| ~ q2(VAR_2,VAR_0,VAR_1)
| q3(VAR_0,VAR_1) ),
file('theBenchmark.p',rule_255) ).
cnf(c_27,plain,
( ~ n0(C,A)
| ~ q2(C,A,B)
| q3(A,B) ),
inference(clausify,[status(thm)],[rule_255]) ).
fof(rule_274,axiom,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
file('theBenchmark.p',rule_274) ).
cnf(c_28,plain,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
inference(clausify,[status(thm)],[rule_274]) ).
fof(rule_240,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p2(VAR_1,VAR_2,VAR_0)
| n3(VAR_0) ),
file('theBenchmark.p',rule_240) ).
cnf(c_91,plain,
( ~ p2(B,C,A)
| n3(A) ),
inference(clausify,[status(thm)],[rule_240]) ).
cnf(c_98,plain,
( ~ n3(e)
| ~ q3(e,b)
| k4(c) ),
inference(resolve,[status(thm)],[c_28,c_3]) ).
fof(prove_this,axiom,
~ k4(c),
file('theBenchmark.p',prove_this) ).
cnf(c_109,plain,
~ k4(c),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_113,plain,
( ~ q3(e,b)
| k4(c)
| ~ p2(A,B,e) ),
inference(resolve,[status(thm)],[c_91,c_98]) ).
cnf(c_207,plain,
( ~ q2(e,e,A)
| q3(e,A) ),
inference(resolve,[status(thm)],[c_27,c_4]) ).
fof(rule_186,axiom,
! [VAR_0,VAR_1] :
( ~ l1(VAR_1,VAR_0)
| q2(VAR_0,VAR_0,VAR_1) ),
file('theBenchmark.p',rule_186) ).
cnf(c_324,plain,
( ~ l1(B,A)
| q2(A,A,B) ),
inference(clausify,[status(thm)],[rule_186]) ).
fof(rule_170,axiom,
! [VAR_0] :
( ~ n1(VAR_0,e,e)
| p2(VAR_0,e,VAR_0) ),
file('theBenchmark.p',rule_170) ).
cnf(c_338,plain,
( ~ n1(A,e,e)
| p2(A,e,A) ),
inference(clausify,[status(thm)],[rule_170]) ).
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_423,plain,
( ~ m0(B,C,A)
| ~ m0(C,D,D)
| n1(A,A,B) ),
inference(clausify,[status(thm)],[rule_059]) ).
fof(rule_003,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ m0(VAR_1,VAR_0,VAR_2)
| ~ r0(VAR_3)
| ~ p0(VAR_2,VAR_0)
| l1(VAR_0,VAR_1) ),
file('theBenchmark.p',rule_003) ).
cnf(c_468,plain,
( ~ m0(B,A,C)
| ~ r0(D)
| ~ p0(C,A)
| l1(A,B) ),
inference(clausify,[status(thm)],[rule_003]) ).
fof(axiom_27,axiom,
m0(e,b,c),
file('theBenchmark.p',axiom_27) ).
cnf(c_477,plain,
m0(e,b,c),
inference(clausify,[status(thm)],[axiom_27]) ).
fof(axiom_19,axiom,
! [VAR_0,VAR_1] : m0(VAR_0,d,VAR_1),
file('theBenchmark.p',axiom_19) ).
cnf(c_484,plain,
m0(A,d,B),
inference(clausify,[status(thm)],[axiom_19]) ).
fof(axiom_18,axiom,
p0(c,b),
file('theBenchmark.p',axiom_18) ).
cnf(c_485,plain,
p0(c,b),
inference(clausify,[status(thm)],[axiom_18]) ).
fof(axiom_13,axiom,
r0(e),
file('theBenchmark.p',axiom_13) ).
cnf(c_489,plain,
r0(e),
inference(clausify,[status(thm)],[axiom_13]) ).
cnf(c_549,plain,
( ~ q3(e,b)
| ~ p2(A,B,e) ),
inference(resolve,[status(thm)],[c_113,c_109]) ).
cnf(c_777,plain,
( ~ m0(B,C,A)
| n1(A,A,B) ),
inference(resolve,[status(thm)],[c_423,c_484]) ).
cnf(c_693,plain,
n1(A,A,B),
inference(resolve,[status(thm)],[c_777,c_484]) ).
cnf(c_778,plain,
( ~ m0(A,b,c)
| ~ r0(B)
| l1(b,A) ),
inference(resolve,[status(thm)],[c_468,c_485]) ).
cnf(c_779,plain,
( ~ m0(A,b,c)
| l1(b,A) ),
inference(resolve,[status(thm)],[c_778,c_489]) ).
cnf(c_742,plain,
l1(b,e),
inference(resolve,[status(thm)],[c_779,c_477]) ).
cnf(c_780,plain,
( ~ n1(e,e,e)
| ~ q3(e,b) ),
inference(resolve,[status(thm)],[c_549,c_338]) ).
cnf(c_761,plain,
~ q3(e,b),
inference(resolve,[status(thm)],[c_693,c_780]) ).
cnf(c_774,plain,
~ q2(e,e,b),
inference(resolve,[status(thm)],[c_761,c_207]) ).
cnf(c_781,plain,
~ l1(b,e),
inference(resolve,[status(thm)],[c_774,c_324]) ).
cnf(c_776,plain,
$false,
inference(resolve,[status(thm)],[c_742,c_781]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN115-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/10.39 % Computer : n004.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Sat Sep 26 17:12:37 UTC 2026
% 0.11/10.40 % CPUTime :
% 0.16/10.40 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/10.40 % Process 2229306 was started by sandbox2 on n004,
% 0.16/10.40 % Sat Sep 26 17:12:37 2026
% 0.16/10.40 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.16/10.41
% 0.16/10.41 % From the command line: assign(max_seconds, 300).
% 0.16/10.54
% 0.16/10.54 % SZS status Unsatisfiable for theBenchmark
% 0.16/10.54
% 0.16/10.54 % Proof 1 at 0.10 (+ 0.01) seconds.
% 0.16/10.54 % Length of proof is 23.
% 0.16/10.54 % Level of proof is 6.
% 0.16/10.54 % Maximum clause weight is 17.000.
% 0.16/10.54 % Given clauses 319.
% 0.16/10.54
% 0.16/10.54 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------