TSTP Solution File: PRO018+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PRO018+4 : TPTP v8.2.0. 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 : n016.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 : Tue May 21 02:23:11 EDT 2024
% Result : Theorem 0.60s 0.80s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of formulae : 101 ( 26 unt; 0 def)
% Number of atoms : 370 ( 29 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 405 ( 136 ~; 142 |; 96 &)
% ( 10 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 3 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 162 ( 123 !; 39 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1391,plain,
$false,
inference(avatar_sat_refutation,[],[f1334,f1363,f1388]) ).
fof(f1388,plain,
~ spl16_36,
inference(avatar_contradiction_clause,[],[f1387]) ).
fof(f1387,plain,
( $false
| ~ spl16_36 ),
inference(subsumption_resolution,[],[f1375,f215]) ).
fof(f215,plain,
min_precedes(sK6(sK0),sK7(sK0),tptp0),
inference(subsumption_resolution,[],[f214,f106]) ).
fof(f106,plain,
~ leaf_occ(sK0,sK1),
inference(cnf_transformation,[],[f69]) ).
fof(f69,plain,
? [X0,X1] :
( ! [X2,X3] :
( ( ? [X4] :
( min_precedes(X2,X4,tptp0)
& occurrence_of(X4,tptp1) )
& occurrence_of(X3,tptp2) )
| ( ? [X5] :
( min_precedes(X2,X5,tptp0)
& occurrence_of(X5,tptp2) )
& occurrence_of(X3,tptp1) )
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ 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,[],[f68]) ).
fof(f68,plain,
? [X0,X1] :
( ! [X2,X3] :
( ( ? [X4] :
( min_precedes(X2,X4,tptp0)
& occurrence_of(X4,tptp1) )
& occurrence_of(X3,tptp2) )
| ( ? [X5] :
( min_precedes(X2,X5,tptp0)
& occurrence_of(X5,tptp2) )
& occurrence_of(X3,tptp1) )
| ~ leaf_occ(X3,X1)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ 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,[],[f48]) ).
fof(f48,plain,
~ ! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ? [X2,X3] :
( ( occurrence_of(X3,tptp2)
=> ~ ? [X4] :
( min_precedes(X2,X4,tptp0)
& occurrence_of(X4,tptp1) ) )
& ( occurrence_of(X3,tptp1)
=> ~ ? [X5] :
( min_precedes(X2,X5,tptp0)
& occurrence_of(X5,tptp2) ) )
& leaf_occ(X3,X1)
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(rectify,[],[f47]) ).
fof(f47,negated_conjecture,
~ ! [X107,X108] :
( ( ~ leaf_occ(X107,X108)
& arboreal(X107)
& subactivity_occurrence(X107,X108)
& occurrence_of(X108,tptp0) )
=> ? [X109,X110] :
( ( occurrence_of(X110,tptp2)
=> ~ ? [X112] :
( min_precedes(X109,X112,tptp0)
& occurrence_of(X112,tptp1) ) )
& ( occurrence_of(X110,tptp1)
=> ~ ? [X111] :
( min_precedes(X109,X111,tptp0)
& occurrence_of(X111,tptp2) ) )
& leaf_occ(X110,X108)
& min_precedes(X109,X110,tptp0)
& ( occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1) )
& next_subocc(X107,X109,tptp0)
& occurrence_of(X109,tptp3) ) ),
inference(negated_conjecture,[],[f46]) ).
fof(f46,conjecture,
! [X107,X108] :
( ( ~ leaf_occ(X107,X108)
& arboreal(X107)
& subactivity_occurrence(X107,X108)
& occurrence_of(X108,tptp0) )
=> ? [X109,X110] :
( ( occurrence_of(X110,tptp2)
=> ~ ? [X112] :
( min_precedes(X109,X112,tptp0)
& occurrence_of(X112,tptp1) ) )
& ( occurrence_of(X110,tptp1)
=> ~ ? [X111] :
( min_precedes(X109,X111,tptp0)
& occurrence_of(X111,tptp2) ) )
& leaf_occ(X110,X108)
& min_precedes(X109,X110,tptp0)
& ( occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1) )
& next_subocc(X107,X109,tptp0)
& occurrence_of(X109,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f214,plain,
( leaf_occ(sK0,sK1)
| min_precedes(sK6(sK0),sK7(sK0),tptp0) ),
inference(subsumption_resolution,[],[f213,f105]) ).
fof(f105,plain,
arboreal(sK0),
inference(cnf_transformation,[],[f69]) ).
fof(f213,plain,
( ~ arboreal(sK0)
| leaf_occ(sK0,sK1)
| min_precedes(sK6(sK0),sK7(sK0),tptp0) ),
inference(subsumption_resolution,[],[f185,f103]) ).
fof(f103,plain,
occurrence_of(sK1,tptp0),
inference(cnf_transformation,[],[f69]) ).
fof(f185,plain,
( ~ occurrence_of(sK1,tptp0)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1)
| min_precedes(sK6(sK0),sK7(sK0),tptp0) ),
inference(resolution,[],[f104,f114]) ).
fof(f114,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1)
| min_precedes(sK6(X0),sK7(X0),tptp0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f71,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( ! [X5] :
( X4 = X5
| X3 = X5
| ~ min_precedes(X2,X5,tptp0) )
& min_precedes(X3,X4,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& min_precedes(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,[],[f70]) ).
fof(f70,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( ! [X5] :
( X4 = X5
| X3 = X5
| ~ min_precedes(X2,X5,tptp0) )
& min_precedes(X3,X4,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& min_precedes(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,[],[f49]) ).
fof(f49,plain,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ? [X2,X3,X4] :
( ! [X5] :
( min_precedes(X2,X5,tptp0)
=> ( X4 = X5
| X3 = X5 ) )
& min_precedes(X3,X4,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& min_precedes(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(rectify,[],[f33]) ).
fof(f33,axiom,
! [X101,X102] :
( ( ~ leaf_occ(X101,X102)
& arboreal(X101)
& subactivity_occurrence(X101,X102)
& occurrence_of(X102,tptp0) )
=> ? [X103,X104,X105] :
( ! [X106] :
( min_precedes(X103,X106,tptp0)
=> ( X105 = X106
| X104 = X106 ) )
& min_precedes(X104,X105,tptp0)
& ( occurrence_of(X105,tptp2)
| occurrence_of(X105,tptp1) )
& min_precedes(X103,X104,tptp0)
& occurrence_of(X104,tptp4)
& next_subocc(X101,X103,tptp0)
& occurrence_of(X103,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f104,plain,
subactivity_occurrence(sK0,sK1),
inference(cnf_transformation,[],[f69]) ).
fof(f1375,plain,
( ~ min_precedes(sK6(sK0),sK7(sK0),tptp0)
| ~ spl16_36 ),
inference(superposition,[],[f1285,f1329]) ).
fof(f1329,plain,
( sK7(sK0) = sK5(sK5(sK0))
| ~ spl16_36 ),
inference(avatar_component_clause,[],[f1327]) ).
fof(f1327,plain,
( spl16_36
<=> sK7(sK0) = sK5(sK5(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_36])]) ).
fof(f1285,plain,
~ min_precedes(sK6(sK0),sK5(sK5(sK0)),tptp0),
inference(unit_resulting_resolution,[],[f212,f887,f136]) ).
fof(f136,plain,
! [X2,X3,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) ),
inference(cnf_transformation,[],[f84]) ).
fof(f84,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,[],[f57]) ).
fof(f57,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,[],[f27]) ).
fof(f27,axiom,
! [X78,X79,X80] :
( next_subocc(X78,X79,X80)
<=> ( ~ ? [X81] :
( min_precedes(X81,X79,X80)
& min_precedes(X78,X81,X80) )
& min_precedes(X78,X79,X80) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_26) ).
fof(f887,plain,
next_subocc(sK5(sK0),sK5(sK5(sK0)),tptp0),
inference(subsumption_resolution,[],[f886,f756]) ).
fof(f756,plain,
~ leaf_occ(sK5(sK0),sK8(tptp0,sK5(sK0),sK6(sK0))),
inference(unit_resulting_resolution,[],[f434,f427,f156]) ).
fof(f156,plain,
! [X2,X0,X1] :
( ~ sP15(X2,X1)
| ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2) ),
inference(general_splitting,[],[f129,f155_D]) ).
fof(f155,plain,
! [X2,X3,X1] :
( ~ min_precedes(X1,X3,X2)
| sP15(X2,X1) ),
inference(cnf_transformation,[],[f155_D]) ).
fof(f155_D,plain,
! [X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
<=> ~ sP15(X2,X1) ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP15])]) ).
fof(f129,plain,
! [X2,X3,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0)
| ~ min_precedes(X1,X3,X2) ),
inference(cnf_transformation,[],[f78]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f77]) ).
fof(f77,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f53]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ( leaf_occ(X1,X0)
& occurrence_of(X0,X2) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X31,X32,X33] :
( ( leaf_occ(X32,X31)
& occurrence_of(X31,X33) )
=> ~ ? [X34] : min_precedes(X32,X34,X33) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).
fof(f427,plain,
occurrence_of(sK8(tptp0,sK5(sK0),sK6(sK0)),tptp0),
inference(unit_resulting_resolution,[],[f212,f123]) ).
fof(f123,plain,
! [X2,X0,X1] :
( occurrence_of(sK8(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f74,plain,
! [X0,X1,X2] :
( ? [X3] :
( subactivity_occurrence(X2,X3)
& subactivity_occurrence(X1,X3)
& occurrence_of(X3,X0) )
| ~ min_precedes(X1,X2,X0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3] :
( subactivity_occurrence(X2,X3)
& subactivity_occurrence(X1,X3)
& occurrence_of(X3,X0) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X21,X22,X23] :
( min_precedes(X22,X23,X21)
=> ? [X24] :
( subactivity_occurrence(X23,X24)
& subactivity_occurrence(X22,X24)
& occurrence_of(X24,X21) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).
fof(f434,plain,
sP15(tptp0,sK5(sK0)),
inference(unit_resulting_resolution,[],[f212,f155]) ).
fof(f886,plain,
( leaf_occ(sK5(sK0),sK8(tptp0,sK5(sK0),sK6(sK0)))
| next_subocc(sK5(sK0),sK5(sK5(sK0)),tptp0) ),
inference(subsumption_resolution,[],[f885,f248]) ).
fof(f248,plain,
arboreal(sK5(sK0)),
inference(unit_resulting_resolution,[],[f118,f203,f131]) ).
fof(f131,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f81,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,plain,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
! [X51,X52] :
( occurrence_of(X51,X52)
=> ( arboreal(X51)
<=> atomic(X52) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_16) ).
fof(f203,plain,
occurrence_of(sK5(sK0),tptp3),
inference(subsumption_resolution,[],[f202,f106]) ).
fof(f202,plain,
( leaf_occ(sK0,sK1)
| occurrence_of(sK5(sK0),tptp3) ),
inference(subsumption_resolution,[],[f201,f105]) ).
fof(f201,plain,
( ~ arboreal(sK0)
| leaf_occ(sK0,sK1)
| occurrence_of(sK5(sK0),tptp3) ),
inference(subsumption_resolution,[],[f181,f103]) ).
fof(f181,plain,
( ~ occurrence_of(sK1,tptp0)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1)
| occurrence_of(sK5(sK0),tptp3) ),
inference(resolution,[],[f104,f110]) ).
fof(f110,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1)
| occurrence_of(sK5(X0),tptp3) ),
inference(cnf_transformation,[],[f71]) ).
fof(f118,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_38) ).
fof(f885,plain,
( ~ arboreal(sK5(sK0))
| leaf_occ(sK5(sK0),sK8(tptp0,sK5(sK0),sK6(sK0)))
| next_subocc(sK5(sK0),sK5(sK5(sK0)),tptp0) ),
inference(subsumption_resolution,[],[f863,f427]) ).
fof(f863,plain,
( ~ occurrence_of(sK8(tptp0,sK5(sK0),sK6(sK0)),tptp0)
| ~ arboreal(sK5(sK0))
| leaf_occ(sK5(sK0),sK8(tptp0,sK5(sK0),sK6(sK0)))
| next_subocc(sK5(sK0),sK5(sK5(sK0)),tptp0) ),
inference(resolution,[],[f428,f111]) ).
fof(f111,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1)
| next_subocc(X0,sK5(X0),tptp0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f428,plain,
subactivity_occurrence(sK5(sK0),sK8(tptp0,sK5(sK0),sK6(sK0))),
inference(unit_resulting_resolution,[],[f212,f124]) ).
fof(f124,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK8(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f212,plain,
min_precedes(sK5(sK0),sK6(sK0),tptp0),
inference(subsumption_resolution,[],[f211,f106]) ).
fof(f211,plain,
( leaf_occ(sK0,sK1)
| min_precedes(sK5(sK0),sK6(sK0),tptp0) ),
inference(subsumption_resolution,[],[f210,f105]) ).
fof(f210,plain,
( ~ arboreal(sK0)
| leaf_occ(sK0,sK1)
| min_precedes(sK5(sK0),sK6(sK0),tptp0) ),
inference(subsumption_resolution,[],[f184,f103]) ).
fof(f184,plain,
( ~ occurrence_of(sK1,tptp0)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1)
| min_precedes(sK5(sK0),sK6(sK0),tptp0) ),
inference(resolution,[],[f104,f113]) ).
fof(f113,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1)
| min_precedes(sK5(X0),sK6(X0),tptp0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f1363,plain,
~ spl16_37,
inference(avatar_contradiction_clause,[],[f1362]) ).
fof(f1362,plain,
( $false
| ~ spl16_37 ),
inference(subsumption_resolution,[],[f1351,f209]) ).
fof(f209,plain,
occurrence_of(sK6(sK0),tptp4),
inference(subsumption_resolution,[],[f208,f106]) ).
fof(f208,plain,
( leaf_occ(sK0,sK1)
| occurrence_of(sK6(sK0),tptp4) ),
inference(subsumption_resolution,[],[f207,f105]) ).
fof(f207,plain,
( ~ arboreal(sK0)
| leaf_occ(sK0,sK1)
| occurrence_of(sK6(sK0),tptp4) ),
inference(subsumption_resolution,[],[f183,f103]) ).
fof(f183,plain,
( ~ occurrence_of(sK1,tptp0)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1)
| occurrence_of(sK6(sK0),tptp4) ),
inference(resolution,[],[f104,f112]) ).
fof(f112,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1)
| occurrence_of(sK6(X0),tptp4) ),
inference(cnf_transformation,[],[f71]) ).
fof(f1351,plain,
( ~ occurrence_of(sK6(sK0),tptp4)
| ~ spl16_37 ),
inference(superposition,[],[f981,f1333]) ).
fof(f1333,plain,
( sK6(sK0) = sK5(sK5(sK0))
| ~ spl16_37 ),
inference(avatar_component_clause,[],[f1331]) ).
fof(f1331,plain,
( spl16_37
<=> sK6(sK0) = sK5(sK5(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_37])]) ).
fof(f981,plain,
~ occurrence_of(sK5(sK5(sK0)),tptp4),
inference(unit_resulting_resolution,[],[f117,f884,f144]) ).
fof(f144,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(flattening,[],[f90]) ).
fof(f90,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& occurrence_of(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X28,X29,X30] :
( ( occurrence_of(X28,X30)
& occurrence_of(X28,X29) )
=> X29 = X30 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(f884,plain,
occurrence_of(sK5(sK5(sK0)),tptp3),
inference(subsumption_resolution,[],[f883,f756]) ).
fof(f883,plain,
( leaf_occ(sK5(sK0),sK8(tptp0,sK5(sK0),sK6(sK0)))
| occurrence_of(sK5(sK5(sK0)),tptp3) ),
inference(subsumption_resolution,[],[f882,f248]) ).
fof(f882,plain,
( ~ arboreal(sK5(sK0))
| leaf_occ(sK5(sK0),sK8(tptp0,sK5(sK0),sK6(sK0)))
| occurrence_of(sK5(sK5(sK0)),tptp3) ),
inference(subsumption_resolution,[],[f862,f427]) ).
fof(f862,plain,
( ~ occurrence_of(sK8(tptp0,sK5(sK0),sK6(sK0)),tptp0)
| ~ arboreal(sK5(sK0))
| leaf_occ(sK5(sK0),sK8(tptp0,sK5(sK0),sK6(sK0)))
| occurrence_of(sK5(sK5(sK0)),tptp3) ),
inference(resolution,[],[f428,f110]) ).
fof(f117,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
tptp3 != tptp4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_39) ).
fof(f1334,plain,
( spl16_36
| spl16_37 ),
inference(avatar_split_clause,[],[f1325,f1331,f1327]) ).
fof(f1325,plain,
( sK6(sK0) = sK5(sK5(sK0))
| sK7(sK0) = sK5(sK5(sK0)) ),
inference(subsumption_resolution,[],[f1324,f223]) ).
fof(f223,plain,
sP13(sK0),
inference(unit_resulting_resolution,[],[f103,f104,f106,f151]) ).
fof(f151,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| sP13(X0) ),
inference(cnf_transformation,[],[f151_D]) ).
fof(f151_D,plain,
! [X0] :
( ! [X1] :
( leaf_occ(X0,X1)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) )
<=> ~ sP13(X0) ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP13])]) ).
fof(f1324,plain,
( sK6(sK0) = sK5(sK5(sK0))
| sK7(sK0) = sK5(sK5(sK0))
| ~ sP13(sK0) ),
inference(subsumption_resolution,[],[f1313,f105]) ).
fof(f1313,plain,
( ~ arboreal(sK0)
| sK6(sK0) = sK5(sK5(sK0))
| sK7(sK0) = sK5(sK5(sK0))
| ~ sP13(sK0) ),
inference(resolution,[],[f1286,f152]) ).
fof(f152,plain,
! [X0,X5] :
( ~ min_precedes(sK5(X0),X5,tptp0)
| ~ arboreal(X0)
| sK6(X0) = X5
| sK7(X0) = X5
| ~ sP13(X0) ),
inference(general_splitting,[],[f108,f151_D]) ).
fof(f108,plain,
! [X0,X1,X5] :
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1)
| ~ min_precedes(sK5(X0),X5,tptp0)
| sK6(X0) = X5
| sK7(X0) = X5 ),
inference(cnf_transformation,[],[f71]) ).
fof(f1286,plain,
min_precedes(sK5(sK0),sK5(sK5(sK0)),tptp0),
inference(unit_resulting_resolution,[],[f887,f137]) ).
fof(f137,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : PRO018+4 : TPTP v8.2.0. Released v4.0.0.
% 0.03/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.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 03:57:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/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/benchmark/theBenchmark.p
% 0.58/0.75 % (19494)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 theBenchmark for (2996ds/51Mi)
% 0.58/0.75 % (19501)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.58/0.75 % (19493)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 theBenchmark for (2996ds/34Mi)
% 0.58/0.75 % (19495)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.58/0.75 % (19497)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.58/0.75 % (19498)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 theBenchmark for (2996ds/34Mi)
% 0.58/0.75 % (19499)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.58/0.75 % (19500)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 theBenchmark for (2996ds/83Mi)
% 0.58/0.76 % (19501)Refutation not found, incomplete strategy% (19501)------------------------------
% 0.58/0.76 % (19501)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (19501)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.76
% 0.58/0.76 % (19501)Memory used [KB]: 1180
% 0.58/0.76 % (19501)Time elapsed: 0.005 s
% 0.58/0.76 % (19501)Instructions burned: 11 (million)
% 0.58/0.76 % (19501)------------------------------
% 0.58/0.76 % (19501)------------------------------
% 0.60/0.77 % (19494)Instruction limit reached!
% 0.60/0.77 % (19494)------------------------------
% 0.60/0.77 % (19494)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (19494)Termination reason: Unknown
% 0.60/0.77 % (19494)Termination phase: Saturation
% 0.60/0.77
% 0.60/0.77 % (19494)Memory used [KB]: 1458
% 0.60/0.77 % (19494)Time elapsed: 0.018 s
% 0.60/0.77 % (19494)Instructions burned: 54 (million)
% 0.60/0.77 % (19494)------------------------------
% 0.60/0.77 % (19494)------------------------------
% 0.60/0.77 % (19509)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.60/0.77 % (19511)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2995ds/50Mi)
% 0.60/0.77 % (19497)Instruction limit reached!
% 0.60/0.77 % (19497)------------------------------
% 0.60/0.77 % (19497)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (19497)Termination reason: Unknown
% 0.60/0.77 % (19497)Termination phase: Saturation
% 0.60/0.77
% 0.60/0.77 % (19497)Memory used [KB]: 1399
% 0.60/0.77 % (19497)Time elapsed: 0.021 s
% 0.60/0.77 % (19497)Instructions burned: 34 (million)
% 0.60/0.77 % (19497)------------------------------
% 0.60/0.77 % (19497)------------------------------
% 0.60/0.78 % (19493)Instruction limit reached!
% 0.60/0.78 % (19493)------------------------------
% 0.60/0.78 % (19493)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (19493)Termination reason: Unknown
% 0.60/0.78 % (19493)Termination phase: Saturation
% 0.60/0.78
% 0.60/0.78 % (19493)Memory used [KB]: 1384
% 0.60/0.78 % (19493)Time elapsed: 0.023 s
% 0.60/0.78 % (19493)Instructions burned: 34 (million)
% 0.60/0.78 % (19493)------------------------------
% 0.60/0.78 % (19493)------------------------------
% 0.60/0.78 % (19498)Instruction limit reached!
% 0.60/0.78 % (19498)------------------------------
% 0.60/0.78 % (19498)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (19498)Termination reason: Unknown
% 0.60/0.78 % (19498)Termination phase: Saturation
% 0.60/0.78
% 0.60/0.78 % (19498)Memory used [KB]: 1649
% 0.60/0.78 % (19498)Time elapsed: 0.023 s
% 0.60/0.78 % (19498)Instructions burned: 34 (million)
% 0.60/0.78 % (19498)------------------------------
% 0.60/0.78 % (19498)------------------------------
% 0.60/0.78 % (19514)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2995ds/208Mi)
% 0.60/0.78 % (19516)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2995ds/52Mi)
% 0.60/0.78 % (19517)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2995ds/518Mi)
% 0.60/0.78 % (19499)Instruction limit reached!
% 0.60/0.78 % (19499)------------------------------
% 0.60/0.78 % (19499)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (19499)Termination reason: Unknown
% 0.60/0.78 % (19499)Termination phase: Saturation
% 0.60/0.78
% 0.60/0.78 % (19499)Memory used [KB]: 1542
% 0.60/0.78 % (19499)Time elapsed: 0.028 s
% 0.60/0.78 % (19499)Instructions burned: 45 (million)
% 0.60/0.78 % (19499)------------------------------
% 0.60/0.78 % (19499)------------------------------
% 0.60/0.79 % (19518)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2995ds/42Mi)
% 0.60/0.79 % (19511)Instruction limit reached!
% 0.60/0.79 % (19511)------------------------------
% 0.60/0.79 % (19511)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79 % (19511)Termination reason: Unknown
% 0.60/0.79 % (19511)Termination phase: Saturation
% 0.60/0.79
% 0.60/0.79 % (19511)Memory used [KB]: 1607
% 0.60/0.79 % (19511)Time elapsed: 0.016 s
% 0.60/0.79 % (19511)Instructions burned: 52 (million)
% 0.60/0.79 % (19511)------------------------------
% 0.60/0.79 % (19511)------------------------------
% 0.60/0.79 % (19509)Instruction limit reached!
% 0.60/0.79 % (19509)------------------------------
% 0.60/0.79 % (19509)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79 % (19509)Termination reason: Unknown
% 0.60/0.79 % (19509)Termination phase: Saturation
% 0.60/0.79
% 0.60/0.79 % (19509)Memory used [KB]: 1764
% 0.60/0.79 % (19509)Time elapsed: 0.044 s
% 0.60/0.79 % (19509)Instructions burned: 57 (million)
% 0.60/0.79 % (19509)------------------------------
% 0.60/0.79 % (19509)------------------------------
% 0.60/0.79 % (19520)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on theBenchmark for (2995ds/243Mi)
% 0.60/0.79 % (19521)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on theBenchmark for (2995ds/117Mi)
% 0.60/0.79 % (19500)First to succeed.
% 0.60/0.79 % (19500)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-19489"
% 0.60/0.80 % (19500)Refutation found. Thanks to Tanya!
% 0.60/0.80 % SZS status Theorem for theBenchmark
% 0.60/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.80 % (19500)------------------------------
% 0.60/0.80 % (19500)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.80 % (19500)Termination reason: Refutation
% 0.60/0.80
% 0.60/0.80 % (19500)Memory used [KB]: 1576
% 0.60/0.80 % (19500)Time elapsed: 0.041 s
% 0.60/0.80 % (19500)Instructions burned: 63 (million)
% 0.60/0.80 % (19489)Success in time 0.432 s
% 0.60/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------