TSTP Solution File: PRO014+2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : PRO014+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n014.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 : Wed Aug 31 18:10:32 EDT 2022
% Result : Theorem 1.41s 0.56s
% Output : Refutation 1.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 77 ( 14 unt; 0 def)
% Number of atoms : 379 ( 0 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 460 ( 158 ~; 163 |; 126 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 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 ( 114 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1216,plain,
$false,
inference(subsumption_resolution,[],[f1215,f426]) ).
fof(f426,plain,
occurrence_of(sK9(sK11),tptp3),
inference(subsumption_resolution,[],[f425,f249]) ).
fof(f249,plain,
arboreal(sK11),
inference(cnf_transformation,[],[f171]) ).
fof(f171,plain,
( ~ leaf_occ(sK11,sK12)
& arboreal(sK11)
& occurrence_of(sK12,tptp0)
& ! [X2,X3] :
( ( ~ occurrence_of(X2,tptp1)
& ~ occurrence_of(X2,tptp2) )
| ~ next_subocc(sK11,X3,tptp0)
| ~ occurrence_of(X3,tptp3)
| ~ min_precedes(X3,X2,tptp0)
| ~ leaf(X2,tptp0) )
& subactivity_occurrence(sK11,sK12) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12])],[f169,f170]) ).
fof(f170,plain,
( ? [X0,X1] :
( ~ leaf_occ(X0,X1)
& arboreal(X0)
& occurrence_of(X1,tptp0)
& ! [X2,X3] :
( ( ~ occurrence_of(X2,tptp1)
& ~ occurrence_of(X2,tptp2) )
| ~ next_subocc(X0,X3,tptp0)
| ~ occurrence_of(X3,tptp3)
| ~ min_precedes(X3,X2,tptp0)
| ~ leaf(X2,tptp0) )
& subactivity_occurrence(X0,X1) )
=> ( ~ leaf_occ(sK11,sK12)
& arboreal(sK11)
& occurrence_of(sK12,tptp0)
& ! [X3,X2] :
( ( ~ occurrence_of(X2,tptp1)
& ~ occurrence_of(X2,tptp2) )
| ~ next_subocc(sK11,X3,tptp0)
| ~ occurrence_of(X3,tptp3)
| ~ min_precedes(X3,X2,tptp0)
| ~ leaf(X2,tptp0) )
& subactivity_occurrence(sK11,sK12) ) ),
introduced(choice_axiom,[]) ).
fof(f169,plain,
? [X0,X1] :
( ~ leaf_occ(X0,X1)
& arboreal(X0)
& occurrence_of(X1,tptp0)
& ! [X2,X3] :
( ( ~ occurrence_of(X2,tptp1)
& ~ occurrence_of(X2,tptp2) )
| ~ next_subocc(X0,X3,tptp0)
| ~ occurrence_of(X3,tptp3)
| ~ min_precedes(X3,X2,tptp0)
| ~ leaf(X2,tptp0) )
& subactivity_occurrence(X0,X1) ),
inference(rectify,[],[f122]) ).
fof(f122,plain,
? [X0,X1] :
( ~ leaf_occ(X0,X1)
& arboreal(X0)
& occurrence_of(X1,tptp0)
& ! [X3,X2] :
( ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(X0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& subactivity_occurrence(X0,X1) ),
inference(flattening,[],[f121]) ).
fof(f121,plain,
? [X1,X0] :
( ! [X3,X2] :
( ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(X0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& ~ leaf_occ(X0,X1)
& arboreal(X0)
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1) ),
inference(ennf_transformation,[],[f75]) ).
fof(f75,plain,
~ ! [X1,X0] :
( ( ~ leaf_occ(X0,X1)
& arboreal(X0)
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1) )
=> ? [X3,X2] :
( occurrence_of(X2,tptp3)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X0,X2,tptp0)
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
inference(rectify,[],[f47]) ).
fof(f47,negated_conjecture,
~ ! [X100,X101] :
( ( subactivity_occurrence(X100,X101)
& arboreal(X100)
& ~ leaf_occ(X100,X101)
& occurrence_of(X101,tptp0) )
=> ? [X102,X103] :
( next_subocc(X100,X102,tptp0)
& leaf(X103,tptp0)
& min_precedes(X102,X103,tptp0)
& occurrence_of(X102,tptp3)
& ( occurrence_of(X103,tptp1)
| occurrence_of(X103,tptp2) ) ) ),
inference(negated_conjecture,[],[f46]) ).
fof(f46,conjecture,
! [X100,X101] :
( ( subactivity_occurrence(X100,X101)
& arboreal(X100)
& ~ leaf_occ(X100,X101)
& occurrence_of(X101,tptp0) )
=> ? [X102,X103] :
( next_subocc(X100,X102,tptp0)
& leaf(X103,tptp0)
& min_precedes(X102,X103,tptp0)
& occurrence_of(X102,tptp3)
& ( occurrence_of(X103,tptp1)
| occurrence_of(X103,tptp2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f425,plain,
( ~ arboreal(sK11)
| occurrence_of(sK9(sK11),tptp3) ),
inference(subsumption_resolution,[],[f423,f250]) ).
fof(f250,plain,
~ leaf_occ(sK11,sK12),
inference(cnf_transformation,[],[f171]) ).
fof(f423,plain,
( leaf_occ(sK11,sK12)
| ~ arboreal(sK11)
| occurrence_of(sK9(sK11),tptp3) ),
inference(resolution,[],[f369,f245]) ).
fof(f245,plain,
subactivity_occurrence(sK11,sK12),
inference(cnf_transformation,[],[f171]) ).
fof(f369,plain,
! [X0] :
( ~ subactivity_occurrence(X0,sK12)
| ~ arboreal(X0)
| leaf_occ(X0,sK12)
| occurrence_of(sK9(X0),tptp3) ),
inference(resolution,[],[f229,f248]) ).
fof(f248,plain,
occurrence_of(sK12,tptp0),
inference(cnf_transformation,[],[f171]) ).
fof(f229,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| leaf_occ(X0,X1)
| ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK9(X0),tptp3)
| ~ arboreal(X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f162,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1)
| ( next_subocc(X0,sK9(X0),tptp0)
& next_subocc(sK8(X0),sK7(X0),tptp0)
& ( occurrence_of(sK7(X0),tptp2)
| occurrence_of(sK7(X0),tptp1) )
& leaf(sK7(X0),tptp0)
& occurrence_of(sK9(X0),tptp3)
& next_subocc(sK9(X0),sK8(X0),tptp0)
& occurrence_of(sK8(X0),tptp4) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9])],[f160,f161]) ).
fof(f161,plain,
! [X0] :
( ? [X2,X3,X4] :
( next_subocc(X0,X4,tptp0)
& next_subocc(X3,X2,tptp0)
& ( occurrence_of(X2,tptp2)
| occurrence_of(X2,tptp1) )
& leaf(X2,tptp0)
& occurrence_of(X4,tptp3)
& next_subocc(X4,X3,tptp0)
& occurrence_of(X3,tptp4) )
=> ( next_subocc(X0,sK9(X0),tptp0)
& next_subocc(sK8(X0),sK7(X0),tptp0)
& ( occurrence_of(sK7(X0),tptp2)
| occurrence_of(sK7(X0),tptp1) )
& leaf(sK7(X0),tptp0)
& occurrence_of(sK9(X0),tptp3)
& next_subocc(sK9(X0),sK8(X0),tptp0)
& occurrence_of(sK8(X0),tptp4) ) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1)
| ? [X2,X3,X4] :
( next_subocc(X0,X4,tptp0)
& next_subocc(X3,X2,tptp0)
& ( occurrence_of(X2,tptp2)
| occurrence_of(X2,tptp1) )
& leaf(X2,tptp0)
& occurrence_of(X4,tptp3)
& next_subocc(X4,X3,tptp0)
& occurrence_of(X3,tptp4) ) ),
inference(rectify,[],[f88]) ).
fof(f88,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1)
| ? [X3,X2,X4] :
( next_subocc(X0,X4,tptp0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& leaf(X3,tptp0)
& occurrence_of(X4,tptp3)
& next_subocc(X4,X2,tptp0)
& occurrence_of(X2,tptp4) ) ),
inference(flattening,[],[f87]) ).
fof(f87,plain,
! [X1,X0] :
( ? [X3,X2,X4] :
( next_subocc(X0,X4,tptp0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& leaf(X3,tptp0)
& occurrence_of(X4,tptp3)
& next_subocc(X4,X2,tptp0)
& occurrence_of(X2,tptp4) )
| leaf_occ(X0,X1)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f56,plain,
! [X1,X0] :
( ( ~ leaf_occ(X0,X1)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0)
& arboreal(X0) )
=> ? [X3,X2,X4] :
( next_subocc(X0,X4,tptp0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& leaf(X3,tptp0)
& occurrence_of(X4,tptp3)
& next_subocc(X4,X2,tptp0)
& occurrence_of(X2,tptp4) ) ),
inference(rectify,[],[f33]) ).
fof(f33,axiom,
! [X95,X96] :
( ( ~ leaf_occ(X95,X96)
& occurrence_of(X96,tptp0)
& arboreal(X95)
& subactivity_occurrence(X95,X96) )
=> ? [X98,X99,X97] :
( occurrence_of(X98,tptp4)
& next_subocc(X97,X98,tptp0)
& occurrence_of(X97,tptp3)
& next_subocc(X95,X97,tptp0)
& leaf(X99,tptp0)
& next_subocc(X98,X99,tptp0)
& ( occurrence_of(X99,tptp1)
| occurrence_of(X99,tptp2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(f1215,plain,
~ occurrence_of(sK9(sK11),tptp3),
inference(subsumption_resolution,[],[f1214,f979]) ).
fof(f979,plain,
min_precedes(sK9(sK11),sK7(sK11),tptp0),
inference(resolution,[],[f584,f497]) ).
fof(f497,plain,
min_precedes(sK9(sK11),sK8(sK11),tptp0),
inference(resolution,[],[f465,f203]) ).
fof(f203,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X2,X1)
| min_precedes(X0,X2,X1) ),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X2,X1)
| ~ min_precedes(X0,X2,X1)
| ( min_precedes(X0,sK3(X0,X1,X2),X1)
& min_precedes(sK3(X0,X1,X2),X2,X1) ) )
& ( ( min_precedes(X0,X2,X1)
& ! [X4] :
( ~ min_precedes(X0,X4,X1)
| ~ min_precedes(X4,X2,X1) ) )
| ~ next_subocc(X0,X2,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f143,f144]) ).
fof(f144,plain,
! [X0,X1,X2] :
( ? [X3] :
( min_precedes(X0,X3,X1)
& min_precedes(X3,X2,X1) )
=> ( min_precedes(X0,sK3(X0,X1,X2),X1)
& min_precedes(sK3(X0,X1,X2),X2,X1) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X2,X1)
| ~ min_precedes(X0,X2,X1)
| ? [X3] :
( min_precedes(X0,X3,X1)
& min_precedes(X3,X2,X1) ) )
& ( ( min_precedes(X0,X2,X1)
& ! [X4] :
( ~ min_precedes(X0,X4,X1)
| ~ min_precedes(X4,X2,X1) ) )
| ~ next_subocc(X0,X2,X1) ) ),
inference(rectify,[],[f142]) ).
fof(f142,plain,
! [X0,X2,X1] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(flattening,[],[f141]) ).
fof(f141,plain,
! [X0,X2,X1] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f94]) ).
fof(f94,plain,
! [X0,X2,X1] :
( next_subocc(X0,X1,X2)
<=> ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) ) ),
inference(ennf_transformation,[],[f80]) ).
fof(f80,plain,
! [X0,X2,X1] :
( next_subocc(X0,X1,X2)
<=> ( ~ ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,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/sandbox/benchmark/theBenchmark.p',sos_04) ).
fof(f465,plain,
next_subocc(sK9(sK11),sK8(sK11),tptp0),
inference(subsumption_resolution,[],[f464,f250]) ).
fof(f464,plain,
( leaf_occ(sK11,sK12)
| next_subocc(sK9(sK11),sK8(sK11),tptp0) ),
inference(subsumption_resolution,[],[f462,f249]) ).
fof(f462,plain,
( ~ arboreal(sK11)
| leaf_occ(sK11,sK12)
| next_subocc(sK9(sK11),sK8(sK11),tptp0) ),
inference(resolution,[],[f402,f245]) ).
fof(f402,plain,
! [X0] :
( ~ subactivity_occurrence(X0,sK12)
| leaf_occ(X0,sK12)
| next_subocc(sK9(X0),sK8(X0),tptp0)
| ~ arboreal(X0) ),
inference(resolution,[],[f228,f248]) ).
fof(f228,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| next_subocc(sK9(X0),sK8(X0),tptp0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f584,plain,
! [X0] :
( ~ min_precedes(X0,sK8(sK11),tptp0)
| min_precedes(X0,sK7(sK11),tptp0) ),
inference(resolution,[],[f501,f222]) ).
fof(f222,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X0,X1,X3)
| ~ min_precedes(X2,X0,X3)
| min_precedes(X2,X1,X3) ),
inference(cnf_transformation,[],[f157]) ).
fof(f157,plain,
! [X0,X1,X2,X3] :
( ~ min_precedes(X0,X1,X3)
| min_precedes(X2,X1,X3)
| ~ min_precedes(X2,X0,X3) ),
inference(rectify,[],[f108]) ).
fof(f108,plain,
! [X1,X3,X2,X0] :
( ~ min_precedes(X1,X3,X0)
| min_precedes(X2,X3,X0)
| ~ min_precedes(X2,X1,X0) ),
inference(flattening,[],[f107]) ).
fof(f107,plain,
! [X2,X3,X1,X0] :
( min_precedes(X2,X3,X0)
| ~ min_precedes(X1,X3,X0)
| ~ min_precedes(X2,X1,X0) ),
inference(ennf_transformation,[],[f62]) ).
fof(f62,plain,
! [X2,X3,X1,X0] :
( ( min_precedes(X1,X3,X0)
& min_precedes(X2,X1,X0) )
=> min_precedes(X2,X3,X0) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X3,X1,X0,X2] :
( ( min_precedes(X1,X2,X3)
& min_precedes(X0,X1,X3) )
=> min_precedes(X0,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
fof(f501,plain,
min_precedes(sK8(sK11),sK7(sK11),tptp0),
inference(resolution,[],[f469,f203]) ).
fof(f469,plain,
next_subocc(sK8(sK11),sK7(sK11),tptp0),
inference(subsumption_resolution,[],[f468,f250]) ).
fof(f468,plain,
( leaf_occ(sK11,sK12)
| next_subocc(sK8(sK11),sK7(sK11),tptp0) ),
inference(subsumption_resolution,[],[f466,f249]) ).
fof(f466,plain,
( ~ arboreal(sK11)
| next_subocc(sK8(sK11),sK7(sK11),tptp0)
| leaf_occ(sK11,sK12) ),
inference(resolution,[],[f411,f245]) ).
fof(f411,plain,
! [X0] :
( ~ subactivity_occurrence(X0,sK12)
| ~ arboreal(X0)
| next_subocc(sK8(X0),sK7(X0),tptp0)
| leaf_occ(X0,sK12) ),
inference(resolution,[],[f232,f248]) ).
fof(f232,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| next_subocc(sK8(X0),sK7(X0),tptp0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f1214,plain,
( ~ min_precedes(sK9(sK11),sK7(sK11),tptp0)
| ~ occurrence_of(sK9(sK11),tptp3) ),
inference(resolution,[],[f705,f442]) ).
fof(f442,plain,
next_subocc(sK11,sK9(sK11),tptp0),
inference(subsumption_resolution,[],[f441,f249]) ).
fof(f441,plain,
( ~ arboreal(sK11)
| next_subocc(sK11,sK9(sK11),tptp0) ),
inference(subsumption_resolution,[],[f439,f250]) ).
fof(f439,plain,
( leaf_occ(sK11,sK12)
| next_subocc(sK11,sK9(sK11),tptp0)
| ~ arboreal(sK11) ),
inference(resolution,[],[f391,f245]) ).
fof(f391,plain,
! [X0] :
( ~ subactivity_occurrence(X0,sK12)
| leaf_occ(X0,sK12)
| next_subocc(X0,sK9(X0),tptp0)
| ~ arboreal(X0) ),
inference(resolution,[],[f233,f248]) ).
fof(f233,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| next_subocc(X0,sK9(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f162]) ).
fof(f705,plain,
! [X0] :
( ~ next_subocc(sK11,X0,tptp0)
| ~ min_precedes(X0,sK7(sK11),tptp0)
| ~ occurrence_of(X0,tptp3) ),
inference(subsumption_resolution,[],[f704,f446]) ).
fof(f446,plain,
! [X1] :
( ~ occurrence_of(sK7(sK11),tptp2)
| ~ occurrence_of(X1,tptp3)
| ~ next_subocc(sK11,X1,tptp0)
| ~ min_precedes(X1,sK7(sK11),tptp0) ),
inference(resolution,[],[f438,f246]) ).
fof(f246,plain,
! [X2,X3] :
( ~ leaf(X2,tptp0)
| ~ occurrence_of(X2,tptp2)
| ~ next_subocc(sK11,X3,tptp0)
| ~ min_precedes(X3,X2,tptp0)
| ~ occurrence_of(X3,tptp3) ),
inference(cnf_transformation,[],[f171]) ).
fof(f438,plain,
leaf(sK7(sK11),tptp0),
inference(subsumption_resolution,[],[f437,f250]) ).
fof(f437,plain,
( leaf(sK7(sK11),tptp0)
| leaf_occ(sK11,sK12) ),
inference(subsumption_resolution,[],[f435,f249]) ).
fof(f435,plain,
( ~ arboreal(sK11)
| leaf_occ(sK11,sK12)
| leaf(sK7(sK11),tptp0) ),
inference(resolution,[],[f390,f245]) ).
fof(f390,plain,
! [X0] :
( ~ subactivity_occurrence(X0,sK12)
| leaf_occ(X0,sK12)
| leaf(sK7(X0),tptp0)
| ~ arboreal(X0) ),
inference(resolution,[],[f230,f248]) ).
fof(f230,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| leaf(sK7(X0),tptp0)
| leaf_occ(X0,X1)
| ~ arboreal(X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f704,plain,
! [X0] :
( ~ occurrence_of(X0,tptp3)
| ~ min_precedes(X0,sK7(sK11),tptp0)
| occurrence_of(sK7(sK11),tptp2)
| ~ next_subocc(sK11,X0,tptp0) ),
inference(resolution,[],[f445,f473]) ).
fof(f473,plain,
( occurrence_of(sK7(sK11),tptp1)
| occurrence_of(sK7(sK11),tptp2) ),
inference(subsumption_resolution,[],[f472,f249]) ).
fof(f472,plain,
( occurrence_of(sK7(sK11),tptp2)
| occurrence_of(sK7(sK11),tptp1)
| ~ arboreal(sK11) ),
inference(subsumption_resolution,[],[f470,f250]) ).
fof(f470,plain,
( occurrence_of(sK7(sK11),tptp1)
| leaf_occ(sK11,sK12)
| ~ arboreal(sK11)
| occurrence_of(sK7(sK11),tptp2) ),
inference(resolution,[],[f414,f245]) ).
fof(f414,plain,
! [X0] :
( ~ subactivity_occurrence(X0,sK12)
| leaf_occ(X0,sK12)
| ~ arboreal(X0)
| occurrence_of(sK7(X0),tptp1)
| occurrence_of(sK7(X0),tptp2) ),
inference(resolution,[],[f231,f248]) ).
fof(f231,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| occurrence_of(sK7(X0),tptp2)
| leaf_occ(X0,X1)
| occurrence_of(sK7(X0),tptp1)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f162]) ).
fof(f445,plain,
! [X0] :
( ~ occurrence_of(sK7(sK11),tptp1)
| ~ min_precedes(X0,sK7(sK11),tptp0)
| ~ occurrence_of(X0,tptp3)
| ~ next_subocc(sK11,X0,tptp0) ),
inference(resolution,[],[f438,f247]) ).
fof(f247,plain,
! [X2,X3] :
( ~ leaf(X2,tptp0)
| ~ occurrence_of(X3,tptp3)
| ~ next_subocc(sK11,X3,tptp0)
| ~ min_precedes(X3,X2,tptp0)
| ~ occurrence_of(X2,tptp1) ),
inference(cnf_transformation,[],[f171]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PRO014+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 10:30:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 % (21086)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.46 % (21078)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.47 % (21069)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.48 TRYING [4]
% 0.20/0.49 % (21067)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50 % (21085)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.50 % (21073)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.50 % (21089)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.50 % (21070)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.51 % (21072)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (21076)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.28/0.51 % (21065)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.28/0.52 % (21091)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.28/0.52 % (21066)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.28/0.52 % (21063)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.28/0.52 % (21087)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.28/0.53 % (21084)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.28/0.53 % (21088)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.28/0.53 TRYING [5]
% 1.28/0.53 % (21070)Instruction limit reached!
% 1.28/0.53 % (21070)------------------------------
% 1.28/0.53 % (21070)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.28/0.53 % (21070)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.28/0.53 % (21070)Termination reason: Unknown
% 1.28/0.53 % (21070)Termination phase: Saturation
% 1.28/0.53
% 1.28/0.53 % (21070)Memory used [KB]: 5756
% 1.28/0.53 % (21070)Time elapsed: 0.109 s
% 1.28/0.53 % (21070)Instructions burned: 8 (million)
% 1.28/0.53 % (21070)------------------------------
% 1.28/0.53 % (21070)------------------------------
% 1.41/0.53 % (21068)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 1.41/0.53 % (21071)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.41/0.53 TRYING [4]
% 1.41/0.54 % (21081)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.41/0.54 % (21078)First to succeed.
% 1.41/0.54 % (21080)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.41/0.54 % (21064)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.41/0.54 % (21069)Instruction limit reached!
% 1.41/0.54 % (21069)------------------------------
% 1.41/0.54 % (21069)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.41/0.54 % (21069)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.41/0.54 % (21069)Termination reason: Unknown
% 1.41/0.54 % (21069)Termination phase: Finite model building constraint generation
% 1.41/0.54
% 1.41/0.54 % (21069)Memory used [KB]: 8571
% 1.41/0.54 % (21069)Time elapsed: 0.107 s
% 1.41/0.54 % (21069)Instructions burned: 54 (million)
% 1.41/0.54 % (21069)------------------------------
% 1.41/0.54 % (21069)------------------------------
% 1.41/0.54 % (21079)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.41/0.54 % (21075)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.41/0.54 % (21064)Refutation not found, incomplete strategy% (21064)------------------------------
% 1.41/0.54 % (21064)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.41/0.54 % (21064)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.41/0.54 % (21064)Termination reason: Refutation not found, incomplete strategy
% 1.41/0.54
% 1.41/0.54 % (21064)Memory used [KB]: 5756
% 1.41/0.54 % (21064)Time elapsed: 0.138 s
% 1.41/0.54 % (21064)Instructions burned: 5 (million)
% 1.41/0.54 % (21064)------------------------------
% 1.41/0.54 % (21064)------------------------------
% 1.41/0.54 % (21077)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.41/0.54 % (21083)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.41/0.54 % (21074)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.41/0.55 % (21082)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.41/0.55 % (21071)Instruction limit reached!
% 1.41/0.55 % (21071)------------------------------
% 1.41/0.55 % (21071)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.41/0.55 % (21071)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.41/0.55 % (21071)Termination reason: Unknown
% 1.41/0.55 % (21071)Termination phase: Property scanning
% 1.41/0.55
% 1.41/0.55 % (21071)Memory used [KB]: 1151
% 1.41/0.55 % (21071)Time elapsed: 0.003 s
% 1.41/0.55 % (21071)Instructions burned: 3 (million)
% 1.41/0.55 % (21071)------------------------------
% 1.41/0.55 % (21071)------------------------------
% 1.41/0.55 % (21090)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.41/0.56 % (21092)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.41/0.56 % (21078)Refutation found. Thanks to Tanya!
% 1.41/0.56 % SZS status Theorem for theBenchmark
% 1.41/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.41/0.56 % (21078)------------------------------
% 1.41/0.56 % (21078)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.41/0.56 % (21078)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.41/0.56 % (21078)Termination reason: Refutation
% 1.41/0.56
% 1.41/0.56 % (21078)Memory used [KB]: 1791
% 1.41/0.56 % (21078)Time elapsed: 0.129 s
% 1.41/0.56 % (21078)Instructions burned: 45 (million)
% 1.41/0.56 % (21078)------------------------------
% 1.41/0.56 % (21078)------------------------------
% 1.41/0.56 % (21060)Success in time 0.208 s
%------------------------------------------------------------------------------