%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN207-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 : n020.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:18 AM UTC 2026
% Result : Unsatisfiable 0.91s 0.56s
% Output : CNFRefutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 50 ( 22 unt; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 120 ( 66 ~; 54 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 61 ( 12 sgn 23 !; 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_26,axiom,
n0(d,c),
file('theBenchmark.p',axiom_26) ).
cnf(c_5,plain,
n0(d,c),
inference(clausify,[status(thm)],[axiom_26]) ).
fof(axiom_15,axiom,
n0(a,b),
file('theBenchmark.p',axiom_15) ).
cnf(c_6,plain,
n0(a,b),
inference(clausify,[status(thm)],[axiom_15]) ).
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_189,axiom,
! [VAR_0] :
( ~ s1(b)
| ~ q2(b,VAR_0,b)
| s2(VAR_0) ),
file('theBenchmark.p',rule_189) ).
cnf(c_78,plain,
( ~ s1(b)
| ~ q2(b,A,b)
| s2(A) ),
inference(clausify,[status(thm)],[rule_189]) ).
fof(rule_273,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ m0(VAR_2,VAR_3,VAR_1)
| ~ s2(VAR_0)
| ~ q2(VAR_2,VAR_0,VAR_2)
| s3(VAR_0,VAR_1) ),
file('theBenchmark.p',rule_273) ).
cnf(c_90,plain,
( ~ m0(C,D,B)
| ~ s2(A)
| ~ q2(C,A,C)
| s3(A,B) ),
inference(clausify,[status(thm)],[rule_273]) ).
fof(prove_this,axiom,
~ s3(c,c),
file('theBenchmark.p',prove_this) ).
cnf(c_100,plain,
~ s3(c,c),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_103,plain,
( ~ s1(b)
| ~ q2(b,A,b)
| ~ m0(C,D,B)
| ~ q2(C,A,C)
| s3(A,B) ),
inference(resolve,[status(thm)],[c_90,c_78]) ).
cnf(c_139,plain,
( ~ s1(b)
| ~ q2(b,c,b)
| ~ m0(A,B,c)
| ~ q2(A,c,A) ),
inference(resolve,[status(thm)],[c_103,c_100]) ).
cnf(c_257,plain,
l1(c,c),
inference(resolve,[status(thm)],[c_10,c_5]) ).
cnf(c_261,plain,
k1(b),
inference(resolve,[status(thm)],[c_1,c_6]) ).
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_326,plain,
( ~ l1(B,A)
| q2(A,A,B) ),
inference(clausify,[status(thm)],[rule_186]) ).
fof(rule_183,axiom,
! [VAR_0,VAR_1] :
( ~ l2(VAR_1,VAR_0)
| ~ l0(c)
| ~ k1(VAR_1)
| q2(VAR_0,c,VAR_1) ),
file('theBenchmark.p',rule_183) ).
cnf(c_329,plain,
( ~ l2(B,A)
| ~ l0(c)
| ~ k1(B)
| q2(A,c,B) ),
inference(clausify,[status(thm)],[rule_183]) ).
fof(rule_134,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p0(VAR_1,VAR_0)
| ~ m1(VAR_2,VAR_1,VAR_1)
| ~ m0(VAR_1,VAR_0,VAR_2)
| l2(VAR_0,VAR_0) ),
file('theBenchmark.p',rule_134) ).
cnf(c_370,plain,
( ~ p0(B,A)
| ~ m1(C,B,B)
| ~ m0(B,A,C)
| l2(A,A) ),
inference(clausify,[status(thm)],[rule_134]) ).
fof(rule_125,axiom,
! [VAR_0] :
( ~ p0(VAR_0,VAR_0)
| s1(VAR_0) ),
file('theBenchmark.p',rule_125) ).
cnf(c_378,plain,
( ~ p0(A,A)
| s1(A) ),
inference(clausify,[status(thm)],[rule_125]) ).
fof(rule_015,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ m0(VAR_1,VAR_1,VAR_0)
| ~ l0(VAR_2)
| m1(VAR_0,VAR_1,VAR_1) ),
file('theBenchmark.p',rule_015) ).
cnf(c_464,plain,
( ~ m0(B,B,A)
| ~ l0(C)
| m1(A,B,B) ),
inference(clausify,[status(thm)],[rule_015]) ).
fof(axiom_31,axiom,
m0(b,b,e),
file('theBenchmark.p',axiom_31) ).
cnf(c_476,plain,
m0(b,b,e),
inference(clausify,[status(thm)],[axiom_31]) ).
fof(axiom_24,axiom,
l0(c),
file('theBenchmark.p',axiom_24) ).
cnf(c_481,plain,
l0(c),
inference(clausify,[status(thm)],[axiom_24]) ).
fof(axiom_19,axiom,
! [VAR_0,VAR_1] : m0(VAR_0,d,VAR_1),
file('theBenchmark.p',axiom_19) ).
cnf(c_486,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_490,plain,
p0(b,A),
inference(clausify,[status(thm)],[axiom_14]) ).
cnf(c_582,plain,
( ~ l2(B,A)
| ~ k1(B)
| q2(A,c,B) ),
inference(resolve,[status(thm)],[c_481,c_329]) ).
cnf(c_788,plain,
( ~ s1(b)
| ~ q2(b,c,b)
| ~ m0(c,A,c)
| ~ l1(c,c) ),
inference(resolve,[status(thm)],[c_326,c_139]) ).
cnf(c_642,plain,
( ~ s1(b)
| ~ q2(b,c,b)
| ~ m0(c,A,c) ),
inference(resolve,[status(thm)],[c_257,c_788]) ).
cnf(c_789,plain,
( ~ m0(B,B,A)
| m1(A,B,B) ),
inference(resolve,[status(thm)],[c_464,c_481]) ).
cnf(c_684,plain,
m1(e,b,b),
inference(resolve,[status(thm)],[c_789,c_476]) ).
cnf(c_728,plain,
s1(b),
inference(resolve,[status(thm)],[c_378,c_490]) ).
cnf(c_738,plain,
( ~ q2(b,c,b)
| ~ m0(c,A,c) ),
inference(resolve,[status(thm)],[c_728,c_642]) ).
cnf(c_778,plain,
~ q2(b,c,b),
inference(resolve,[status(thm)],[c_738,c_486]) ).
cnf(c_790,plain,
( ~ l2(b,b)
| ~ k1(b) ),
inference(resolve,[status(thm)],[c_778,c_582]) ).
cnf(c_781,plain,
~ l2(b,b),
inference(resolve,[status(thm)],[c_261,c_790]) ).
cnf(c_791,plain,
( ~ p0(A,b)
| ~ m1(B,A,A)
| ~ m0(A,b,B) ),
inference(resolve,[status(thm)],[c_370,c_781]) ).
cnf(c_792,plain,
( ~ p0(b,b)
| ~ m1(e,b,b) ),
inference(resolve,[status(thm)],[c_791,c_476]) ).
cnf(c_793,plain,
~ m1(e,b,b),
inference(resolve,[status(thm)],[c_792,c_490]) ).
cnf(c_787,plain,
$false,
inference(resolve,[status(thm)],[c_684,c_793]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN207-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.10/0.36 % Computer : n020.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 17:22:34 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.36 % Process 2113011 was started by sandbox2 on n020,
% 0.10/0.36 % Sat Sep 26 17:22:34 2026
% 0.10/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 0.91/0.56
% 0.91/0.56 % SZS status Unsatisfiable for theBenchmark
% 0.91/0.56
% 0.91/0.56 % Proof 1 at 0.15 (+ 0.01) seconds.
% 0.91/0.56 % Length of proof is 28.
% 0.91/0.56 % Level of proof is 7.
% 0.91/0.56 % Maximum clause weight is 19.000.
% 0.91/0.56 % Given clauses 321.
% 0.91/0.56
% 0.91/0.56 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------