%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN214-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 : n007.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:19 AM UTC 2026
% Result : Unsatisfiable 1.49s 0.62s
% Output : CNFRefutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 17
% Syntax : Number of formulae : 51 ( 17 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 112 ( 61 ~; 51 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 95 ( 45 sgn 29 !; 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_30,axiom,
n0(e,e),
file('theBenchmark.p',axiom_30) ).
cnf(c_4,plain,
n0(e,e),
inference(clausify,[status(thm)],[axiom_30]) ).
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_002,axiom,
! [VAR_0,VAR_1] :
( ~ n0(VAR_1,VAR_0)
| l1(VAR_0,VAR_0) ),
file('theBenchmark.p',rule_002) ).
cnf(c_10,plain,
( ~ n0(B,A)
| l1(A,A) ),
inference(clausify,[status(thm)],[rule_002]) ).
fof(rule_066,axiom,
! [VAR_0,VAR_1] :
( ~ n0(VAR_1,VAR_0)
| p1(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_066) ).
cnf(c_17,plain,
( ~ n0(B,A)
| p1(A,A,A) ),
inference(clausify,[status(thm)],[rule_066]) ).
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_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_244,axiom,
! [VAR_0] :
( ~ n2(VAR_0)
| p3(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_244) ).
cnf(c_56,plain,
( ~ n2(A)
| p3(A,A,A) ),
inference(clausify,[status(thm)],[rule_244]) ).
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]) ).
fof(rule_298,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ p0(VAR_3,VAR_0)
| ~ q3(VAR_1,VAR_2)
| ~ n3(VAR_0)
| r4(VAR_0) ),
file('theBenchmark.p',rule_298) ).
cnf(c_96,plain,
( ~ p0(D,A)
| ~ q3(B,C)
| ~ n3(A)
| r4(A) ),
inference(clausify,[status(thm)],[rule_298]) ).
cnf(c_114,plain,
( ~ p0(F,C)
| ~ q3(D,E)
| r4(C)
| ~ p2(A,B,C) ),
inference(resolve,[status(thm)],[c_91,c_96]) ).
fof(rule_329,axiom,
! [VAR_0,VAR_1] :
( ~ r4(VAR_1)
| ~ l4(VAR_0)
| s5(VAR_0) ),
file('theBenchmark.p',rule_329) ).
cnf(c_116,plain,
( ~ r4(B)
| ~ l4(A)
| s5(A) ),
inference(clausify,[status(thm)],[rule_329]) ).
cnf(c_135,plain,
( ~ p0(V6,D)
| ~ q3(E,F)
| ~ p2(B,C,D)
| ~ l4(A)
| s5(A) ),
inference(resolve,[status(thm)],[c_116,c_114]) ).
cnf(c_170,plain,
( ~ p1(B,C,A)
| p3(A,A,A) ),
inference(resolve,[status(thm)],[c_56,c_46]) ).
cnf(c_207,plain,
( ~ q2(e,e,A)
| q3(e,A) ),
inference(resolve,[status(thm)],[c_27,c_4]) ).
cnf(c_235,plain,
p1(c,c,c),
inference(resolve,[status(thm)],[c_17,c_5]) ).
cnf(c_256,plain,
l1(e,e),
inference(resolve,[status(thm)],[c_10,c_4]) ).
cnf(c_263,plain,
k1(a),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(prove_this,axiom,
~ s5(c),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ s5(c),
inference(clausify,[status(thm)],[prove_this]) ).
fof(rule_277,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p3(VAR_1,VAR_2,VAR_0)
| l4(VAR_0) ),
file('theBenchmark.p',rule_277) ).
cnf(c_288,plain,
( ~ p3(B,C,A)
| l4(A) ),
inference(clausify,[status(thm)],[rule_277]) ).
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_159,axiom,
! [VAR_0] :
( ~ k1(VAR_0)
| p2(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_159) ).
cnf(c_346,plain,
( ~ k1(A)
| p2(A,A,A) ),
inference(clausify,[status(thm)],[rule_159]) ).
fof(axiom_14,axiom,
! [VAR_0] : p0(b,VAR_0),
file('theBenchmark.p',axiom_14) ).
cnf(c_481,plain,
p0(b,A),
inference(clausify,[status(thm)],[axiom_14]) ).
cnf(c_527,plain,
p3(c,c,c),
inference(resolve,[status(thm)],[c_170,c_235]) ).
cnf(c_543,plain,
( ~ p0(F,C)
| ~ q3(D,E)
| ~ p2(A,B,C)
| ~ l4(c) ),
inference(resolve,[status(thm)],[c_264,c_135]) ).
cnf(c_681,plain,
( ~ q3(D,E)
| ~ p2(A,B,C)
| ~ l4(c) ),
inference(resolve,[status(thm)],[c_543,c_481]) ).
cnf(c_698,plain,
( ~ k1(C)
| ~ q3(A,B)
| ~ l4(c) ),
inference(resolve,[status(thm)],[c_681,c_346]) ).
cnf(c_727,plain,
( ~ q3(A,B)
| ~ l4(c) ),
inference(resolve,[status(thm)],[c_698,c_263]) ).
cnf(c_733,plain,
( ~ q2(e,e,A)
| ~ l4(c) ),
inference(resolve,[status(thm)],[c_727,c_207]) ).
cnf(c_768,plain,
( ~ l1(A,e)
| ~ l4(c) ),
inference(resolve,[status(thm)],[c_733,c_324]) ).
cnf(c_773,plain,
~ l4(c),
inference(resolve,[status(thm)],[c_768,c_256]) ).
cnf(c_775,plain,
~ p3(A,B,c),
inference(resolve,[status(thm)],[c_773,c_288]) ).
cnf(c_776,plain,
$false,
inference(resolve,[status(thm)],[c_775,c_527]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN214-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n007.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 17:20:09 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 60690 was started by sandbox2 on n007,
% 0.08/0.35 % Sat Sep 26 17:20:09 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.37
% 0.08/0.37 % From the command line: assign(max_seconds, 300).
% 1.49/0.62
% 1.49/0.62 % SZS status Unsatisfiable for theBenchmark
% 1.49/0.62
% 1.49/0.62 % Proof 1 at 0.18 (+ 0.01) seconds.
% 1.49/0.62 % Length of proof is 34.
% 1.49/0.62 % Level of proof is 11.
% 1.49/0.62 % Maximum clause weight is 14.000.
% 1.49/0.62 % Given clauses 390.
% 1.49/0.62
% 1.49/0.62 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------