TSTP Solution File: SEU156+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU156+3 : 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 : n011.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:45:07 EDT 2024
% Result : Theorem 0.60s 0.76s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 23
% Syntax : Number of formulae : 105 ( 17 unt; 0 def)
% Number of atoms : 240 ( 154 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 229 ( 94 ~; 113 |; 8 &)
% ( 9 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 10 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 86 ( 78 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f578,plain,
$false,
inference(avatar_sat_refutation,[],[f48,f180,f200,f216,f290,f453,f459,f467,f475,f484,f490,f555,f573]) ).
fof(f573,plain,
( spl10_1
| ~ spl10_16 ),
inference(avatar_split_clause,[],[f572,f173,f41]) ).
fof(f41,plain,
( spl10_1
<=> sK0 = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f173,plain,
( spl10_16
<=> sF5 = sF7 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_16])]) ).
fof(f572,plain,
( sK0 = sK2
| ~ spl10_16 ),
inference(subsumption_resolution,[],[f442,f175]) ).
fof(f175,plain,
( sF5 = sF7
| ~ spl10_16 ),
inference(avatar_component_clause,[],[f173]) ).
fof(f442,plain,
( sF5 != sF7
| sK0 = sK2 ),
inference(superposition,[],[f90,f36]) ).
fof(f36,plain,
unordered_pair(sK2,sK3) = sF7,
introduced(function_definition,[new_symbols(definition,[sF7])]) ).
fof(f90,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != sF5
| sK0 = X0 ),
inference(superposition,[],[f32,f34]) ).
fof(f34,plain,
unordered_pair(sK0,sK0) = sF5,
introduced(function_definition,[new_symbols(definition,[sF5])]) ).
fof(f32,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(definition_unfolding,[],[f24,f25]) ).
fof(f25,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f24,plain,
! [X2,X0,X1] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f555,plain,
( spl10_2
| ~ spl10_3
| ~ spl10_24 ),
inference(avatar_contradiction_clause,[],[f554]) ).
fof(f554,plain,
( $false
| spl10_2
| ~ spl10_3
| ~ spl10_24 ),
inference(subsumption_resolution,[],[f552,f63]) ).
fof(f63,plain,
( sK0 = sK1
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f61]) ).
fof(f61,plain,
( spl10_3
<=> sK0 = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f552,plain,
( sK0 != sK1
| spl10_2
| ~ spl10_24 ),
inference(superposition,[],[f47,f463]) ).
fof(f463,plain,
( sK0 = sK3
| ~ spl10_24 ),
inference(avatar_component_clause,[],[f461]) ).
fof(f461,plain,
( spl10_24
<=> sK0 = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_24])]) ).
fof(f47,plain,
( sK1 != sK3
| spl10_2 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f45,plain,
( spl10_2
<=> sK1 = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f490,plain,
( spl10_24
| ~ spl10_1
| ~ spl10_16 ),
inference(avatar_split_clause,[],[f489,f173,f41,f461]) ).
fof(f489,plain,
( sK0 = sK3
| ~ spl10_1
| ~ spl10_16 ),
inference(forward_demodulation,[],[f488,f42]) ).
fof(f42,plain,
( sK0 = sK2
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f488,plain,
( sK2 = sK3
| ~ spl10_16 ),
inference(subsumption_resolution,[],[f299,f175]) ).
fof(f299,plain,
( sF5 != sF7
| sK2 = sK3 ),
inference(superposition,[],[f49,f36]) ).
fof(f49,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != sF5
| X0 = X1 ),
inference(superposition,[],[f31,f34]) ).
fof(f31,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X1 = X2 ),
inference(definition_unfolding,[],[f23,f25]) ).
fof(f23,plain,
! [X2,X0,X1] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f484,plain,
( spl10_3
| ~ spl10_18 ),
inference(avatar_split_clause,[],[f401,f197,f61]) ).
fof(f197,plain,
( spl10_18
<=> sF4 = sF8 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_18])]) ).
fof(f401,plain,
( sF4 != sF8
| sK0 = sK1 ),
inference(superposition,[],[f50,f33]) ).
fof(f33,plain,
unordered_pair(sK0,sK1) = sF4,
introduced(function_definition,[new_symbols(definition,[sF4])]) ).
fof(f50,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != sF8
| X0 = X1 ),
inference(superposition,[],[f31,f37]) ).
fof(f37,plain,
unordered_pair(sK2,sK2) = sF8,
introduced(function_definition,[new_symbols(definition,[sF8])]) ).
fof(f475,plain,
( spl10_3
| ~ spl10_7 ),
inference(avatar_split_clause,[],[f297,f77,f61]) ).
fof(f77,plain,
( spl10_7
<=> sF4 = sF5 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
fof(f297,plain,
( sF4 != sF5
| sK0 = sK1 ),
inference(superposition,[],[f49,f33]) ).
fof(f467,plain,
( ~ spl10_1
| spl10_3
| ~ spl10_23 ),
inference(avatar_contradiction_clause,[],[f466]) ).
fof(f466,plain,
( $false
| ~ spl10_1
| spl10_3
| ~ spl10_23 ),
inference(subsumption_resolution,[],[f465,f62]) ).
fof(f62,plain,
( sK0 != sK1
| spl10_3 ),
inference(avatar_component_clause,[],[f61]) ).
fof(f465,plain,
( sK0 = sK1
| ~ spl10_1
| ~ spl10_23 ),
inference(forward_demodulation,[],[f458,f42]) ).
fof(f458,plain,
( sK1 = sK2
| ~ spl10_23 ),
inference(avatar_component_clause,[],[f456]) ).
fof(f456,plain,
( spl10_23
<=> sK1 = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_23])]) ).
fof(f459,plain,
( spl10_2
| spl10_23
| ~ spl10_17 ),
inference(avatar_split_clause,[],[f426,f177,f456,f45]) ).
fof(f177,plain,
( spl10_17
<=> sF4 = sF7 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_17])]) ).
fof(f426,plain,
( sK1 = sK2
| sK1 = sK3
| ~ spl10_17 ),
inference(trivial_inequality_removal,[],[f416]) ).
fof(f416,plain,
( sF4 != sF4
| sK1 = sK2
| sK1 = sK3
| ~ spl10_17 ),
inference(superposition,[],[f341,f33]) ).
fof(f341,plain,
( ! [X0,X1] :
( unordered_pair(X1,X0) != sF4
| sK2 = X0
| sK3 = X0 )
| ~ spl10_17 ),
inference(superposition,[],[f339,f27]) ).
fof(f27,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f339,plain,
( ! [X0,X1] :
( unordered_pair(X0,X1) != sF4
| sK2 = X0
| sK3 = X0 )
| ~ spl10_17 ),
inference(forward_demodulation,[],[f116,f179]) ).
fof(f179,plain,
( sF4 = sF7
| ~ spl10_17 ),
inference(avatar_component_clause,[],[f177]) ).
fof(f116,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != sF7
| sK2 = X0
| sK3 = X0 ),
inference(superposition,[],[f26,f36]) ).
fof(f26,plain,
! [X2,X3,X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1,X2,X3] :
( X0 = X3
| X0 = X2
| unordered_pair(X0,X1) != unordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1,X2,X3] :
~ ( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(f453,plain,
( spl10_1
| spl10_7
| ~ spl10_17 ),
inference(avatar_split_clause,[],[f450,f177,f77,f41]) ).
fof(f450,plain,
( sK0 = sK2
| spl10_7
| ~ spl10_17 ),
inference(subsumption_resolution,[],[f443,f241]) ).
fof(f241,plain,
( sF5 = sF8
| spl10_7
| ~ spl10_17 ),
inference(subsumption_resolution,[],[f240,f78]) ).
fof(f78,plain,
( sF4 != sF5
| spl10_7 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f240,plain,
( sF4 = sF5
| sF5 = sF8
| ~ spl10_17 ),
inference(forward_demodulation,[],[f239,f179]) ).
fof(f239,plain,
( sF5 = sF7
| sF5 = sF8 ),
inference(trivial_inequality_removal,[],[f236]) ).
fof(f236,plain,
( sF6 != sF6
| sF5 = sF7
| sF5 = sF8 ),
inference(superposition,[],[f184,f35]) ).
fof(f35,plain,
unordered_pair(sF4,sF5) = sF6,
introduced(function_definition,[new_symbols(definition,[sF6])]) ).
fof(f184,plain,
! [X0,X1] :
( unordered_pair(X1,X0) != sF6
| sF7 = X0
| sF8 = X0 ),
inference(superposition,[],[f128,f27]) ).
fof(f128,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != sF6
| sF7 = X0
| sF8 = X0 ),
inference(forward_demodulation,[],[f119,f39]) ).
fof(f39,plain,
sF6 = sF9,
inference(definition_folding,[],[f30,f38,f37,f36,f35,f34,f33]) ).
fof(f38,plain,
unordered_pair(sF7,sF8) = sF9,
introduced(function_definition,[new_symbols(definition,[sF9])]) ).
fof(f30,plain,
unordered_pair(unordered_pair(sK0,sK1),unordered_pair(sK0,sK0)) = unordered_pair(unordered_pair(sK2,sK3),unordered_pair(sK2,sK2)),
inference(definition_unfolding,[],[f21,f29,f29]) ).
fof(f29,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f28,f25]) ).
fof(f28,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f21,plain,
ordered_pair(sK0,sK1) = ordered_pair(sK2,sK3),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( ( sK1 != sK3
| sK0 != sK2 )
& ordered_pair(sK0,sK1) = ordered_pair(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f15,f19]) ).
fof(f19,plain,
( ? [X0,X1,X2,X3] :
( ( X1 != X3
| X0 != X2 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) )
=> ( ( sK1 != sK3
| sK0 != sK2 )
& ordered_pair(sK0,sK1) = ordered_pair(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
? [X0,X1,X2,X3] :
( ( X1 != X3
| X0 != X2 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X1 = X3
& X0 = X2 ) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X1 = X3
& X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(f119,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != sF9
| sF7 = X0
| sF8 = X0 ),
inference(superposition,[],[f26,f38]) ).
fof(f443,plain,
( sF5 != sF8
| sK0 = sK2 ),
inference(superposition,[],[f90,f37]) ).
fof(f290,plain,
( ~ spl10_3
| spl10_7 ),
inference(avatar_contradiction_clause,[],[f289]) ).
fof(f289,plain,
( $false
| ~ spl10_3
| spl10_7 ),
inference(subsumption_resolution,[],[f271,f78]) ).
fof(f271,plain,
( sF4 = sF5
| ~ spl10_3 ),
inference(superposition,[],[f34,f102]) ).
fof(f102,plain,
( unordered_pair(sK0,sK0) = sF4
| ~ spl10_3 ),
inference(superposition,[],[f33,f63]) ).
fof(f216,plain,
( ~ spl10_7
| spl10_16
| ~ spl10_17 ),
inference(avatar_split_clause,[],[f215,f177,f173,f77]) ).
fof(f215,plain,
( sF4 != sF5
| spl10_16
| ~ spl10_17 ),
inference(forward_demodulation,[],[f174,f179]) ).
fof(f174,plain,
( sF5 != sF7
| spl10_16 ),
inference(avatar_component_clause,[],[f173]) ).
fof(f200,plain,
( spl10_18
| spl10_7
| ~ spl10_16 ),
inference(avatar_split_clause,[],[f195,f173,f77,f197]) ).
fof(f195,plain,
( sF4 = sF5
| sF4 = sF8
| ~ spl10_16 ),
inference(forward_demodulation,[],[f191,f175]) ).
fof(f191,plain,
( sF4 = sF7
| sF4 = sF8 ),
inference(trivial_inequality_removal,[],[f189]) ).
fof(f189,plain,
( sF6 != sF6
| sF4 = sF7
| sF4 = sF8 ),
inference(superposition,[],[f128,f35]) ).
fof(f180,plain,
( spl10_16
| spl10_17 ),
inference(avatar_split_clause,[],[f137,f177,f173]) ).
fof(f137,plain,
( sF4 = sF7
| sF5 = sF7 ),
inference(trivial_inequality_removal,[],[f135]) ).
fof(f135,plain,
( sF6 != sF6
| sF4 = sF7
| sF5 = sF7 ),
inference(superposition,[],[f123,f35]) ).
fof(f123,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != sF6
| sF7 = X0
| sF7 = X1 ),
inference(forward_demodulation,[],[f111,f39]) ).
fof(f111,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != sF9
| sF7 = X0
| sF7 = X1 ),
inference(superposition,[],[f26,f38]) ).
fof(f48,plain,
( ~ spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f22,f45,f41]) ).
fof(f22,plain,
( sK1 != sK3
| sK0 != sK2 ),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU156+3 : TPTP v8.2.0. Released v3.2.0.
% 0.06/0.13 % 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.34 % Computer : n011.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % 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 : Sun May 19 15:48:08 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.54/0.74 % (17738)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.54/0.74 % (17732)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.54/0.74 % (17733)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.54/0.74 % (17735)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.54/0.74 % (17734)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.74 % (17736)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.54/0.74 % (17737)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.54/0.74 % (17735)Refutation not found, incomplete strategy% (17735)------------------------------
% 0.54/0.74 % (17735)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74 % (17735)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.74
% 0.54/0.74 % (17735)Memory used [KB]: 955
% 0.54/0.74 % (17735)Time elapsed: 0.003 s
% 0.54/0.74 % (17735)Instructions burned: 2 (million)
% 0.54/0.74 % (17736)Refutation not found, incomplete strategy% (17736)------------------------------
% 0.54/0.74 % (17736)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74 % (17736)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.74
% 0.54/0.74 % (17736)Memory used [KB]: 971
% 0.54/0.74 % (17736)Time elapsed: 0.003 s
% 0.54/0.74 % (17736)Instructions burned: 2 (million)
% 0.54/0.74 % (17735)------------------------------
% 0.54/0.74 % (17735)------------------------------
% 0.54/0.74 % (17736)------------------------------
% 0.54/0.74 % (17736)------------------------------
% 0.54/0.74 % (17732)Refutation not found, incomplete strategy% (17732)------------------------------
% 0.54/0.74 % (17732)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74 % (17732)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.74
% 0.54/0.74 % (17732)Memory used [KB]: 984
% 0.54/0.74 % (17732)Time elapsed: 0.004 s
% 0.54/0.74 % (17732)Instructions burned: 4 (million)
% 0.54/0.74 % (17732)------------------------------
% 0.54/0.74 % (17732)------------------------------
% 0.54/0.74 % (17739)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.54/0.74 % (17742)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.54/0.74 % (17740)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.54/0.74 % (17741)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.54/0.75 % (17741)Refutation not found, incomplete strategy% (17741)------------------------------
% 0.54/0.75 % (17741)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (17741)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75
% 0.54/0.75 % (17741)Memory used [KB]: 959
% 0.54/0.75 % (17741)Time elapsed: 0.003 s
% 0.54/0.75 % (17741)Instructions burned: 2 (million)
% 0.54/0.75 % (17741)------------------------------
% 0.54/0.75 % (17741)------------------------------
% 0.54/0.75 % (17743)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.54/0.75 % (17742)First to succeed.
% 0.54/0.75 % (17737)Also succeeded, but the first one will report.
% 0.60/0.75 % (17742)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17731"
% 0.60/0.76 % (17742)Refutation found. Thanks to Tanya!
% 0.60/0.76 % SZS status Theorem for theBenchmark
% 0.60/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.76 % (17742)------------------------------
% 0.60/0.76 % (17742)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (17742)Termination reason: Refutation
% 0.60/0.76
% 0.60/0.76 % (17742)Memory used [KB]: 1147
% 0.60/0.76 % (17742)Time elapsed: 0.012 s
% 0.60/0.76 % (17742)Instructions burned: 20 (million)
% 0.60/0.76 % (17731)Success in time 0.395 s
% 0.60/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------