%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN160-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 : n001.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:11 AM UTC 2026
% Result : Unsatisfiable 0.14s 5.52s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 32 ( 12 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 56 ( 31 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 49 ( 13 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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_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_210,axiom,
! [VAR_0] :
( ~ n2(VAR_0)
| k3(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_210) ).
cnf(c_48,plain,
( ~ n2(A)
| k3(A,A,A) ),
inference(clausify,[status(thm)],[rule_210]) ).
fof(rule_236,axiom,
! [VAR_0] :
( ~ n2(VAR_0)
| m3(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_236) ).
cnf(c_55,plain,
( ~ n2(A)
| m3(A,A,A) ),
inference(clausify,[status(thm)],[rule_236]) ).
cnf(c_174,plain,
( ~ p1(B,C,A)
| m3(A,A,A) ),
inference(resolve,[status(thm)],[c_55,c_46]) ).
cnf(c_191,plain,
( ~ p1(B,C,A)
| k3(A,A,A) ),
inference(resolve,[status(thm)],[c_48,c_46]) ).
cnf(c_234,plain,
p1(b,b,b),
inference(resolve,[status(thm)],[c_17,c_6]) ).
cnf(c_254,plain,
l1(b,b),
inference(resolve,[status(thm)],[c_10,c_6]) ).
fof(prove_this,axiom,
~ n5(b,b),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ n5(b,b),
inference(clausify,[status(thm)],[prove_this]) ).
fof(rule_313,axiom,
! [VAR_0,VAR_1] :
( ~ q4(VAR_1,VAR_0)
| n5(VAR_0,VAR_0) ),
file('theBenchmark.p',rule_313) ).
cnf(c_269,plain,
( ~ q4(B,A)
| n5(A,A) ),
inference(clausify,[status(thm)],[rule_313]) ).
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_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]) ).
cnf(c_522,plain,
k3(b,b,b),
inference(resolve,[status(thm)],[c_191,c_234]) ).
cnf(c_523,plain,
m3(b,b,b),
inference(resolve,[status(thm)],[c_174,c_234]) ).
cnf(c_546,plain,
~ q4(A,b),
inference(resolve,[status(thm)],[c_269,c_264]) ).
cnf(c_554,plain,
q2(b,b,b),
inference(resolve,[status(thm)],[c_324,c_254]) ).
cnf(c_651,plain,
( ~ m3(C,D,C)
| ~ q2(C,b,B)
| ~ k3(A,A,B) ),
inference(resolve,[status(thm)],[c_276,c_546]) ).
cnf(c_652,plain,
( ~ m3(A,B,A)
| ~ q2(A,b,b) ),
inference(resolve,[status(thm)],[c_651,c_522]) ).
cnf(c_649,plain,
~ q2(b,b,b),
inference(resolve,[status(thm)],[c_652,c_523]) ).
cnf(c_650,plain,
$false,
inference(resolve,[status(thm)],[c_649,c_554]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN160-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.10/5.38 % Computer : n001.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Sat Sep 26 17:22:19 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/5.38 % Process 2318115 was started by sandbox on n001,
% 0.10/5.38 % Sat Sep 26 17:22:19 2026
% 0.10/5.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/5.39
% 0.10/5.39 % From the command line: assign(max_seconds, 300).
% 0.14/5.52
% 0.14/5.52 % SZS status Unsatisfiable for theBenchmark
% 0.14/5.52
% 0.14/5.52 % Proof 1 at 0.10 (+ 0.01) seconds.
% 0.14/5.52 % Length of proof is 20.
% 0.14/5.52 % Level of proof is 4.
% 0.14/5.52 % Maximum clause weight is 17.000.
% 0.14/5.52 % Given clauses 373.
% 0.14/5.52
% 0.14/5.52 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------