%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN181-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 : n012.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:14 AM UTC 2026
% Result : Unsatisfiable 0.07s 0.44s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 35 ( 14 unt; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 75 ( 41 ~; 34 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 66 ( 14 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,axiom,
~ q4(d,b),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ q4(d,b),
inference(clausify,[status(thm)],[prove_this]) ).
fof(rule_295,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( ~ m3(VAR_3,VAR_4,VAR_3)
| ~ q2(VAR_3,VAR_1,VAR_0)
| ~ k3(VAR_2,VAR_2,VAR_0)
| q4(VAR_0,VAR_1) ),
file('theBenchmark.p',rule_295) ).
cnf(c_276,plain,
( ~ m3(D,E,D)
| ~ q2(D,B,A)
| ~ k3(C,C,A)
| q4(A,B) ),
inference(clausify,[status(thm)],[rule_295]) ).
fof(rule_238,axiom,
! [VAR_0] :
( ~ p2(VAR_0,VAR_0,VAR_0)
| m3(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_238) ).
cnf(c_308,plain,
( ~ p2(A,A,A)
| m3(A,A,A) ),
inference(clausify,[status(thm)],[rule_238]) ).
fof(rule_206,axiom,
! [VAR_0,VAR_1] :
( ~ p2(VAR_1,VAR_0,VAR_0)
| k3(VAR_0,VAR_1,VAR_0) ),
file('theBenchmark.p',rule_206) ).
cnf(c_317,plain,
( ~ p2(B,A,A)
| k3(A,B,A) ),
inference(clausify,[status(thm)],[rule_206]) ).
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_325,plain,
( ~ l1(B,A)
| q2(A,A,B) ),
inference(clausify,[status(thm)],[rule_186]) ).
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_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_469,plain,
( ~ m0(B,A,C)
| ~ r0(D)
| ~ p0(C,A)
| l1(A,B) ),
inference(clausify,[status(thm)],[rule_003]) ).
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_13,axiom,
r0(e),
file('theBenchmark.p',axiom_13) ).
cnf(c_490,plain,
r0(e),
inference(clausify,[status(thm)],[axiom_13]) ).
cnf(c_669,plain,
( ~ m3(B,C,B)
| ~ q2(B,b,d)
| ~ k3(A,A,d) ),
inference(resolve,[status(thm)],[c_276,c_264]) ).
cnf(c_829,plain,
( ~ m0(B,C,A)
| n1(A,A,B) ),
inference(resolve,[status(thm)],[c_424,c_485]) ).
cnf(c_723,plain,
n1(A,A,B),
inference(resolve,[status(thm)],[c_829,c_485]) ).
cnf(c_726,plain,
p2(A,A,A),
inference(resolve,[status(thm)],[c_723,c_353]) ).
cnf(c_730,plain,
m3(A,A,A),
inference(resolve,[status(thm)],[c_726,c_308]) ).
cnf(c_830,plain,
( ~ m0(B,A,b)
| ~ r0(C)
| l1(A,B) ),
inference(resolve,[status(thm)],[c_469,c_489]) ).
cnf(c_831,plain,
( ~ m0(B,A,b)
| l1(A,B) ),
inference(resolve,[status(thm)],[c_830,c_490]) ).
cnf(c_777,plain,
l1(d,A),
inference(resolve,[status(thm)],[c_831,c_485]) ).
cnf(c_832,plain,
( ~ p2(d,d,d)
| ~ m3(A,B,A)
| ~ q2(A,b,d) ),
inference(resolve,[status(thm)],[c_669,c_317]) ).
cnf(c_814,plain,
( ~ m3(A,B,A)
| ~ q2(A,b,d) ),
inference(resolve,[status(thm)],[c_726,c_832]) ).
cnf(c_833,plain,
( ~ l1(d,b)
| ~ m3(b,A,b) ),
inference(resolve,[status(thm)],[c_814,c_325]) ).
cnf(c_827,plain,
~ m3(b,A,b),
inference(resolve,[status(thm)],[c_777,c_833]) ).
cnf(c_828,plain,
$false,
inference(resolve,[status(thm)],[c_827,c_730]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN181-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Sat Sep 26 17:18:35 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.03/0.31 % Process 1124292 was started by sandbox2 on n012,
% 0.03/0.31 % Sat Sep 26 17:18:35 2026
% 0.03/0.31 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.03/0.31
% 0.03/0.31 % From the command line: assign(max_seconds, 300).
% 0.07/0.44
% 0.07/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.07/0.44
% 0.07/0.44 % Proof 1 at 0.10 (+ 0.01) seconds.
% 0.07/0.44 % Length of proof is 19.
% 0.07/0.44 % Level of proof is 5.
% 0.07/0.44 % Maximum clause weight is 20.000.
% 0.07/0.44 % Given clauses 320.
% 0.07/0.44
% 0.07/0.44 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------