%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN195-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 : 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:16 AM UTC 2026
% Result : Unsatisfiable 0.77s 0.58s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of formulae : 51 ( 21 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 109 ( 58 ~; 51 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 96 ( 42 sgn 27 !; 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_34,axiom,
n0(c,d),
file('theBenchmark.p',axiom_34) ).
cnf(c_3,plain,
n0(c,d),
inference(clausify,[status(thm)],[axiom_34]) ).
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_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_327,axiom,
! [VAR_0,VAR_1] :
( ~ n3(VAR_1)
| ~ k0(b)
| ~ s4(VAR_0)
| r5(VAR_0,VAR_1) ),
file('theBenchmark.p',rule_327) ).
cnf(c_97,plain,
( ~ n3(B)
| ~ k0(b)
| ~ s4(A)
| r5(A,B) ),
inference(clausify,[status(thm)],[rule_327]) ).
fof(rule_299,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ l1(VAR_0,VAR_2)
| ~ p3(VAR_1,VAR_2,VAR_3)
| s4(VAR_0) ),
file('theBenchmark.p',rule_299) ).
cnf(c_117,plain,
( ~ l1(A,C)
| ~ p3(B,C,D)
| s4(A) ),
inference(clausify,[status(thm)],[rule_299]) ).
cnf(c_124,plain,
( ~ k0(b)
| ~ s4(D)
| r5(D,C)
| ~ p2(A,B,C) ),
inference(resolve,[status(thm)],[c_91,c_97]) ).
fof(prove_this,axiom,
~ r5(d,d),
file('theBenchmark.p',prove_this) ).
cnf(c_132,plain,
~ r5(d,d),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_135,plain,
( ~ l1(D,F)
| ~ p3(E,F,V6)
| ~ k0(b)
| r5(D,C)
| ~ p2(A,B,C) ),
inference(resolve,[status(thm)],[c_124,c_117]) ).
cnf(c_136,plain,
( ~ l1(d,D)
| ~ p3(C,D,E)
| ~ k0(b)
| ~ p2(A,B,d) ),
inference(resolve,[status(thm)],[c_132,c_135]) ).
cnf(c_175,plain,
( ~ p1(B,C,A)
| p3(A,A,A) ),
inference(resolve,[status(thm)],[c_56,c_46]) ).
cnf(c_243,plain,
p1(a,a,a),
inference(resolve,[status(thm)],[c_17,c_2]) ).
cnf(c_267,plain,
k1(d),
inference(resolve,[status(thm)],[c_1,c_3]) ).
fof(rule_170,axiom,
! [VAR_0] :
( ~ n1(VAR_0,e,e)
| p2(VAR_0,e,VAR_0) ),
file('theBenchmark.p',rule_170) ).
cnf(c_343,plain,
( ~ n1(A,e,e)
| p2(A,e,A) ),
inference(clausify,[status(thm)],[rule_170]) ).
fof(rule_040,axiom,
! [VAR_0,VAR_1] :
( ~ k1(VAR_0)
| ~ m0(VAR_0,VAR_1,e)
| n1(VAR_0,e,e) ),
file('theBenchmark.p',rule_040) ).
cnf(c_444,plain,
( ~ k1(A)
| ~ m0(A,B,e)
| n1(A,e,e) ),
inference(clausify,[status(thm)],[rule_040]) ).
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_473,plain,
( ~ m0(B,A,C)
| ~ r0(D)
| ~ p0(C,A)
| l1(A,B) ),
inference(clausify,[status(thm)],[rule_003]) ).
fof(axiom_32,axiom,
k0(b),
file('theBenchmark.p',axiom_32) ).
cnf(c_478,plain,
k0(b),
inference(clausify,[status(thm)],[axiom_32]) ).
fof(axiom_19,axiom,
! [VAR_0,VAR_1] : m0(VAR_0,d,VAR_1),
file('theBenchmark.p',axiom_19) ).
cnf(c_489,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_493,plain,
p0(b,A),
inference(clausify,[status(thm)],[axiom_14]) ).
fof(axiom_13,axiom,
r0(e),
file('theBenchmark.p',axiom_13) ).
cnf(c_494,plain,
r0(e),
inference(clausify,[status(thm)],[axiom_13]) ).
cnf(c_580,plain,
( ~ l1(d,D)
| ~ p3(C,D,E)
| ~ p2(A,B,d) ),
inference(resolve,[status(thm)],[c_478,c_136]) ).
cnf(c_645,plain,
p3(a,a,a),
inference(resolve,[status(thm)],[c_175,c_243]) ).
cnf(c_782,plain,
( ~ k1(A)
| n1(A,e,e) ),
inference(resolve,[status(thm)],[c_444,c_489]) ).
cnf(c_697,plain,
n1(d,e,e),
inference(resolve,[status(thm)],[c_782,c_267]) ).
cnf(c_783,plain,
( ~ m0(B,A,b)
| ~ r0(C)
| l1(A,B) ),
inference(resolve,[status(thm)],[c_473,c_493]) ).
cnf(c_784,plain,
( ~ m0(B,A,b)
| l1(A,B) ),
inference(resolve,[status(thm)],[c_783,c_494]) ).
cnf(c_748,plain,
l1(d,A),
inference(resolve,[status(thm)],[c_784,c_489]) ).
cnf(c_752,plain,
( ~ p3(C,D,E)
| ~ p2(A,B,d) ),
inference(resolve,[status(thm)],[c_748,c_580]) ).
cnf(c_785,plain,
( ~ n1(d,e,e)
| ~ p3(A,B,C) ),
inference(resolve,[status(thm)],[c_752,c_343]) ).
cnf(c_780,plain,
~ p3(A,B,C),
inference(resolve,[status(thm)],[c_697,c_785]) ).
cnf(c_781,plain,
$false,
inference(resolve,[status(thm)],[c_780,c_645]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN195-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n007.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 26 17:18:24 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 58169 was started by sandbox on n007,
% 0.09/0.36 % Sat Sep 26 17:18:24 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.36
% 0.13/0.36 % From the command line: assign(max_seconds, 300).
% 0.77/0.58
% 0.77/0.58 % SZS status Unsatisfiable for theBenchmark
% 0.77/0.58
% 0.77/0.58 % Proof 1 at 0.13 (+ 0.02) seconds.
% 0.77/0.58 % Length of proof is 30.
% 0.77/0.58 % Level of proof is 7.
% 0.77/0.58 % Maximum clause weight is 15.000.
% 0.77/0.58 % Given clauses 318.
% 0.77/0.58
% 0.77/0.58 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------