TSTP Solution File: PRO014+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PRO014+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.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 : Sun May 5 08:47:22 EDT 2024
% Result : Theorem 0.61s 0.80s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 85 ( 14 unt; 0 def)
% Number of atoms : 378 ( 0 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 464 ( 171 ~; 164 |; 114 &)
% ( 6 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 4 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 129 ( 96 !; 33 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f829,plain,
$false,
inference(avatar_sat_refutation,[],[f344,f732,f826,f828]) ).
fof(f828,plain,
( ~ spl19_4
| ~ spl19_13 ),
inference(avatar_split_clause,[],[f827,f711,f341]) ).
fof(f341,plain,
( spl19_4
<=> occurrence_of(sK15(sK16),tptp1) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_4])]) ).
fof(f711,plain,
( spl19_13
<=> min_precedes(sK13(sK16),sK15(sK16),tptp0) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_13])]) ).
fof(f827,plain,
( ~ occurrence_of(sK15(sK16),tptp1)
| ~ spl19_13 ),
inference(subsumption_resolution,[],[f803,f350]) ).
fof(f350,plain,
leaf(sK15(sK16),tptp0),
inference(subsumption_resolution,[],[f349,f245]) ).
fof(f245,plain,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f166]) ).
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(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(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(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(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(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(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/tmp/tmp.aTySstI62N/Vampire---4.8_4369',goals) ).
fof(f349,plain,
( leaf(sK15(sK16),tptp0)
| ~ occurrence_of(sK17,tptp0) ),
inference(subsumption_resolution,[],[f348,f247]) ).
fof(f247,plain,
arboreal(sK16),
inference(cnf_transformation,[],[f166]) ).
fof(f348,plain,
( leaf(sK15(sK16),tptp0)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(subsumption_resolution,[],[f309,f248]) ).
fof(f248,plain,
~ leaf_occ(sK16,sK17),
inference(cnf_transformation,[],[f166]) ).
fof(f309,plain,
( leaf(sK15(sK16),tptp0)
| leaf_occ(sK16,sK17)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(resolution,[],[f246,f232]) ).
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(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(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(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(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(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(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/tmp/tmp.aTySstI62N/Vampire---4.8_4369',sos_32) ).
fof(f246,plain,
subactivity_occurrence(sK16,sK17),
inference(cnf_transformation,[],[f166]) ).
fof(f803,plain,
( ~ occurrence_of(sK15(sK16),tptp1)
| ~ leaf(sK15(sK16),tptp0)
| ~ spl19_13 ),
inference(resolution,[],[f712,f436]) ).
fof(f436,plain,
! [X0] :
( ~ min_precedes(sK13(sK16),X0,tptp0)
| ~ occurrence_of(X0,tptp1)
| ~ leaf(X0,tptp0) ),
inference(subsumption_resolution,[],[f430,f323]) ).
fof(f323,plain,
occurrence_of(sK13(sK16),tptp3),
inference(subsumption_resolution,[],[f322,f245]) ).
fof(f322,plain,
( occurrence_of(sK13(sK16),tptp3)
| ~ occurrence_of(sK17,tptp0) ),
inference(subsumption_resolution,[],[f321,f247]) ).
fof(f321,plain,
( occurrence_of(sK13(sK16),tptp3)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(subsumption_resolution,[],[f303,f248]) ).
fof(f303,plain,
( occurrence_of(sK13(sK16),tptp3)
| leaf_occ(sK16,sK17)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(resolution,[],[f246,f226]) ).
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(f430,plain,
! [X0] :
( ~ min_precedes(sK13(sK16),X0,tptp0)
| ~ occurrence_of(X0,tptp1)
| ~ leaf(X0,tptp0)
| ~ occurrence_of(sK13(sK16),tptp3) ),
inference(resolution,[],[f326,f250]) ).
fof(f250,plain,
! [X2,X3] :
( ~ next_subocc(sK16,X2,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X3,tptp1)
| ~ leaf(X3,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f166]) ).
fof(f326,plain,
next_subocc(sK16,sK13(sK16),tptp0),
inference(subsumption_resolution,[],[f325,f245]) ).
fof(f325,plain,
( next_subocc(sK16,sK13(sK16),tptp0)
| ~ occurrence_of(sK17,tptp0) ),
inference(subsumption_resolution,[],[f324,f247]) ).
fof(f324,plain,
( next_subocc(sK16,sK13(sK16),tptp0)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(subsumption_resolution,[],[f304,f248]) ).
fof(f304,plain,
( next_subocc(sK16,sK13(sK16),tptp0)
| leaf_occ(sK16,sK17)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(resolution,[],[f246,f227]) ).
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(f712,plain,
( min_precedes(sK13(sK16),sK15(sK16),tptp0)
| ~ spl19_13 ),
inference(avatar_component_clause,[],[f711]) ).
fof(f826,plain,
( ~ spl19_3
| ~ spl19_13 ),
inference(avatar_contradiction_clause,[],[f825]) ).
fof(f825,plain,
( $false
| ~ spl19_3
| ~ spl19_13 ),
inference(subsumption_resolution,[],[f824,f350]) ).
fof(f824,plain,
( ~ leaf(sK15(sK16),tptp0)
| ~ spl19_3
| ~ spl19_13 ),
inference(subsumption_resolution,[],[f802,f339]) ).
fof(f339,plain,
( occurrence_of(sK15(sK16),tptp2)
| ~ spl19_3 ),
inference(avatar_component_clause,[],[f337]) ).
fof(f337,plain,
( spl19_3
<=> occurrence_of(sK15(sK16),tptp2) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_3])]) ).
fof(f802,plain,
( ~ occurrence_of(sK15(sK16),tptp2)
| ~ leaf(sK15(sK16),tptp0)
| ~ spl19_13 ),
inference(resolution,[],[f712,f437]) ).
fof(f437,plain,
! [X0] :
( ~ min_precedes(sK13(sK16),X0,tptp0)
| ~ occurrence_of(X0,tptp2)
| ~ leaf(X0,tptp0) ),
inference(subsumption_resolution,[],[f431,f323]) ).
fof(f431,plain,
! [X0] :
( ~ min_precedes(sK13(sK16),X0,tptp0)
| ~ occurrence_of(X0,tptp2)
| ~ leaf(X0,tptp0)
| ~ occurrence_of(sK13(sK16),tptp3) ),
inference(resolution,[],[f326,f249]) ).
fof(f249,plain,
! [X2,X3] :
( ~ next_subocc(sK16,X2,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X3,tptp2)
| ~ leaf(X3,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f166]) ).
fof(f732,plain,
spl19_13,
inference(avatar_split_clause,[],[f723,f711]) ).
fof(f723,plain,
min_precedes(sK13(sK16),sK15(sK16),tptp0),
inference(resolution,[],[f502,f461]) ).
fof(f461,plain,
min_precedes(sK14(sK16),sK15(sK16),tptp0),
inference(resolution,[],[f347,f171]) ).
fof(f171,plain,
! [X2,X0,X1] :
( min_precedes(X0,X1,X2)
| ~ next_subocc(X0,X1,X2) ),
inference(cnf_transformation,[],[f133]) ).
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(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(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(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(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(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(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(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/tmp/tmp.aTySstI62N/Vampire---4.8_4369',sos_04) ).
fof(f347,plain,
next_subocc(sK14(sK16),sK15(sK16),tptp0),
inference(subsumption_resolution,[],[f346,f245]) ).
fof(f346,plain,
( next_subocc(sK14(sK16),sK15(sK16),tptp0)
| ~ occurrence_of(sK17,tptp0) ),
inference(subsumption_resolution,[],[f345,f247]) ).
fof(f345,plain,
( next_subocc(sK14(sK16),sK15(sK16),tptp0)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(subsumption_resolution,[],[f308,f248]) ).
fof(f308,plain,
( next_subocc(sK14(sK16),sK15(sK16),tptp0)
| leaf_occ(sK16,sK17)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(resolution,[],[f246,f231]) ).
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(f502,plain,
! [X0] :
( ~ min_precedes(sK14(sK16),X0,tptp0)
| min_precedes(sK13(sK16),X0,tptp0) ),
inference(resolution,[],[f447,f167]) ).
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(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(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(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/tmp/tmp.aTySstI62N/Vampire---4.8_4369',sos) ).
fof(f447,plain,
min_precedes(sK13(sK16),sK14(sK16),tptp0),
inference(resolution,[],[f332,f171]) ).
fof(f332,plain,
next_subocc(sK13(sK16),sK14(sK16),tptp0),
inference(subsumption_resolution,[],[f331,f245]) ).
fof(f331,plain,
( next_subocc(sK13(sK16),sK14(sK16),tptp0)
| ~ occurrence_of(sK17,tptp0) ),
inference(subsumption_resolution,[],[f330,f247]) ).
fof(f330,plain,
( next_subocc(sK13(sK16),sK14(sK16),tptp0)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(subsumption_resolution,[],[f306,f248]) ).
fof(f306,plain,
( next_subocc(sK13(sK16),sK14(sK16),tptp0)
| leaf_occ(sK16,sK17)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(resolution,[],[f246,f229]) ).
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(f344,plain,
( spl19_3
| spl19_4 ),
inference(avatar_split_clause,[],[f335,f341,f337]) ).
fof(f335,plain,
( occurrence_of(sK15(sK16),tptp1)
| occurrence_of(sK15(sK16),tptp2) ),
inference(subsumption_resolution,[],[f334,f245]) ).
fof(f334,plain,
( occurrence_of(sK15(sK16),tptp1)
| occurrence_of(sK15(sK16),tptp2)
| ~ occurrence_of(sK17,tptp0) ),
inference(subsumption_resolution,[],[f333,f247]) ).
fof(f333,plain,
( occurrence_of(sK15(sK16),tptp1)
| occurrence_of(sK15(sK16),tptp2)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(subsumption_resolution,[],[f307,f248]) ).
fof(f307,plain,
( occurrence_of(sK15(sK16),tptp1)
| occurrence_of(sK15(sK16),tptp2)
| leaf_occ(sK16,sK17)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(resolution,[],[f246,f230]) ).
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]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : PRO014+2 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 20:36:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.aTySstI62N/Vampire---4.8_4369
% 0.61/0.78 % (4564)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.61/0.78 % (4559)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.61/0.78 % (4565)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.61/0.78 % (4560)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.78 % (4558)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.78 % (4561)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.79 % (4562)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.79 % (4563)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.79 % (4562)First to succeed.
% 0.61/0.80 % (4562)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4532"
% 0.61/0.80 % (4564)Also succeeded, but the first one will report.
% 0.61/0.80 % (4562)Refutation found. Thanks to Tanya!
% 0.61/0.80 % SZS status Theorem for Vampire---4
% 0.61/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.80 % (4562)------------------------------
% 0.61/0.80 % (4562)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80 % (4562)Termination reason: Refutation
% 0.61/0.80
% 0.61/0.80 % (4562)Memory used [KB]: 1200
% 0.61/0.80 % (4562)Time elapsed: 0.014 s
% 0.61/0.80 % (4562)Instructions burned: 17 (million)
% 0.61/0.80 % (4532)Success in time 0.424 s
% 0.61/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------