TSTP Solution File: PRO014+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : PRO014+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:19 EDT 2024
% Result : Theorem 7.02s 1.63s
% Output : CNFRefutation 7.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 80 ( 24 unt; 0 def)
% Number of atoms : 376 ( 0 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 475 ( 179 ~; 170 |; 114 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 152 ( 0 sgn 91 !; 33 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X1,X2,X3)
& min_precedes(X0,X1,X3) )
=> min_precedes(X0,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
fof(f5,axiom,
! [X15,X16,X17] :
( next_subocc(X15,X16,X17)
<=> ( ~ ? [X18] :
( min_precedes(X18,X16,X17)
& min_precedes(X15,X18,X17) )
& min_precedes(X15,X16,X17) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(f33,axiom,
! [X95,X96] :
( ( ~ leaf_occ(X95,X96)
& arboreal(X95)
& subactivity_occurrence(X95,X96)
& occurrence_of(X96,tptp0) )
=> ? [X97,X98,X99] :
( leaf(X99,tptp0)
& next_subocc(X98,X99,tptp0)
& ( occurrence_of(X99,tptp1)
| occurrence_of(X99,tptp2) )
& next_subocc(X97,X98,tptp0)
& occurrence_of(X98,tptp4)
& next_subocc(X95,X97,tptp0)
& occurrence_of(X97,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f46,conjecture,
! [X100,X101] :
( ( ~ leaf_occ(X100,X101)
& arboreal(X100)
& subactivity_occurrence(X100,X101)
& occurrence_of(X101,tptp0) )
=> ? [X102,X103] :
( leaf(X103,tptp0)
& min_precedes(X102,X103,tptp0)
& ( occurrence_of(X103,tptp1)
| occurrence_of(X103,tptp2) )
& next_subocc(X100,X102,tptp0)
& occurrence_of(X102,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f47,negated_conjecture,
~ ! [X100,X101] :
( ( ~ leaf_occ(X100,X101)
& arboreal(X100)
& subactivity_occurrence(X100,X101)
& occurrence_of(X101,tptp0) )
=> ? [X102,X103] :
( leaf(X103,tptp0)
& min_precedes(X102,X103,tptp0)
& ( occurrence_of(X103,tptp1)
| occurrence_of(X103,tptp2) )
& next_subocc(X100,X102,tptp0)
& occurrence_of(X102,tptp3) ) ),
inference(negated_conjecture,[],[f46]) ).
fof(f51,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( ~ ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) ) ),
inference(rectify,[],[f5]) ).
fof(f79,plain,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ? [X2,X3,X4] :
( leaf(X4,tptp0)
& next_subocc(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(rectify,[],[f33]) ).
fof(f80,plain,
~ ! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ? [X2,X3] :
( leaf(X3,tptp0)
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(rectify,[],[f47]) ).
fof(f83,plain,
! [X0,X1,X2,X3] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3) ),
inference(ennf_transformation,[],[f1]) ).
fof(f84,plain,
! [X0,X1,X2,X3] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3) ),
inference(flattening,[],[f83]) ).
fof(f91,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( ! [X3] :
( ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) ) ),
inference(ennf_transformation,[],[f51]) ).
fof(f125,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( leaf(X4,tptp0)
& next_subocc(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) )
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(ennf_transformation,[],[f79]) ).
fof(f126,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( leaf(X4,tptp0)
& next_subocc(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) )
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(flattening,[],[f125]) ).
fof(f127,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(X0,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) ),
inference(ennf_transformation,[],[f80]) ).
fof(f128,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(X0,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) ),
inference(flattening,[],[f127]) ).
fof(f129,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
| ~ min_precedes(X0,X1,X2) )
& ( ( ! [X3] :
( ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f91]) ).
fof(f130,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
| ~ min_precedes(X0,X1,X2) )
& ( ( ! [X3] :
( ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(flattening,[],[f129]) ).
fof(f131,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
| ~ min_precedes(X0,X1,X2) )
& ( ( ! [X4] :
( ~ min_precedes(X4,X1,X2)
| ~ min_precedes(X0,X4,X2) )
& min_precedes(X0,X1,X2) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(rectify,[],[f130]) ).
fof(f132,plain,
! [X0,X1,X2] :
( ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
=> ( min_precedes(sK0(X0,X1,X2),X1,X2)
& min_precedes(X0,sK0(X0,X1,X2),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ( min_precedes(sK0(X0,X1,X2),X1,X2)
& min_precedes(X0,sK0(X0,X1,X2),X2) )
| ~ min_precedes(X0,X1,X2) )
& ( ( ! [X4] :
( ~ min_precedes(X4,X1,X2)
| ~ min_precedes(X0,X4,X2) )
& min_precedes(X0,X1,X2) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f131,f132]) ).
fof(f163,plain,
! [X0] :
( ? [X2,X3,X4] :
( leaf(X4,tptp0)
& next_subocc(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) )
=> ( leaf(sK15(X0),tptp0)
& next_subocc(sK14(X0),sK15(X0),tptp0)
& ( occurrence_of(sK15(X0),tptp1)
| occurrence_of(sK15(X0),tptp2) )
& next_subocc(sK13(X0),sK14(X0),tptp0)
& occurrence_of(sK14(X0),tptp4)
& next_subocc(X0,sK13(X0),tptp0)
& occurrence_of(sK13(X0),tptp3) ) ),
introduced(choice_axiom,[]) ).
fof(f164,plain,
! [X0,X1] :
( ( leaf(sK15(X0),tptp0)
& next_subocc(sK14(X0),sK15(X0),tptp0)
& ( occurrence_of(sK15(X0),tptp1)
| occurrence_of(sK15(X0),tptp2) )
& next_subocc(sK13(X0),sK14(X0),tptp0)
& occurrence_of(sK14(X0),tptp4)
& next_subocc(X0,sK13(X0),tptp0)
& occurrence_of(sK13(X0),tptp3) )
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14,sK15])],[f126,f163]) ).
fof(f165,plain,
( ? [X0,X1] :
( ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(X0,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ( ! [X3,X2] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(sK16,sK17)
& arboreal(sK16)
& subactivity_occurrence(sK16,sK17)
& occurrence_of(sK17,tptp0) ) ),
introduced(choice_axiom,[]) ).
fof(f166,plain,
( ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(sK16,sK17)
& arboreal(sK16)
& subactivity_occurrence(sK16,sK17)
& occurrence_of(sK17,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK16,sK17])],[f128,f165]) ).
fof(f167,plain,
! [X2,X3,X0,X1] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3) ),
inference(cnf_transformation,[],[f84]) ).
fof(f171,plain,
! [X2,X0,X1] :
( min_precedes(X0,X1,X2)
| ~ next_subocc(X0,X1,X2) ),
inference(cnf_transformation,[],[f133]) ).
fof(f226,plain,
! [X0,X1] :
( occurrence_of(sK13(X0),tptp3)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f227,plain,
! [X0,X1] :
( next_subocc(X0,sK13(X0),tptp0)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f229,plain,
! [X0,X1] :
( next_subocc(sK13(X0),sK14(X0),tptp0)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f230,plain,
! [X0,X1] :
( occurrence_of(sK15(X0),tptp1)
| occurrence_of(sK15(X0),tptp2)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f231,plain,
! [X0,X1] :
( next_subocc(sK14(X0),sK15(X0),tptp0)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f232,plain,
! [X0,X1] :
( leaf(sK15(X0),tptp0)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f164]) ).
fof(f245,plain,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f166]) ).
fof(f246,plain,
subactivity_occurrence(sK16,sK17),
inference(cnf_transformation,[],[f166]) ).
fof(f247,plain,
arboreal(sK16),
inference(cnf_transformation,[],[f166]) ).
fof(f248,plain,
~ leaf_occ(sK16,sK17),
inference(cnf_transformation,[],[f166]) ).
fof(f249,plain,
! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X3,tptp2)
| ~ next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f166]) ).
fof(f250,plain,
! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X3,tptp1)
| ~ next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f166]) ).
cnf(c_49,plain,
( ~ min_precedes(X0,X1,X2)
| ~ min_precedes(X1,X3,X2)
| min_precedes(X0,X3,X2) ),
inference(cnf_transformation,[],[f167]) ).
cnf(c_56,plain,
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f171]) ).
cnf(c_108,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| leaf(sK15(X0),tptp0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f232]) ).
cnf(c_109,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| next_subocc(sK14(X0),sK15(X0),tptp0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f231]) ).
cnf(c_110,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| occurrence_of(sK15(X0),tptp1)
| occurrence_of(sK15(X0),tptp2)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f230]) ).
cnf(c_111,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| next_subocc(sK13(X0),sK14(X0),tptp0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f229]) ).
cnf(c_113,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| next_subocc(X0,sK13(X0),tptp0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f227]) ).
cnf(c_114,plain,
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| occurrence_of(sK13(X0),tptp3)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f226]) ).
cnf(c_127,negated_conjecture,
( ~ min_precedes(X0,X1,tptp0)
| ~ next_subocc(sK16,X0,tptp0)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(X1,tptp1)
| ~ leaf(X1,tptp0) ),
inference(cnf_transformation,[],[f250]) ).
cnf(c_128,negated_conjecture,
( ~ min_precedes(X0,X1,tptp0)
| ~ next_subocc(sK16,X0,tptp0)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(X1,tptp2)
| ~ leaf(X1,tptp0) ),
inference(cnf_transformation,[],[f249]) ).
cnf(c_129,negated_conjecture,
~ leaf_occ(sK16,sK17),
inference(cnf_transformation,[],[f248]) ).
cnf(c_130,negated_conjecture,
arboreal(sK16),
inference(cnf_transformation,[],[f247]) ).
cnf(c_131,negated_conjecture,
subactivity_occurrence(sK16,sK17),
inference(cnf_transformation,[],[f246]) ).
cnf(c_132,negated_conjecture,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f245]) ).
cnf(c_7072,negated_conjecture,
occurrence_of(sK17,tptp0),
inference(demodulation,[status(thm)],[c_132]) ).
cnf(c_7073,negated_conjecture,
subactivity_occurrence(sK16,sK17),
inference(demodulation,[status(thm)],[c_131]) ).
cnf(c_7074,negated_conjecture,
arboreal(sK16),
inference(demodulation,[status(thm)],[c_130]) ).
cnf(c_7075,negated_conjecture,
~ leaf_occ(sK16,sK17),
inference(demodulation,[status(thm)],[c_129]) ).
cnf(c_7076,negated_conjecture,
( ~ min_precedes(X0,X1,tptp0)
| ~ next_subocc(sK16,X0,tptp0)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(X1,tptp2)
| ~ leaf(X1,tptp0) ),
inference(demodulation,[status(thm)],[c_128]) ).
cnf(c_7077,negated_conjecture,
( ~ min_precedes(X0,X1,tptp0)
| ~ next_subocc(sK16,X0,tptp0)
| ~ occurrence_of(X0,tptp3)
| ~ occurrence_of(X1,tptp1)
| ~ leaf(X1,tptp0) ),
inference(demodulation,[status(thm)],[c_127]) ).
cnf(c_10153,plain,
( ~ occurrence_of(sK17,tptp0)
| ~ subactivity_occurrence(sK16,sK17)
| ~ arboreal(sK16)
| leaf(sK15(sK16),tptp0) ),
inference(superposition,[status(thm)],[c_108,c_7075]) ).
cnf(c_10161,plain,
leaf(sK15(sK16),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_10153,c_7074,c_7073,c_7072]) ).
cnf(c_10325,plain,
( ~ occurrence_of(sK17,tptp0)
| ~ subactivity_occurrence(sK16,sK17)
| ~ arboreal(sK16)
| occurrence_of(sK13(sK16),tptp3) ),
inference(superposition,[status(thm)],[c_114,c_7075]) ).
cnf(c_10337,plain,
occurrence_of(sK13(sK16),tptp3),
inference(forward_subsumption_resolution,[status(thm)],[c_10325,c_7074,c_7073,c_7072]) ).
cnf(c_10724,plain,
( ~ occurrence_of(sK17,tptp0)
| ~ subactivity_occurrence(sK16,sK17)
| ~ arboreal(sK16)
| next_subocc(sK16,sK13(sK16),tptp0) ),
inference(superposition,[status(thm)],[c_113,c_7075]) ).
cnf(c_10730,plain,
next_subocc(sK16,sK13(sK16),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_10724,c_7074,c_7073,c_7072]) ).
cnf(c_10841,plain,
( ~ occurrence_of(sK17,tptp0)
| ~ subactivity_occurrence(sK16,sK17)
| ~ arboreal(sK16)
| next_subocc(sK14(sK16),sK15(sK16),tptp0) ),
inference(superposition,[status(thm)],[c_109,c_7075]) ).
cnf(c_10852,plain,
next_subocc(sK14(sK16),sK15(sK16),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_10841,c_7074,c_7073,c_7072]) ).
cnf(c_10931,plain,
( ~ occurrence_of(sK17,tptp0)
| ~ subactivity_occurrence(sK16,sK17)
| ~ arboreal(sK16)
| next_subocc(sK13(sK16),sK14(sK16),tptp0) ),
inference(superposition,[status(thm)],[c_111,c_7075]) ).
cnf(c_10937,plain,
next_subocc(sK13(sK16),sK14(sK16),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_10931,c_7074,c_7073,c_7072]) ).
cnf(c_10990,plain,
( ~ occurrence_of(sK17,tptp0)
| ~ subactivity_occurrence(sK16,sK17)
| ~ arboreal(sK16)
| occurrence_of(sK15(sK16),tptp1)
| occurrence_of(sK15(sK16),tptp2) ),
inference(superposition,[status(thm)],[c_110,c_7075]) ).
cnf(c_11002,plain,
( occurrence_of(sK15(sK16),tptp1)
| occurrence_of(sK15(sK16),tptp2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_10990,c_7074,c_7073,c_7072]) ).
cnf(c_11108,plain,
min_precedes(sK14(sK16),sK15(sK16),tptp0),
inference(superposition,[status(thm)],[c_10852,c_56]) ).
cnf(c_11111,plain,
min_precedes(sK13(sK16),sK14(sK16),tptp0),
inference(superposition,[status(thm)],[c_10937,c_56]) ).
cnf(c_12292,plain,
( ~ min_precedes(sK14(sK16),X0,tptp0)
| min_precedes(sK13(sK16),X0,tptp0) ),
inference(superposition,[status(thm)],[c_11111,c_49]) ).
cnf(c_21155,plain,
min_precedes(sK13(sK16),sK15(sK16),tptp0),
inference(superposition,[status(thm)],[c_11108,c_12292]) ).
cnf(c_21198,plain,
( ~ next_subocc(sK16,sK13(sK16),tptp0)
| ~ occurrence_of(sK15(sK16),tptp1)
| ~ occurrence_of(sK13(sK16),tptp3)
| ~ leaf(sK15(sK16),tptp0) ),
inference(superposition,[status(thm)],[c_21155,c_7077]) ).
cnf(c_21199,plain,
( ~ next_subocc(sK16,sK13(sK16),tptp0)
| ~ occurrence_of(sK15(sK16),tptp2)
| ~ occurrence_of(sK13(sK16),tptp3)
| ~ leaf(sK15(sK16),tptp0) ),
inference(superposition,[status(thm)],[c_21155,c_7076]) ).
cnf(c_21204,plain,
~ occurrence_of(sK15(sK16),tptp2),
inference(forward_subsumption_resolution,[status(thm)],[c_21199,c_10161,c_10337,c_10730]) ).
cnf(c_21205,plain,
~ occurrence_of(sK15(sK16),tptp1),
inference(forward_subsumption_resolution,[status(thm)],[c_21198,c_10161,c_10337,c_10730]) ).
cnf(c_21212,plain,
occurrence_of(sK15(sK16),tptp1),
inference(backward_subsumption_resolution,[status(thm)],[c_11002,c_21204]) ).
cnf(c_21213,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_21212,c_21205]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : PRO014+2 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu May 2 23:53:24 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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
% 7.02/1.63 % SZS status Started for theBenchmark.p
% 7.02/1.63 % SZS status Theorem for theBenchmark.p
% 7.02/1.63
% 7.02/1.63 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.02/1.63
% 7.02/1.63 ------ iProver source info
% 7.02/1.63
% 7.02/1.63 git: date: 2024-05-02 19:28:25 +0000
% 7.02/1.63 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.02/1.63 git: non_committed_changes: false
% 7.02/1.63
% 7.02/1.63 ------ Parsing...
% 7.02/1.63 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.02/1.63
% 7.02/1.63 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.02/1.63
% 7.02/1.63 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.02/1.63
% 7.02/1.63 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.02/1.63 ------ Proving...
% 7.02/1.63 ------ Problem Properties
% 7.02/1.63
% 7.02/1.63
% 7.02/1.63 clauses 83
% 7.02/1.63 conjectures 6
% 7.02/1.63 EPR 49
% 7.02/1.63 Horn 63
% 7.02/1.63 unary 16
% 7.02/1.63 binary 32
% 7.02/1.63 lits 215
% 7.02/1.63 lits eq 10
% 7.02/1.63 fd_pure 0
% 7.02/1.63 fd_pseudo 0
% 7.02/1.63 fd_cond 0
% 7.02/1.63 fd_pseudo_cond 4
% 7.02/1.63 AC symbols 0
% 7.02/1.63
% 7.02/1.63 ------ Schedule dynamic 5 is on
% 7.02/1.63
% 7.02/1.63 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.02/1.63
% 7.02/1.63
% 7.02/1.63 ------
% 7.02/1.63 Current options:
% 7.02/1.63 ------
% 7.02/1.63
% 7.02/1.63
% 7.02/1.63
% 7.02/1.63
% 7.02/1.63 ------ Proving...
% 7.02/1.63
% 7.02/1.63
% 7.02/1.63 % SZS status Theorem for theBenchmark.p
% 7.02/1.63
% 7.02/1.63 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.38/1.63
% 7.38/1.64
%------------------------------------------------------------------------------