TSTP Solution File: CSR021+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : CSR021+1 : TPTP v8.2.0. Bugfixed 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n009.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 19:32:11 EDT 2024
% Result : Theorem 0.55s 0.74s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 61 ( 17 unt; 0 def)
% Number of atoms : 301 ( 134 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 360 ( 120 ~; 118 |; 106 &)
% ( 14 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 115 ( 115 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f497,plain,
$false,
inference(subsumption_resolution,[],[f493,f430]) ).
fof(f430,plain,
sP5(n2,backwards,pull),
inference(resolution,[],[f305,f338]) ).
fof(f338,plain,
happens(push,n2),
inference(resolution,[],[f199,f293]) ).
fof(f293,plain,
sP1(n2,push),
inference(equality_resolution,[],[f292]) ).
fof(f292,plain,
! [X1] :
( sP1(n2,X1)
| push != X1 ),
inference(equality_resolution,[],[f194]) ).
fof(f194,plain,
! [X0,X1] :
( sP1(X0,X1)
| n2 != X0
| push != X1 ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0,X1] :
( ( sP1(X0,X1)
| ( ( n2 != X0
| push != X1 )
& ( n2 != X0
| pull != X1 )
& ( n1 != X0
| pull != X1 )
& ~ sP0(X0,X1) ) )
& ( ( n2 = X0
& push = X1 )
| ( n2 = X0
& pull = X1 )
| ( n1 = X0
& pull = X1 )
| sP0(X0,X1)
| ~ sP1(X0,X1) ) ),
inference(rectify,[],[f118]) ).
fof(f118,plain,
! [X1,X0] :
( ( sP1(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ~ sP0(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP0(X1,X0)
| ~ sP1(X1,X0) ) ),
inference(flattening,[],[f117]) ).
fof(f117,plain,
! [X1,X0] :
( ( sP1(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ~ sP0(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP0(X1,X0)
| ~ sP1(X1,X0) ) ),
inference(nnf_transformation,[],[f104]) ).
fof(f104,plain,
! [X1,X0] :
( sP1(X1,X0)
<=> ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP0(X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f199,plain,
! [X0,X1] :
( ~ sP1(X1,X0)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP1(X1,X0) )
& ( sP1(X1,X0)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f105]) ).
fof(f105,plain,
! [X0,X1] :
( happens(X0,X1)
<=> sP1(X1,X0) ),
inference(definition_folding,[],[f54,f104,f103]) ).
fof(f103,plain,
! [X1,X0] :
( sP0(X1,X0)
<=> ( n0 = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f54,plain,
! [X0,X1] :
( happens(X0,X1)
<=> ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| ( n0 = X1
& push = X0 ) ) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X3,X4] :
( happens(X3,X4)
<=> ( ( n2 = X4
& push = X3 )
| ( n2 = X4
& pull = X3 )
| ( n1 = X4
& pull = X3 )
| ( n0 = X4
& push = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',happens_all_defn) ).
fof(f305,plain,
! [X0] :
( ~ happens(push,X0)
| sP5(X0,backwards,pull) ),
inference(equality_resolution,[],[f304]) ).
fof(f304,plain,
! [X2,X0] :
( sP5(X0,backwards,X2)
| ~ happens(push,X0)
| pull != X2 ),
inference(equality_resolution,[],[f218]) ).
fof(f218,plain,
! [X2,X0,X1] :
( sP5(X0,X1,X2)
| ~ happens(push,X0)
| backwards != X1
| pull != X2 ),
inference(cnf_transformation,[],[f132]) ).
fof(f132,plain,
! [X0,X1,X2] :
( ( sP5(X0,X1,X2)
| ~ happens(push,X0)
| backwards != X1
| pull != X2 )
& ( ( happens(push,X0)
& backwards = X1
& pull = X2 )
| ~ sP5(X0,X1,X2) ) ),
inference(rectify,[],[f131]) ).
fof(f131,plain,
! [X2,X1,X0] :
( ( sP5(X2,X1,X0)
| ~ happens(push,X2)
| backwards != X1
| pull != X0 )
& ( ( happens(push,X2)
& backwards = X1
& pull = X0 )
| ~ sP5(X2,X1,X0) ) ),
inference(flattening,[],[f130]) ).
fof(f130,plain,
! [X2,X1,X0] :
( ( sP5(X2,X1,X0)
| ~ happens(push,X2)
| backwards != X1
| pull != X0 )
& ( ( happens(push,X2)
& backwards = X1
& pull = X0 )
| ~ sP5(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X2,X1,X0] :
( sP5(X2,X1,X0)
<=> ( happens(push,X2)
& backwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP5])]) ).
fof(f493,plain,
~ sP5(n2,backwards,pull),
inference(resolution,[],[f484,f208]) ).
fof(f208,plain,
! [X2,X0,X1] :
( sP7(X0,X1,X2)
| ~ sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
! [X0,X1,X2] :
( ( sP7(X0,X1,X2)
| ( ( happens(push,X0)
| spinning != X1
| pull != X2 )
& ~ sP6(X0,X1,X2)
& ~ sP5(X0,X1,X2)
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2) ) )
& ( ( ~ happens(push,X0)
& spinning = X1
& pull = X2 )
| sP6(X0,X1,X2)
| sP5(X0,X1,X2)
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| ~ sP7(X0,X1,X2) ) ),
inference(rectify,[],[f125]) ).
fof(f125,plain,
! [X2,X1,X0] :
( ( sP7(X2,X1,X0)
| ( ( happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP6(X2,X1,X0)
& ~ sP5(X2,X1,X0)
& ~ sP4(X2,X1,X0)
& ~ sP3(X2,X1,X0)
& ~ sP2(X2,X1,X0) ) )
& ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| sP3(X2,X1,X0)
| sP2(X2,X1,X0)
| ~ sP7(X2,X1,X0) ) ),
inference(flattening,[],[f124]) ).
fof(f124,plain,
! [X2,X1,X0] :
( ( sP7(X2,X1,X0)
| ( ( happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP6(X2,X1,X0)
& ~ sP5(X2,X1,X0)
& ~ sP4(X2,X1,X0)
& ~ sP3(X2,X1,X0)
& ~ sP2(X2,X1,X0) ) )
& ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| sP3(X2,X1,X0)
| sP2(X2,X1,X0)
| ~ sP7(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f111]) ).
fof(f111,plain,
! [X2,X1,X0] :
( sP7(X2,X1,X0)
<=> ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| sP3(X2,X1,X0)
| sP2(X2,X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP7])]) ).
fof(f484,plain,
~ sP7(n2,backwards,pull),
inference(resolution,[],[f481,f175]) ).
fof(f175,plain,
holdsAt(backwards,n3),
inference(cnf_transformation,[],[f51]) ).
fof(f51,plain,
holdsAt(backwards,n3),
inference(flattening,[],[f49]) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(backwards,n3),
inference(negated_conjecture,[],[f48]) ).
fof(f48,conjecture,
~ holdsAt(backwards,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_3) ).
fof(f481,plain,
! [X0] :
( ~ holdsAt(X0,n3)
| ~ sP7(n2,X0,pull) ),
inference(forward_demodulation,[],[f478,f268]) ).
fof(f268,plain,
n3 = plus(n1,n2),
inference(cnf_transformation,[],[f26]) ).
fof(f26,axiom,
n3 = plus(n1,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_2) ).
fof(f478,plain,
! [X0] :
( ~ holdsAt(X0,plus(n1,n2))
| ~ sP7(n2,X0,pull) ),
inference(resolution,[],[f476,f339]) ).
fof(f339,plain,
happens(pull,n2),
inference(resolution,[],[f199,f295]) ).
fof(f295,plain,
sP1(n2,pull),
inference(equality_resolution,[],[f294]) ).
fof(f294,plain,
! [X1] :
( sP1(n2,X1)
| pull != X1 ),
inference(equality_resolution,[],[f193]) ).
fof(f193,plain,
! [X0,X1] :
( sP1(X0,X1)
| n2 != X0
| pull != X1 ),
inference(cnf_transformation,[],[f119]) ).
fof(f476,plain,
! [X2,X0,X1] :
( ~ happens(X2,X0)
| ~ holdsAt(X1,plus(n1,X0))
| ~ sP7(X0,X1,X2) ),
inference(resolution,[],[f232,f418]) ).
fof(f418,plain,
! [X2,X0,X1] :
( ~ terminates(X2,X1,X0)
| ~ holdsAt(X1,plus(n1,X0))
| ~ happens(X2,X0) ),
inference(superposition,[],[f247,f288]) ).
fof(f288,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f78]) ).
fof(f78,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(rectify,[],[f31]) ).
fof(f31,axiom,
! [X8,X9] : plus(X8,X9) = plus(X9,X8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(f247,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
fof(f88,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(flattening,[],[f87]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(ennf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1,X2] :
( ( terminates(X0,X2,X1)
& happens(X0,X1) )
=> ~ holdsAt(X2,plus(X1,n1)) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X3,X4,X1] :
( ( terminates(X3,X1,X4)
& happens(X3,X4) )
=> ~ holdsAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',happens_terminates_not_holds) ).
fof(f232,plain,
! [X2,X0,X1] :
( terminates(X0,X1,X2)
| ~ sP7(X2,X1,X0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
! [X0,X1,X2] :
( ( terminates(X0,X1,X2)
| ~ sP7(X2,X1,X0) )
& ( sP7(X2,X1,X0)
| ~ terminates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> sP7(X2,X1,X0) ),
inference(definition_folding,[],[f57,f111,f110,f109,f108,f107,f106]) ).
fof(f106,plain,
! [X2,X1,X0] :
( sP2(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& backwards = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f107,plain,
! [X2,X1,X0] :
( sP3(X2,X1,X0)
<=> ( ~ happens(push,X2)
& forwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f108,plain,
! [X2,X1,X0] :
( sP4(X2,X1,X0)
<=> ( happens(push,X2)
& forwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f110,plain,
! [X2,X1,X0] :
( sP6(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& spinning = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f57,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| ( ~ happens(pull,X2)
& spinning = X1
& push = X0 )
| ( happens(push,X2)
& backwards = X1
& pull = X0 )
| ( happens(push,X2)
& forwards = X1
& pull = X0 )
| ( ~ happens(push,X2)
& forwards = X1
& pull = X0 )
| ( ~ happens(pull,X2)
& backwards = X1
& push = X0 ) ) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X3,X1,X4] :
( terminates(X3,X1,X4)
<=> ( ( ~ happens(push,X4)
& spinning = X1
& pull = X3 )
| ( ~ happens(pull,X4)
& spinning = X1
& push = X3 )
| ( happens(push,X4)
& backwards = X1
& pull = X3 )
| ( happens(push,X4)
& forwards = X1
& pull = X3 )
| ( ~ happens(push,X4)
& forwards = X1
& pull = X3 )
| ( ~ happens(pull,X4)
& backwards = X1
& push = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',terminates_all_defn) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR021+1 : TPTP v8.2.0. Bugfixed v3.1.0.
% 0.11/0.13 % 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.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 00:54:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.34 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.55/0.72 % (19153)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.55/0.72 % (19147)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.55/0.72 % (19153)Refutation not found, incomplete strategy% (19153)------------------------------
% 0.55/0.72 % (19153)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.72 % (19153)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.72
% 0.55/0.72 % (19153)Memory used [KB]: 1070
% 0.55/0.72 % (19153)Time elapsed: 0.002 s
% 0.55/0.72 % (19153)Instructions burned: 3 (million)
% 0.55/0.72 % (19148)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.72 % (19149)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.55/0.72 % (19150)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.55/0.73 % (19153)------------------------------
% 0.55/0.73 % (19153)------------------------------
% 0.55/0.73 % (19146)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.55/0.73 % (19149)Refutation not found, incomplete strategy% (19149)------------------------------
% 0.55/0.73 % (19149)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (19149)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (19149)Memory used [KB]: 1068
% 0.55/0.73 % (19149)Time elapsed: 0.003 s
% 0.55/0.73 % (19149)Instructions burned: 3 (million)
% 0.55/0.73 % (19151)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.55/0.73 % (19149)------------------------------
% 0.55/0.73 % (19149)------------------------------
% 0.55/0.73 % (19150)Refutation not found, incomplete strategy% (19150)------------------------------
% 0.55/0.73 % (19150)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (19150)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (19150)Memory used [KB]: 1168
% 0.55/0.73 % (19150)Time elapsed: 0.005 s
% 0.55/0.73 % (19150)Instructions burned: 7 (million)
% 0.55/0.73 % (19152)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.55/0.73 % (19150)------------------------------
% 0.55/0.73 % (19150)------------------------------
% 0.55/0.73 % (19151)Refutation not found, incomplete strategy% (19151)------------------------------
% 0.55/0.73 % (19151)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (19151)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (19151)Memory used [KB]: 1088
% 0.55/0.73 % (19151)Time elapsed: 0.005 s
% 0.55/0.73 % (19151)Instructions burned: 4 (million)
% 0.55/0.73 % (19146)Refutation not found, incomplete strategy% (19146)------------------------------
% 0.55/0.73 % (19146)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (19146)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (19146)Memory used [KB]: 1200
% 0.55/0.73 % (19146)Time elapsed: 0.006 s
% 0.55/0.73 % (19146)Instructions burned: 12 (million)
% 0.55/0.73 % (19151)------------------------------
% 0.55/0.73 % (19151)------------------------------
% 0.55/0.73 % (19146)------------------------------
% 0.55/0.73 % (19146)------------------------------
% 0.55/0.73 % (19155)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.55/0.73 % (19156)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.55/0.73 % (19157)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.55/0.73 % (19154)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.55/0.73 % (19158)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2996ds/518Mi)
% 0.55/0.74 % (19152)Refutation not found, incomplete strategy% (19152)------------------------------
% 0.55/0.74 % (19152)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (19152)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (19152)Memory used [KB]: 1140
% 0.55/0.74 % (19152)Time elapsed: 0.010 s
% 0.55/0.74 % (19152)Instructions burned: 7 (million)
% 0.55/0.74 % (19152)------------------------------
% 0.55/0.74 % (19152)------------------------------
% 0.55/0.74 % (19157)First to succeed.
% 0.55/0.74 % (19158)Refutation not found, incomplete strategy% (19158)------------------------------
% 0.55/0.74 % (19158)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (19158)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (19158)Memory used [KB]: 1179
% 0.55/0.74 % (19158)Time elapsed: 0.006 s
% 0.55/0.74 % (19158)Instructions burned: 8 (million)
% 0.55/0.74 % (19158)------------------------------
% 0.55/0.74 % (19158)------------------------------
% 0.55/0.74 % (19157)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-19145"
% 0.55/0.74 % (19157)Refutation found. Thanks to Tanya!
% 0.55/0.74 % SZS status Theorem for theBenchmark
% 0.55/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.74 % (19157)------------------------------
% 0.55/0.74 % (19157)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (19157)Termination reason: Refutation
% 0.55/0.74
% 0.55/0.74 % (19157)Memory used [KB]: 1213
% 0.55/0.74 % (19157)Time elapsed: 0.007 s
% 0.55/0.74 % (19157)Instructions burned: 19 (million)
% 0.55/0.74 % (19145)Success in time 0.388 s
% 0.55/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------