TSTP Solution File: PRO011+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : PRO011+4 : 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_uns --cores 0 -t %d %s
% Computer : n008.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:12 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 4 unt; 0 def)
% Number of atoms : 230 ( 0 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 244 ( 60 ~; 56 |; 109 &)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 3 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 120 ( 76 !; 44 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f660,plain,
$false,
inference(avatar_sat_refutation,[],[f515,f519,f659]) ).
fof(f659,plain,
~ spl20_10,
inference(avatar_contradiction_clause,[],[f656]) ).
fof(f656,plain,
( $false
| ~ spl20_10 ),
inference(resolution,[],[f590,f231]) ).
fof(f231,plain,
occurrence_of(sK9,tptp0),
inference(cnf_transformation,[],[f161]) ).
fof(f161,plain,
( ! [X1,X2] :
( ( min_precedes(X2,sK10(X2),tptp0)
& occurrence_of(sK10(X2),tptp1)
& subactivity_occurrence(sK10(X2),sK9)
& occurrence_of(X1,tptp2) )
| ~ leaf_occ(X1,sK9)
| sP0(sK9,X2,X1) )
& occurrence_of(sK9,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f158,f160,f159]) ).
fof(f159,plain,
( ? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X2,X3,tptp0)
& occurrence_of(X3,tptp1)
& subactivity_occurrence(X3,X0) )
& occurrence_of(X1,tptp2) )
| ~ leaf_occ(X1,X0)
| sP0(X0,X2,X1) )
& occurrence_of(X0,tptp0) )
=> ( ! [X2,X1] :
( ( ? [X3] :
( min_precedes(X2,X3,tptp0)
& occurrence_of(X3,tptp1)
& subactivity_occurrence(X3,sK9) )
& occurrence_of(X1,tptp2) )
| ~ leaf_occ(X1,sK9)
| sP0(sK9,X2,X1) )
& occurrence_of(sK9,tptp0) ) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
! [X2] :
( ? [X3] :
( min_precedes(X2,X3,tptp0)
& occurrence_of(X3,tptp1)
& subactivity_occurrence(X3,sK9) )
=> ( min_precedes(X2,sK10(X2),tptp0)
& occurrence_of(sK10(X2),tptp1)
& subactivity_occurrence(sK10(X2),sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X2,X3,tptp0)
& occurrence_of(X3,tptp1)
& subactivity_occurrence(X3,X0) )
& occurrence_of(X1,tptp2) )
| ~ leaf_occ(X1,X0)
| sP0(X0,X2,X1) )
& occurrence_of(X0,tptp0) ),
inference(rectify,[],[f133]) ).
fof(f133,plain,
? [X0] :
( ! [X1,X2] :
( ( ? [X4] :
( min_precedes(X2,X4,tptp0)
& occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0) )
& occurrence_of(X1,tptp2) )
| ~ leaf_occ(X1,X0)
| sP0(X0,X2,X1) )
& occurrence_of(X0,tptp0) ),
inference(definition_folding,[],[f108,f132]) ).
fof(f132,plain,
! [X0,X2,X1] :
( ( ? [X3] :
( subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2)
& min_precedes(X2,X3,tptp0) )
& occurrence_of(X1,tptp1) )
| ~ sP0(X0,X2,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f108,plain,
? [X0] :
( ! [X1,X2] :
( ( ? [X4] :
( min_precedes(X2,X4,tptp0)
& occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0) )
& occurrence_of(X1,tptp2) )
| ~ leaf_occ(X1,X0)
| ( ? [X3] :
( subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2)
& min_precedes(X2,X3,tptp0) )
& occurrence_of(X1,tptp1) ) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f50,plain,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X1,X0)
& ( occurrence_of(X1,tptp1)
=> ~ ? [X3] :
( subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2)
& min_precedes(X2,X3,tptp0) ) )
& ( occurrence_of(X1,tptp2)
=> ~ ? [X4] :
( min_precedes(X2,X4,tptp0)
& occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0) ) ) ) ),
inference(rectify,[],[f47]) ).
fof(f47,negated_conjecture,
~ ! [X105] :
( occurrence_of(X105,tptp0)
=> ? [X107,X106] :
( leaf_occ(X107,X105)
& ( occurrence_of(X107,tptp1)
=> ~ ? [X108] :
( subactivity_occurrence(X108,X105)
& min_precedes(X106,X108,tptp0)
& occurrence_of(X108,tptp2) ) )
& ( occurrence_of(X107,tptp2)
=> ~ ? [X109] :
( occurrence_of(X109,tptp1)
& min_precedes(X106,X109,tptp0)
& subactivity_occurrence(X109,X105) ) ) ) ),
inference(negated_conjecture,[],[f46]) ).
fof(f46,conjecture,
! [X105] :
( occurrence_of(X105,tptp0)
=> ? [X107,X106] :
( leaf_occ(X107,X105)
& ( occurrence_of(X107,tptp1)
=> ~ ? [X108] :
( subactivity_occurrence(X108,X105)
& min_precedes(X106,X108,tptp0)
& occurrence_of(X108,tptp2) ) )
& ( occurrence_of(X107,tptp2)
=> ~ ? [X109] :
( occurrence_of(X109,tptp1)
& min_precedes(X106,X109,tptp0)
& subactivity_occurrence(X109,X105) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f590,plain,
( ! [X5] : ~ occurrence_of(X5,tptp0)
| ~ spl20_10 ),
inference(duplicate_literal_removal,[],[f589]) ).
fof(f589,plain,
( ! [X5] :
( ~ occurrence_of(X5,tptp0)
| ~ occurrence_of(X5,tptp0) )
| ~ spl20_10 ),
inference(resolution,[],[f584,f216]) ).
fof(f216,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| leaf_occ(sK4(X0),X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
! [X0] :
( ( occurrence_of(sK3(X0),tptp3)
& leaf_occ(sK4(X0),X0)
& next_subocc(sK3(X0),sK2(X0),tptp0)
& ( occurrence_of(sK4(X0),tptp2)
| occurrence_of(sK4(X0),tptp1) )
& next_subocc(sK2(X0),sK4(X0),tptp0)
& root_occ(sK3(X0),X0)
& occurrence_of(sK2(X0),tptp4) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f141,f142]) ).
fof(f142,plain,
! [X0] :
( ? [X1,X2,X3] :
( occurrence_of(X2,tptp3)
& leaf_occ(X3,X0)
& next_subocc(X2,X1,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X1,X3,tptp0)
& root_occ(X2,X0)
& occurrence_of(X1,tptp4) )
=> ( occurrence_of(sK3(X0),tptp3)
& leaf_occ(sK4(X0),X0)
& next_subocc(sK3(X0),sK2(X0),tptp0)
& ( occurrence_of(sK4(X0),tptp2)
| occurrence_of(sK4(X0),tptp1) )
& next_subocc(sK2(X0),sK4(X0),tptp0)
& root_occ(sK3(X0),X0)
& occurrence_of(sK2(X0),tptp4) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
! [X0] :
( ? [X1,X2,X3] :
( occurrence_of(X2,tptp3)
& leaf_occ(X3,X0)
& next_subocc(X2,X1,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X1,X3,tptp0)
& root_occ(X2,X0)
& occurrence_of(X1,tptp4) )
| ~ occurrence_of(X0,tptp0) ),
inference(rectify,[],[f105]) ).
fof(f105,plain,
! [X0] :
( ? [X3,X1,X2] :
( occurrence_of(X1,tptp3)
& leaf_occ(X2,X0)
& next_subocc(X1,X3,tptp0)
& ( occurrence_of(X2,tptp2)
| occurrence_of(X2,tptp1) )
& next_subocc(X3,X2,tptp0)
& root_occ(X1,X0)
& occurrence_of(X3,tptp4) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f66]) ).
fof(f66,plain,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X3,X1,X2] :
( occurrence_of(X1,tptp3)
& leaf_occ(X2,X0)
& next_subocc(X1,X3,tptp0)
& ( occurrence_of(X2,tptp2)
| occurrence_of(X2,tptp1) )
& next_subocc(X3,X2,tptp0)
& root_occ(X1,X0)
& occurrence_of(X3,tptp4) ) ),
inference(rectify,[],[f33]) ).
fof(f33,axiom,
! [X101] :
( occurrence_of(X101,tptp0)
=> ? [X102,X104,X103] :
( next_subocc(X102,X103,tptp0)
& occurrence_of(X102,tptp3)
& ( occurrence_of(X104,tptp1)
| occurrence_of(X104,tptp2) )
& next_subocc(X103,X104,tptp0)
& leaf_occ(X104,X101)
& occurrence_of(X103,tptp4)
& root_occ(X102,X101) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f584,plain,
( ! [X0,X1] :
( ~ leaf_occ(X0,X1)
| ~ occurrence_of(X1,tptp0) )
| ~ spl20_10 ),
inference(subsumption_resolution,[],[f564,f210]) ).
fof(f210,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X0,X3,X2)
| ~ occurrence_of(X1,X2)
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
! [X0,X1,X2] :
( ~ leaf_occ(X0,X1)
| ! [X3] : ~ min_precedes(X0,X3,X2)
| ~ occurrence_of(X1,X2) ),
inference(rectify,[],[f96]) ).
fof(f96,plain,
! [X2,X1,X0] :
( ~ leaf_occ(X2,X1)
| ! [X3] : ~ min_precedes(X2,X3,X0)
| ~ occurrence_of(X1,X0) ),
inference(flattening,[],[f95]) ).
fof(f95,plain,
! [X0,X2,X1] :
( ! [X3] : ~ min_precedes(X2,X3,X0)
| ~ leaf_occ(X2,X1)
| ~ occurrence_of(X1,X0) ),
inference(ennf_transformation,[],[f79]) ).
fof(f79,plain,
! [X0,X2,X1] :
( ( leaf_occ(X2,X1)
& occurrence_of(X1,X0) )
=> ~ ? [X3] : min_precedes(X2,X3,X0) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X33,X31,X32] :
( ( leaf_occ(X32,X31)
& occurrence_of(X31,X33) )
=> ~ ? [X34] : min_precedes(X32,X34,X33) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).
fof(f564,plain,
( ! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| min_precedes(X0,sK10(X0),tptp0)
| ~ leaf_occ(X0,X1) )
| ~ spl20_10 ),
inference(resolution,[],[f514,f210]) ).
fof(f514,plain,
( ! [X7] :
( min_precedes(X7,sK8(sK9,X7),tptp0)
| min_precedes(X7,sK10(X7),tptp0) )
| ~ spl20_10 ),
inference(avatar_component_clause,[],[f513]) ).
fof(f513,plain,
( spl20_10
<=> ! [X7] :
( min_precedes(X7,sK8(sK9,X7),tptp0)
| min_precedes(X7,sK10(X7),tptp0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl20_10])]) ).
fof(f519,plain,
~ spl20_8,
inference(avatar_contradiction_clause,[],[f518]) ).
fof(f518,plain,
( $false
| ~ spl20_8 ),
inference(subsumption_resolution,[],[f517,f231]) ).
fof(f517,plain,
( ~ occurrence_of(sK9,tptp0)
| ~ spl20_8 ),
inference(resolution,[],[f507,f216]) ).
fof(f507,plain,
( ! [X6] : ~ leaf_occ(X6,sK9)
| ~ spl20_8 ),
inference(avatar_component_clause,[],[f506]) ).
fof(f506,plain,
( spl20_8
<=> ! [X6] : ~ leaf_occ(X6,sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl20_8])]) ).
fof(f515,plain,
( spl20_8
| spl20_10 ),
inference(avatar_split_clause,[],[f392,f513,f506]) ).
fof(f392,plain,
! [X6,X7] :
( min_precedes(X7,sK8(sK9,X7),tptp0)
| ~ leaf_occ(X6,sK9)
| min_precedes(X7,sK10(X7),tptp0) ),
inference(resolution,[],[f235,f228]) ).
fof(f228,plain,
! [X2,X0,X1] :
( min_precedes(X1,sK8(X0,X1),tptp0)
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f157]) ).
fof(f157,plain,
! [X0,X1,X2] :
( ( subactivity_occurrence(sK8(X0,X1),X0)
& occurrence_of(sK8(X0,X1),tptp2)
& min_precedes(X1,sK8(X0,X1),tptp0)
& occurrence_of(X2,tptp1) )
| ~ sP0(X0,X1,X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f155,f156]) ).
fof(f156,plain,
! [X0,X1] :
( ? [X3] :
( subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2)
& min_precedes(X1,X3,tptp0) )
=> ( subactivity_occurrence(sK8(X0,X1),X0)
& occurrence_of(sK8(X0,X1),tptp2)
& min_precedes(X1,sK8(X0,X1),tptp0) ) ),
introduced(choice_axiom,[]) ).
fof(f155,plain,
! [X0,X1,X2] :
( ( ? [X3] :
( subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp1) )
| ~ sP0(X0,X1,X2) ),
inference(rectify,[],[f154]) ).
fof(f154,plain,
! [X0,X2,X1] :
( ( ? [X3] :
( subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2)
& min_precedes(X2,X3,tptp0) )
& occurrence_of(X1,tptp1) )
| ~ sP0(X0,X2,X1) ),
inference(nnf_transformation,[],[f132]) ).
fof(f235,plain,
! [X2,X1] :
( sP0(sK9,X2,X1)
| ~ leaf_occ(X1,sK9)
| min_precedes(X2,sK10(X2),tptp0) ),
inference(cnf_transformation,[],[f161]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PRO011+4 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.33 % Computer : n008.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 : Tue Aug 30 10:31:40 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.47 % (6869)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.47 % (6860)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.48 % (6855)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.48 % (6852)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.48 % (6856)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.49 % (6860)Instruction limit reached!
% 0.19/0.49 % (6860)------------------------------
% 0.19/0.49 % (6860)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (6860)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (6860)Termination reason: Unknown
% 0.19/0.49 % (6860)Termination phase: Saturation
% 0.19/0.49
% 0.19/0.49 % (6860)Memory used [KB]: 6268
% 0.19/0.49 % (6860)Time elapsed: 0.081 s
% 0.19/0.49 % (6860)Instructions burned: 8 (million)
% 0.19/0.49 % (6860)------------------------------
% 0.19/0.49 % (6860)------------------------------
% 0.19/0.49 % (6847)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.49 % (6847)Instruction limit reached!
% 0.19/0.49 % (6847)------------------------------
% 0.19/0.49 % (6847)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (6855)First to succeed.
% 0.19/0.49 % (6847)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (6847)Termination reason: Unknown
% 0.19/0.49 % (6847)Termination phase: Saturation
% 0.19/0.49
% 0.19/0.49 % (6847)Memory used [KB]: 1663
% 0.19/0.49 % (6847)Time elapsed: 0.003 s
% 0.19/0.49 % (6847)Instructions burned: 4 (million)
% 0.19/0.49 % (6847)------------------------------
% 0.19/0.49 % (6847)------------------------------
% 0.19/0.49 % (6848)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.49 % (6872)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.50 % (6869)Also succeeded, but the first one will report.
% 0.19/0.50 % (6855)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (6855)------------------------------
% 0.19/0.50 % (6855)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (6855)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (6855)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (6855)Memory used [KB]: 6268
% 0.19/0.50 % (6855)Time elapsed: 0.101 s
% 0.19/0.50 % (6855)Instructions burned: 10 (million)
% 0.19/0.50 % (6855)------------------------------
% 0.19/0.50 % (6855)------------------------------
% 0.19/0.50 % (6841)Success in time 0.161 s
%------------------------------------------------------------------------------