TSTP Solution File: PRO011+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : PRO011+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:54:17 EDT 2024
% Result : Theorem 0.42s 1.10s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 16
% Syntax : Number of formulae : 107 ( 13 unt; 0 def)
% Number of atoms : 411 ( 14 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 431 ( 127 ~; 142 |; 132 &)
% ( 8 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 239 ( 10 sgn 125 !; 55 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X4,X5,X6] :
( ( occurrence_of(X4,X6)
& occurrence_of(X4,X5) )
=> X5 = X6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(f8,axiom,
! [X16,X17] :
( occurrence_of(X16,X17)
=> ( arboreal(X16)
<=> atomic(X17) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(f22,axiom,
! [X56,X57] :
( leaf(X56,X57)
<=> ( ~ ? [X59] : min_precedes(X56,X59,X57)
& ( ? [X58] : min_precedes(X58,X56,X57)
| root(X56,X57) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(f35,axiom,
! [X102,X103] :
( leaf_occ(X102,X103)
<=> ? [X104] :
( leaf(X102,X104)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,X104) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(f36,axiom,
! [X105] :
( occurrence_of(X105,tptp0)
=> ? [X106,X107,X108] :
( leaf_occ(X108,X105)
& next_subocc(X107,X108,tptp0)
& ( occurrence_of(X108,tptp2)
| occurrence_of(X108,tptp1) )
& next_subocc(X106,X107,tptp0)
& occurrence_of(X107,tptp4)
& root_occ(X106,X105)
& occurrence_of(X106,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_35) ).
fof(f40,axiom,
atomic(tptp1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_39) ).
fof(f48,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_47) ).
fof(f49,conjecture,
! [X109] :
( occurrence_of(X109,tptp0)
=> ? [X110,X111] :
( ( occurrence_of(X111,tptp2)
=> ~ ? [X113] :
( min_precedes(X110,X113,tptp0)
& subactivity_occurrence(X113,X109)
& occurrence_of(X113,tptp1) ) )
& ( occurrence_of(X111,tptp1)
=> ~ ? [X112] :
( min_precedes(X110,X112,tptp0)
& subactivity_occurrence(X112,X109)
& occurrence_of(X112,tptp2) ) )
& leaf_occ(X111,X109) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f50,negated_conjecture,
~ ! [X109] :
( occurrence_of(X109,tptp0)
=> ? [X110,X111] :
( ( occurrence_of(X111,tptp2)
=> ~ ? [X113] :
( min_precedes(X110,X113,tptp0)
& subactivity_occurrence(X113,X109)
& occurrence_of(X113,tptp1) ) )
& ( occurrence_of(X111,tptp1)
=> ~ ? [X112] :
( min_precedes(X110,X112,tptp0)
& subactivity_occurrence(X112,X109)
& occurrence_of(X112,tptp2) ) )
& leaf_occ(X111,X109) ) ),
inference(negated_conjecture,[],[f49]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& occurrence_of(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f3]) ).
fof(f57,plain,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
inference(rectify,[],[f8]) ).
fof(f71,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ~ ? [X2] : min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) ) ),
inference(rectify,[],[f22]) ).
fof(f84,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
<=> ? [X2] :
( leaf(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) ) ),
inference(rectify,[],[f35]) ).
fof(f85,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(rectify,[],[f36]) ).
fof(f86,plain,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( ( occurrence_of(X2,tptp2)
=> ~ ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) ) )
& ( occurrence_of(X2,tptp1)
=> ~ ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp2) ) )
& leaf_occ(X2,X0) ) ),
inference(rectify,[],[f50]) ).
fof(f91,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f52]) ).
fof(f92,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(flattening,[],[f91]) ).
fof(f99,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f57]) ).
fof(f116,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ! [X2] : ~ min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) ) ),
inference(ennf_transformation,[],[f71]) ).
fof(f135,plain,
! [X0] :
( ? [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) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f85]) ).
fof(f136,plain,
? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| ( ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f86]) ).
fof(f137,plain,
! [X1,X0,X2] :
( ( ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ sP0(X1,X0,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f138,plain,
? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| sP0(X1,X0,X2)
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) ),
inference(definition_folding,[],[f136,f137]) ).
fof(f141,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f99]) ).
fof(f150,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ? [X2] : min_precedes(X0,X2,X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X2] : ~ min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(nnf_transformation,[],[f116]) ).
fof(f151,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ? [X2] : min_precedes(X0,X2,X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X2] : ~ min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(flattening,[],[f150]) ).
fof(f152,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ? [X2] : min_precedes(X0,X2,X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X4] : ~ min_precedes(X0,X4,X1)
& ( ? [X5] : min_precedes(X5,X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(rectify,[],[f151]) ).
fof(f153,plain,
! [X0,X1] :
( ? [X2] : min_precedes(X0,X2,X1)
=> min_precedes(X0,sK6(X0,X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f154,plain,
! [X0,X1] :
( ? [X5] : min_precedes(X5,X0,X1)
=> min_precedes(sK7(X0,X1),X0,X1) ),
introduced(choice_axiom,[]) ).
fof(f155,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| min_precedes(X0,sK6(X0,X1),X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X4] : ~ min_precedes(X0,X4,X1)
& ( min_precedes(sK7(X0,X1),X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f152,f154,f153]) ).
fof(f170,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,[],[f84]) ).
fof(f171,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) ) )
& ( ? [X3] :
( leaf(X0,X3)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X3) )
| ~ leaf_occ(X0,X1) ) ),
inference(rectify,[],[f170]) ).
fof(f172,plain,
! [X0,X1] :
( ? [X3] :
( leaf(X0,X3)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X3) )
=> ( leaf(X0,sK14(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK14(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f173,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) ) )
& ( ( leaf(X0,sK14(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK14(X0,X1)) )
| ~ leaf_occ(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14])],[f171,f172]) ).
fof(f174,plain,
! [X0] :
( ? [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) )
=> ( leaf_occ(sK17(X0),X0)
& next_subocc(sK16(X0),sK17(X0),tptp0)
& ( occurrence_of(sK17(X0),tptp2)
| occurrence_of(sK17(X0),tptp1) )
& next_subocc(sK15(X0),sK16(X0),tptp0)
& occurrence_of(sK16(X0),tptp4)
& root_occ(sK15(X0),X0)
& occurrence_of(sK15(X0),tptp3) ) ),
introduced(choice_axiom,[]) ).
fof(f175,plain,
! [X0] :
( ( leaf_occ(sK17(X0),X0)
& next_subocc(sK16(X0),sK17(X0),tptp0)
& ( occurrence_of(sK17(X0),tptp2)
| occurrence_of(sK17(X0),tptp1) )
& next_subocc(sK15(X0),sK16(X0),tptp0)
& occurrence_of(sK16(X0),tptp4)
& root_occ(sK15(X0),X0)
& occurrence_of(sK15(X0),tptp3) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK15,sK16,sK17])],[f135,f174]) ).
fof(f176,plain,
! [X1,X0,X2] :
( ( ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ sP0(X1,X0,X2) ),
inference(nnf_transformation,[],[f137]) ).
fof(f177,plain,
! [X0,X1,X2] :
( ( ? [X3] :
( min_precedes(X0,X3,tptp0)
& subactivity_occurrence(X3,X1)
& occurrence_of(X3,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ sP0(X0,X1,X2) ),
inference(rectify,[],[f176]) ).
fof(f178,plain,
! [X0,X1] :
( ? [X3] :
( min_precedes(X0,X3,tptp0)
& subactivity_occurrence(X3,X1)
& occurrence_of(X3,tptp2) )
=> ( min_precedes(X0,sK18(X0,X1),tptp0)
& subactivity_occurrence(sK18(X0,X1),X1)
& occurrence_of(sK18(X0,X1),tptp2) ) ),
introduced(choice_axiom,[]) ).
fof(f179,plain,
! [X0,X1,X2] :
( ( min_precedes(X0,sK18(X0,X1),tptp0)
& subactivity_occurrence(sK18(X0,X1),X1)
& occurrence_of(sK18(X0,X1),tptp2)
& occurrence_of(X2,tptp1) )
| ~ sP0(X0,X1,X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18])],[f177,f178]) ).
fof(f180,plain,
( ? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| sP0(X1,X0,X2)
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) )
=> ( ! [X2,X1] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,sK19)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| sP0(X1,sK19,X2)
| ~ leaf_occ(X2,sK19) )
& occurrence_of(sK19,tptp0) ) ),
introduced(choice_axiom,[]) ).
fof(f181,plain,
! [X1] :
( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,sK19)
& occurrence_of(X3,tptp1) )
=> ( min_precedes(X1,sK20(X1),tptp0)
& subactivity_occurrence(sK20(X1),sK19)
& occurrence_of(sK20(X1),tptp1) ) ),
introduced(choice_axiom,[]) ).
fof(f182,plain,
( ! [X1,X2] :
( ( min_precedes(X1,sK20(X1),tptp0)
& subactivity_occurrence(sK20(X1),sK19)
& occurrence_of(sK20(X1),tptp1)
& occurrence_of(X2,tptp2) )
| sP0(X1,sK19,X2)
| ~ leaf_occ(X2,sK19) )
& occurrence_of(sK19,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19,sK20])],[f138,f181,f180]) ).
fof(f187,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f92]) ).
fof(f193,plain,
! [X0,X1] :
( arboreal(X0)
| ~ atomic(X1)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f141]) ).
fof(f215,plain,
! [X0,X1,X4] :
( ~ min_precedes(X0,X4,X1)
| ~ leaf(X0,X1) ),
inference(cnf_transformation,[],[f155]) ).
fof(f242,plain,
! [X0,X1] :
( occurrence_of(X1,sK14(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f173]) ).
fof(f243,plain,
! [X0,X1] :
( subactivity_occurrence(X0,X1)
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f173]) ).
fof(f244,plain,
! [X0,X1] :
( leaf(X0,sK14(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f173]) ).
fof(f245,plain,
! [X2,X0,X1] :
( leaf_occ(X0,X1)
| ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) ),
inference(cnf_transformation,[],[f173]) ).
fof(f252,plain,
! [X0] :
( leaf_occ(sK17(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f256,plain,
atomic(tptp1),
inference(cnf_transformation,[],[f40]) ).
fof(f264,plain,
tptp1 != tptp2,
inference(cnf_transformation,[],[f48]) ).
fof(f265,plain,
! [X2,X0,X1] :
( occurrence_of(X2,tptp1)
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f179]) ).
fof(f268,plain,
! [X2,X0,X1] :
( min_precedes(X0,sK18(X0,X1),tptp0)
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f179]) ).
fof(f269,plain,
occurrence_of(sK19,tptp0),
inference(cnf_transformation,[],[f182]) ).
fof(f270,plain,
! [X2,X1] :
( occurrence_of(X2,tptp2)
| sP0(X1,sK19,X2)
| ~ leaf_occ(X2,sK19) ),
inference(cnf_transformation,[],[f182]) ).
fof(f271,plain,
! [X2,X1] :
( occurrence_of(sK20(X1),tptp1)
| sP0(X1,sK19,X2)
| ~ leaf_occ(X2,sK19) ),
inference(cnf_transformation,[],[f182]) ).
fof(f273,plain,
! [X2,X1] :
( min_precedes(X1,sK20(X1),tptp0)
| sP0(X1,sK19,X2)
| ~ leaf_occ(X2,sK19) ),
inference(cnf_transformation,[],[f182]) ).
cnf(c_53,plain,
( ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f187]) ).
cnf(c_58,plain,
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f193]) ).
cnf(c_82,plain,
( ~ min_precedes(X0,X1,X2)
| ~ leaf(X0,X2) ),
inference(cnf_transformation,[],[f215]) ).
cnf(c_108,plain,
( ~ occurrence_of(X0,X1)
| ~ leaf(X2,X1)
| ~ subactivity_occurrence(X2,X0)
| leaf_occ(X2,X0) ),
inference(cnf_transformation,[],[f245]) ).
cnf(c_109,plain,
( ~ leaf_occ(X0,X1)
| leaf(X0,sK14(X0,X1)) ),
inference(cnf_transformation,[],[f244]) ).
cnf(c_110,plain,
( ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f243]) ).
cnf(c_111,plain,
( ~ leaf_occ(X0,X1)
| occurrence_of(X1,sK14(X0,X1)) ),
inference(cnf_transformation,[],[f242]) ).
cnf(c_112,plain,
( ~ occurrence_of(X0,tptp0)
| leaf_occ(sK17(X0),X0) ),
inference(cnf_transformation,[],[f252]) ).
cnf(c_122,plain,
atomic(tptp1),
inference(cnf_transformation,[],[f256]) ).
cnf(c_130,plain,
tptp2 != tptp1,
inference(cnf_transformation,[],[f264]) ).
cnf(c_131,plain,
( ~ sP0(X0,X1,X2)
| min_precedes(X0,sK18(X0,X1),tptp0) ),
inference(cnf_transformation,[],[f268]) ).
cnf(c_134,plain,
( ~ sP0(X0,X1,X2)
| occurrence_of(X2,tptp1) ),
inference(cnf_transformation,[],[f265]) ).
cnf(c_135,negated_conjecture,
( ~ leaf_occ(X0,sK19)
| min_precedes(X1,sK20(X1),tptp0)
| sP0(X1,sK19,X0) ),
inference(cnf_transformation,[],[f273]) ).
cnf(c_137,negated_conjecture,
( ~ leaf_occ(X0,sK19)
| sP0(X1,sK19,X0)
| occurrence_of(sK20(X1),tptp1) ),
inference(cnf_transformation,[],[f271]) ).
cnf(c_138,negated_conjecture,
( ~ leaf_occ(X0,sK19)
| sP0(X1,sK19,X0)
| occurrence_of(X0,tptp2) ),
inference(cnf_transformation,[],[f270]) ).
cnf(c_139,negated_conjecture,
occurrence_of(sK19,tptp0),
inference(cnf_transformation,[],[f269]) ).
cnf(c_6904,negated_conjecture,
occurrence_of(sK19,tptp0),
inference(demodulation,[status(thm)],[c_139]) ).
cnf(c_6905,negated_conjecture,
( ~ leaf_occ(X0,sK19)
| sP0(X1,sK19,X0)
| occurrence_of(X0,tptp2) ),
inference(demodulation,[status(thm)],[c_138]) ).
cnf(c_6906,negated_conjecture,
( ~ leaf_occ(X0,sK19)
| sP0(X1,sK19,X0)
| occurrence_of(sK20(X1),tptp1) ),
inference(demodulation,[status(thm)],[c_137]) ).
cnf(c_6908,negated_conjecture,
( ~ leaf_occ(X0,sK19)
| min_precedes(X1,sK20(X1),tptp0)
| sP0(X1,sK19,X0) ),
inference(demodulation,[status(thm)],[c_135]) ).
cnf(c_8156,plain,
( ~ occurrence_of(X0,tptp0)
| subactivity_occurrence(sK17(X0),X0) ),
inference(superposition,[status(thm)],[c_112,c_110]) ).
cnf(c_8210,plain,
( ~ leaf_occ(X0,sK19)
| min_precedes(X1,sK20(X1),tptp0)
| occurrence_of(X0,tptp1) ),
inference(superposition,[status(thm)],[c_6908,c_134]) ).
cnf(c_8411,plain,
( ~ occurrence_of(sK19,tptp0)
| min_precedes(X0,sK20(X0),tptp0)
| occurrence_of(sK17(sK19),tptp1) ),
inference(superposition,[status(thm)],[c_112,c_8210]) ).
cnf(c_8412,plain,
( min_precedes(X0,sK20(X0),tptp0)
| occurrence_of(sK17(sK19),tptp1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_8411,c_6904]) ).
cnf(c_8499,plain,
( ~ leaf(X0,tptp0)
| occurrence_of(sK17(sK19),tptp1) ),
inference(superposition,[status(thm)],[c_8412,c_82]) ).
cnf(c_8892,plain,
( ~ occurrence_of(sK19,tptp0)
| leaf_occ(sK17(sK19),sK19) ),
inference(instantiation,[status(thm)],[c_112]) ).
cnf(c_9231,plain,
( ~ occurrence_of(X0,tptp2)
| ~ occurrence_of(X0,tptp1)
| tptp2 = tptp1 ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_9973,plain,
( ~ leaf_occ(X0,sK19)
| min_precedes(X1,sK18(X1,sK19),tptp0)
| occurrence_of(sK20(X1),tptp1) ),
inference(superposition,[status(thm)],[c_6906,c_131]) ).
cnf(c_9974,plain,
( ~ leaf_occ(X0,sK19)
| min_precedes(X1,sK18(X1,sK19),tptp0)
| occurrence_of(X0,tptp2) ),
inference(superposition,[status(thm)],[c_6905,c_131]) ).
cnf(c_10049,plain,
( ~ occurrence_of(sK19,X0)
| X0 = tptp0 ),
inference(superposition,[status(thm)],[c_6904,c_53]) ).
cnf(c_10197,plain,
( ~ leaf_occ(X0,sK19)
| sK14(X0,sK19) = tptp0 ),
inference(superposition,[status(thm)],[c_111,c_10049]) ).
cnf(c_10215,plain,
( ~ occurrence_of(sK19,tptp0)
| min_precedes(X0,sK18(X0,sK19),tptp0)
| occurrence_of(sK17(sK19),tptp2) ),
inference(superposition,[status(thm)],[c_112,c_9974]) ).
cnf(c_10216,plain,
( min_precedes(X0,sK18(X0,sK19),tptp0)
| occurrence_of(sK17(sK19),tptp2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_10215,c_6904]) ).
cnf(c_10229,plain,
( ~ leaf(X0,tptp0)
| occurrence_of(sK17(sK19),tptp2) ),
inference(superposition,[status(thm)],[c_10216,c_82]) ).
cnf(c_10334,plain,
( ~ occurrence_of(sK19,tptp0)
| min_precedes(X0,sK18(X0,sK19),tptp0)
| occurrence_of(sK20(X0),tptp1) ),
inference(superposition,[status(thm)],[c_112,c_9973]) ).
cnf(c_10335,plain,
( min_precedes(X0,sK18(X0,sK19),tptp0)
| occurrence_of(sK20(X0),tptp1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_10334,c_6904]) ).
cnf(c_10350,plain,
( ~ leaf(X0,tptp0)
| occurrence_of(sK20(X0),tptp1) ),
inference(superposition,[status(thm)],[c_10335,c_82]) ).
cnf(c_10970,plain,
( ~ leaf(X0,tptp0)
| ~ atomic(tptp1)
| arboreal(sK20(X0)) ),
inference(superposition,[status(thm)],[c_10350,c_58]) ).
cnf(c_10972,plain,
( ~ leaf(X0,tptp0)
| arboreal(sK20(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_10970,c_122]) ).
cnf(c_11126,plain,
( ~ leaf(X0,tptp0)
| ~ subactivity_occurrence(X0,sK19)
| leaf_occ(X0,sK19) ),
inference(superposition,[status(thm)],[c_6904,c_108]) ).
cnf(c_11518,plain,
( ~ leaf(sK17(sK19),tptp0)
| ~ occurrence_of(sK19,tptp0)
| leaf_occ(sK17(sK19),sK19) ),
inference(superposition,[status(thm)],[c_8156,c_11126]) ).
cnf(c_11525,plain,
( ~ leaf(sK17(sK19),tptp0)
| leaf_occ(sK17(sK19),sK19) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11518,c_6904]) ).
cnf(c_11601,plain,
leaf_occ(sK17(sK19),sK19),
inference(global_subsumption_just,[status(thm)],[c_11525,c_139,c_8892]) ).
cnf(c_12078,plain,
( ~ occurrence_of(sK17(sK19),tptp2)
| ~ occurrence_of(sK17(sK19),tptp1)
| tptp2 = tptp1 ),
inference(instantiation,[status(thm)],[c_9231]) ).
cnf(c_12320,plain,
~ leaf(X0,tptp0),
inference(global_subsumption_just,[status(thm)],[c_10972,c_130,c_8499,c_10229,c_12078]) ).
cnf(c_13532,plain,
sK14(sK17(sK19),sK19) = tptp0,
inference(superposition,[status(thm)],[c_11601,c_10197]) ).
cnf(c_13535,plain,
( ~ leaf_occ(sK17(sK19),sK19)
| leaf(sK17(sK19),tptp0) ),
inference(superposition,[status(thm)],[c_13532,c_109]) ).
cnf(c_13536,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_13535,c_12320,c_11601]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : PRO011+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.10 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n028.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 23:58:48 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.42/1.10 % SZS status Started for theBenchmark.p
% 0.42/1.10 % SZS status Theorem for theBenchmark.p
% 0.42/1.10
% 0.42/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.42/1.10
% 0.42/1.10 ------ iProver source info
% 0.42/1.10
% 0.42/1.10 git: date: 2024-05-02 19:28:25 +0000
% 0.42/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.42/1.10 git: non_committed_changes: false
% 0.42/1.10
% 0.42/1.10 ------ Parsing...
% 0.42/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.42/1.10
% 0.42/1.10 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 0.42/1.10
% 0.42/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.42/1.10
% 0.42/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.42/1.10 ------ Proving...
% 0.42/1.10 ------ Problem Properties
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 clauses 90
% 0.42/1.10 conjectures 5
% 0.42/1.10 EPR 46
% 0.42/1.10 Horn 74
% 0.42/1.10 unary 13
% 0.42/1.10 binary 45
% 0.42/1.10 lits 217
% 0.42/1.10 lits eq 9
% 0.42/1.10 fd_pure 0
% 0.42/1.10 fd_pseudo 0
% 0.42/1.10 fd_cond 0
% 0.42/1.10 fd_pseudo_cond 3
% 0.42/1.10 AC symbols 0
% 0.42/1.10
% 0.42/1.10 ------ Schedule dynamic 5 is on
% 0.42/1.10
% 0.42/1.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 ------
% 0.42/1.10 Current options:
% 0.42/1.10 ------
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 ------ Proving...
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 % SZS status Theorem for theBenchmark.p
% 0.42/1.10
% 0.42/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.42/1.10
% 0.42/1.11
%------------------------------------------------------------------------------