%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN116-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:05 AM UTC 2026
% Result : Unsatisfiable 0.07s 22.66s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 33 ( 14 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 61 ( 33 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 39 ( 16 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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]) ).
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_244,axiom,
! [VAR_0] :
( ~ n2(VAR_0)
| p3(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_244) ).
cnf(c_56,plain,
( ~ n2(A)
| p3(A,A,A) ),
inference(clausify,[status(thm)],[rule_244]) ).
fof(rule_299,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ l1(VAR_0,VAR_2)
| ~ p3(VAR_1,VAR_2,VAR_3)
| s4(VAR_0) ),
file('theBenchmark.p',rule_299) ).
cnf(c_117,plain,
( ~ l1(A,C)
| ~ p3(B,C,D)
| s4(A) ),
inference(clausify,[status(thm)],[rule_299]) ).
fof(rule_301,axiom,
( ~ n1(b,b,b)
| ~ s4(e)
| k5(b) ),
file('theBenchmark.p',rule_301) ).
cnf(c_119,plain,
( ~ n1(b,b,b)
| ~ s4(e)
| k5(b) ),
inference(clausify,[status(thm)],[rule_301]) ).
cnf(c_127,plain,
( ~ n1(b,b,b)
| k5(b)
| ~ l1(e,B)
| ~ p3(A,B,C) ),
inference(resolve,[status(thm)],[c_117,c_119]) ).
fof(prove_this,axiom,
~ k5(b),
file('theBenchmark.p',prove_this) ).
cnf(c_129,plain,
~ k5(b),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_133,plain,
( ~ n1(b,b,b)
| ~ l1(e,B)
| ~ p3(A,B,C) ),
inference(resolve,[status(thm)],[c_129,c_127]) ).
cnf(c_171,plain,
( ~ p1(B,C,A)
| p3(A,A,A) ),
inference(resolve,[status(thm)],[c_56,c_46]) ).
cnf(c_237,plain,
p1(e,e,e),
inference(resolve,[status(thm)],[c_17,c_4]) ).
cnf(c_257,plain,
l1(e,e),
inference(resolve,[status(thm)],[c_10,c_4]) ).
fof(rule_061,axiom,
! [VAR_0] :
( ~ s0(VAR_0)
| ~ k0(VAR_0)
| n1(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_061) ).
cnf(c_422,plain,
( ~ s0(A)
| ~ k0(A)
| n1(A,A,A) ),
inference(clausify,[status(thm)],[rule_061]) ).
fof(axiom_32,axiom,
k0(b),
file('theBenchmark.p',axiom_32) ).
cnf(c_474,plain,
k0(b),
inference(clausify,[status(thm)],[axiom_32]) ).
fof(axiom_5,axiom,
s0(b),
file('theBenchmark.p',axiom_5) ).
cnf(c_494,plain,
s0(b),
inference(clausify,[status(thm)],[axiom_5]) ).
cnf(c_667,plain,
p3(e,e,e),
inference(resolve,[status(thm)],[c_237,c_171]) ).
cnf(c_681,plain,
( ~ n1(b,b,b)
| ~ p3(A,e,B) ),
inference(resolve,[status(thm)],[c_257,c_133]) ).
cnf(c_789,plain,
( ~ s0(b)
| n1(b,b,b) ),
inference(resolve,[status(thm)],[c_474,c_422]) ).
cnf(c_770,plain,
n1(b,b,b),
inference(resolve,[status(thm)],[c_494,c_789]) ).
cnf(c_787,plain,
~ p3(A,e,B),
inference(resolve,[status(thm)],[c_770,c_681]) ).
cnf(c_788,plain,
$false,
inference(resolve,[status(thm)],[c_787,c_667]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN116-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.04/22.53 % Computer : n012.cluster.edu
% 0.04/22.53 % Model : x86_64 x86_64
% 0.04/22.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/22.53 % Memory : 8046.5625MB
% 0.04/22.53 % OS : Linux 6.8.0-71-generic
% 0.04/22.53 % CPULimit : 300
% 0.04/22.53 % WCLimit : 300
% 0.04/22.53 % DateTime : Sat Sep 26 17:12:18 UTC 2026
% 0.04/22.53 % CPUTime :
% 0.04/22.54 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.04/22.54 % Process 1120382 was started by sandbox2 on n012,
% 0.04/22.54 % Sat Sep 26 17:12:18 2026
% 0.04/22.54 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.04/22.54
% 0.04/22.54 % From the command line: assign(max_seconds, 300).
% 0.07/22.66
% 0.07/22.66 % SZS status Unsatisfiable for theBenchmark
% 0.07/22.66
% 0.07/22.66 % Proof 1 at 0.10 (+ 0.01) seconds.
% 0.07/22.66 % Length of proof is 21.
% 0.07/22.66 % Level of proof is 5.
% 0.07/22.66 % Maximum clause weight is 16.000.
% 0.07/22.66 % Given clauses 240.
% 0.07/22.66
% 0.07/22.66 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------