%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN144-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 : n010.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:09 AM UTC 2026
% Result : Unsatisfiable 1.28s 0.56s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 34 ( 16 unt; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 61 ( 35 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 47 ( 13 sgn 19 !; 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(rule_092,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ p0(VAR_3,VAR_0)
| ~ n0(VAR_2,VAR_1)
| q1(VAR_0,VAR_1,VAR_0) ),
file('theBenchmark.p',rule_092) ).
cnf(c_21,plain,
( ~ p0(D,A)
| ~ n0(C,B)
| q1(A,B,A) ),
inference(clausify,[status(thm)],[rule_092]) ).
fof(prove_this,axiom,
~ m5(e,a),
file('theBenchmark.p',prove_this) ).
cnf(c_132,plain,
~ m5(e,a),
inference(clausify,[status(thm)],[prove_this]) ).
fof(rule_303,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p4(VAR_0,VAR_2,VAR_1)
| ~ r0(VAR_0)
| m5(VAR_0,VAR_1) ),
file('theBenchmark.p',rule_303) ).
cnf(c_133,plain,
( ~ p4(A,C,B)
| ~ r0(A)
| m5(A,B) ),
inference(clausify,[status(thm)],[rule_303]) ).
cnf(c_138,plain,
( ~ p4(e,A,a)
| ~ r0(e) ),
inference(resolve,[status(thm)],[c_132,c_133]) ).
cnf(c_238,plain,
( ~ p0(B,A)
| q1(A,a,A) ),
inference(resolve,[status(thm)],[c_21,c_2]) ).
cnf(c_270,plain,
k1(a),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(rule_285,axiom,
! [VAR_0,VAR_1] :
( ~ r3(VAR_1,VAR_0,VAR_1)
| ~ r0(VAR_0)
| p4(VAR_0,VAR_0,VAR_1) ),
file('theBenchmark.p',rule_285) ).
cnf(c_289,plain,
( ~ r3(B,A,B)
| ~ r0(A)
| p4(A,A,B) ),
inference(clausify,[status(thm)],[rule_285]) ).
fof(rule_267,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p2(VAR_0,VAR_2,VAR_1)
| r3(VAR_0,VAR_1,VAR_0) ),
file('theBenchmark.p',rule_267) ).
cnf(c_300,plain,
( ~ p2(A,C,B)
| r3(A,B,A) ),
inference(clausify,[status(thm)],[rule_267]) ).
fof(rule_155,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p2(e,VAR_0,VAR_1)
| ~ k1(VAR_2)
| p2(VAR_0,VAR_1,VAR_1) ),
file('theBenchmark.p',rule_155) ).
cnf(c_357,plain,
( ~ p2(e,A,B)
| ~ k1(C)
| p2(A,B,B) ),
inference(clausify,[status(thm)],[rule_155]) ).
fof(rule_141,axiom,
! [VAR_0] :
( ~ q1(VAR_0,a,VAR_0)
| p2(VAR_0,a,VAR_0) ),
file('theBenchmark.p',rule_141) ).
cnf(c_371,plain,
( ~ q1(A,a,A)
| p2(A,a,A) ),
inference(clausify,[status(thm)],[rule_141]) ).
fof(axiom_14,axiom,
! [VAR_0] : p0(b,VAR_0),
file('theBenchmark.p',axiom_14) ).
cnf(c_495,plain,
p0(b,A),
inference(clausify,[status(thm)],[axiom_14]) ).
fof(axiom_13,axiom,
r0(e),
file('theBenchmark.p',axiom_13) ).
cnf(c_496,plain,
r0(e),
inference(clausify,[status(thm)],[axiom_13]) ).
cnf(c_607,plain,
~ p4(e,A,a),
inference(resolve,[status(thm)],[c_496,c_138]) ).
cnf(c_730,plain,
q1(A,a,A),
inference(resolve,[status(thm)],[c_238,c_495]) ).
cnf(c_749,plain,
p2(A,a,A),
inference(resolve,[status(thm)],[c_730,c_371]) ).
cnf(c_783,plain,
( ~ r3(a,e,a)
| ~ r0(e) ),
inference(resolve,[status(thm)],[c_607,c_289]) ).
cnf(c_772,plain,
~ r3(a,e,a),
inference(resolve,[status(thm)],[c_496,c_783]) ).
cnf(c_778,plain,
~ p2(a,A,e),
inference(resolve,[status(thm)],[c_772,c_300]) ).
cnf(c_784,plain,
( ~ p2(e,a,e)
| ~ k1(A) ),
inference(resolve,[status(thm)],[c_778,c_357]) ).
cnf(c_781,plain,
~ k1(A),
inference(resolve,[status(thm)],[c_749,c_784]) ).
cnf(c_782,plain,
$false,
inference(resolve,[status(thm)],[c_781,c_270]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN144-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n010.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.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 26 17:15:45 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/0.36 % Process 3793510 was started by sandbox on n010,
% 0.13/0.36 % Sat Sep 26 17:15:45 2026
% 0.13/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.38
% 0.13/0.38 % From the command line: assign(max_seconds, 300).
% 1.28/0.56
% 1.28/0.56 % SZS status Unsatisfiable for theBenchmark
% 1.28/0.56
% 1.28/0.56 % Proof 1 at 0.15 (+ 0.02) seconds.
% 1.28/0.56 % Length of proof is 21.
% 1.28/0.56 % Level of proof is 6.
% 1.28/0.56 % Maximum clause weight is 10.000.
% 1.28/0.56 % Given clauses 319.
% 1.28/0.56
% 1.28/0.56 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------