%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : COM013+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.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 06:59:38 AM UTC 2026
% Result : Theorem 0.14s 5.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 8
% Syntax : Number of formulae : 76 ( 17 unt; 0 def)
% Number of atoms : 273 ( 4 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 345 ( 148 ~; 146 |; 29 &)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 125 ( 5 sgn 48 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mReduct,axiom,
! [W0,W1] :
( ( aRewritingSystem0(W1)
& aElement0(W0) )
=> ! [W2] :
( aReductOfIn0(W2,W0,W1)
=> aElement0(W2) ) ),
file('theBenchmark.p',mReduct) ).
fof(mTCDef,axiom,
! [W0,W1,W2] :
( ( aElement0(W2)
& aRewritingSystem0(W1)
& aElement0(W0) )
=> ( sdtmndtplgtdt0(W0,W1,W2)
<=> ( ? [W3] :
( sdtmndtplgtdt0(W3,W1,W2)
& aReductOfIn0(W3,W0,W1)
& aElement0(W3) )
| aReductOfIn0(W2,W0,W1) ) ) ),
file('theBenchmark.p',mTCDef) ).
fof(mTCRDef,axiom,
! [W0,W1,W2] :
( ( aElement0(W2)
& aRewritingSystem0(W1)
& aElement0(W0) )
=> ( sdtmndtasgtdt0(W0,W1,W2)
<=> ( sdtmndtplgtdt0(W0,W1,W2)
| W0 = W2 ) ) ),
file('theBenchmark.p',mTCRDef) ).
fof(mTCRTrans,axiom,
! [W0,W1,W2,W3] :
( ( aElement0(W3)
& aElement0(W2)
& aRewritingSystem0(W1)
& aElement0(W0) )
=> ( ( sdtmndtasgtdt0(W2,W1,W3)
& sdtmndtasgtdt0(W0,W1,W2) )
=> sdtmndtasgtdt0(W0,W1,W3) ) ),
file('theBenchmark.p',mTCRTrans) ).
fof(mTermin,axiom,
! [W0] :
( aRewritingSystem0(W0)
=> ( isTerminating0(W0)
<=> ! [W1,W2] :
( ( aElement0(W2)
& aElement0(W1) )
=> ( sdtmndtplgtdt0(W1,W0,W2)
=> iLess0(W2,W1) ) ) ) ),
file('theBenchmark.p',mTermin) ).
fof(mNFRDef,axiom,
! [W0,W1] :
( ( aRewritingSystem0(W1)
& aElement0(W0) )
=> ! [W2] :
( aNormalFormOfIn0(W2,W0,W1)
<=> ( ~ ? [W3] : aReductOfIn0(W3,W2,W1)
& sdtmndtasgtdt0(W0,W1,W2)
& aElement0(W2) ) ) ),
file('theBenchmark.p',mNFRDef) ).
fof(m__587,axiom,
( isTerminating0(xR)
& aRewritingSystem0(xR) ),
file('theBenchmark.p',m__587) ).
fof(m__,conjecture,
! [W0] :
( aElement0(W0)
=> ( ! [W1] :
( aElement0(W1)
=> ( iLess0(W1,W0)
=> ? [W2] : aNormalFormOfIn0(W2,W1,xR) ) )
=> ? [W1] : aNormalFormOfIn0(W1,W0,xR) ) ),
file('theBenchmark.p',m__) ).
fof(m___neg,negated_conjecture,
~ ! [W0] :
( aElement0(W0)
=> ( ! [W1] :
( aElement0(W1)
=> ( iLess0(W1,W0)
=> ? [W2] : aNormalFormOfIn0(W2,W1,xR) ) )
=> ? [W1] : aNormalFormOfIn0(W1,W0,xR) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_16,plain,
aRewritingSystem0(xR),
inference(clausify,[status(thm)],[m__587]) ).
fof(nnf_13,plain,
! [W0,W1] :
( ! [W2] :
( ( ? [W3] : aReductOfIn0(W3,W2,W1)
| ~ sdtmndtasgtdt0(W0,W1,W2)
| ~ aElement0(W2)
| aNormalFormOfIn0(W2,W0,W1) )
& ( ( ! [X0] : ~ aReductOfIn0(X0,W2,W1)
& sdtmndtasgtdt0(W0,W1,W2)
& aElement0(W2) )
| ~ aNormalFormOfIn0(W2,W0,W1) ) )
| ~ aRewritingSystem0(W1)
| ~ aElement0(W0) ),
inference(fof_nnf,[status(thm)],[mNFRDef]) ).
fof(sk_mNFRDef_sk,plain,
! [W0,W1] :
( ! [W2] :
( ( aReductOfIn0(sK0(W0,W1,W2),W2,W1)
| ~ sdtmndtasgtdt0(W0,W1,W2)
| ~ aElement0(W2)
| aNormalFormOfIn0(W2,W0,W1) )
& ( ( ! [X0] : ~ aReductOfIn0(X0,W2,W1)
& sdtmndtasgtdt0(W0,W1,W2)
& aElement0(W2) )
| ~ aNormalFormOfIn0(W2,W0,W1) ) )
| ~ aRewritingSystem0(W1)
| ~ aElement0(W0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(W3,sK0(W0,W1,W2))],[nnf_13]) ).
fof(sk_mNFRDef,plain,
( ! [VAR_0,VAR_1,VAR_2] :
( aReductOfIn0(sK0(VAR_0,VAR_1,VAR_2),VAR_2,VAR_1)
| ~ sdtmndtasgtdt0(VAR_0,VAR_1,VAR_2)
| ~ aElement0(VAR_2)
| aNormalFormOfIn0(VAR_2,VAR_0,VAR_1)
| ~ aRewritingSystem0(VAR_1)
| ~ aElement0(VAR_0) )
& ! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ aReductOfIn0(VAR_3,VAR_2,VAR_1)
| ~ aNormalFormOfIn0(VAR_2,VAR_0,VAR_1)
| ~ aRewritingSystem0(VAR_1)
| ~ aElement0(VAR_0) )
& ! [VAR_0,VAR_1,VAR_2] :
( sdtmndtasgtdt0(VAR_0,VAR_1,VAR_2)
| ~ aNormalFormOfIn0(VAR_2,VAR_0,VAR_1)
| ~ aRewritingSystem0(VAR_1)
| ~ aElement0(VAR_0) )
& ! [VAR_0,VAR_1,VAR_2] :
( aElement0(VAR_2)
| ~ aNormalFormOfIn0(VAR_2,VAR_0,VAR_1)
| ~ aRewritingSystem0(VAR_1)
| ~ aElement0(VAR_0) ) ),
inference(cnf_transformation,[status(thm)],[sk_mNFRDef_sk]) ).
cnf(c_17,plain,
( aReductOfIn0(sK0(A,B,C),C,B)
| ~ sdtmndtasgtdt0(A,B,C)
| ~ aElement0(C)
| aNormalFormOfIn0(C,A,B)
| ~ aRewritingSystem0(B)
| ~ aElement0(A) ),
inference(split_conjunct,[status(thm)],[sk_mNFRDef]) ).
cnf(c_18,plain,
( ~ aReductOfIn0(D,C,B)
| ~ aNormalFormOfIn0(C,A,B)
| ~ aRewritingSystem0(B)
| ~ aElement0(A) ),
inference(split_conjunct,[status(thm)],[sk_mNFRDef]) ).
cnf(c_19,plain,
( sdtmndtasgtdt0(A,B,C)
| ~ aNormalFormOfIn0(C,A,B)
| ~ aRewritingSystem0(B)
| ~ aElement0(A) ),
inference(split_conjunct,[status(thm)],[sk_mNFRDef]) ).
cnf(c_20,plain,
( aElement0(C)
| ~ aNormalFormOfIn0(C,A,B)
| ~ aRewritingSystem0(B)
| ~ aElement0(A) ),
inference(split_conjunct,[status(thm)],[sk_mNFRDef]) ).
cnf(c_25,plain,
( iLess0(C,B)
| ~ sdtmndtplgtdt0(B,A,C)
| ~ aElement0(C)
| ~ aElement0(B)
| ~ isTerminating0(A)
| ~ aRewritingSystem0(A) ),
inference(clausify,[status(thm)],[mTermin]) ).
cnf(c_44,plain,
( sdtmndtasgtdt0(A,B,D)
| ~ sdtmndtasgtdt0(C,B,D)
| ~ sdtmndtasgtdt0(A,B,C)
| ~ aElement0(D)
| ~ aElement0(C)
| ~ aRewritingSystem0(B)
| ~ aElement0(A) ),
inference(clausify,[status(thm)],[mTCRTrans]) ).
cnf(c_45,plain,
( ~ sdtmndtplgtdt0(A,B,C)
| sdtmndtasgtdt0(A,B,C)
| ~ aElement0(C)
| ~ aRewritingSystem0(B)
| ~ aElement0(A) ),
inference(clausify,[status(thm)],[mTCRDef]) ).
cnf(c_46,plain,
( C != A
| sdtmndtasgtdt0(A,B,C)
| ~ aElement0(C)
| ~ aRewritingSystem0(B)
| ~ aElement0(A) ),
inference(clausify,[status(thm)],[mTCRDef]) ).
cnf(c_50,plain,
( ~ aReductOfIn0(C,A,B)
| sdtmndtplgtdt0(A,B,C)
| ~ aElement0(C)
| ~ aRewritingSystem0(B)
| ~ aElement0(A) ),
inference(clausify,[status(thm)],[mTCDef]) ).
cnf(c_54,plain,
( aElement0(C)
| ~ aReductOfIn0(C,A,B)
| ~ aRewritingSystem0(B)
| ~ aElement0(A) ),
inference(clausify,[status(thm)],[mReduct]) ).
cnf(c_55,plain,
( aElement0(B)
| ~ aReductOfIn0(B,A,xR)
| ~ aElement0(A) ),
inference(resolve,[status(thm)],[c_16,c_54]) ).
cnf(c_59,plain,
( ~ aReductOfIn0(B,A,xR)
| sdtmndtplgtdt0(A,xR,B)
| ~ aElement0(B)
| ~ aElement0(A) ),
inference(resolve,[status(thm)],[c_16,c_50]) ).
cnf(c_63,plain,
( B != A
| sdtmndtasgtdt0(A,xR,B)
| ~ aElement0(B)
| ~ aElement0(A) ),
inference(resolve,[status(thm)],[c_16,c_46]) ).
cnf(c_64,plain,
( ~ sdtmndtplgtdt0(A,xR,B)
| sdtmndtasgtdt0(A,xR,B)
| ~ aElement0(B)
| ~ aElement0(A) ),
inference(resolve,[status(thm)],[c_16,c_45]) ).
cnf(c_65,plain,
( sdtmndtasgtdt0(A,xR,C)
| ~ sdtmndtasgtdt0(B,xR,C)
| ~ sdtmndtasgtdt0(A,xR,B)
| ~ aElement0(C)
| ~ aElement0(B)
| ~ aElement0(A) ),
inference(resolve,[status(thm)],[c_16,c_44]) ).
cnf(c_84,plain,
( iLess0(B,A)
| ~ sdtmndtplgtdt0(A,xR,B)
| ~ aElement0(B)
| ~ aElement0(A)
| ~ isTerminating0(xR) ),
inference(resolve,[status(thm)],[c_16,c_25]) ).
cnf(c_85,plain,
( aElement0(B)
| ~ aNormalFormOfIn0(B,A,xR)
| ~ aElement0(A) ),
inference(resolve,[status(thm)],[c_16,c_20]) ).
cnf(c_86,plain,
( sdtmndtasgtdt0(A,xR,B)
| ~ aNormalFormOfIn0(B,A,xR)
| ~ aElement0(A) ),
inference(resolve,[status(thm)],[c_16,c_19]) ).
cnf(c_87,plain,
( ~ aReductOfIn0(C,B,xR)
| ~ aNormalFormOfIn0(B,A,xR)
| ~ aElement0(A) ),
inference(resolve,[status(thm)],[c_16,c_18]) ).
cnf(c_88,plain,
( aReductOfIn0(sK0(A,xR,B),B,xR)
| ~ sdtmndtasgtdt0(A,xR,B)
| ~ aElement0(B)
| aNormalFormOfIn0(B,A,xR)
| ~ aElement0(A) ),
inference(resolve,[status(thm)],[c_16,c_17]) ).
fof(nnf_15,plain,
? [W0] :
( ! [W1] : ~ aNormalFormOfIn0(W1,W0,xR)
& ! [X0] :
( ? [W2] : aNormalFormOfIn0(W2,X0,xR)
| ~ iLess0(X0,W0)
| ~ aElement0(X0) )
& aElement0(W0) ),
inference(fof_nnf,[status(thm)],[m___neg]) ).
fof(sk_m___neg,plain,
( ! [W1] : ~ aNormalFormOfIn0(W1,sK1,xR)
& ! [X0] :
( aNormalFormOfIn0(sK2(X0),X0,xR)
| ~ iLess0(X0,sK1)
| ~ aElement0(X0) )
& aElement0(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(W0,sK1),skolemize(W2,sK2(X0))],[nnf_15]) ).
cnf(c_89,negated_conjecture,
~ aNormalFormOfIn0(A,sK1,xR),
inference(split_conjunct,[status(thm)],[sk_m___neg]) ).
cnf(c_90,negated_conjecture,
( aNormalFormOfIn0(sK2(A),A,xR)
| ~ iLess0(A,sK1)
| ~ aElement0(A) ),
inference(split_conjunct,[status(thm)],[sk_m___neg]) ).
cnf(c_91,negated_conjecture,
aElement0(sK1),
inference(split_conjunct,[status(thm)],[sk_m___neg]) ).
cnf(c_92,plain,
isTerminating0(xR),
inference(clausify,[status(thm)],[m__587]) ).
cnf(c_344,plain,
( A != A
| sdtmndtasgtdt0(A,xR,A)
| ~ aElement0(A) ),
inference(factor,[status(thm)],[c_63]) ).
cnf(c_99,plain,
( sdtmndtasgtdt0(A,xR,A)
| ~ aElement0(A) ),
inference(copy,[status(thm)],[c_344]) ).
cnf(c_117,plain,
( aReductOfIn0(sK0(A,xR,A),A,xR)
| ~ sdtmndtasgtdt0(A,xR,A)
| aNormalFormOfIn0(A,A,xR)
| ~ aElement0(A) ),
inference(factor,[status(thm)],[c_88]) ).
cnf(c_118,plain,
( iLess0(B,A)
| ~ sdtmndtplgtdt0(A,xR,B)
| ~ aElement0(B)
| ~ aElement0(A) ),
inference(resolve,[status(thm)],[c_92,c_84]) ).
cnf(c_136,plain,
sdtmndtasgtdt0(sK1,xR,sK1),
inference(resolve,[status(thm)],[c_99,c_91]) ).
cnf(c_345,plain,
( aReductOfIn0(sK0(sK1,xR,sK1),sK1,xR)
| aNormalFormOfIn0(sK1,sK1,xR)
| ~ aElement0(sK1) ),
inference(resolve,[status(thm)],[c_136,c_117]) ).
cnf(c_346,negated_conjecture,
( aReductOfIn0(sK0(sK1,xR,sK1),sK1,xR)
| aNormalFormOfIn0(sK1,sK1,xR) ),
inference(resolve,[status(thm)],[c_91,c_345]) ).
cnf(c_141,negated_conjecture,
aReductOfIn0(sK0(sK1,xR,sK1),sK1,xR),
inference(resolve,[status(thm)],[c_89,c_346]) ).
cnf(c_347,plain,
( sdtmndtplgtdt0(sK1,xR,sK0(sK1,xR,sK1))
| ~ aElement0(sK0(sK1,xR,sK1))
| ~ aElement0(sK1) ),
inference(resolve,[status(thm)],[c_141,c_59]) ).
cnf(c_156,negated_conjecture,
( sdtmndtplgtdt0(sK1,xR,sK0(sK1,xR,sK1))
| ~ aElement0(sK0(sK1,xR,sK1)) ),
inference(resolve,[status(thm)],[c_91,c_347]) ).
cnf(c_348,plain,
( aElement0(sK0(sK1,xR,sK1))
| ~ aElement0(sK1) ),
inference(resolve,[status(thm)],[c_141,c_55]) ).
cnf(c_157,negated_conjecture,
aElement0(sK0(sK1,xR,sK1)),
inference(resolve,[status(thm)],[c_91,c_348]) ).
cnf(c_160,negated_conjecture,
sdtmndtplgtdt0(sK1,xR,sK0(sK1,xR,sK1)),
inference(resolve,[status(thm)],[c_157,c_156]) ).
cnf(c_349,plain,
( iLess0(sK0(sK1,xR,sK1),sK1)
| ~ aElement0(sK0(sK1,xR,sK1))
| ~ aElement0(sK1) ),
inference(resolve,[status(thm)],[c_160,c_118]) ).
cnf(c_350,negated_conjecture,
( iLess0(sK0(sK1,xR,sK1),sK1)
| ~ aElement0(sK0(sK1,xR,sK1)) ),
inference(resolve,[status(thm)],[c_91,c_349]) ).
cnf(c_174,negated_conjecture,
iLess0(sK0(sK1,xR,sK1),sK1),
inference(resolve,[status(thm)],[c_157,c_350]) ).
cnf(c_351,plain,
( sdtmndtasgtdt0(sK1,xR,sK0(sK1,xR,sK1))
| ~ aElement0(sK0(sK1,xR,sK1))
| ~ aElement0(sK1) ),
inference(resolve,[status(thm)],[c_160,c_64]) ).
cnf(c_352,negated_conjecture,
( sdtmndtasgtdt0(sK1,xR,sK0(sK1,xR,sK1))
| ~ aElement0(sK0(sK1,xR,sK1)) ),
inference(resolve,[status(thm)],[c_91,c_351]) ).
cnf(c_176,negated_conjecture,
sdtmndtasgtdt0(sK1,xR,sK0(sK1,xR,sK1)),
inference(resolve,[status(thm)],[c_157,c_352]) ).
cnf(c_353,negated_conjecture,
( aNormalFormOfIn0(sK2(sK0(sK1,xR,sK1)),sK0(sK1,xR,sK1),xR)
| ~ aElement0(sK0(sK1,xR,sK1)) ),
inference(resolve,[status(thm)],[c_174,c_90]) ).
cnf(c_181,negated_conjecture,
aNormalFormOfIn0(sK2(sK0(sK1,xR,sK1)),sK0(sK1,xR,sK1),xR),
inference(resolve,[status(thm)],[c_157,c_353]) ).
cnf(c_354,plain,
( sdtmndtasgtdt0(sK1,xR,A)
| ~ sdtmndtasgtdt0(sK0(sK1,xR,sK1),xR,A)
| ~ aElement0(A)
| ~ aElement0(sK0(sK1,xR,sK1))
| ~ aElement0(sK1) ),
inference(resolve,[status(thm)],[c_176,c_65]) ).
cnf(c_355,negated_conjecture,
( sdtmndtasgtdt0(sK1,xR,A)
| ~ sdtmndtasgtdt0(sK0(sK1,xR,sK1),xR,A)
| ~ aElement0(A)
| ~ aElement0(sK0(sK1,xR,sK1)) ),
inference(resolve,[status(thm)],[c_91,c_354]) ).
cnf(c_198,negated_conjecture,
( sdtmndtasgtdt0(sK1,xR,A)
| ~ sdtmndtasgtdt0(sK0(sK1,xR,sK1),xR,A)
| ~ aElement0(A) ),
inference(resolve,[status(thm)],[c_157,c_355]) ).
cnf(c_356,plain,
( ~ aReductOfIn0(A,sK2(sK0(sK1,xR,sK1)),xR)
| ~ aElement0(sK0(sK1,xR,sK1)) ),
inference(resolve,[status(thm)],[c_181,c_87]) ).
cnf(c_316,plain,
~ aReductOfIn0(A,sK2(sK0(sK1,xR,sK1)),xR),
inference(resolve,[status(thm)],[c_157,c_356]) ).
cnf(c_357,plain,
( sdtmndtasgtdt0(sK0(sK1,xR,sK1),xR,sK2(sK0(sK1,xR,sK1)))
| ~ aElement0(sK0(sK1,xR,sK1)) ),
inference(resolve,[status(thm)],[c_181,c_86]) ).
cnf(c_317,plain,
sdtmndtasgtdt0(sK0(sK1,xR,sK1),xR,sK2(sK0(sK1,xR,sK1))),
inference(resolve,[status(thm)],[c_157,c_357]) ).
cnf(c_358,plain,
( aElement0(sK2(sK0(sK1,xR,sK1)))
| ~ aElement0(sK0(sK1,xR,sK1)) ),
inference(resolve,[status(thm)],[c_181,c_85]) ).
cnf(c_318,plain,
aElement0(sK2(sK0(sK1,xR,sK1))),
inference(resolve,[status(thm)],[c_157,c_358]) ).
cnf(c_359,negated_conjecture,
( aReductOfIn0(sK0(sK1,xR,A),A,xR)
| ~ sdtmndtasgtdt0(sK1,xR,A)
| ~ aElement0(A)
| aNormalFormOfIn0(A,sK1,xR) ),
inference(resolve,[status(thm)],[c_88,c_91]) ).
cnf(c_360,negated_conjecture,
( aReductOfIn0(sK0(sK1,xR,A),A,xR)
| ~ sdtmndtasgtdt0(sK1,xR,A)
| ~ aElement0(A) ),
inference(resolve,[status(thm)],[c_359,c_89]) ).
cnf(c_361,negated_conjecture,
( aReductOfIn0(sK0(sK1,xR,sK2(sK0(sK1,xR,sK1))),sK2(sK0(sK1,xR,sK1)),xR)
| ~ sdtmndtasgtdt0(sK1,xR,sK2(sK0(sK1,xR,sK1))) ),
inference(resolve,[status(thm)],[c_360,c_318]) ).
cnf(c_332,negated_conjecture,
~ sdtmndtasgtdt0(sK1,xR,sK2(sK0(sK1,xR,sK1))),
inference(resolve,[status(thm)],[c_361,c_316]) ).
cnf(c_362,plain,
( sdtmndtasgtdt0(sK1,xR,sK2(sK0(sK1,xR,sK1)))
| ~ aElement0(sK2(sK0(sK1,xR,sK1))) ),
inference(resolve,[status(thm)],[c_317,c_198]) ).
cnf(c_363,plain,
sdtmndtasgtdt0(sK1,xR,sK2(sK0(sK1,xR,sK1))),
inference(resolve,[status(thm)],[c_318,c_362]) ).
cnf(c_343,plain,
$false,
inference(resolve,[status(thm)],[c_332,c_363]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM013+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/5.37 % Computer : n015.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Sat Sep 26 23:24:52 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 1044535 was started by sandbox2 on n015,
% 0.10/5.38 % Sat Sep 26 23:24:52 2026
% 0.10/5.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/5.39
% 0.10/5.39 % From the command line: assign(max_seconds, 300).
% 0.14/5.46
% 0.14/5.46 % SZS status Theorem for theBenchmark
% 0.14/5.46
% 0.14/5.46 % Proof 1 at 0.05 (+ 0.01) seconds.
% 0.14/5.46 % Length of proof is 50.
% 0.14/5.46 % Level of proof is 12.
% 0.14/5.46 % Maximum clause weight is 29.000.
% 0.14/5.46 % Given clauses 126.
% 0.14/5.46
% 0.14/5.46 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------