TSTP Solution File: PRO011+1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : PRO011+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n017.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 : Mon Jun 24 13:41:29 EDT 2024
% Result : Theorem 0.21s 0.42s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 56 ( 7 unt; 0 def)
% Number of atoms : 283 ( 8 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 294 ( 67 ~; 71 |; 131 &)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 163 ( 108 !; 55 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f323,plain,
$false,
inference(subsumption_resolution,[],[f322,f315]) ).
fof(f315,plain,
! [X0] : ~ min_precedes(sK7(sK2),X0,tptp0),
inference(resolution,[],[f314,f232]) ).
fof(f232,plain,
! [X0,X1,X4] :
( ~ leaf(X0,X1)
| ~ min_precedes(X0,X4,X1) ),
inference(cnf_transformation,[],[f162]) ).
fof(f162,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| min_precedes(X0,sK11(X0,X1),X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X4] : ~ min_precedes(X0,X4,X1)
& ( min_precedes(sK12(X0,X1),X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12])],[f159,f161,f160]) ).
fof(f160,plain,
! [X0,X1] :
( ? [X2] : min_precedes(X0,X2,X1)
=> min_precedes(X0,sK11(X0,X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
! [X0,X1] :
( ? [X5] : min_precedes(X5,X0,X1)
=> min_precedes(sK12(X0,X1),X0,X1) ),
introduced(choice_axiom,[]) ).
fof(f159,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ? [X2] : min_precedes(X0,X2,X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X4] : ~ min_precedes(X0,X4,X1)
& ( ? [X5] : min_precedes(X5,X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(rectify,[],[f158]) ).
fof(f158,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ? [X2] : min_precedes(X0,X2,X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X2] : ~ min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(flattening,[],[f157]) ).
fof(f157,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ? [X2] : min_precedes(X0,X2,X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X2] : ~ min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(nnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ! [X2] : ~ min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) ) ),
inference(ennf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ~ ? [X2] : min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) ) ),
inference(rectify,[],[f22]) ).
fof(f22,axiom,
! [X56,X57] :
( leaf(X56,X57)
<=> ( ~ ? [X59] : min_precedes(X56,X59,X57)
& ( ? [X58] : min_precedes(X58,X56,X57)
| root(X56,X57) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f314,plain,
leaf(sK7(sK2),tptp0),
inference(subsumption_resolution,[],[f312,f275]) ).
fof(f275,plain,
leaf_occ(sK7(sK2),sK2),
inference(resolution,[],[f214,f187]) ).
fof(f187,plain,
occurrence_of(sK2,tptp0),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
( ! [X1,X2] :
( ( min_precedes(X1,sK3(X1),tptp0)
& subactivity_occurrence(sK3(X1),sK2)
& occurrence_of(sK3(X1),tptp1)
& occurrence_of(X2,tptp2) )
| sP0(X1,sK2,X2)
| ~ leaf_occ(X2,sK2) )
& occurrence_of(sK2,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f138,f144,f143]) ).
fof(f143,plain,
( ? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| sP0(X1,X0,X2)
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) )
=> ( ! [X2,X1] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,sK2)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| sP0(X1,sK2,X2)
| ~ leaf_occ(X2,sK2) )
& occurrence_of(sK2,tptp0) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
! [X1] :
( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,sK2)
& occurrence_of(X3,tptp1) )
=> ( min_precedes(X1,sK3(X1),tptp0)
& subactivity_occurrence(sK3(X1),sK2)
& occurrence_of(sK3(X1),tptp1) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| sP0(X1,X0,X2)
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) ),
inference(definition_folding,[],[f89,f137]) ).
fof(f137,plain,
! [X1,X0,X2] :
( ( ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ sP0(X1,X0,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f89,plain,
? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| ( ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f51,plain,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( ( occurrence_of(X2,tptp2)
=> ~ ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) ) )
& ( occurrence_of(X2,tptp1)
=> ~ ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp2) ) )
& leaf_occ(X2,X0) ) ),
inference(rectify,[],[f50]) ).
fof(f50,negated_conjecture,
~ ! [X109] :
( occurrence_of(X109,tptp0)
=> ? [X110,X111] :
( ( occurrence_of(X111,tptp2)
=> ~ ? [X113] :
( min_precedes(X110,X113,tptp0)
& subactivity_occurrence(X113,X109)
& occurrence_of(X113,tptp1) ) )
& ( occurrence_of(X111,tptp1)
=> ~ ? [X112] :
( min_precedes(X110,X112,tptp0)
& subactivity_occurrence(X112,X109)
& occurrence_of(X112,tptp2) ) )
& leaf_occ(X111,X109) ) ),
inference(negated_conjecture,[],[f49]) ).
fof(f49,conjecture,
! [X109] :
( occurrence_of(X109,tptp0)
=> ? [X110,X111] :
( ( occurrence_of(X111,tptp2)
=> ~ ? [X113] :
( min_precedes(X110,X113,tptp0)
& subactivity_occurrence(X113,X109)
& occurrence_of(X113,tptp1) ) )
& ( occurrence_of(X111,tptp1)
=> ~ ? [X112] :
( min_precedes(X110,X112,tptp0)
& subactivity_occurrence(X112,X109)
& occurrence_of(X112,tptp2) ) )
& leaf_occ(X111,X109) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f214,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| leaf_occ(sK7(X0),X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
! [X0] :
( ( leaf_occ(sK7(X0),X0)
& next_subocc(sK6(X0),sK7(X0),tptp0)
& ( occurrence_of(sK7(X0),tptp2)
| occurrence_of(sK7(X0),tptp1) )
& next_subocc(sK5(X0),sK6(X0),tptp0)
& occurrence_of(sK6(X0),tptp4)
& root_occ(sK5(X0),X0)
& occurrence_of(sK5(X0),tptp3) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f93,f148]) ).
fof(f148,plain,
! [X0] :
( ? [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) )
=> ( leaf_occ(sK7(X0),X0)
& next_subocc(sK6(X0),sK7(X0),tptp0)
& ( occurrence_of(sK7(X0),tptp2)
| occurrence_of(sK7(X0),tptp1) )
& next_subocc(sK5(X0),sK6(X0),tptp0)
& occurrence_of(sK6(X0),tptp4)
& root_occ(sK5(X0),X0)
& occurrence_of(sK5(X0),tptp3) ) ),
introduced(choice_axiom,[]) ).
fof(f93,plain,
! [X0] :
( ? [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) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,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,[],[f36]) ).
fof(f36,axiom,
! [X105] :
( occurrence_of(X105,tptp0)
=> ? [X106,X107,X108] :
( leaf_occ(X108,X105)
& next_subocc(X107,X108,tptp0)
& ( occurrence_of(X108,tptp2)
| occurrence_of(X108,tptp1) )
& next_subocc(X106,X107,tptp0)
& occurrence_of(X107,tptp4)
& root_occ(X106,X105)
& occurrence_of(X106,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f312,plain,
( leaf(sK7(sK2),tptp0)
| ~ leaf_occ(sK7(sK2),sK2) ),
inference(superposition,[],[f240,f311]) ).
fof(f311,plain,
tptp0 = sK14(sK7(sK2),sK2),
inference(resolution,[],[f300,f275]) ).
fof(f300,plain,
! [X0] :
( ~ leaf_occ(X0,sK2)
| tptp0 = sK14(X0,sK2) ),
inference(resolution,[],[f290,f238]) ).
fof(f238,plain,
! [X0,X1] :
( occurrence_of(X1,sK14(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f168,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) ) )
& ( ( leaf(X0,sK14(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK14(X0,X1)) )
| ~ leaf_occ(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14])],[f166,f167]) ).
fof(f167,plain,
! [X0,X1] :
( ? [X3] :
( leaf(X0,X3)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X3) )
=> ( leaf(X0,sK14(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK14(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f166,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) ) )
& ( ? [X3] :
( leaf(X0,X3)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X3) )
| ~ leaf_occ(X0,X1) ) ),
inference(rectify,[],[f165]) ).
fof(f165,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) ) )
& ( ? [X2] :
( leaf(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) )
| ~ leaf_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f67]) ).
fof(f67,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
<=> ? [X2] :
( leaf(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) ) ),
inference(rectify,[],[f35]) ).
fof(f35,axiom,
! [X102,X103] :
( leaf_occ(X102,X103)
<=> ? [X104] :
( leaf(X102,X104)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,X104) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f290,plain,
! [X0] :
( ~ occurrence_of(sK2,X0)
| tptp0 = X0 ),
inference(resolution,[],[f264,f187]) ).
fof(f264,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| X1 = X2
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(flattening,[],[f122]) ).
fof(f122,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f79]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& occurrence_of(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X4,X5,X6] :
( ( occurrence_of(X4,X6)
& occurrence_of(X4,X5) )
=> X5 = X6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f240,plain,
! [X0,X1] :
( leaf(X0,sK14(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f322,plain,
min_precedes(sK7(sK2),sK1(sK7(sK2),sK2),tptp0),
inference(resolution,[],[f302,f315]) ).
fof(f302,plain,
! [X0] :
( min_precedes(X0,sK3(X0),tptp0)
| min_precedes(X0,sK1(X0,sK2),tptp0) ),
inference(resolution,[],[f186,f276]) ).
fof(f276,plain,
! [X0] :
( sP0(X0,sK2,sK7(sK2))
| min_precedes(X0,sK3(X0),tptp0) ),
inference(resolution,[],[f275,f191]) ).
fof(f191,plain,
! [X2,X1] :
( ~ leaf_occ(X2,sK2)
| sP0(X1,sK2,X2)
| min_precedes(X1,sK3(X1),tptp0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f186,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| min_precedes(X0,sK1(X0,X1),tptp0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
! [X0,X1,X2] :
( ( min_precedes(X0,sK1(X0,X1),tptp0)
& subactivity_occurrence(sK1(X0,X1),X1)
& occurrence_of(sK1(X0,X1),tptp2)
& occurrence_of(X2,tptp1) )
| ~ sP0(X0,X1,X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f140,f141]) ).
fof(f141,plain,
! [X0,X1] :
( ? [X3] :
( min_precedes(X0,X3,tptp0)
& subactivity_occurrence(X3,X1)
& occurrence_of(X3,tptp2) )
=> ( min_precedes(X0,sK1(X0,X1),tptp0)
& subactivity_occurrence(sK1(X0,X1),X1)
& occurrence_of(sK1(X0,X1),tptp2) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
! [X0,X1,X2] :
( ( ? [X3] :
( min_precedes(X0,X3,tptp0)
& subactivity_occurrence(X3,X1)
& occurrence_of(X3,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ sP0(X0,X1,X2) ),
inference(rectify,[],[f139]) ).
fof(f139,plain,
! [X1,X0,X2] :
( ( ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ sP0(X1,X0,X2) ),
inference(nnf_transformation,[],[f137]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PRO011+1 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.12 % Command : run_vampire %s %d THM
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 06:18:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.35 Running first-order theorem proving
% 0.12/0.35 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.41 % (16944)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.41 % (16947)lrs+11_1:16_to=lpo:drc=off:bsd=on:sp=frequency:i=172350:bs=on:av=off:fsd=on:sil=256000:fdi=50_0 on theBenchmark for (2999ds/172350Mi)
% 0.21/0.41 % (16944)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.41 % (16948)lrs+1011_1:1_sil=2000:i=103:ep=RS:nm=32:ss=axioms:sos=on_0 on theBenchmark for (2999ds/103Mi)
% 0.21/0.41 % (16944)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.41 % (16950)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=113:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2999ds/113Mi)
% 0.21/0.41 % (16944)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.41 % (16949)lrs+1011_1:1_sil=32000:rnwc=on:nwc=10.0:lwlo=on:i=121:bd=off:av=off_0 on theBenchmark for (2999ds/121Mi)
% 0.21/0.41 % (16944)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.41 % (16951)lrs+1010_1:1_to=lpo:sil=2000:plsq=on:plsqr=32,1:sp=reverse_arity:sos=on:spb=goal_then_units:i=128:ss=axioms:sgt=50:bd=off:sd=3_0 on theBenchmark for (2999ds/128Mi)
% 0.21/0.41 % (16944)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.41 % (16946)lrs+1002_74:59_drc=off:tgt=full:sos=all:cond=fast:i=124987:kws=inv_frequency:afp=300:afq=2.0744697298148953:rawr=on:urr=full:sil=128000:si=on:rtra=on:random_seed=3250543_0 on theBenchmark for (2999ds/124987Mi)
% 0.21/0.41 % (16948)Refutation not found, incomplete strategy% (16948)------------------------------
% 0.21/0.41 % (16948)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.41 % (16948)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.41 % (16948)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.41
% 0.21/0.41 % (16948)Memory used [KB]: 1155
% 0.21/0.41 % (16948)Time elapsed: 0.003 s
% 0.21/0.41 % (16948)Instructions burned: 2 (million)
% 0.21/0.41 % (16948)------------------------------
% 0.21/0.41 % (16948)------------------------------
% 0.21/0.42 % (16944)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (16945)lrs+2_5:39_bsr=unit_only:to=lpo:drc=off:sil=128000:plsq=on:plsqr=2,19:sp=frequency:lcm=reverse:fd=preordered:s2a=on:i=38749:s2at=-1.0:fsr=off:uhcvi=on:rawr=on:aer=off:lwlo=on:add=off:bce=on:acc=model:afr=on_0 on theBenchmark for (2999ds/38749Mi)
% 0.21/0.42 % (16950)Refutation not found, incomplete strategy% (16950)------------------------------
% 0.21/0.42 % (16950)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.42 % (16950)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.42 % (16950)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.42
% 0.21/0.42 % (16950)Memory used [KB]: 1194
% 0.21/0.42 % (16950)Time elapsed: 0.007 s
% 0.21/0.42 % (16950)Instructions burned: 7 (million)
% 0.21/0.42 % (16950)------------------------------
% 0.21/0.42 % (16950)------------------------------
% 0.21/0.42 % (16949)First to succeed.
% 0.21/0.42 % (16951)Also succeeded, but the first one will report.
% 0.21/0.42 % (16949)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-16944"
% 0.21/0.42 % (16944)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (16949)Refutation found. Thanks to Tanya!
% 0.21/0.42 % SZS status Theorem for theBenchmark
% 0.21/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.42 % (16949)------------------------------
% 0.21/0.42 % (16949)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.42 % (16949)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.42 % (16949)Termination reason: Refutation
% 0.21/0.42
% 0.21/0.42 % (16949)Memory used [KB]: 1284
% 0.21/0.42 % (16949)Time elapsed: 0.009 s
% 0.21/0.42 % (16949)Instructions burned: 12 (million)
% 0.21/0.42 % (16949)------------------------------
% 0.21/0.42 % (16949)------------------------------
% 0.21/0.42 % (16944)Success in time 0.058 s
%------------------------------------------------------------------------------