TSTP Solution File: PRO010+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PRO010+4 : 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 : n026.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:19 EDT 2024
% Result : Theorem 0.51s 0.70s
% Output : Refutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 50 ( 4 unt; 1 typ; 0 def)
% Number of atoms : 367 ( 0 equ)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 230 ( 74 ~; 60 |; 75 &)
% ( 3 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 162 ( 162 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 22 ( 21 usr; 10 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 118 ( 75 !; 42 ?; 29 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_19,type,
sQ12_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f216,plain,
$false,
inference(avatar_sat_refutation,[],[f186,f205,f210,f215]) ).
tff(f215,plain,
~ spl13_1,
inference(avatar_contradiction_clause,[],[f214]) ).
tff(f214,plain,
( $false
| ~ spl13_1 ),
inference(subsumption_resolution,[],[f213,f114]) ).
tff(f114,plain,
occurrence_of(sK2,tptp0),
inference(cnf_transformation,[],[f96]) ).
tff(f96,plain,
( ! [X1,X2] :
( ( min_precedes(X1,sK3(X1),tptp0)
& occurrence_of(sK3(X1),tptp1)
& occurrence_of(X2,tptp2) )
| sP0(X1,X2)
| ~ leaf_occ(X2,sK2) )
& occurrence_of(sK2,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f89,f95,f94]) ).
tff(f94,plain,
( ? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| sP0(X1,X2)
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) )
=> ( ! [X2,X1] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| sP0(X1,X2)
| ~ leaf_occ(X2,sK2) )
& occurrence_of(sK2,tptp0) ) ),
introduced(choice_axiom,[]) ).
tff(f95,plain,
! [X1] :
( ? [X3] :
( min_precedes(X1,X3,tptp0)
& occurrence_of(X3,tptp1) )
=> ( min_precedes(X1,sK3(X1),tptp0)
& occurrence_of(sK3(X1),tptp1) ) ),
introduced(choice_axiom,[]) ).
tff(f89,plain,
? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| sP0(X1,X2)
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) ),
inference(definition_folding,[],[f67,f88]) ).
tff(f88,plain,
! [X1,X2] :
( ( ? [X4] :
( min_precedes(X1,X4,tptp0)
& occurrence_of(X4,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ sP0(X1,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f67,plain,
? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| ( ? [X4] :
( min_precedes(X1,X4,tptp0)
& occurrence_of(X4,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f48]) ).
tff(f48,plain,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( ( occurrence_of(X2,tptp2)
=> ~ ? [X3] :
( min_precedes(X1,X3,tptp0)
& occurrence_of(X3,tptp1) ) )
& ( occurrence_of(X2,tptp1)
=> ~ ? [X4] :
( min_precedes(X1,X4,tptp0)
& occurrence_of(X4,tptp2) ) )
& leaf_occ(X2,X0) ) ),
inference(rectify,[],[f47]) ).
tff(f47,negated_conjecture,
~ ! [X105] :
( occurrence_of(X105,tptp0)
=> ? [X106,X107] :
( ( occurrence_of(X107,tptp2)
=> ~ ? [X109] :
( min_precedes(X106,X109,tptp0)
& occurrence_of(X109,tptp1) ) )
& ( occurrence_of(X107,tptp1)
=> ~ ? [X108] :
( min_precedes(X106,X108,tptp0)
& occurrence_of(X108,tptp2) ) )
& leaf_occ(X107,X105) ) ),
inference(negated_conjecture,[],[f46]) ).
tff(f46,conjecture,
! [X105] :
( occurrence_of(X105,tptp0)
=> ? [X106,X107] :
( ( occurrence_of(X107,tptp2)
=> ~ ? [X109] :
( min_precedes(X106,X109,tptp0)
& occurrence_of(X109,tptp1) ) )
& ( occurrence_of(X107,tptp1)
=> ~ ? [X108] :
( min_precedes(X106,X108,tptp0)
& occurrence_of(X108,tptp2) ) )
& leaf_occ(X107,X105) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BU2s2SnPBG/Vampire---4.8_10341',goals) ).
tff(f213,plain,
( ~ occurrence_of(sK2,tptp0)
| ~ spl13_1 ),
inference(resolution,[],[f182,f123]) ).
tff(f123,plain,
! [X0: $i] :
( leaf_occ(sK6(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f98]) ).
tff(f98,plain,
! [X0] :
( ( leaf_occ(sK6(X0),X0)
& ( occurrence_of(sK6(X0),tptp2)
| occurrence_of(sK6(X0),tptp1) )
& occurrence_of(sK5(X0),tptp4)
& root_occ(sK4(X0),X0)
& occurrence_of(sK4(X0),tptp3) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f68,f97]) ).
tff(f97,plain,
! [X0] :
( ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) )
=> ( leaf_occ(sK6(X0),X0)
& ( occurrence_of(sK6(X0),tptp2)
| occurrence_of(sK6(X0),tptp1) )
& occurrence_of(sK5(X0),tptp4)
& root_occ(sK4(X0),X0)
& occurrence_of(sK4(X0),tptp3) ) ),
introduced(choice_axiom,[]) ).
tff(f68,plain,
! [X0] :
( ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f63]) ).
tff(f63,plain,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
inference(pure_predicate_removal,[],[f49]) ).
tff(f49,plain,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
inference(rectify,[],[f33]) ).
tff(f33,axiom,
! [X101] :
( occurrence_of(X101,tptp0)
=> ? [X102,X103,X104] :
( leaf_occ(X104,X101)
& next_subocc(X103,X104,tptp0)
& ( occurrence_of(X104,tptp2)
| occurrence_of(X104,tptp1) )
& next_subocc(X102,X103,tptp0)
& occurrence_of(X103,tptp4)
& root_occ(X102,X101)
& occurrence_of(X102,tptp3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BU2s2SnPBG/Vampire---4.8_10341',sos_32) ).
tff(f182,plain,
( ! [X2: $i] : ~ leaf_occ(X2,sK2)
| ~ spl13_1 ),
inference(avatar_component_clause,[],[f181]) ).
tff(f181,plain,
( spl13_1
<=> ! [X2] : ~ leaf_occ(X2,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_1])]) ).
tff(f210,plain,
~ spl13_4,
inference(avatar_contradiction_clause,[],[f207]) ).
tff(f207,plain,
( $false
| ~ spl13_4 ),
inference(resolution,[],[f192,f114]) ).
tff(f192,plain,
( ! [X0: $i] : ~ occurrence_of(X0,tptp0)
| ~ spl13_4 ),
inference(avatar_component_clause,[],[f191]) ).
tff(f191,plain,
( spl13_4
<=> ! [X0] : ~ occurrence_of(X0,tptp0) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_4])]) ).
tff(f205,plain,
( spl13_4
| ~ spl13_2 ),
inference(avatar_split_clause,[],[f204,f184,f191]) ).
tff(f184,plain,
( spl13_2
<=> ! [X0,X1] :
( ~ occurrence_of(X0,tptp0)
| ~ leaf_occ(sK6(X0),X1)
| ~ occurrence_of(X1,tptp0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_2])]) ).
tff(f204,plain,
( ! [X0: $i] : ~ occurrence_of(X0,tptp0)
| ~ spl13_2 ),
inference(duplicate_literal_removal,[],[f203]) ).
tff(f203,plain,
( ! [X0: $i] :
( ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl13_2 ),
inference(resolution,[],[f185,f123]) ).
tff(f185,plain,
( ! [X0: $i,X1: $i] :
( ~ leaf_occ(sK6(X0),X1)
| ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X1,tptp0) )
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f184]) ).
tff(f186,plain,
( spl13_1
| spl13_2 ),
inference(avatar_split_clause,[],[f178,f184,f181]) ).
tff(f178,plain,
! [X2: $i,X0: $i,X1: $i] :
( ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(sK6(X0),X1)
| ~ leaf_occ(X2,sK2) ),
inference(resolution,[],[f177,f174]) ).
tff(f174,plain,
! [X2: $i,X0: $i,X1: $i] :
( sP0(X0,X2)
| ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(X0,X1)
| ~ leaf_occ(X2,sK2) ),
inference(resolution,[],[f126,f117]) ).
tff(f117,plain,
! [X2: $i,X1: $i] :
( min_precedes(X1,sK3(X1),tptp0)
| sP0(X1,X2)
| ~ leaf_occ(X2,sK2) ),
inference(cnf_transformation,[],[f96]) ).
tff(f126,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ~ min_precedes(X1,X3,X2)
| ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2) ),
inference(cnf_transformation,[],[f74]) ).
tff(f74,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f73]) ).
tff(f73,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f52]) ).
tff(f52,plain,
! [X0,X1,X2] :
( ( leaf_occ(X1,X0)
& occurrence_of(X0,X2) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
inference(rectify,[],[f10]) ).
tff(f10,axiom,
! [X31,X32,X33] :
( ( leaf_occ(X32,X31)
& occurrence_of(X31,X33) )
=> ~ ? [X34] : min_precedes(X32,X34,X33) ),
file('/export/starexec/sandbox2/tmp/tmp.BU2s2SnPBG/Vampire---4.8_10341',sos_09) ).
tff(f177,plain,
! [X0: $i,X1: $i] :
( ~ sP0(sK6(X0),X1)
| ~ occurrence_of(X0,tptp0) ),
inference(duplicate_literal_removal,[],[f176]) ).
tff(f176,plain,
! [X0: $i,X1: $i] :
( ~ occurrence_of(X0,tptp0)
| ~ sP0(sK6(X0),X1)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f175,f123]) ).
tff(f175,plain,
! [X2: $i,X0: $i,X1: $i] :
( ~ leaf_occ(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ sP0(X0,X2) ),
inference(resolution,[],[f126,f113]) ).
tff(f113,plain,
! [X0: $i,X1: $i] :
( min_precedes(X0,sK1(X0),tptp0)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
tff(f93,plain,
! [X0,X1] :
( ( min_precedes(X0,sK1(X0),tptp0)
& occurrence_of(sK1(X0),tptp2)
& occurrence_of(X1,tptp1) )
| ~ sP0(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f91,f92]) ).
tff(f92,plain,
! [X0] :
( ? [X2] :
( min_precedes(X0,X2,tptp0)
& occurrence_of(X2,tptp2) )
=> ( min_precedes(X0,sK1(X0),tptp0)
& occurrence_of(sK1(X0),tptp2) ) ),
introduced(choice_axiom,[]) ).
tff(f91,plain,
! [X0,X1] :
( ( ? [X2] :
( min_precedes(X0,X2,tptp0)
& occurrence_of(X2,tptp2) )
& occurrence_of(X1,tptp1) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f90]) ).
tff(f90,plain,
! [X1,X2] :
( ( ? [X4] :
( min_precedes(X1,X4,tptp0)
& occurrence_of(X4,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ sP0(X1,X2) ),
inference(nnf_transformation,[],[f88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : PRO010+4 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.16 % 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.37 % Computer : n026.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Fri May 3 20:36:38 EDT 2024
% 0.14/0.38 % CPUTime :
% 0.14/0.38 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.38 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.BU2s2SnPBG/Vampire---4.8_10341
% 0.51/0.70 % (10450)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 (2996ds/34Mi)
% 0.51/0.70 % (10456)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.51/0.70 % (10452)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.51/0.70 % (10453)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.51/0.70 % (10455)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 (2996ds/34Mi)
% 0.51/0.70 % (10451)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 (2996ds/51Mi)
% 0.51/0.70 % (10457)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 (2996ds/83Mi)
% 0.51/0.70 % (10458)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 (2996ds/56Mi)
% 0.51/0.70 % (10453)Refutation not found, incomplete strategy% (10453)------------------------------
% 0.51/0.70 % (10453)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.70 % (10453)Termination reason: Refutation not found, incomplete strategy
% 0.51/0.70
% 0.51/0.70 % (10453)Memory used [KB]: 1026
% 0.51/0.70 % (10453)Time elapsed: 0.002 s
% 0.51/0.70 % (10456)Refutation not found, incomplete strategy% (10456)------------------------------
% 0.51/0.70 % (10456)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.70 % (10453)Instructions burned: 2 (million)
% 0.51/0.70 % (10456)Termination reason: Refutation not found, incomplete strategy
% 0.51/0.70
% 0.51/0.70 % (10456)Memory used [KB]: 1041
% 0.51/0.70 % (10456)Time elapsed: 0.002 s
% 0.51/0.70 % (10456)Instructions burned: 2 (million)
% 0.51/0.70 % (10458)Refutation not found, incomplete strategy% (10458)------------------------------
% 0.51/0.70 % (10458)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.70 % (10458)Termination reason: Refutation not found, incomplete strategy
% 0.51/0.70
% 0.51/0.70 % (10458)Memory used [KB]: 1025
% 0.51/0.70 % (10458)Time elapsed: 0.002 s
% 0.51/0.70 % (10458)Instructions burned: 2 (million)
% 0.51/0.70 % (10453)------------------------------
% 0.51/0.70 % (10453)------------------------------
% 0.51/0.70 % (10456)------------------------------
% 0.51/0.70 % (10456)------------------------------
% 0.51/0.70 % (10458)------------------------------
% 0.51/0.70 % (10458)------------------------------
% 0.51/0.70 % (10450)First to succeed.
% 0.51/0.70 % (10450)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-10449"
% 0.51/0.70 % (10450)Refutation found. Thanks to Tanya!
% 0.51/0.70 % SZS status Theorem for Vampire---4
% 0.51/0.70 % SZS output start Proof for Vampire---4
% See solution above
% 0.51/0.70 % (10450)------------------------------
% 0.51/0.70 % (10450)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.70 % (10450)Termination reason: Refutation
% 0.51/0.70
% 0.51/0.70 % (10450)Memory used [KB]: 1108
% 0.51/0.70 % (10450)Time elapsed: 0.004 s
% 0.51/0.70 % (10450)Instructions burned: 7 (million)
% 0.51/0.70 % (10449)Success in time 0.32 s
% 0.51/0.70 % Vampire---4.8 exiting
%------------------------------------------------------------------------------