TSTP Solution File: SET890+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET890+1 : TPTP v8.2.0. Released v3.2.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 : n027.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 03:13:49 EDT 2024
% Result : Theorem 0.57s 0.75s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 60 ( 9 unt; 0 def)
% Number of atoms : 224 ( 53 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 258 ( 94 ~; 99 |; 48 &)
% ( 9 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 118 ( 98 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f112,plain,
$false,
inference(avatar_sat_refutation,[],[f81,f85,f111]) ).
fof(f111,plain,
spl6_2,
inference(avatar_contradiction_clause,[],[f110]) ).
fof(f110,plain,
( $false
| spl6_2 ),
inference(subsumption_resolution,[],[f107,f79]) ).
fof(f79,plain,
( ~ subset(union(singleton(sK0)),sK0)
| spl6_2 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f78,plain,
( spl6_2
<=> subset(union(singleton(sK0)),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f107,plain,
( subset(union(singleton(sK0)),sK0)
| spl6_2 ),
inference(resolution,[],[f106,f52]) ).
fof(f52,plain,
! [X0,X1] :
( ~ in(sK5(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK5(X0,X1),X1)
& in(sK5(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f32,f33]) ).
fof(f33,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK5(X0,X1),X1)
& in(sK5(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f106,plain,
( in(sK5(union(singleton(sK0)),sK0),sK0)
| spl6_2 ),
inference(forward_demodulation,[],[f104,f95]) ).
fof(f95,plain,
( sK0 = sK3(singleton(sK0),sK5(union(singleton(sK0)),sK0))
| spl6_2 ),
inference(resolution,[],[f94,f60]) ).
fof(f60,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f42]) ).
fof(f42,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK4(X0,X1) != X0
| ~ in(sK4(X0,X1),X1) )
& ( sK4(X0,X1) = X0
| in(sK4(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f26,f27]) ).
fof(f27,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK4(X0,X1) != X0
| ~ in(sK4(X0,X1),X1) )
& ( sK4(X0,X1) = X0
| in(sK4(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f94,plain,
( in(sK3(singleton(sK0),sK5(union(singleton(sK0)),sK0)),singleton(sK0))
| spl6_2 ),
inference(resolution,[],[f56,f86]) ).
fof(f86,plain,
( in(sK5(union(singleton(sK0)),sK0),union(singleton(sK0)))
| spl6_2 ),
inference(resolution,[],[f79,f51]) ).
fof(f51,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK5(X0,X1),X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f56,plain,
! [X0,X5] :
( ~ in(X5,union(X0))
| in(sK3(X0,X5),X0) ),
inference(equality_resolution,[],[f37]) ).
fof(f37,plain,
! [X0,X1,X5] :
( in(sK3(X0,X5),X0)
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( union(X0) = X1
| ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK1(X0,X1),X3) )
| ~ in(sK1(X0,X1),X1) )
& ( ( in(sK2(X0,X1),X0)
& in(sK1(X0,X1),sK2(X0,X1)) )
| in(sK1(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ( in(sK3(X0,X5),X0)
& in(X5,sK3(X0,X5)) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f20,f23,f22,f21]) ).
fof(f21,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) )
=> ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK1(X0,X1),X3) )
| ~ in(sK1(X0,X1),X1) )
& ( ? [X4] :
( in(X4,X0)
& in(sK1(X0,X1),X4) )
| in(sK1(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0,X1] :
( ? [X4] :
( in(X4,X0)
& in(sK1(X0,X1),X4) )
=> ( in(sK2(X0,X1),X0)
& in(sK1(X0,X1),sK2(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X0,X5] :
( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
=> ( in(sK3(X0,X5),X0)
& in(X5,sK3(X0,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) ) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| ~ in(X2,X1) ) )
| union(X0) != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] :
( union(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,X0)
& in(X2,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
fof(f104,plain,
( in(sK5(union(singleton(sK0)),sK0),sK3(singleton(sK0),sK5(union(singleton(sK0)),sK0)))
| spl6_2 ),
inference(resolution,[],[f57,f86]) ).
fof(f57,plain,
! [X0,X5] :
( ~ in(X5,union(X0))
| in(X5,sK3(X0,X5)) ),
inference(equality_resolution,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X5] :
( in(X5,sK3(X0,X5))
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f85,plain,
spl6_1,
inference(avatar_contradiction_clause,[],[f84]) ).
fof(f84,plain,
( $false
| spl6_1 ),
inference(subsumption_resolution,[],[f82,f59]) ).
fof(f59,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f58]) ).
fof(f58,plain,
! [X3,X1] :
( in(X3,X1)
| singleton(X3) != X1 ),
inference(equality_resolution,[],[f43]) ).
fof(f43,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f28]) ).
fof(f82,plain,
( ~ in(sK0,singleton(sK0))
| spl6_1 ),
inference(resolution,[],[f76,f49]) ).
fof(f49,plain,
! [X0,X1] :
( subset(X0,union(X1))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( subset(X0,union(X1))
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] :
( in(X0,X1)
=> subset(X0,union(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).
fof(f76,plain,
( ~ subset(sK0,union(singleton(sK0)))
| spl6_1 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f75,plain,
( spl6_1
<=> subset(sK0,union(singleton(sK0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f81,plain,
( ~ spl6_2
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f69,f75,f78]) ).
fof(f69,plain,
( ~ subset(sK0,union(singleton(sK0)))
| ~ subset(union(singleton(sK0)),sK0) ),
inference(extensionality_resolution,[],[f48,f35]) ).
fof(f35,plain,
sK0 != union(singleton(sK0)),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
sK0 != union(singleton(sK0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f13,f17]) ).
fof(f17,plain,
( ? [X0] : union(singleton(X0)) != X0
=> sK0 != union(singleton(sK0)) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
? [X0] : union(singleton(X0)) != X0,
inference(ennf_transformation,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X0] : union(singleton(X0)) = X0,
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X0] : union(singleton(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t31_zfmisc_1) ).
fof(f48,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET890+1 : TPTP v8.2.0. Released v3.2.0.
% 0.13/0.14 % 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.15/0.35 % Computer : n027.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 13:31:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.35 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.57/0.72 % (12782)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.72 % (12775)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.72 % (12776)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.72 % (12778)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.72 % (12777)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.72 % (12779)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.72 % (12780)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.72 % (12781)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.73 % (12780)Refutation not found, incomplete strategy% (12780)------------------------------
% 0.57/0.73 % (12780)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.73 % (12780)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.73
% 0.57/0.73 % (12780)Memory used [KB]: 957
% 0.57/0.73 % (12780)Time elapsed: 0.003 s
% 0.57/0.73 % (12780)Instructions burned: 2 (million)
% 0.57/0.73 % (12780)------------------------------
% 0.57/0.73 % (12780)------------------------------
% 0.57/0.73 % (12775)Refutation not found, incomplete strategy% (12775)------------------------------
% 0.57/0.73 % (12775)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.73 % (12775)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.73
% 0.57/0.73 % (12775)Memory used [KB]: 1052
% 0.57/0.73 % (12775)Time elapsed: 0.004 s
% 0.57/0.73 % (12775)Instructions burned: 4 (million)
% 0.57/0.73 % (12775)------------------------------
% 0.57/0.73 % (12775)------------------------------
% 0.57/0.73 % (12783)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.73 % (12784)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.73 % (12784)Refutation not found, incomplete strategy% (12784)------------------------------
% 0.57/0.73 % (12784)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.73 % (12784)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.73
% 0.57/0.73 % (12784)Memory used [KB]: 1038
% 0.57/0.73 % (12784)Time elapsed: 0.003 s
% 0.57/0.73 % (12784)Instructions burned: 3 (million)
% 0.57/0.73 % (12784)------------------------------
% 0.57/0.73 % (12784)------------------------------
% 0.57/0.74 % (12785)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.57/0.74 % (12782)Instruction limit reached!
% 0.57/0.74 % (12782)------------------------------
% 0.57/0.74 % (12782)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (12782)Termination reason: Unknown
% 0.57/0.74 % (12782)Termination phase: Saturation
% 0.57/0.74
% 0.57/0.74 % (12782)Memory used [KB]: 1315
% 0.57/0.74 % (12782)Time elapsed: 0.018 s
% 0.57/0.74 % (12782)Instructions burned: 56 (million)
% 0.57/0.74 % (12782)------------------------------
% 0.57/0.74 % (12782)------------------------------
% 0.57/0.74 % (12778)Instruction limit reached!
% 0.57/0.74 % (12778)------------------------------
% 0.57/0.74 % (12778)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (12778)Termination reason: Unknown
% 0.57/0.74 % (12778)Termination phase: Saturation
% 0.57/0.74
% 0.57/0.74 % (12778)Memory used [KB]: 1558
% 0.57/0.74 % (12778)Time elapsed: 0.019 s
% 0.57/0.74 % (12778)Instructions burned: 34 (million)
% 0.57/0.74 % (12778)------------------------------
% 0.57/0.74 % (12778)------------------------------
% 0.57/0.74 % (12786)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2996ds/52Mi)
% 0.57/0.74 % (12786)First to succeed.
% 0.57/0.75 % (12786)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12774"
% 0.57/0.75 % (12779)Instruction limit reached!
% 0.57/0.75 % (12779)------------------------------
% 0.57/0.75 % (12779)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (12779)Termination reason: Unknown
% 0.57/0.75 % (12786)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 % (12786)------------------------------
% 0.57/0.75 % (12786)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (12786)Termination reason: Refutation
% 0.57/0.75
% 0.57/0.75 % (12786)Memory used [KB]: 1065
% 0.57/0.75 % (12786)Time elapsed: 0.003 s
% 0.57/0.75 % (12786)Instructions burned: 7 (million)
% 0.57/0.75 % (12774)Success in time 0.38 s
% 0.57/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------