%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PRO011+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 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 : Fri Sep 25 02:31:36 PM UTC 2026
% Result : Theorem 4.28s 1.31s
% Output : CNFRefutation 4.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 10
% Syntax : Number of formulae : 86 ( 11 unt; 1 def)
% Number of atoms : 321 ( 13 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 350 ( 115 ~; 116 |; 105 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 6 con; 0-3 aty)
% Number of variables : 211 ( 0 sgn 170 !; 41 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( occurrence_of(X1,X0)
=> ( activity_occurrence(X1)
& activity(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
fof(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& occurrence_of(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(f12,axiom,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3,X4] :
( atocc(X2,X4)
& atocc(X1,X3)
& subactivity(X4,X0)
& subactivity(X3,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_11) ).
fof(f22,axiom,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ~ ? [X3] : min_precedes(X0,X3,X1)
& ( ? [X2] : min_precedes(X2,X0,X1)
| root(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(f24,axiom,
! [X0,X1] :
( atocc(X0,X1)
<=> ? [X2] :
( occurrence_of(X0,X2)
& atomic(X2)
& subactivity(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_23) ).
fof(f35,axiom,
! [X0,X1] :
( leaf_occ(X0,X1)
<=> ? [X2] :
( leaf(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(f50,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_49) ).
fof(f62,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_61) ).
fof(f63,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp1) ) )
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2) ) )
& leaf_occ(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f64,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp1) ) )
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2) ) )
& leaf_occ(X2,X0) ) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f65,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| ( activity_occurrence(X1)
& activity(X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f3]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f67]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ~ min_precedes(X1,X2,X0)
| ? [X3,X4] :
( atocc(X2,X4)
& atocc(X1,X3)
& subactivity(X4,X0)
& subactivity(X3,X0) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f92,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ! [X3] : ~ min_precedes(X0,X3,X1)
& ( ? [X2] : min_precedes(X2,X0,X1)
| root(X0,X1) ) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f136,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
inference(ennf_transformation,[],[f50]) ).
fof(f137,plain,
? [X0] :
( occurrence_of(X0,tptp0)
& ! [X1,X2] :
( ( occurrence_of(X2,tptp2)
& ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp1) ) )
| ( occurrence_of(X2,tptp1)
& ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2) ) )
| ~ leaf_occ(X2,X0) ) ),
inference(ennf_transformation,[],[f64]) ).
fof(f144,plain,
! [X0,X1,X2] :
( ~ min_precedes(X1,X2,X0)
| ( atocc(X2,sK3(X0,X1,X2))
& atocc(X1,sK2(X0,X1,X2))
& subactivity(sK3(X0,X1,X2),X0)
& subactivity(sK2(X0,X1,X2),X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X3,sK2(X0,X1,X2)),skolemize(X4,sK3(X0,X1,X2))],[f79]) ).
fof(f147,plain,
! [X0,X1] :
( ( ~ leaf(X0,X1)
| ( ! [X3] : ~ min_precedes(X0,X3,X1)
& ( ? [X2] : min_precedes(X2,X0,X1)
| root(X0,X1) ) ) )
& ( ? [X3] : min_precedes(X0,X3,X1)
| ( ! [X2] : ~ min_precedes(X2,X0,X1)
& ~ root(X0,X1) )
| leaf(X0,X1) ) ),
inference(nnf_transformation,[],[f92]) ).
fof(f148,plain,
! [X0,X1] :
( ( ~ leaf(X0,X1)
| ( ! [X3] : ~ min_precedes(X0,X3,X1)
& ( ? [X2] : min_precedes(X2,X0,X1)
| root(X0,X1) ) ) )
& ( ? [X3] : min_precedes(X0,X3,X1)
| ( ! [X2] : ~ min_precedes(X2,X0,X1)
& ~ root(X0,X1) )
| leaf(X0,X1) ) ),
inference(flattening,[],[f147]) ).
fof(f149,plain,
! [X0,X1] :
( ( ~ leaf(X0,X1)
| ( ! [X5] : ~ min_precedes(X0,X5,X1)
& ( ? [X4] : min_precedes(X4,X0,X1)
| root(X0,X1) ) ) )
& ( ? [X3] : min_precedes(X0,X3,X1)
| ( ! [X2] : ~ min_precedes(X2,X0,X1)
& ~ root(X0,X1) )
| leaf(X0,X1) ) ),
inference(rectify,[],[f148]) ).
fof(f150,plain,
! [X0,X1] :
( ( ~ leaf(X0,X1)
| ( ! [X5] : ~ min_precedes(X0,X5,X1)
& ( min_precedes(sK7(X0,X1),X0,X1)
| root(X0,X1) ) ) )
& ( min_precedes(X0,sK6(X0,X1),X1)
| ( ! [X2] : ~ min_precedes(X2,X0,X1)
& ~ root(X0,X1) )
| leaf(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X3,sK6(X0,X1)),skolemize(X4,sK7(X0,X1))],[f149]) ).
fof(f155,plain,
! [X0,X1] :
( ( ~ atocc(X0,X1)
| ? [X2] :
( occurrence_of(X0,X2)
& atomic(X2)
& subactivity(X1,X2) ) )
& ( ! [X2] :
( ~ occurrence_of(X0,X2)
| ~ atomic(X2)
| ~ subactivity(X1,X2) )
| atocc(X0,X1) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f156,plain,
! [X0,X1] :
( ( ~ atocc(X0,X1)
| ? [X3] :
( occurrence_of(X0,X3)
& atomic(X3)
& subactivity(X1,X3) ) )
& ( ! [X2] :
( ~ occurrence_of(X0,X2)
| ~ atomic(X2)
| ~ subactivity(X1,X2) )
| atocc(X0,X1) ) ),
inference(rectify,[],[f155]) ).
fof(f157,plain,
! [X0,X1] :
( ( ~ atocc(X0,X1)
| ( occurrence_of(X0,sK9(X0,X1))
& atomic(sK9(X0,X1))
& subactivity(X1,sK9(X0,X1)) ) )
& ( ! [X2] :
( ~ occurrence_of(X0,X2)
| ~ atomic(X2)
| ~ subactivity(X1,X2) )
| atocc(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f156]) ).
fof(f165,plain,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
| ? [X2] :
( leaf(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) ) )
& ( ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) )
| leaf_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f166,plain,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
| ? [X3] :
( leaf(X0,X3)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X3) ) )
& ( ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) )
| leaf_occ(X0,X1) ) ),
inference(rectify,[],[f165]) ).
fof(f167,plain,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
| ( leaf(X0,sK15(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK15(X0,X1)) ) )
& ( ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) )
| leaf_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15]),skolemize(X3,sK15(X0,X1))],[f166]) ).
fof(f169,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ( leaf_occ(sK19(X0),X0)
& next_subocc(sK18(X0),sK19(X0),tptp0)
& ( occurrence_of(sK19(X0),tptp2)
| occurrence_of(sK19(X0),tptp1) )
& next_subocc(sK17(X0),sK18(X0),tptp0)
& occurrence_of(sK18(X0),tptp4)
& root_occ(sK17(X0),X0)
& occurrence_of(sK17(X0),tptp3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17,sK18,sK19]),skolemize(X1,sK17(X0)),skolemize(X2,sK18(X0)),skolemize(X3,sK19(X0))],[f136]) ).
fof(f173,plain,
( occurrence_of(sK21,tptp0)
& ! [X1,X2] :
( sP0(sK21,X1,X2)
| ( occurrence_of(X2,tptp1)
& min_precedes(X1,sK22(X1),tptp0)
& subactivity_occurrence(sK22(X1),sK21)
& occurrence_of(sK22(X1),tptp2) )
| ~ leaf_occ(X2,sK21) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21,sK22]),skolemize(X0,sK21),skolemize(X3,sK22(X1))],[f139]) ).
fof(f174,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(cnf_transformation,[],[f65]) ).
fof(f178,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f68]) ).
fof(f191,plain,
! [X2,X0,X1] :
( ~ min_precedes(X1,X2,X0)
| atocc(X1,sK2(X0,X1,X2)) ),
inference(cnf_transformation,[],[f144]) ).
fof(f205,plain,
! [X0,X1,X5] :
( ~ leaf(X0,X1)
| ~ min_precedes(X0,X5,X1) ),
inference(cnf_transformation,[],[f150]) ).
fof(f213,plain,
! [X0,X1] :
( ~ atocc(X0,X1)
| occurrence_of(X0,sK9(X0,X1)) ),
inference(cnf_transformation,[],[f157]) ).
fof(f236,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| leaf(X0,sK15(X0,X1)) ),
inference(cnf_transformation,[],[f167]) ).
fof(f238,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| occurrence_of(X1,sK15(X0,X1)) ),
inference(cnf_transformation,[],[f167]) ).
fof(f256,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| leaf_occ(sK19(X0),X0) ),
inference(cnf_transformation,[],[f169]) ).
fof(f274,plain,
tptp1 != tptp2,
inference(cnf_transformation,[],[f62]) ).
fof(f279,plain,
occurrence_of(sK21,tptp0),
inference(cnf_transformation,[],[f173]) ).
fof(f280,plain,
! [X2,X1] :
( sP0(sK21,X1,X2)
| occurrence_of(X2,tptp1)
| ~ leaf_occ(X2,sK21) ),
inference(cnf_transformation,[],[f173]) ).
fof(f281,plain,
! [X2,X1] :
( sP0(sK21,X1,X2)
| min_precedes(X1,sK22(X1),tptp0)
| ~ leaf_occ(X2,sK21) ),
inference(cnf_transformation,[],[f173]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( activity_occurrence(X0)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f174]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f178]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] :
( atocc(X0,sK2(X2,X0,X1))
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f191]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ leaf(X0,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f205]) ).
tcf(c_91,plain,
! [X0: $i,X1: $i] :
( occurrence_of(X0,sK9(X0,X1))
| ~ atocc(X0,X1) ),
inference(cnf_transformation,[],[f213]) ).
tcf(c_112,plain,
! [X0: $i,X1: $i] :
( occurrence_of(X1,sK15(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f238]) ).
tcf(c_114,plain,
! [X0: $i,X1: $i] :
( leaf(X0,sK15(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f236]) ).
tcf(c_137,plain,
! [X0: $i] :
( leaf_occ(sK19(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f256]) ).
tcf(c_149,plain,
tptp1 != tptp2,
inference(cnf_transformation,[],[f274]) ).
tcf(c_156,negated_conjecture,
! [X0: $i,X1: $i] :
( sP0(sK21,X1,X0)
| min_precedes(X1,sK22(X1),tptp0)
| ~ leaf_occ(X0,sK21) ),
inference(cnf_transformation,[],[f281]) ).
tcf(c_157,negated_conjecture,
! [X0: $i,X1: $i] :
( occurrence_of(X0,tptp1)
| sP0(sK21,X1,X0)
| ~ leaf_occ(X0,sK21) ),
inference(cnf_transformation,[],[f280]) ).
tcf(c_158,negated_conjecture,
occurrence_of(sK21,tptp0),
inference(cnf_transformation,[],[f279]) ).
tcf(c_4152,negated_conjecture,
occurrence_of(sK21,tptp0),
inference(demodulation,[status(thm)],[c_158]) ).
tcf(c_4154,negated_conjecture,
! [X0: $i,X1: $i] :
( sP0(sK21,X1,X0)
| min_precedes(X1,sK22(X1),tptp0)
| ~ leaf_occ(X0,sK21) ),
inference(demodulation,[status(thm)],[c_156]) ).
tcf(c_5622,plain,
! [X0: $i] :
( ( X0 = tptp0 )
| ~ occurrence_of(sK21,X0) ),
inference(superposition,[status(thm)],[c_4152,c_53]) ).
tcf(c_6047,plain,
! [X0: $i,X1: $i] :
( sP0(sK21,X0,X1)
| ~ leaf_occ(X1,sK21)
| ~ leaf(X0,tptp0) ),
inference(superposition,[status(thm)],[c_4154,c_83]) ).
tcf(c_6164,plain,
! [X0: $i,X1: $i] :
( activity_occurrence(X0)
| ~ atocc(X0,X1) ),
inference(superposition,[status(thm)],[c_91,c_50]) ).
tcf(c_6340,plain,
! [X0: $i] :
( ( sK15(X0,sK21) = tptp0 )
| ~ leaf_occ(X0,sK21) ),
inference(superposition,[status(thm)],[c_112,c_5622]) ).
tcf(c_6415,plain,
( ( sK15(sK19(sK21),sK21) = tptp0 )
| ~ occurrence_of(sK21,tptp0) ),
inference(superposition,[status(thm)],[c_137,c_6340]) ).
tcf(c_6416,plain,
sK15(sK19(sK21),sK21) = tptp0,
inference(forward_subsumption_resolution,[status(thm)],[c_6415,c_4152]) ).
tcf(c_6417,plain,
( leaf(sK19(sK21),tptp0)
| ~ leaf_occ(sK19(sK21),sK21) ),
inference(superposition,[status(thm)],[c_6416,c_114]) ).
tcf(c_6425,plain,
( leaf(sK19(sK21),tptp0)
| ~ occurrence_of(sK21,tptp0) ),
inference(superposition,[status(thm)],[c_137,c_6417]) ).
tcf(c_6426,plain,
leaf(sK19(sK21),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_6425,c_4152]) ).
tcf(c_6783,plain,
! [X0: $i] :
( ( tptp1 = tptp2 )
| ~ occurrence_of(X0,tptp2)
| ~ occurrence_of(X0,tptp1) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_6882,plain,
! [X0: $i,X1: $i,X2: $i] :
( activity_occurrence(X0)
| ~ min_precedes(X0,X1,X2) ),
inference(superposition,[status(thm)],[c_67,c_6164]) ).
tcf(c_6929,plain,
! [X0: $i,X1: $i] :
( activity_occurrence(X1)
| sP0(sK21,X1,X0)
| ~ leaf_occ(X0,sK21) ),
inference(superposition,[status(thm)],[c_4154,c_6882]) ).
fof(f138,definition,
! [X0,X1,X2] :
( ~ sP0(X0,X1,X2)
| ( occurrence_of(X2,tptp2)
& ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp1) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f139,plain,
? [X0] :
( occurrence_of(X0,tptp0)
& ! [X1,X2] :
( sP0(X0,X1,X2)
| ( occurrence_of(X2,tptp1)
& ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2) ) )
| ~ leaf_occ(X2,X0) ) ),
inference(definition_folding,[],[f137,f138]) ).
fof(f170,plain,
! [X0,X1,X2] :
( ~ sP0(X0,X1,X2)
| ( occurrence_of(X2,tptp2)
& ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp1) ) ) ),
inference(nnf_transformation,[],[f138]) ).
fof(f171,plain,
! [X0,X1,X2] :
( ~ sP0(X0,X1,X2)
| ( occurrence_of(X2,tptp2)
& ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) ) ) ),
inference(rectify,[],[f170]) ).
fof(f172,plain,
! [X0,X1,X2] :
( ~ sP0(X0,X1,X2)
| ( occurrence_of(X2,tptp2)
& min_precedes(X1,sK20(X0,X1),tptp0)
& subactivity_occurrence(sK20(X0,X1),X0)
& occurrence_of(sK20(X0,X1),tptp1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20]),skolemize(X3,sK20(X0,X1))],[f171]) ).
fof(f275,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| occurrence_of(X2,tptp2) ),
inference(cnf_transformation,[],[f172]) ).
fof(f276,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| min_precedes(X1,sK20(X0,X1),tptp0) ),
inference(cnf_transformation,[],[f172]) ).
tcf(c_152,plain,
! [X0: $i,X1: $i,X2: $i] :
( min_precedes(X1,sK20(X0,X1),tptp0)
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f276]) ).
tcf(c_153,plain,
! [X0: $i,X1: $i,X2: $i] :
( occurrence_of(X2,tptp2)
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f275]) ).
tcf(c_6111,plain,
! [X0: $i,X1: $i] :
( occurrence_of(X1,tptp2)
| ~ leaf_occ(X1,sK21)
| ~ leaf(X0,tptp0) ),
inference(superposition,[status(thm)],[c_6047,c_153]) ).
tcf(c_6427,plain,
! [X0: $i] :
( occurrence_of(X0,tptp2)
| ~ leaf_occ(X0,sK21) ),
inference(superposition,[status(thm)],[c_6426,c_6111]) ).
tcf(c_6936,plain,
! [X0: $i,X1: $i] :
( ~ leaf_occ(X0,sK21)
| sP0(sK21,X1,X0) ),
inference(global_subsumption_just,[status(thm)],[c_6929,c_149,c_157,c_6427,c_6783]) ).
tcf(c_6937,plain,
! [X0: $i,X1: $i] :
( sP0(sK21,X1,X0)
| ~ leaf_occ(X0,sK21) ),
inference(renaming,[status(thm)],[c_6936]) ).
tcf(c_7410,plain,
! [X0: $i,X1: $i] :
( min_precedes(X1,sK20(sK21,X1),tptp0)
| ~ leaf_occ(X0,sK21) ),
inference(superposition,[status(thm)],[c_6937,c_152]) ).
tcf(c_7542,plain,
! [X0: $i] :
( min_precedes(X0,sK20(sK21,X0),tptp0)
| ~ occurrence_of(sK21,tptp0) ),
inference(superposition,[status(thm)],[c_137,c_7410]) ).
tcf(c_7543,plain,
! [X0: $i] : min_precedes(X0,sK20(sK21,X0),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_7542,c_4152]) ).
tcf(c_7550,plain,
! [X0: $i] : ~ leaf(X0,tptp0),
inference(superposition,[status(thm)],[c_7543,c_83]) ).
tcf(c_7560,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_6426,c_7550]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO011+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n017.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Thu Sep 24 06:24:48 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 4.28/1.31 % SZS status Started for theBenchmark.p
% 4.28/1.31 % SZS status Theorem for theBenchmark.p
% 4.28/1.31
% 4.28/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.28/1.31
% 4.28/1.31 % ------ iProver source info
% 4.28/1.31
% 4.28/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 4.28/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.28/1.31 % git: non_committed_changes: false
% 4.28/1.31
% 4.28/1.31 % ------ Parsing...
% 4.28/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.28/1.31
% 4.28/1.31 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.28/1.31
% 4.28/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.28/1.31
% 4.28/1.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.28/1.31 % ------ Proving...
% 4.28/1.31 % ------ Problem Properties
% 4.28/1.31
% 4.28/1.31 %
% 4.28/1.31 % clauses 110
% 4.28/1.31 % conjectures 5
% 4.28/1.31 % EPR 64
% 4.28/1.31 % Horn 84
% 4.28/1.31 % unary 13
% 4.28/1.31 % binary 50
% 4.28/1.31 % lits 295
% 4.28/1.31 % lits eq 18
% 4.28/1.31 % fd_pure 0
% 4.28/1.31 % fd_pseudo 0
% 4.28/1.31 % fd_cond 0
% 4.28/1.31 % fd_pseudo_cond 12
% 4.28/1.31 % AC symbols 0
% 4.28/1.31
% 4.28/1.31 % ------ Schedule dynamic 5 is on
% 4.28/1.31
% 4.28/1.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.28/1.31
% 4.28/1.31
% 4.28/1.31 % ------
% 4.28/1.31 % Current options:
% 4.28/1.31 % ------
% 4.28/1.31
% 4.28/1.31
% 4.28/1.31 %
% 4.28/1.31
% 4.28/1.31 % ------ Proving...
% 4.28/1.31 %
% 4.28/1.31
% 4.28/1.31 % SZS status Theorem for theBenchmark.p
% 4.28/1.31
% 4.28/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.28/1.31
% 4.28/1.31
%------------------------------------------------------------------------------