TSTP Solution File: KRS106+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : KRS106+1 : TPTP v8.2.0. Released v3.1.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 : n005.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 May 20 23:20:07 EDT 2024
% Result : Unsatisfiable 0.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of formulae : 79 ( 4 unt; 0 def)
% Number of atoms : 248 ( 19 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 270 ( 101 ~; 94 |; 50 &)
% ( 12 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 131 ( 103 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f222,plain,
$false,
inference(avatar_sat_refutation,[],[f173,f182,f194,f208,f219,f221]) ).
fof(f221,plain,
( ~ spl5_1
| ~ spl5_7 ),
inference(avatar_split_clause,[],[f220,f216,f166]) ).
fof(f166,plain,
( spl5_1
<=> cUnsatisfiable(i2003_11_14_17_20_57644) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f216,plain,
( spl5_7
<=> cp1(sK0(i2003_11_14_17_20_57644)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_7])]) ).
fof(f220,plain,
( ~ cUnsatisfiable(i2003_11_14_17_20_57644)
| ~ spl5_7 ),
inference(resolution,[],[f218,f153]) ).
fof(f153,plain,
! [X0] :
( ~ cp1(sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f152,f120]) ).
fof(f120,plain,
! [X0] :
( cp1xcomp(sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f86]) ).
fof(f86,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp1xcomp(X1)
| ~ rf2(X0,X1) )
| ! [X2] :
( ~ cp1(X2)
| ~ rf1(X0,X2) )
| ! [X3] :
( ~ cp2(X3)
| ~ rf3(X0,X3) ) )
& ( ( cp1xcomp(sK0(X0))
& rf2(X0,sK0(X0))
& cp1(sK1(X0))
& rf1(X0,sK1(X0))
& cp2(sK2(X0))
& rf3(X0,sK2(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f82,f85,f84,f83]) ).
fof(f83,plain,
! [X0] :
( ? [X4] :
( cp1xcomp(X4)
& rf2(X0,X4) )
=> ( cp1xcomp(sK0(X0))
& rf2(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f84,plain,
! [X0] :
( ? [X5] :
( cp1(X5)
& rf1(X0,X5) )
=> ( cp1(sK1(X0))
& rf1(X0,sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f85,plain,
! [X0] :
( ? [X6] :
( cp2(X6)
& rf3(X0,X6) )
=> ( cp2(sK2(X0))
& rf3(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f82,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp1xcomp(X1)
| ~ rf2(X0,X1) )
| ! [X2] :
( ~ cp1(X2)
| ~ rf1(X0,X2) )
| ! [X3] :
( ~ cp2(X3)
| ~ rf3(X0,X3) ) )
& ( ( ? [X4] :
( cp1xcomp(X4)
& rf2(X0,X4) )
& ? [X5] :
( cp1(X5)
& rf1(X0,X5) )
& ? [X6] :
( cp2(X6)
& rf3(X0,X6) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f81]) ).
fof(f81,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp1xcomp(X1)
| ~ rf2(X0,X1) )
| ! [X2] :
( ~ cp1(X2)
| ~ rf1(X0,X2) )
| ! [X3] :
( ~ cp2(X3)
| ~ rf3(X0,X3) ) )
& ( ( ? [X1] :
( cp1xcomp(X1)
& rf2(X0,X1) )
& ? [X2] :
( cp1(X2)
& rf1(X0,X2) )
& ? [X3] :
( cp2(X3)
& rf3(X0,X3) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f80]) ).
fof(f80,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp1xcomp(X1)
| ~ rf2(X0,X1) )
| ! [X2] :
( ~ cp1(X2)
| ~ rf1(X0,X2) )
| ! [X3] :
( ~ cp2(X3)
| ~ rf3(X0,X3) ) )
& ( ( ? [X1] :
( cp1xcomp(X1)
& rf2(X0,X1) )
& ? [X2] :
( cp1(X2)
& rf1(X0,X2) )
& ? [X3] :
( cp2(X3)
& rf3(X0,X3) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( cp1xcomp(X1)
& rf2(X0,X1) )
& ? [X2] :
( cp1(X2)
& rf1(X0,X2) )
& ? [X3] :
( cp2(X3)
& rf3(X0,X3) ) ) ),
inference(rectify,[],[f19]) ).
fof(f19,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ? [X4] :
( cp1xcomp(X4)
& rf2(X3,X4) )
& ? [X4] :
( cp1(X4)
& rf1(X3,X4) )
& ? [X4] :
( cp2(X4)
& rf3(X3,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f152,plain,
! [X0] :
( ~ cp1xcomp(X0)
| ~ cp1(X0) ),
inference(resolution,[],[f124,f122]) ).
fof(f122,plain,
! [X2,X0] :
( ~ ra_Px1(X0,X2)
| ~ cp1(X0) ),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
! [X0] :
( ( cp1(X0)
| ra_Px1(X0,sK3(X0)) )
& ( ! [X2] : ~ ra_Px1(X0,X2)
| ~ cp1(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f88,f89]) ).
fof(f89,plain,
! [X0] :
( ? [X1] : ra_Px1(X0,X1)
=> ra_Px1(X0,sK3(X0)) ),
introduced(choice_axiom,[]) ).
fof(f88,plain,
! [X0] :
( ( cp1(X0)
| ? [X1] : ra_Px1(X0,X1) )
& ( ! [X2] : ~ ra_Px1(X0,X2)
| ~ cp1(X0) ) ),
inference(rectify,[],[f87]) ).
fof(f87,plain,
! [X0] :
( ( cp1(X0)
| ? [X1] : ra_Px1(X0,X1) )
& ( ! [X1] : ~ ra_Px1(X0,X1)
| ~ cp1(X0) ) ),
inference(nnf_transformation,[],[f70]) ).
fof(f70,plain,
! [X0] :
( cp1(X0)
<=> ! [X1] : ~ ra_Px1(X0,X1) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0] :
( cp1(X0)
<=> ~ ? [X1] : ra_Px1(X0,X1) ),
inference(rectify,[],[f20]) ).
fof(f20,axiom,
! [X3] :
( cp1(X3)
<=> ~ ? [X4] : ra_Px1(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f124,plain,
! [X0] :
( ra_Px1(X0,sK4(X0))
| ~ cp1xcomp(X0) ),
inference(cnf_transformation,[],[f94]) ).
fof(f94,plain,
! [X0] :
( ( cp1xcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ra_Px1(X0,sK4(X0))
| ~ cp1xcomp(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f92,f93]) ).
fof(f93,plain,
! [X0] :
( ? [X2] : ra_Px1(X0,X2)
=> ra_Px1(X0,sK4(X0)) ),
introduced(choice_axiom,[]) ).
fof(f92,plain,
! [X0] :
( ( cp1xcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ? [X2] : ra_Px1(X0,X2)
| ~ cp1xcomp(X0) ) ),
inference(rectify,[],[f91]) ).
fof(f91,plain,
! [X0] :
( ( cp1xcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ? [X1] : ra_Px1(X0,X1)
| ~ cp1xcomp(X0) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0] :
( cp1xcomp(X0)
<=> ? [X1] : ra_Px1(X0,X1) ),
inference(rectify,[],[f21]) ).
fof(f21,axiom,
! [X3] :
( cp1xcomp(X3)
<=> ? [X5] : ra_Px1(X3,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f218,plain,
( cp1(sK0(i2003_11_14_17_20_57644))
| ~ spl5_7 ),
inference(avatar_component_clause,[],[f216]) ).
fof(f219,plain,
( ~ spl5_1
| spl5_7
| ~ spl5_6 ),
inference(avatar_split_clause,[],[f214,f205,f216,f166]) ).
fof(f205,plain,
( spl5_6
<=> sK1(i2003_11_14_17_20_57644) = sK0(i2003_11_14_17_20_57644) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_6])]) ).
fof(f214,plain,
( cp1(sK0(i2003_11_14_17_20_57644))
| ~ cUnsatisfiable(i2003_11_14_17_20_57644)
| ~ spl5_6 ),
inference(superposition,[],[f118,f207]) ).
fof(f207,plain,
( sK1(i2003_11_14_17_20_57644) = sK0(i2003_11_14_17_20_57644)
| ~ spl5_6 ),
inference(avatar_component_clause,[],[f205]) ).
fof(f118,plain,
! [X0] :
( cp1(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f86]) ).
fof(f208,plain,
( ~ spl5_1
| spl5_6
| ~ spl5_3 ),
inference(avatar_split_clause,[],[f202,f179,f205,f166]) ).
fof(f179,plain,
( spl5_3
<=> rf2(i2003_11_14_17_20_57644,sK1(i2003_11_14_17_20_57644)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f202,plain,
( sK1(i2003_11_14_17_20_57644) = sK0(i2003_11_14_17_20_57644)
| ~ cUnsatisfiable(i2003_11_14_17_20_57644)
| ~ spl5_3 ),
inference(resolution,[],[f195,f119]) ).
fof(f119,plain,
! [X0] :
( rf2(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f86]) ).
fof(f195,plain,
( ! [X0] :
( ~ rf2(i2003_11_14_17_20_57644,X0)
| sK1(i2003_11_14_17_20_57644) = X0 )
| ~ spl5_3 ),
inference(resolution,[],[f181,f127]) ).
fof(f127,plain,
! [X2,X0,X1] :
( ~ rf2(X0,X2)
| X1 = X2
| ~ rf2(X0,X1) ),
inference(cnf_transformation,[],[f74]) ).
fof(f74,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf2(X0,X2)
| ~ rf2(X0,X1) ),
inference(flattening,[],[f73]) ).
fof(f73,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf2(X0,X2)
| ~ rf2(X0,X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( rf2(X0,X2)
& rf2(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f23]) ).
fof(f23,axiom,
! [X3,X4,X6] :
( ( rf2(X3,X6)
& rf2(X3,X4) )
=> X4 = X6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f181,plain,
( rf2(i2003_11_14_17_20_57644,sK1(i2003_11_14_17_20_57644))
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f179]) ).
fof(f194,plain,
spl5_1,
inference(avatar_contradiction_clause,[],[f193]) ).
fof(f193,plain,
( $false
| spl5_1 ),
inference(resolution,[],[f168,f129]) ).
fof(f129,plain,
cUnsatisfiable(i2003_11_14_17_20_57644),
inference(cnf_transformation,[],[f25]) ).
fof(f25,axiom,
cUnsatisfiable(i2003_11_14_17_20_57644),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(f168,plain,
( ~ cUnsatisfiable(i2003_11_14_17_20_57644)
| spl5_1 ),
inference(avatar_component_clause,[],[f166]) ).
fof(f182,plain,
( ~ spl5_1
| spl5_3
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f174,f170,f179,f166]) ).
fof(f170,plain,
( spl5_2
<=> sK1(i2003_11_14_17_20_57644) = sK2(i2003_11_14_17_20_57644) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f174,plain,
( rf2(i2003_11_14_17_20_57644,sK1(i2003_11_14_17_20_57644))
| ~ cUnsatisfiable(i2003_11_14_17_20_57644)
| ~ spl5_2 ),
inference(superposition,[],[f156,f172]) ).
fof(f172,plain,
( sK1(i2003_11_14_17_20_57644) = sK2(i2003_11_14_17_20_57644)
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f170]) ).
fof(f156,plain,
! [X0] :
( rf2(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f131,f115]) ).
fof(f115,plain,
! [X0] :
( rf3(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f86]) ).
fof(f131,plain,
! [X0,X1] :
( ~ rf3(X0,X1)
| rf2(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f78,plain,
! [X0,X1] :
( rf2(X0,X1)
| ~ rf3(X0,X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( rf3(X0,X1)
=> rf2(X0,X1) ),
inference(rectify,[],[f27]) ).
fof(f27,axiom,
! [X3,X4] :
( rf3(X3,X4)
=> rf2(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
fof(f173,plain,
( ~ spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f164,f170,f166]) ).
fof(f164,plain,
( sK1(i2003_11_14_17_20_57644) = sK2(i2003_11_14_17_20_57644)
| ~ cUnsatisfiable(i2003_11_14_17_20_57644) ),
inference(resolution,[],[f162,f155]) ).
fof(f155,plain,
! [X0] :
( rf1(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f130,f115]) ).
fof(f130,plain,
! [X0,X1] :
( ~ rf3(X0,X1)
| rf1(X0,X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f77,plain,
! [X0,X1] :
( rf1(X0,X1)
| ~ rf3(X0,X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1] :
( rf3(X0,X1)
=> rf1(X0,X1) ),
inference(rectify,[],[f26]) ).
fof(f26,axiom,
! [X3,X4] :
( rf3(X3,X4)
=> rf1(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(f162,plain,
! [X0] :
( ~ rf1(i2003_11_14_17_20_57644,X0)
| sK1(i2003_11_14_17_20_57644) = X0 ),
inference(resolution,[],[f157,f129]) ).
fof(f157,plain,
! [X0,X1] :
( ~ cUnsatisfiable(X1)
| ~ rf1(X1,X0)
| sK1(X1) = X0 ),
inference(resolution,[],[f126,f117]) ).
fof(f117,plain,
! [X0] :
( rf1(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f86]) ).
fof(f126,plain,
! [X2,X0,X1] :
( ~ rf1(X0,X2)
| X1 = X2
| ~ rf1(X0,X1) ),
inference(cnf_transformation,[],[f72]) ).
fof(f72,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(flattening,[],[f71]) ).
fof(f71,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( rf1(X0,X2)
& rf1(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f22]) ).
fof(f22,axiom,
! [X3,X4,X6] :
( ( rf1(X3,X6)
& rf1(X3,X4) )
=> X4 = X6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.15 % Problem : KRS106+1 : TPTP v8.2.0. Released v3.1.0.
% 0.10/0.17 % 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.16/0.39 % Computer : n005.cluster.edu
% 0.16/0.39 % Model : x86_64 x86_64
% 0.16/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39 % Memory : 8042.1875MB
% 0.16/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39 % CPULimit : 300
% 0.16/0.39 % WCLimit : 300
% 0.16/0.39 % DateTime : Sat May 18 22:19:23 EDT 2024
% 0.16/0.39 % CPUTime :
% 0.16/0.39 This is a FOF_UNS_RFO_SEQ problem
% 0.16/0.40 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.60/0.76 % (28630)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.60/0.76 % (28630)Refutation not found, incomplete strategy% (28630)------------------------------
% 0.60/0.76 % (28630)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (28630)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.76
% 0.60/0.76 % (28630)Memory used [KB]: 948
% 0.60/0.76 % (28630)Time elapsed: 0.001 s
% 0.60/0.76 % (28630)Instructions burned: 2 (million)
% 0.60/0.76 % (28630)------------------------------
% 0.60/0.76 % (28630)------------------------------
% 0.60/0.76 % (28624)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.60/0.76 % (28625)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.60/0.76 % (28631)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.60/0.76 % (28624)Refutation not found, incomplete strategy% (28624)------------------------------
% 0.60/0.76 % (28624)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (28624)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.76
% 0.60/0.76 % (28624)Memory used [KB]: 948
% 0.60/0.76 % (28624)Time elapsed: 0.002 s
% 0.60/0.76 % (28624)Instructions burned: 2 (million)
% 0.60/0.76 % (28631)Refutation not found, incomplete strategy% (28631)------------------------------
% 0.60/0.76 % (28631)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (28631)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.76
% 0.60/0.76 % (28631)Memory used [KB]: 948
% 0.60/0.76 % (28631)Time elapsed: 0.002 s
% 0.60/0.76 % (28631)Instructions burned: 2 (million)
% 0.60/0.76 % (28624)------------------------------
% 0.60/0.76 % (28624)------------------------------
% 0.60/0.76 % (28631)------------------------------
% 0.60/0.76 % (28631)------------------------------
% 0.60/0.76 % (28629)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.60/0.76 % (28629)Refutation not found, incomplete strategy% (28629)------------------------------
% 0.60/0.76 % (28629)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (28629)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.76
% 0.60/0.76 % (28629)Memory used [KB]: 948
% 0.60/0.76 % (28629)Time elapsed: 0.001 s
% 0.60/0.76 % (28629)Instructions burned: 2 (million)
% 0.60/0.77 % (28629)------------------------------
% 0.60/0.77 % (28629)------------------------------
% 0.60/0.77 % (28632)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 % (28625)First to succeed.
% 0.60/0.77 % (28633)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 (2996ds/50Mi)
% 0.60/0.77 % (28634)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 (2996ds/208Mi)
% 0.60/0.77 % (28625)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-28623"
% 0.60/0.77 % (28628)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.60/0.77 % (28634)Refutation not found, incomplete strategy% (28634)------------------------------
% 0.60/0.77 % (28634)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (28634)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.77
% 0.60/0.77 % (28634)Memory used [KB]: 948
% 0.60/0.77 % (28634)Time elapsed: 0.002 s
% 0.60/0.77 % (28634)Instructions burned: 2 (million)
% 0.60/0.77 % (28634)------------------------------
% 0.60/0.77 % (28634)------------------------------
% 0.60/0.77 % (28627)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.60/0.77 % (28632)Also succeeded, but the first one will report.
% 0.60/0.77 % (28625)Refutation found. Thanks to Tanya!
% 0.60/0.77 % SZS status Unsatisfiable for theBenchmark
% 0.60/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.77 % (28625)------------------------------
% 0.60/0.77 % (28625)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (28625)Termination reason: Refutation
% 0.60/0.77
% 0.60/0.77 % (28625)Memory used [KB]: 1083
% 0.60/0.77 % (28625)Time elapsed: 0.006 s
% 0.60/0.77 % (28625)Instructions burned: 6 (million)
% 0.60/0.77 % (28623)Success in time 0.367 s
% 0.60/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------