TSTP Solution File: SWC096+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC096+1 : TPTP v8.2.0. Released v2.4.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/sandbox/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 : Tue May 21 04:36:12 EDT 2024
% Result : Theorem 0.57s 0.75s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 59 ( 5 unt; 0 def)
% Number of atoms : 298 ( 78 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 355 ( 116 ~; 104 |; 112 &)
% ( 5 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 141 ( 99 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f370,plain,
$false,
inference(avatar_sat_refutation,[],[f204,f206,f246,f290,f334,f369]) ).
fof(f369,plain,
( ~ spl11_1
| ~ spl11_6 ),
inference(avatar_contradiction_clause,[],[f368]) ).
fof(f368,plain,
( $false
| ~ spl11_1
| ~ spl11_6 ),
inference(resolution,[],[f289,f199]) ).
fof(f199,plain,
( sP0(sK6,sK5,sK6,sK5)
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f197]) ).
fof(f197,plain,
( spl11_1
<=> sP0(sK6,sK5,sK6,sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f289,plain,
( ! [X0,X1] : ~ sP0(X0,X1,sK6,sK5)
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f288]) ).
fof(f288,plain,
( spl11_6
<=> ! [X0,X1] : ~ sP0(X0,X1,sK6,sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_6])]) ).
fof(f334,plain,
( ~ spl11_1
| spl11_5 ),
inference(avatar_contradiction_clause,[],[f333]) ).
fof(f333,plain,
( $false
| ~ spl11_1
| spl11_5 ),
inference(resolution,[],[f325,f199]) ).
fof(f325,plain,
( ! [X0,X1] : ~ sP0(sK6,sK5,X0,X1)
| spl11_5 ),
inference(resolution,[],[f286,f145]) ).
fof(f145,plain,
! [X2,X3,X0,X1] :
( ssList(sK2(X0,X1))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
! [X0,X1,X2,X3] :
( ( app(sK2(X0,X1),cons(sK1(X0,X1),nil)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(sK2(X0,X1))
& ssItem(sK1(X0,X1))
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X2
| cons(X6,nil) != X3
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X2,nil) )
| ~ sP0(X0,X1,X2,X3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f123,f125,f124]) ).
fof(f124,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X0
& cons(X4,nil) = X1
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( app(X5,cons(sK1(X0,X1),nil)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X5) )
& ssItem(sK1(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
! [X0,X1] :
( ? [X5] :
( app(X5,cons(sK1(X0,X1),nil)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X5) )
=> ( app(sK2(X0,X1),cons(sK1(X0,X1),nil)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(sK2(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
! [X0,X1,X2,X3] :
( ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X0
& cons(X4,nil) = X1
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X2
| cons(X6,nil) != X3
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X2,nil) )
| ~ sP0(X0,X1,X2,X3) ),
inference(rectify,[],[f122]) ).
fof(f122,plain,
! [X3,X2,X1,X0] :
( ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X1
| cons(X6,nil) != X0
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X1,nil) )
| ~ sP0(X3,X2,X1,X0) ),
inference(nnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X3,X2,X1,X0] :
( ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X1
| cons(X6,nil) != X0
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X1,nil) )
| ~ sP0(X3,X2,X1,X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f286,plain,
( ~ ssList(sK2(sK6,sK5))
| spl11_5 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f284,plain,
( spl11_5
<=> ssList(sK2(sK6,sK5)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
fof(f290,plain,
( ~ spl11_5
| spl11_6
| ~ spl11_1
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f277,f226,f197,f288,f284]) ).
fof(f226,plain,
( spl11_3
<=> ssItem(sK1(sK6,sK5)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f277,plain,
( ! [X0,X1] :
( ~ sP0(X0,X1,sK6,sK5)
| ~ ssList(sK2(sK6,sK5)) )
| ~ spl11_1
| ~ spl11_3 ),
inference(superposition,[],[f259,f264]) ).
fof(f264,plain,
( sK6 = app(sK2(sK6,sK5),sK5)
| ~ spl11_1 ),
inference(forward_demodulation,[],[f263,f220]) ).
fof(f220,plain,
( sK5 = cons(sK1(sK6,sK5),nil)
| ~ spl11_1 ),
inference(resolution,[],[f146,f199]) ).
fof(f146,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| cons(sK1(X0,X1),nil) = X1 ),
inference(cnf_transformation,[],[f126]) ).
fof(f263,plain,
( sK6 = app(sK2(sK6,sK5),cons(sK1(sK6,sK5),nil))
| ~ spl11_1 ),
inference(resolution,[],[f147,f199]) ).
fof(f147,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| app(sK2(X0,X1),cons(sK1(X0,X1),nil)) = X0 ),
inference(cnf_transformation,[],[f126]) ).
fof(f259,plain,
( ! [X2,X0,X1] :
( ~ sP0(X0,X1,app(X2,sK5),sK5)
| ~ ssList(X2) )
| ~ spl11_1
| ~ spl11_3 ),
inference(subsumption_resolution,[],[f257,f227]) ).
fof(f227,plain,
( ssItem(sK1(sK6,sK5))
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f257,plain,
( ! [X2,X0,X1] :
( ~ sP0(X0,X1,app(X2,sK5),sK5)
| ~ ssItem(sK1(sK6,sK5))
| ~ ssList(X2) )
| ~ spl11_1 ),
inference(superposition,[],[f188,f220]) ).
fof(f188,plain,
! [X0,X1,X6,X7] :
( ~ sP0(X0,X1,app(X7,cons(X6,nil)),cons(X6,nil))
| ~ ssItem(X6)
| ~ ssList(X7) ),
inference(equality_resolution,[],[f187]) ).
fof(f187,plain,
! [X3,X0,X1,X6,X7] :
( cons(X6,nil) != X3
| ~ ssList(X7)
| ~ ssItem(X6)
| ~ sP0(X0,X1,app(X7,cons(X6,nil)),X3) ),
inference(equality_resolution,[],[f143]) ).
fof(f143,plain,
! [X2,X3,X0,X1,X6,X7] :
( app(X7,cons(X6,nil)) != X2
| cons(X6,nil) != X3
| ~ ssList(X7)
| ~ ssItem(X6)
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f126]) ).
fof(f246,plain,
( ~ spl11_1
| spl11_3 ),
inference(avatar_contradiction_clause,[],[f245]) ).
fof(f245,plain,
( $false
| ~ spl11_1
| spl11_3 ),
inference(resolution,[],[f241,f199]) ).
fof(f241,plain,
( ! [X0,X1] : ~ sP0(sK6,sK5,X0,X1)
| spl11_3 ),
inference(resolution,[],[f228,f144]) ).
fof(f144,plain,
! [X2,X3,X0,X1] :
( ssItem(sK1(X0,X1))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f126]) ).
fof(f228,plain,
( ~ ssItem(sK1(sK6,sK5))
| spl11_3 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f206,plain,
spl11_2,
inference(avatar_split_clause,[],[f205,f201]) ).
fof(f201,plain,
( spl11_2
<=> neq(sK6,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f205,plain,
neq(sK6,nil),
inference(subsumption_resolution,[],[f184,f142]) ).
fof(f142,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| neq(X2,nil) ),
inference(cnf_transformation,[],[f126]) ).
fof(f184,plain,
( neq(sK6,nil)
| sP0(sK6,sK5,sK6,sK5) ),
inference(definition_unfolding,[],[f154,f152,f152,f153]) ).
fof(f153,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f131]) ).
fof(f131,plain,
( ( ( ~ neq(sK6,nil)
& neq(sK4,nil) )
| sP0(sK6,sK5,sK4,sK3) )
& sK3 = sK5
& sK4 = sK6
& ssList(sK6)
& ssList(sK5)
& ssList(sK4)
& ssList(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f121,f130,f129,f128,f127]) ).
fof(f127,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X3,X2,X1,X0) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X3,X2,X1,sK3) )
& sK3 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X3,X2,X1,sK3) )
& sK3 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK4,nil) )
| sP0(X3,X2,sK4,sK3) )
& sK3 = X2
& sK4 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK4,nil) )
| sP0(X3,X2,sK4,sK3) )
& sK3 = X2
& sK4 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK4,nil) )
| sP0(X3,sK5,sK4,sK3) )
& sK3 = sK5
& sK4 = X3
& ssList(X3) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK4,nil) )
| sP0(X3,sK5,sK4,sK3) )
& sK3 = sK5
& sK4 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK6,nil)
& neq(sK4,nil) )
| sP0(sK6,sK5,sK4,sK3) )
& sK3 = sK5
& sK4 = sK6
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X3,X2,X1,X0) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f120]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X1
| cons(X6,nil) != X0
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X3
| cons(X4,nil) != X2
| ~ ssList(X5) ) )
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X1
& cons(X6,nil) = X0
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( app(X7,cons(X6,nil)) != X3
| cons(X6,nil) != X2
| ~ ssList(X7) ) )
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X1
& cons(X4,nil) = X0
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( app(X7,cons(X6,nil)) != X3
| cons(X6,nil) != X2
| ~ ssList(X7) ) )
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X1
& cons(X4,nil) = X0
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f152,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f131]) ).
fof(f154,plain,
( neq(sK4,nil)
| sP0(sK6,sK5,sK4,sK3) ),
inference(cnf_transformation,[],[f131]) ).
fof(f204,plain,
( spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f183,f201,f197]) ).
fof(f183,plain,
( ~ neq(sK6,nil)
| sP0(sK6,sK5,sK6,sK5) ),
inference(definition_unfolding,[],[f155,f152,f153]) ).
fof(f155,plain,
( ~ neq(sK6,nil)
| sP0(sK6,sK5,sK4,sK3) ),
inference(cnf_transformation,[],[f131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SWC096+1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n005.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 02:52:22 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.57/0.74 % (12714)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.57/0.75 % (12715)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.57/0.75 % (12716)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.57/0.75 % (12717)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.57/0.75 % (12718)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.57/0.75 % (12721)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.57/0.75 % (12720)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.57/0.75 % (12719)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.57/0.75 % (12721)Refutation not found, incomplete strategy% (12721)------------------------------
% 0.57/0.75 % (12721)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (12721)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (12721)Memory used [KB]: 1154
% 0.57/0.75 % (12721)Time elapsed: 0.003 s
% 0.57/0.75 % (12721)Instructions burned: 4 (million)
% 0.57/0.75 % (12719)Refutation not found, incomplete strategy% (12719)------------------------------
% 0.57/0.75 % (12719)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (12719)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75 % (12721)------------------------------
% 0.57/0.75 % (12721)------------------------------
% 0.57/0.75
% 0.57/0.75 % (12719)Memory used [KB]: 1151
% 0.57/0.75 % (12719)Time elapsed: 0.004 s
% 0.57/0.75 % (12719)Instructions burned: 4 (million)
% 0.57/0.75 % (12719)------------------------------
% 0.57/0.75 % (12719)------------------------------
% 0.57/0.75 % (12723)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.57/0.75 % (12715)Also succeeded, but the first one will report.
% 0.57/0.75 % (12716)First to succeed.
% 0.57/0.75 % (12722)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.57/0.75 % (12716)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-12713"
% 0.57/0.75 % (12716)Refutation found. Thanks to Tanya!
% 0.57/0.75 % SZS status Theorem for theBenchmark
% 0.57/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.75 % (12716)------------------------------
% 0.57/0.75 % (12716)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (12716)Termination reason: Refutation
% 0.57/0.75
% 0.57/0.75 % (12716)Memory used [KB]: 1206
% 0.57/0.75 % (12716)Time elapsed: 0.010 s
% 0.57/0.75 % (12716)Instructions burned: 15 (million)
% 0.57/0.75 % (12713)Success in time 0.386 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------