%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN272-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 : n017.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:26 AM UTC 2026
% Result : Unsatisfiable 0.14s 5.63s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 33 ( 16 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 55 ( 31 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 45 ( 12 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_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_100,axiom,
! [VAR_0,VAR_1] :
( ~ n0(VAR_1,VAR_0)
| q1(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_100) ).
cnf(c_22,plain,
( ~ n0(B,A)
| q1(A,A,A) ),
inference(clausify,[status(thm)],[rule_100]) ).
cnf(c_225,plain,
q1(d,d,d),
inference(resolve,[status(thm)],[c_22,c_3]) ).
cnf(c_262,plain,
k1(d),
inference(resolve,[status(thm)],[c_1,c_3]) ).
fof(prove_this,axiom,
! [VAR_0] : ~ p4(d,e,VAR_0),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ p4(d,e,A),
inference(clausify,[status(thm)],[prove_this]) ).
fof(rule_287,axiom,
! [VAR_0,VAR_1] :
( ~ k3(VAR_0,VAR_0,VAR_1)
| p4(VAR_0,VAR_1,VAR_0) ),
file('theBenchmark.p',rule_287) ).
cnf(c_282,plain,
( ~ k3(A,A,B)
| p4(A,B,A) ),
inference(clausify,[status(thm)],[rule_287]) ).
fof(rule_194,axiom,
! [VAR_0,VAR_1] :
( ~ k2(VAR_1,VAR_0)
| k3(VAR_0,VAR_0,VAR_1) ),
file('theBenchmark.p',rule_194) ).
cnf(c_323,plain,
( ~ k2(B,A)
| k3(A,A,B) ),
inference(clausify,[status(thm)],[rule_194]) ).
fof(rule_129,axiom,
! [VAR_0,VAR_1] :
( ~ q1(VAR_1,VAR_0,VAR_0)
| k2(VAR_0,VAR_0) ),
file('theBenchmark.p',rule_129) ).
cnf(c_367,plain,
( ~ q1(B,A,A)
| k2(A,A) ),
inference(clausify,[status(thm)],[rule_129]) ).
fof(rule_127,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ k2(VAR_3,VAR_1)
| ~ k1(VAR_3)
| ~ m1(VAR_2,VAR_1,VAR_0)
| k2(VAR_0,VAR_1) ),
file('theBenchmark.p',rule_127) ).
cnf(c_369,plain,
( ~ k2(D,B)
| ~ k1(D)
| ~ m1(C,B,A)
| k2(A,B) ),
inference(clausify,[status(thm)],[rule_127]) ).
fof(rule_007,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ r0(VAR_0)
| ~ p0(VAR_2,VAR_1)
| m1(VAR_0,VAR_1,VAR_0) ),
file('theBenchmark.p',rule_007) ).
cnf(c_458,plain,
( ~ r0(A)
| ~ p0(C,B)
| m1(A,B,A) ),
inference(clausify,[status(thm)],[rule_007]) ).
fof(axiom_14,axiom,
! [VAR_0] : p0(b,VAR_0),
file('theBenchmark.p',axiom_14) ).
cnf(c_481,plain,
p0(b,A),
inference(clausify,[status(thm)],[axiom_14]) ).
fof(axiom_13,axiom,
r0(e),
file('theBenchmark.p',axiom_13) ).
cnf(c_482,plain,
r0(e),
inference(clausify,[status(thm)],[axiom_13]) ).
cnf(c_544,plain,
~ k3(d,d,e),
inference(resolve,[status(thm)],[c_282,c_264]) ).
cnf(c_553,plain,
k2(d,d),
inference(resolve,[status(thm)],[c_367,c_225]) ).
cnf(c_688,plain,
( ~ r0(A)
| m1(A,B,A) ),
inference(resolve,[status(thm)],[c_458,c_481]) ).
cnf(c_629,plain,
m1(e,A,e),
inference(resolve,[status(thm)],[c_688,c_482]) ).
cnf(c_640,plain,
~ k2(e,d),
inference(resolve,[status(thm)],[c_544,c_323]) ).
cnf(c_689,plain,
( ~ k2(B,d)
| ~ k1(B)
| ~ m1(A,d,e) ),
inference(resolve,[status(thm)],[c_369,c_640]) ).
cnf(c_690,plain,
( ~ k2(d,d)
| ~ m1(A,d,e) ),
inference(resolve,[status(thm)],[c_689,c_262]) ).
cnf(c_686,plain,
~ m1(A,d,e),
inference(resolve,[status(thm)],[c_690,c_553]) ).
cnf(c_687,plain,
$false,
inference(resolve,[status(thm)],[c_686,c_629]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN272-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.09/5.37 % Computer : n017.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Sat Sep 26 17:23:56 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.38 % Process 1257256 was started by sandbox on n017,
% 0.09/5.38 % Sat Sep 26 17:23:56 2026
% 0.09/5.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/5.39
% 0.09/5.39 % From the command line: assign(max_seconds, 300).
% 0.14/5.63
% 0.14/5.63 % SZS status Unsatisfiable for theBenchmark
% 0.14/5.63
% 0.14/5.63 % Proof 1 at 0.21 (+ 0.02) seconds.
% 0.14/5.63 % Length of proof is 19.
% 0.14/5.63 % Level of proof is 4.
% 0.14/5.63 % Maximum clause weight is 12.000.
% 0.14/5.63 % Given clauses 387.
% 0.14/5.63
% 0.14/5.63 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------