%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PRO017+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n016.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 08:20:59 AM UTC 2026
% Result : Theorem 49.09s 7.54s
% Output : CNFRefutation 49.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 7
% Syntax : Number of formulae : 96 ( 18 unt; 0 def)
% Number of atoms : 403 ( 32 equ)
% Maximal formula atoms : 38 ( 4 avg)
% Number of connectives : 483 ( 176 ~; 230 |; 68 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 133 ( 4 sgn 67 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X1,X2,X3)
& min_precedes(X0,X1,X3) )
=> min_precedes(X0,X2,X3) ),
file('theBenchmark.p',sos) ).
fof(sos_06,axiom,
! [X22,X23,X24] :
( min_precedes(X22,X23,X24)
=> precedes(X22,X23) ),
file('theBenchmark.p',sos_06) ).
fof(sos_08,axiom,
! [X28,X29] :
( precedes(X28,X29)
<=> ( legal(X29)
& earlier(X28,X29) ) ),
file('theBenchmark.p',sos_08) ).
fof(sos_09,axiom,
! [X30,X31] :
( earlier(X30,X31)
=> ~ earlier(X31,X30) ),
file('theBenchmark.p',sos_09) ).
fof(sos_14,axiom,
! [X42,X43] :
( leaf(X42,X43)
<=> ( ~ ? [X45] : min_precedes(X42,X45,X43)
& ( ? [X44] : min_precedes(X44,X42,X43)
| root(X42,X43) ) ) ),
file('theBenchmark.p',sos_14) ).
fof(sos_32,axiom,
! [X95,X96] :
( ( ~ leaf_occ(X95,X96)
& arboreal(X95)
& subactivity_occurrence(X95,X96)
& occurrence_of(X96,tptp0) )
=> ? [X97,X98,X99] :
( ! [X100] :
( min_precedes(X97,X100,tptp0)
=> ( X100 = X99
| X100 = X98 ) )
& min_precedes(X98,X99,tptp0)
& ( occurrence_of(X99,tptp1)
| occurrence_of(X99,tptp2) )
& min_precedes(X97,X98,tptp0)
& occurrence_of(X98,tptp4)
& next_subocc(X95,X97,tptp0)
& occurrence_of(X97,tptp3) ) ),
file('theBenchmark.p',sos_32) ).
fof(goals,conjecture,
! [X101,X102] :
( ( ~ leaf_occ(X101,X102)
& arboreal(X101)
& subactivity_occurrence(X101,X102)
& occurrence_of(X102,tptp0) )
=> ? [X103,X104] :
( leaf(X104,tptp0)
& min_precedes(X103,X104,tptp0)
& ( occurrence_of(X104,tptp1)
| occurrence_of(X104,tptp2) )
& next_subocc(X101,X103,tptp0)
& occurrence_of(X103,tptp3) ) ),
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X101,X102] :
( ( ~ leaf_occ(X101,X102)
& arboreal(X101)
& subactivity_occurrence(X101,X102)
& occurrence_of(X102,tptp0) )
=> ? [X103,X104] :
( leaf(X104,tptp0)
& min_precedes(X103,X104,tptp0)
& ( occurrence_of(X104,tptp1)
| occurrence_of(X104,tptp2) )
& next_subocc(X101,X103,tptp0)
& occurrence_of(X103,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_35,plain,
( earlier(A,B)
| ~ precedes(A,B) ),
inference(clausify,[status(thm)],[sos_08]) ).
cnf(c_36,plain,
( precedes(A,B)
| ~ min_precedes(A,B,C) ),
inference(clausify,[status(thm)],[sos_06]) ).
cnf(c_103,plain,
( min_precedes(A,D,C)
| ~ min_precedes(B,D,C)
| ~ min_precedes(A,B,C) ),
inference(clausify,[status(thm)],[sos]) ).
cnf(c_113,plain,
( ~ earlier(B,A)
| ~ earlier(A,B) ),
inference(clausify,[status(thm)],[sos_09]) ).
fof(nnf_15,plain,
! [X42,X43] :
( ( ? [X45] : min_precedes(X42,X45,X43)
| ( ! [X44] : ~ min_precedes(X44,X42,X43)
& ~ root(X42,X43) )
| leaf(X42,X43) )
& ( ( ! [X106] : ~ min_precedes(X42,X106,X43)
& ( ? [X105] : min_precedes(X105,X42,X43)
| root(X42,X43) ) )
| ~ leaf(X42,X43) ) ),
inference(fof_nnf,[status(thm)],[sos_14]) ).
fof(sk_sos_14_sk,plain,
! [X42,X43] :
( ( min_precedes(X42,sK0(X42,X43),X43)
| ( ! [X44] : ~ min_precedes(X44,X42,X43)
& ~ root(X42,X43) )
| leaf(X42,X43) )
& ( ( ! [X106] : ~ min_precedes(X42,X106,X43)
& ( min_precedes(sK6(X42,X43),X42,X43)
| root(X42,X43) ) )
| ~ leaf(X42,X43) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK0]),skolemize(X105,sK6(X42,X43)),skolemize(X45,sK0(X42,X43))],[nnf_15]) ).
fof(sk_sos_14,plain,
( ! [VAR_0,VAR_1,VAR_2] :
( min_precedes(VAR_0,sK0(VAR_0,VAR_1),VAR_1)
| ~ min_precedes(VAR_2,VAR_0,VAR_1)
| leaf(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( min_precedes(VAR_0,sK0(VAR_0,VAR_1),VAR_1)
| ~ root(VAR_0,VAR_1)
| leaf(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1,VAR_2] :
( ~ min_precedes(VAR_0,VAR_2,VAR_1)
| ~ leaf(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( min_precedes(sK6(VAR_0,VAR_1),VAR_0,VAR_1)
| root(VAR_0,VAR_1)
| ~ leaf(VAR_0,VAR_1) ) ),
inference(cnf_transformation,[status(thm)],[sk_sos_14_sk]) ).
cnf(c_122,plain,
( ~ min_precedes(A,C,B)
| ~ leaf(A,B) ),
inference(split_conjunct,[status(thm)],[sk_sos_14]) ).
cnf(c_123,plain,
( min_precedes(A,sK0(A,B),B)
| ~ min_precedes(C,A,B)
| leaf(A,B) ),
inference(split_conjunct,[status(thm)],[sk_sos_14]) ).
fof(nnf_33,plain,
! [X95,X96] :
( ? [X97,X98,X99] :
( ! [X100] :
( X100 = X99
| X100 = X98
| ~ min_precedes(X97,X100,tptp0) )
& min_precedes(X98,X99,tptp0)
& ( occurrence_of(X99,tptp1)
| occurrence_of(X99,tptp2) )
& min_precedes(X97,X98,tptp0)
& occurrence_of(X98,tptp4)
& next_subocc(X95,X97,tptp0)
& occurrence_of(X97,tptp3) )
| leaf_occ(X95,X96)
| ~ arboreal(X95)
| ~ subactivity_occurrence(X95,X96)
| ~ occurrence_of(X96,tptp0) ),
inference(fof_nnf,[status(thm)],[sos_32]) ).
fof(sk_sos_32_sk,plain,
! [X95,X96] :
( ( ! [X100] :
( X100 = sK3(X95,X96)
| X100 = sK2(X95,X96)
| ~ min_precedes(sK1(X95,X96),X100,tptp0) )
& min_precedes(sK2(X95,X96),sK3(X95,X96),tptp0)
& ( occurrence_of(sK3(X95,X96),tptp1)
| occurrence_of(sK3(X95,X96),tptp2) )
& min_precedes(sK1(X95,X96),sK2(X95,X96),tptp0)
& occurrence_of(sK2(X95,X96),tptp4)
& next_subocc(X95,sK1(X95,X96),tptp0)
& occurrence_of(sK1(X95,X96),tptp3) )
| leaf_occ(X95,X96)
| ~ arboreal(X95)
| ~ subactivity_occurrence(X95,X96)
| ~ occurrence_of(X96,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X97,sK1(X95,X96)),skolemize(X98,sK2(X95,X96)),skolemize(X99,sK3(X95,X96))],[nnf_33]) ).
fof(sk_sos_32,plain,
( ! [VAR_0,VAR_1,VAR_2] :
( VAR_2 = sK3(VAR_1,VAR_0)
| VAR_2 = sK2(VAR_1,VAR_0)
| ~ min_precedes(sK1(VAR_1,VAR_0),VAR_2,tptp0)
| leaf_occ(VAR_1,VAR_0)
| ~ arboreal(VAR_1)
| ~ subactivity_occurrence(VAR_1,VAR_0)
| ~ occurrence_of(VAR_0,tptp0) )
& ! [VAR_0,VAR_1] :
( min_precedes(sK2(VAR_1,VAR_0),sK3(VAR_1,VAR_0),tptp0)
| leaf_occ(VAR_1,VAR_0)
| ~ arboreal(VAR_1)
| ~ subactivity_occurrence(VAR_1,VAR_0)
| ~ occurrence_of(VAR_0,tptp0) )
& ! [VAR_0,VAR_1] :
( occurrence_of(sK3(VAR_1,VAR_0),tptp1)
| occurrence_of(sK3(VAR_1,VAR_0),tptp2)
| leaf_occ(VAR_1,VAR_0)
| ~ arboreal(VAR_1)
| ~ subactivity_occurrence(VAR_1,VAR_0)
| ~ occurrence_of(VAR_0,tptp0) )
& ! [VAR_0,VAR_1] :
( min_precedes(sK1(VAR_1,VAR_0),sK2(VAR_1,VAR_0),tptp0)
| leaf_occ(VAR_1,VAR_0)
| ~ arboreal(VAR_1)
| ~ subactivity_occurrence(VAR_1,VAR_0)
| ~ occurrence_of(VAR_0,tptp0) )
& ! [VAR_0,VAR_1] :
( occurrence_of(sK2(VAR_1,VAR_0),tptp4)
| leaf_occ(VAR_1,VAR_0)
| ~ arboreal(VAR_1)
| ~ subactivity_occurrence(VAR_1,VAR_0)
| ~ occurrence_of(VAR_0,tptp0) )
& ! [VAR_0,VAR_1] :
( next_subocc(VAR_1,sK1(VAR_1,VAR_0),tptp0)
| leaf_occ(VAR_1,VAR_0)
| ~ arboreal(VAR_1)
| ~ subactivity_occurrence(VAR_1,VAR_0)
| ~ occurrence_of(VAR_0,tptp0) )
& ! [VAR_0,VAR_1] :
( occurrence_of(sK1(VAR_1,VAR_0),tptp3)
| leaf_occ(VAR_1,VAR_0)
| ~ arboreal(VAR_1)
| ~ subactivity_occurrence(VAR_1,VAR_0)
| ~ occurrence_of(VAR_0,tptp0) ) ),
inference(cnf_transformation,[status(thm)],[sk_sos_32_sk]) ).
cnf(c_140,plain,
( occurrence_of(sK1(B,A),tptp3)
| leaf_occ(B,A)
| ~ arboreal(B)
| ~ subactivity_occurrence(B,A)
| ~ occurrence_of(A,tptp0) ),
inference(split_conjunct,[status(thm)],[sk_sos_32]) ).
cnf(c_141,plain,
( next_subocc(B,sK1(B,A),tptp0)
| leaf_occ(B,A)
| ~ arboreal(B)
| ~ subactivity_occurrence(B,A)
| ~ occurrence_of(A,tptp0) ),
inference(split_conjunct,[status(thm)],[sk_sos_32]) ).
cnf(c_143,plain,
( min_precedes(sK1(B,A),sK2(B,A),tptp0)
| leaf_occ(B,A)
| ~ arboreal(B)
| ~ subactivity_occurrence(B,A)
| ~ occurrence_of(A,tptp0) ),
inference(split_conjunct,[status(thm)],[sk_sos_32]) ).
cnf(c_144,plain,
( occurrence_of(sK3(B,A),tptp1)
| occurrence_of(sK3(B,A),tptp2)
| leaf_occ(B,A)
| ~ arboreal(B)
| ~ subactivity_occurrence(B,A)
| ~ occurrence_of(A,tptp0) ),
inference(split_conjunct,[status(thm)],[sk_sos_32]) ).
cnf(c_145,plain,
( min_precedes(sK2(B,A),sK3(B,A),tptp0)
| leaf_occ(B,A)
| ~ arboreal(B)
| ~ subactivity_occurrence(B,A)
| ~ occurrence_of(A,tptp0) ),
inference(split_conjunct,[status(thm)],[sk_sos_32]) ).
cnf(c_146,plain,
( C = sK3(B,A)
| C = sK2(B,A)
| ~ min_precedes(sK1(B,A),C,tptp0)
| leaf_occ(B,A)
| ~ arboreal(B)
| ~ subactivity_occurrence(B,A)
| ~ occurrence_of(A,tptp0) ),
inference(split_conjunct,[status(thm)],[sk_sos_32]) ).
cnf(c_17098,plain,
( C = sK3(B,A)
| sK2(B,A) = C
| ~ min_precedes(sK1(B,A),C,tptp0)
| leaf_occ(B,A)
| ~ arboreal(B)
| ~ subactivity_occurrence(B,A)
| ~ occurrence_of(A,tptp0) ),
inference(copy,[status(thm)],[c_146]) ).
cnf(c_147,plain,
( sK3(B,A) = C
| sK2(B,A) = C
| ~ min_precedes(sK1(B,A),C,tptp0)
| leaf_occ(B,A)
| ~ arboreal(B)
| ~ subactivity_occurrence(B,A)
| ~ occurrence_of(A,tptp0) ),
inference(copy,[status(thm)],[c_17098]) ).
fof(nnf_34,plain,
? [X101,X102] :
( ! [X103,X104] :
( ~ leaf(X104,tptp0)
| ~ min_precedes(X103,X104,tptp0)
| ( ~ occurrence_of(X104,tptp1)
& ~ occurrence_of(X104,tptp2) )
| ~ next_subocc(X101,X103,tptp0)
| ~ occurrence_of(X103,tptp3) )
& ~ leaf_occ(X101,X102)
& arboreal(X101)
& subactivity_occurrence(X101,X102)
& occurrence_of(X102,tptp0) ),
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg_sk,plain,
( ! [X103,X104] :
( ~ leaf(X104,tptp0)
| ~ min_precedes(X103,X104,tptp0)
| ( ~ occurrence_of(X104,tptp1)
& ~ occurrence_of(X104,tptp2) )
| ~ next_subocc(sK5,X103,tptp0)
| ~ occurrence_of(X103,tptp3) )
& ~ leaf_occ(sK5,sK4)
& arboreal(sK5)
& subactivity_occurrence(sK5,sK4)
& occurrence_of(sK4,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X101,sK5),skolemize(X102,sK4)],[nnf_34]) ).
fof(sk_goals_neg,plain,
( ! [VAR_0,VAR_1] :
( ~ leaf(VAR_1,tptp0)
| ~ min_precedes(VAR_0,VAR_1,tptp0)
| ~ occurrence_of(VAR_1,tptp1)
| ~ next_subocc(sK5,VAR_0,tptp0)
| ~ occurrence_of(VAR_0,tptp3) )
& ! [VAR_0,VAR_1] :
( ~ leaf(VAR_1,tptp0)
| ~ min_precedes(VAR_0,VAR_1,tptp0)
| ~ occurrence_of(VAR_1,tptp2)
| ~ next_subocc(sK5,VAR_0,tptp0)
| ~ occurrence_of(VAR_0,tptp3) )
& ~ leaf_occ(sK5,sK4)
& arboreal(sK5)
& subactivity_occurrence(sK5,sK4)
& occurrence_of(sK4,tptp0) ),
inference(cnf_transformation,[status(thm)],[sk_goals_neg_sk]) ).
cnf(c_159,negated_conjecture,
occurrence_of(sK4,tptp0),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_160,negated_conjecture,
subactivity_occurrence(sK5,sK4),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_161,negated_conjecture,
arboreal(sK5),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_162,negated_conjecture,
~ leaf_occ(sK5,sK4),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_163,negated_conjecture,
( ~ leaf(B,tptp0)
| ~ min_precedes(A,B,tptp0)
| ~ occurrence_of(B,tptp2)
| ~ next_subocc(sK5,A,tptp0)
| ~ occurrence_of(A,tptp3) ),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_164,negated_conjecture,
( ~ leaf(B,tptp0)
| ~ min_precedes(A,B,tptp0)
| ~ occurrence_of(B,tptp1)
| ~ next_subocc(sK5,A,tptp0)
| ~ occurrence_of(A,tptp3) ),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_165,plain,
( ~ min_precedes(A,B,C)
| earlier(A,B) ),
inference(resolve,[status(thm)],[c_35,c_36]) ).
cnf(c_192,plain,
~ earlier(A,A),
inference(factor,[status(thm)],[c_113]) ).
cnf(c_17099,negated_conjecture,
( min_precedes(sK2(sK5,sK4),sK3(sK5,sK4),tptp0)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5)
| ~ occurrence_of(sK4,tptp0) ),
inference(resolve,[status(thm)],[c_160,c_145]) ).
cnf(c_17100,negated_conjecture,
( min_precedes(sK2(sK5,sK4),sK3(sK5,sK4),tptp0)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5) ),
inference(resolve,[status(thm)],[c_159,c_17099]) ).
cnf(c_17101,negated_conjecture,
( min_precedes(sK2(sK5,sK4),sK3(sK5,sK4),tptp0)
| leaf_occ(sK5,sK4) ),
inference(resolve,[status(thm)],[c_161,c_17100]) ).
cnf(c_199,negated_conjecture,
min_precedes(sK2(sK5,sK4),sK3(sK5,sK4),tptp0),
inference(resolve,[status(thm)],[c_162,c_17101]) ).
cnf(c_17102,negated_conjecture,
( occurrence_of(sK3(sK5,sK4),tptp1)
| occurrence_of(sK3(sK5,sK4),tptp2)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5)
| ~ occurrence_of(sK4,tptp0) ),
inference(resolve,[status(thm)],[c_160,c_144]) ).
cnf(c_17103,negated_conjecture,
( occurrence_of(sK3(sK5,sK4),tptp1)
| occurrence_of(sK3(sK5,sK4),tptp2)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5) ),
inference(resolve,[status(thm)],[c_159,c_17102]) ).
cnf(c_17104,negated_conjecture,
( occurrence_of(sK3(sK5,sK4),tptp1)
| occurrence_of(sK3(sK5,sK4),tptp2)
| leaf_occ(sK5,sK4) ),
inference(resolve,[status(thm)],[c_161,c_17103]) ).
cnf(c_200,negated_conjecture,
( occurrence_of(sK3(sK5,sK4),tptp1)
| occurrence_of(sK3(sK5,sK4),tptp2) ),
inference(resolve,[status(thm)],[c_162,c_17104]) ).
cnf(c_17105,negated_conjecture,
( min_precedes(sK1(sK5,sK4),sK2(sK5,sK4),tptp0)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5)
| ~ occurrence_of(sK4,tptp0) ),
inference(resolve,[status(thm)],[c_160,c_143]) ).
cnf(c_17106,negated_conjecture,
( min_precedes(sK1(sK5,sK4),sK2(sK5,sK4),tptp0)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5) ),
inference(resolve,[status(thm)],[c_159,c_17105]) ).
cnf(c_17107,negated_conjecture,
( min_precedes(sK1(sK5,sK4),sK2(sK5,sK4),tptp0)
| leaf_occ(sK5,sK4) ),
inference(resolve,[status(thm)],[c_161,c_17106]) ).
cnf(c_201,negated_conjecture,
min_precedes(sK1(sK5,sK4),sK2(sK5,sK4),tptp0),
inference(resolve,[status(thm)],[c_162,c_17107]) ).
cnf(c_17108,negated_conjecture,
( next_subocc(sK5,sK1(sK5,sK4),tptp0)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5)
| ~ occurrence_of(sK4,tptp0) ),
inference(resolve,[status(thm)],[c_160,c_141]) ).
cnf(c_17109,negated_conjecture,
( next_subocc(sK5,sK1(sK5,sK4),tptp0)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5) ),
inference(resolve,[status(thm)],[c_159,c_17108]) ).
cnf(c_17110,negated_conjecture,
( next_subocc(sK5,sK1(sK5,sK4),tptp0)
| leaf_occ(sK5,sK4) ),
inference(resolve,[status(thm)],[c_161,c_17109]) ).
cnf(c_203,negated_conjecture,
next_subocc(sK5,sK1(sK5,sK4),tptp0),
inference(resolve,[status(thm)],[c_162,c_17110]) ).
cnf(c_17111,negated_conjecture,
( occurrence_of(sK1(sK5,sK4),tptp3)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5)
| ~ occurrence_of(sK4,tptp0) ),
inference(resolve,[status(thm)],[c_160,c_140]) ).
cnf(c_17112,negated_conjecture,
( occurrence_of(sK1(sK5,sK4),tptp3)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5) ),
inference(resolve,[status(thm)],[c_159,c_17111]) ).
cnf(c_17113,negated_conjecture,
( occurrence_of(sK1(sK5,sK4),tptp3)
| leaf_occ(sK5,sK4) ),
inference(resolve,[status(thm)],[c_161,c_17112]) ).
cnf(c_204,negated_conjecture,
occurrence_of(sK1(sK5,sK4),tptp3),
inference(resolve,[status(thm)],[c_162,c_17113]) ).
cnf(c_296,plain,
earlier(sK2(sK5,sK4),sK3(sK5,sK4)),
inference(resolve,[status(thm)],[c_199,c_165]) ).
cnf(c_304,plain,
( min_precedes(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0),tptp0)
| leaf(sK3(sK5,sK4),tptp0) ),
inference(resolve,[status(thm)],[c_199,c_123]) ).
cnf(c_308,plain,
( min_precedes(A,sK3(sK5,sK4),tptp0)
| ~ min_precedes(A,sK2(sK5,sK4),tptp0) ),
inference(resolve,[status(thm)],[c_199,c_103]) ).
cnf(c_17114,negated_conjecture,
( ~ leaf(A,tptp0)
| ~ min_precedes(sK1(sK5,sK4),A,tptp0)
| ~ occurrence_of(A,tptp1)
| ~ occurrence_of(sK1(sK5,sK4),tptp3) ),
inference(resolve,[status(thm)],[c_203,c_164]) ).
cnf(c_324,negated_conjecture,
( ~ leaf(A,tptp0)
| ~ min_precedes(sK1(sK5,sK4),A,tptp0)
| ~ occurrence_of(A,tptp1) ),
inference(resolve,[status(thm)],[c_204,c_17114]) ).
cnf(c_17115,negated_conjecture,
( ~ leaf(A,tptp0)
| ~ min_precedes(sK1(sK5,sK4),A,tptp0)
| ~ occurrence_of(A,tptp2)
| ~ occurrence_of(sK1(sK5,sK4),tptp3) ),
inference(resolve,[status(thm)],[c_203,c_163]) ).
cnf(c_325,negated_conjecture,
( ~ leaf(A,tptp0)
| ~ min_precedes(sK1(sK5,sK4),A,tptp0)
| ~ occurrence_of(A,tptp2) ),
inference(resolve,[status(thm)],[c_204,c_17115]) ).
cnf(c_370,plain,
~ earlier(sK3(sK5,sK4),sK2(sK5,sK4)),
inference(resolve,[status(thm)],[c_296,c_113]) ).
cnf(c_627,plain,
min_precedes(sK1(sK5,sK4),sK3(sK5,sK4),tptp0),
inference(resolve,[status(thm)],[c_308,c_201]) ).
cnf(c_628,plain,
( ~ leaf(sK3(sK5,sK4),tptp0)
| ~ occurrence_of(sK3(sK5,sK4),tptp2) ),
inference(resolve,[status(thm)],[c_627,c_325]) ).
cnf(c_629,plain,
( ~ leaf(sK3(sK5,sK4),tptp0)
| ~ occurrence_of(sK3(sK5,sK4),tptp1) ),
inference(resolve,[status(thm)],[c_627,c_324]) ).
cnf(c_638,plain,
( min_precedes(sK1(sK5,sK4),A,tptp0)
| ~ min_precedes(sK3(sK5,sK4),A,tptp0) ),
inference(resolve,[status(thm)],[c_627,c_103]) ).
cnf(c_1301,plain,
( ~ occurrence_of(sK3(sK5,sK4),tptp1)
| min_precedes(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0),tptp0) ),
inference(resolve,[status(thm)],[c_304,c_629]) ).
cnf(c_1302,plain,
( ~ occurrence_of(sK3(sK5,sK4),tptp2)
| min_precedes(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0),tptp0) ),
inference(resolve,[status(thm)],[c_304,c_628]) ).
cnf(c_1310,plain,
( min_precedes(sK1(sK5,sK4),sK0(sK3(sK5,sK4),tptp0),tptp0)
| leaf(sK3(sK5,sK4),tptp0) ),
inference(resolve,[status(thm)],[c_304,c_638]) ).
cnf(c_1318,plain,
( earlier(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0))
| leaf(sK3(sK5,sK4),tptp0) ),
inference(resolve,[status(thm)],[c_304,c_165]) ).
cnf(c_2870,plain,
( ~ occurrence_of(sK3(sK5,sK4),tptp1)
| earlier(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0)) ),
inference(resolve,[status(thm)],[c_1318,c_629]) ).
cnf(c_2871,plain,
( ~ occurrence_of(sK3(sK5,sK4),tptp2)
| earlier(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0)) ),
inference(resolve,[status(thm)],[c_1318,c_628]) ).
cnf(c_3326,plain,
( occurrence_of(sK3(sK5,sK4),tptp2)
| earlier(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0)) ),
inference(resolve,[status(thm)],[c_2870,c_200]) ).
cnf(c_17116,plain,
( earlier(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0))
| earlier(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0)) ),
inference(resolve,[status(thm)],[c_3326,c_2871]) ).
cnf(c_3485,plain,
earlier(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0)),
inference(copy,[status(thm)],[c_17116]) ).
cnf(c_4999,plain,
( occurrence_of(sK3(sK5,sK4),tptp2)
| min_precedes(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0),tptp0) ),
inference(resolve,[status(thm)],[c_1301,c_200]) ).
cnf(c_17117,plain,
( sK3(sK5,sK4) = sK0(sK3(sK5,sK4),tptp0)
| sK2(sK5,sK4) = sK0(sK3(sK5,sK4),tptp0)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5)
| ~ subactivity_occurrence(sK5,sK4)
| ~ occurrence_of(sK4,tptp0)
| leaf(sK3(sK5,sK4),tptp0) ),
inference(resolve,[status(thm)],[c_1310,c_147]) ).
cnf(c_17118,plain,
( sK3(sK5,sK4) = sK0(sK3(sK5,sK4),tptp0)
| sK0(sK3(sK5,sK4),tptp0) = sK2(sK5,sK4)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5)
| ~ subactivity_occurrence(sK5,sK4)
| ~ occurrence_of(sK4,tptp0)
| leaf(sK3(sK5,sK4),tptp0) ),
inference(copy,[status(thm)],[c_17117]) ).
cnf(c_17119,plain,
( sK0(sK3(sK5,sK4),tptp0) = sK3(sK5,sK4)
| sK0(sK3(sK5,sK4),tptp0) = sK2(sK5,sK4)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5)
| ~ subactivity_occurrence(sK5,sK4)
| ~ occurrence_of(sK4,tptp0)
| leaf(sK3(sK5,sK4),tptp0) ),
inference(copy,[status(thm)],[c_17118]) ).
cnf(c_17120,negated_conjecture,
( sK0(sK3(sK5,sK4),tptp0) = sK3(sK5,sK4)
| sK0(sK3(sK5,sK4),tptp0) = sK2(sK5,sK4)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5)
| ~ subactivity_occurrence(sK5,sK4)
| leaf(sK3(sK5,sK4),tptp0) ),
inference(resolve,[status(thm)],[c_159,c_17119]) ).
cnf(c_17121,negated_conjecture,
( sK0(sK3(sK5,sK4),tptp0) = sK3(sK5,sK4)
| sK0(sK3(sK5,sK4),tptp0) = sK2(sK5,sK4)
| leaf_occ(sK5,sK4)
| ~ arboreal(sK5)
| leaf(sK3(sK5,sK4),tptp0) ),
inference(resolve,[status(thm)],[c_160,c_17120]) ).
cnf(c_17122,negated_conjecture,
( sK0(sK3(sK5,sK4),tptp0) = sK3(sK5,sK4)
| sK0(sK3(sK5,sK4),tptp0) = sK2(sK5,sK4)
| leaf_occ(sK5,sK4)
| leaf(sK3(sK5,sK4),tptp0) ),
inference(resolve,[status(thm)],[c_161,c_17121]) ).
cnf(c_5017,negated_conjecture,
( sK0(sK3(sK5,sK4),tptp0) = sK3(sK5,sK4)
| sK0(sK3(sK5,sK4),tptp0) = sK2(sK5,sK4)
| leaf(sK3(sK5,sK4),tptp0) ),
inference(resolve,[status(thm)],[c_162,c_17122]) ).
cnf(c_17123,plain,
( min_precedes(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0),tptp0)
| min_precedes(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0),tptp0) ),
inference(resolve,[status(thm)],[c_4999,c_1302]) ).
cnf(c_6425,plain,
min_precedes(sK3(sK5,sK4),sK0(sK3(sK5,sK4),tptp0),tptp0),
inference(copy,[status(thm)],[c_17123]) ).
cnf(c_6434,plain,
~ leaf(sK3(sK5,sK4),tptp0),
inference(resolve,[status(thm)],[c_6425,c_122]) ).
cnf(c_6457,negated_conjecture,
( sK0(sK3(sK5,sK4),tptp0) = sK3(sK5,sK4)
| sK0(sK3(sK5,sK4),tptp0) = sK2(sK5,sK4) ),
inference(resolve,[status(thm)],[c_6434,c_5017]) ).
cnf(c_17124,plain,
( earlier(sK3(sK5,sK4),sK3(sK5,sK4))
| sK0(sK3(sK5,sK4),tptp0) = sK2(sK5,sK4) ),
inference(paramod,[status(thm)],[c_6457,c_3485]) ).
cnf(c_17085,plain,
sK0(sK3(sK5,sK4),tptp0) = sK2(sK5,sK4),
inference(resolve,[status(thm)],[c_192,c_17124]) ).
cnf(c_17125,plain,
earlier(sK3(sK5,sK4),sK2(sK5,sK4)),
inference(paramod,[status(thm)],[c_17085,c_3485]) ).
cnf(c_17097,plain,
$false,
inference(resolve,[status(thm)],[c_370,c_17125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO017+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 05:05:33 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 35351 was started by sandbox on n016,
% 0.10/0.37 % Sat Sep 26 05:05:33 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 49.09/7.54
% 49.09/7.54 % given #500 (A,wt=30): 396 leaf_occ(f14(tptp0,c2),c2) | -occurrence_of(A,tptp0) | -leaf_occ(f16(f14(tptp0,c2),c2),A). [resolve(211,b,127,c)].
% 49.09/7.54
% 49.09/7.54 % given #1000 (T,wt=28): 4436 f14(f7(c2),c2) = c1 | earlier(f14(tptp0,c2),f5(c1,tptp0)). [resolve(3832,b,3839,b),merge(c)].
% 49.09/7.54
% 49.09/7.54 % given #1500 (T,wt=31): 2067 arboreal(f5(f14(tptp0,c2),tptp0)) | -occurrence_of(f10(f14(tptp0,c2),tptp0),A) | tptp0 = A. [resolve(690,a,128,b)].
% 49.09/7.54
% 49.09/7.54 % given #2000 (A,wt=39): 914 subactivity_occurrence(f14(tptp0,f9(tptp0,f15(c1,c2),f16(c1,c2))),f9(tptp0,f15(c1,c2),f16(c1,c2))). [resolve(355,a,139,a),unit_del(a,148)].
% 49.09/7.54
% 49.09/7.54 % given #2500 (A,wt=36): 1107 atocc(A,f7(f17(c1,c2))) | -occurrence_of(A,f6(f17(c1,c2),f7(f17(c1,c2)))). [resolve(1104,a,85,a),unit_del(b,1106)].
% 49.09/7.54
% 49.09/7.54 % given #3000 (T,wt=27): 16475 f14(f7(c2),c2) = c1 | -atocc(f17(c1,c2),f7(c2)). [resolve(16444,b,193,a)].
% 49.09/7.54
% 49.09/7.54 % SZS status Theorem for theBenchmark
% 49.09/7.54
% 49.09/7.54 % Proof 1 at 6.02 (+ 1.04) seconds.
% 49.09/7.54 % Length of proof is 58.
% 49.09/7.54 % Level of proof is 12.
% 49.09/7.54 % Maximum clause weight is 38.000.
% 49.09/7.54 % Given clauses 3182.
% 49.09/7.54
% 49.09/7.54 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------