%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN273-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:27 AM UTC 2026
% Result : Unsatisfiable 0.84s 0.54s
% Output : CNFRefutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 36 ( 18 unt; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 61 ( 34 ~; 27 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 42 ( 8 sgn 17 !; 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_30,axiom,
n0(e,e),
file('theBenchmark.p',axiom_30) ).
cnf(c_4,plain,
n0(e,e),
inference(clausify,[status(thm)],[axiom_30]) ).
cnf(c_261,plain,
k1(e),
inference(resolve,[status(thm)],[c_1,c_4]) ).
fof(prove_this,axiom,
~ p4(e,c,e),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ p4(e,c,e),
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_324,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_373,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_375,plain,
( ~ k2(D,B)
| ~ k1(D)
| ~ m1(C,B,A)
| k2(A,B) ),
inference(clausify,[status(thm)],[rule_127]) ).
fof(rule_107,axiom,
! [VAR_0] :
( ~ m0(e,d,VAR_0)
| ~ m0(VAR_0,d,VAR_0)
| q1(e,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_107) ).
cnf(c_390,plain,
( ~ m0(e,d,A)
| ~ m0(A,d,A)
| q1(e,A,A) ),
inference(clausify,[status(thm)],[rule_107]) ).
fof(rule_021,axiom,
! [VAR_0,VAR_1] :
( ~ k0(VAR_1)
| ~ l0(VAR_0)
| m1(VAR_0,VAR_1,VAR_0) ),
file('theBenchmark.p',rule_021) ).
cnf(c_458,plain,
( ~ k0(B)
| ~ l0(A)
| m1(A,B,A) ),
inference(clausify,[status(thm)],[rule_021]) ).
fof(axiom_28,axiom,
k0(e),
file('theBenchmark.p',axiom_28) ).
cnf(c_477,plain,
k0(e),
inference(clausify,[status(thm)],[axiom_28]) ).
fof(axiom_24,axiom,
l0(c),
file('theBenchmark.p',axiom_24) ).
cnf(c_480,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_485,plain,
m0(A,d,B),
inference(clausify,[status(thm)],[axiom_19]) ).
cnf(c_955,plain,
( ~ m0(e,d,A)
| q1(e,A,A) ),
inference(resolve,[status(thm)],[c_485,c_390]) ).
cnf(c_606,plain,
q1(e,A,A),
inference(resolve,[status(thm)],[c_485,c_955]) ).
cnf(c_671,plain,
~ k3(e,e,c),
inference(resolve,[status(thm)],[c_282,c_264]) ).
cnf(c_956,plain,
( ~ k0(A)
| m1(c,A,c) ),
inference(resolve,[status(thm)],[c_458,c_480]) ).
cnf(c_758,plain,
m1(c,e,c),
inference(resolve,[status(thm)],[c_956,c_477]) ).
cnf(c_880,plain,
k2(A,A),
inference(resolve,[status(thm)],[c_606,c_373]) ).
cnf(c_915,plain,
~ k2(c,e),
inference(resolve,[status(thm)],[c_671,c_324]) ).
cnf(c_957,plain,
( ~ k2(B,e)
| ~ k1(B)
| ~ m1(A,e,c) ),
inference(resolve,[status(thm)],[c_375,c_915]) ).
cnf(c_958,plain,
( ~ k2(e,e)
| ~ m1(A,e,c) ),
inference(resolve,[status(thm)],[c_957,c_261]) ).
cnf(c_953,plain,
~ m1(A,e,c),
inference(resolve,[status(thm)],[c_958,c_880]) ).
cnf(c_954,plain,
$false,
inference(resolve,[status(thm)],[c_953,c_758]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN273-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.10/0.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 17:24:04 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.38 % Process 1257639 was started by sandbox on n017,
% 0.10/0.38 % Sat Sep 26 17:24:04 2026
% 0.10/0.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.39
% 0.10/0.39 % From the command line: assign(max_seconds, 300).
% 0.84/0.54
% 0.84/0.54 % SZS status Unsatisfiable for theBenchmark
% 0.84/0.54
% 0.84/0.54 % Proof 1 at 0.11 (+ 0.02) seconds.
% 0.84/0.54 % Length of proof is 20.
% 0.84/0.54 % Level of proof is 4.
% 0.84/0.54 % Maximum clause weight is 17.000.
% 0.84/0.54 % Given clauses 338.
% 0.84/0.54
% 0.84/0.54 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------