TSTP Solution File: SEU371+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU371+1 : TPTP v8.2.0. Released v3.3.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 : n019.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:47:27 EDT 2024
% Result : Theorem 0.60s 0.80s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 22 unt; 0 def)
% Number of atoms : 144 ( 39 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 141 ( 43 ~; 39 |; 55 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 22 ( 20 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 47 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1013,plain,
$false,
inference(trivial_inequality_removal,[],[f1011]) ).
fof(f1011,plain,
empty_set != empty_set,
inference(superposition,[],[f671,f1007]) ).
fof(f1007,plain,
! [X0] : empty_set = bottom_of_relstr(poset_of_lattice(boole_lattice(X0))),
inference(forward_demodulation,[],[f1006,f819]) ).
fof(f819,plain,
! [X0] : empty_set = join_of_latt_set(boole_lattice(X0),empty_set),
inference(forward_demodulation,[],[f818,f314]) ).
fof(f314,plain,
! [X0] : empty_set = bottom_of_semilattstr(boole_lattice(X0)),
inference(cnf_transformation,[],[f109]) ).
fof(f109,axiom,
! [X0] :
( empty_set = bottom_of_semilattstr(boole_lattice(X0))
& lower_bounded_semilattstr(boole_lattice(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_lattice3) ).
fof(f818,plain,
! [X0] : bottom_of_semilattstr(boole_lattice(X0)) = join_of_latt_set(boole_lattice(X0),empty_set),
inference(subsumption_resolution,[],[f817,f356]) ).
fof(f356,plain,
! [X0] : ~ empty_carrier(boole_lattice(X0)),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( complete_latt_str(boole_lattice(X0))
& boolean_lattstr(boole_lattice(X0))
& complemented_lattstr(boole_lattice(X0))
& bounded_lattstr(boole_lattice(X0))
& upper_bounded_semilattstr(boole_lattice(X0))
& lower_bounded_semilattstr(boole_lattice(X0))
& distributive_lattstr(boole_lattice(X0))
& lattice(boole_lattice(X0))
& join_absorbing(boole_lattice(X0))
& meet_absorbing(boole_lattice(X0))
& meet_associative(boole_lattice(X0))
& meet_commutative(boole_lattice(X0))
& join_associative(boole_lattice(X0))
& join_commutative(boole_lattice(X0))
& strict_latt_str(boole_lattice(X0))
& ~ empty_carrier(boole_lattice(X0)) ),
inference(pure_predicate_removal,[],[f59]) ).
fof(f59,axiom,
! [X0] :
( complete_latt_str(boole_lattice(X0))
& boolean_lattstr(boole_lattice(X0))
& complemented_lattstr(boole_lattice(X0))
& bounded_lattstr(boole_lattice(X0))
& upper_bounded_semilattstr(boole_lattice(X0))
& lower_bounded_semilattstr(boole_lattice(X0))
& modular_lattstr(boole_lattice(X0))
& distributive_lattstr(boole_lattice(X0))
& lattice(boole_lattice(X0))
& join_absorbing(boole_lattice(X0))
& meet_absorbing(boole_lattice(X0))
& meet_associative(boole_lattice(X0))
& meet_commutative(boole_lattice(X0))
& join_associative(boole_lattice(X0))
& join_commutative(boole_lattice(X0))
& strict_latt_str(boole_lattice(X0))
& ~ empty_carrier(boole_lattice(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_knaster) ).
fof(f817,plain,
! [X0] :
( bottom_of_semilattstr(boole_lattice(X0)) = join_of_latt_set(boole_lattice(X0),empty_set)
| empty_carrier(boole_lattice(X0)) ),
inference(subsumption_resolution,[],[f816,f364]) ).
fof(f364,plain,
! [X0] : lattice(boole_lattice(X0)),
inference(cnf_transformation,[],[f117]) ).
fof(f816,plain,
! [X0] :
( bottom_of_semilattstr(boole_lattice(X0)) = join_of_latt_set(boole_lattice(X0),empty_set)
| ~ lattice(boole_lattice(X0))
| empty_carrier(boole_lattice(X0)) ),
inference(subsumption_resolution,[],[f815,f414]) ).
fof(f414,plain,
! [X0] : latt_str(boole_lattice(X0)),
inference(cnf_transformation,[],[f27]) ).
fof(f27,axiom,
! [X0] :
( latt_str(boole_lattice(X0))
& strict_latt_str(boole_lattice(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_lattice3) ).
fof(f815,plain,
! [X0] :
( ~ latt_str(boole_lattice(X0))
| bottom_of_semilattstr(boole_lattice(X0)) = join_of_latt_set(boole_lattice(X0),empty_set)
| ~ lattice(boole_lattice(X0))
| empty_carrier(boole_lattice(X0)) ),
inference(resolution,[],[f312,f371]) ).
fof(f371,plain,
! [X0] : complete_latt_str(boole_lattice(X0)),
inference(cnf_transformation,[],[f117]) ).
fof(f312,plain,
! [X0] :
( ~ complete_latt_str(X0)
| ~ latt_str(X0)
| bottom_of_semilattstr(X0) = join_of_latt_set(X0,empty_set)
| ~ lattice(X0)
| empty_carrier(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f130,plain,
! [X0] :
( ( bottom_of_semilattstr(X0) = join_of_latt_set(X0,empty_set)
& latt_str(X0)
& lower_bounded_semilattstr(X0)
& lattice(X0)
& ~ empty_carrier(X0) )
| ~ latt_str(X0)
| ~ complete_latt_str(X0)
| ~ lattice(X0)
| empty_carrier(X0) ),
inference(flattening,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ( bottom_of_semilattstr(X0) = join_of_latt_set(X0,empty_set)
& latt_str(X0)
& lower_bounded_semilattstr(X0)
& lattice(X0)
& ~ empty_carrier(X0) )
| ~ latt_str(X0)
| ~ complete_latt_str(X0)
| ~ lattice(X0)
| empty_carrier(X0) ),
inference(ennf_transformation,[],[f112]) ).
fof(f112,axiom,
! [X0] :
( ( latt_str(X0)
& complete_latt_str(X0)
& lattice(X0)
& ~ empty_carrier(X0) )
=> ( bottom_of_semilattstr(X0) = join_of_latt_set(X0,empty_set)
& latt_str(X0)
& lower_bounded_semilattstr(X0)
& lattice(X0)
& ~ empty_carrier(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t50_lattice3) ).
fof(f1006,plain,
! [X0] : join_of_latt_set(boole_lattice(X0),empty_set) = bottom_of_relstr(poset_of_lattice(boole_lattice(X0))),
inference(subsumption_resolution,[],[f1003,f688]) ).
fof(f688,plain,
! [X0] : rel_str(poset_of_lattice(boole_lattice(X0))),
inference(definition_unfolding,[],[f333,f334]) ).
fof(f334,plain,
! [X0] : boole_POSet(X0) = poset_of_lattice(boole_lattice(X0)),
inference(cnf_transformation,[],[f22]) ).
fof(f22,axiom,
! [X0] : boole_POSet(X0) = poset_of_lattice(boole_lattice(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_yellow_1) ).
fof(f333,plain,
! [X0] : rel_str(boole_POSet(X0)),
inference(cnf_transformation,[],[f36]) ).
fof(f36,axiom,
! [X0] :
( rel_str(boole_POSet(X0))
& strict_rel_str(boole_POSet(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k3_yellow_1) ).
fof(f1003,plain,
! [X0] :
( join_of_latt_set(boole_lattice(X0),empty_set) = bottom_of_relstr(poset_of_lattice(boole_lattice(X0)))
| ~ rel_str(poset_of_lattice(boole_lattice(X0))) ),
inference(superposition,[],[f878,f306]) ).
fof(f306,plain,
! [X0] :
( bottom_of_relstr(X0) = join_on_relstr(X0,empty_set)
| ~ rel_str(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f127,plain,
! [X0] :
( bottom_of_relstr(X0) = join_on_relstr(X0,empty_set)
| ~ rel_str(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,axiom,
! [X0] :
( rel_str(X0)
=> bottom_of_relstr(X0) = join_on_relstr(X0,empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d11_yellow_0) ).
fof(f878,plain,
! [X0,X1] : join_of_latt_set(boole_lattice(X0),X1) = join_on_relstr(poset_of_lattice(boole_lattice(X0)),X1),
inference(subsumption_resolution,[],[f877,f356]) ).
fof(f877,plain,
! [X0,X1] :
( join_of_latt_set(boole_lattice(X0),X1) = join_on_relstr(poset_of_lattice(boole_lattice(X0)),X1)
| empty_carrier(boole_lattice(X0)) ),
inference(subsumption_resolution,[],[f876,f364]) ).
fof(f876,plain,
! [X0,X1] :
( join_of_latt_set(boole_lattice(X0),X1) = join_on_relstr(poset_of_lattice(boole_lattice(X0)),X1)
| ~ lattice(boole_lattice(X0))
| empty_carrier(boole_lattice(X0)) ),
inference(subsumption_resolution,[],[f875,f414]) ).
fof(f875,plain,
! [X0,X1] :
( ~ latt_str(boole_lattice(X0))
| join_of_latt_set(boole_lattice(X0),X1) = join_on_relstr(poset_of_lattice(boole_lattice(X0)),X1)
| ~ lattice(boole_lattice(X0))
| empty_carrier(boole_lattice(X0)) ),
inference(resolution,[],[f337,f371]) ).
fof(f337,plain,
! [X0,X1] :
( ~ complete_latt_str(X0)
| ~ latt_str(X0)
| join_of_latt_set(X0,X1) = join_on_relstr(poset_of_lattice(X0),X1)
| ~ lattice(X0)
| empty_carrier(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( meet_of_latt_set(X0,X1) = meet_on_relstr(poset_of_lattice(X0),X1)
& join_of_latt_set(X0,X1) = join_on_relstr(poset_of_lattice(X0),X1) )
| ~ latt_str(X0)
| ~ complete_latt_str(X0)
| ~ lattice(X0)
| empty_carrier(X0) ),
inference(flattening,[],[f131]) ).
fof(f131,plain,
! [X0] :
( ! [X1] :
( meet_of_latt_set(X0,X1) = meet_on_relstr(poset_of_lattice(X0),X1)
& join_of_latt_set(X0,X1) = join_on_relstr(poset_of_lattice(X0),X1) )
| ~ latt_str(X0)
| ~ complete_latt_str(X0)
| ~ lattice(X0)
| empty_carrier(X0) ),
inference(ennf_transformation,[],[f106]) ).
fof(f106,axiom,
! [X0] :
( ( latt_str(X0)
& complete_latt_str(X0)
& lattice(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( meet_of_latt_set(X0,X1) = meet_on_relstr(poset_of_lattice(X0),X1)
& join_of_latt_set(X0,X1) = join_on_relstr(poset_of_lattice(X0),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t29_yellow_0) ).
fof(f671,plain,
empty_set != bottom_of_relstr(poset_of_lattice(boole_lattice(sK2))),
inference(definition_unfolding,[],[f304,f334]) ).
fof(f304,plain,
empty_set != bottom_of_relstr(boole_POSet(sK2)),
inference(cnf_transformation,[],[f239]) ).
fof(f239,plain,
empty_set != bottom_of_relstr(boole_POSet(sK2)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f125,f238]) ).
fof(f238,plain,
( ? [X0] : empty_set != bottom_of_relstr(boole_POSet(X0))
=> empty_set != bottom_of_relstr(boole_POSet(sK2)) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
? [X0] : empty_set != bottom_of_relstr(boole_POSet(X0)),
inference(ennf_transformation,[],[f104]) ).
fof(f104,negated_conjecture,
~ ! [X0] : empty_set = bottom_of_relstr(boole_POSet(X0)),
inference(negated_conjecture,[],[f103]) ).
fof(f103,conjecture,
! [X0] : empty_set = bottom_of_relstr(boole_POSet(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_yellow_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SEU371+1 : TPTP v8.2.0. Released v3.3.0.
% 0.03/0.11 % 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.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 16:05:22 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.31 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.60/0.77 % (13858)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.77 % (13855)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.77 % (13853)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 (2995ds/34Mi)
% 0.60/0.77 % (13854)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 (2995ds/51Mi)
% 0.60/0.77 % (13856)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.77 % (13857)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 (2995ds/34Mi)
% 0.60/0.77 % (13859)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 (2995ds/83Mi)
% 0.60/0.77 % (13860)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 (2995ds/56Mi)
% 0.60/0.78 % (13856)Refutation not found, incomplete strategy% (13856)------------------------------
% 0.60/0.78 % (13856)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (13856)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (13856)Memory used [KB]: 1117
% 0.60/0.78 % (13856)Time elapsed: 0.003 s
% 0.60/0.78 % (13856)Instructions burned: 3 (million)
% 0.60/0.78 % (13853)Refutation not found, incomplete strategy% (13853)------------------------------
% 0.60/0.78 % (13853)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (13853)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (13853)Memory used [KB]: 1135
% 0.60/0.78 % (13853)Time elapsed: 0.003 s
% 0.60/0.78 % (13853)Instructions burned: 3 (million)
% 0.60/0.78 % (13856)------------------------------
% 0.60/0.78 % (13856)------------------------------
% 0.60/0.78 % (13853)------------------------------
% 0.60/0.78 % (13853)------------------------------
% 0.60/0.78 % (13858)Refutation not found, incomplete strategy% (13858)------------------------------
% 0.60/0.78 % (13858)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (13858)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (13858)Memory used [KB]: 1155
% 0.60/0.78 % (13858)Time elapsed: 0.003 s
% 0.60/0.78 % (13858)Instructions burned: 5 (million)
% 0.60/0.78 % (13860)Refutation not found, incomplete strategy% (13860)------------------------------
% 0.60/0.78 % (13860)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (13860)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (13858)------------------------------
% 0.60/0.78 % (13858)------------------------------
% 0.60/0.78 % (13860)Memory used [KB]: 1137
% 0.60/0.78 % (13860)Time elapsed: 0.003 s
% 0.60/0.78 % (13860)Instructions burned: 4 (million)
% 0.60/0.78 % (13860)------------------------------
% 0.60/0.78 % (13860)------------------------------
% 0.60/0.78 % (13861)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 (2995ds/55Mi)
% 0.60/0.78 % (13863)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 (2995ds/208Mi)
% 0.60/0.78 % (13862)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 (2995ds/50Mi)
% 0.60/0.78 % (13864)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 (2995ds/52Mi)
% 0.60/0.78 % (13863)Refutation not found, incomplete strategy% (13863)------------------------------
% 0.60/0.78 % (13863)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (13863)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (13863)Memory used [KB]: 1136
% 0.60/0.78 % (13863)Time elapsed: 0.003 s
% 0.60/0.78 % (13863)Instructions burned: 4 (million)
% 0.60/0.78 % (13863)------------------------------
% 0.60/0.78 % (13863)------------------------------
% 0.60/0.78 % (13865)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 (2995ds/518Mi)
% 0.60/0.78 % (13862)Refutation not found, incomplete strategy% (13862)------------------------------
% 0.60/0.78 % (13862)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (13862)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (13862)Memory used [KB]: 1345
% 0.60/0.78 % (13862)Time elapsed: 0.007 s
% 0.60/0.79 % (13862)Instructions burned: 14 (million)
% 0.60/0.79 % (13862)------------------------------
% 0.60/0.79 % (13862)------------------------------
% 0.60/0.79 % (13866)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2995ds/42Mi)
% 0.60/0.79 % (13857)Instruction limit reached!
% 0.60/0.79 % (13857)------------------------------
% 0.60/0.79 % (13857)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79 % (13857)Termination reason: Unknown
% 0.60/0.79 % (13857)Termination phase: Saturation
% 0.60/0.79
% 0.60/0.79 % (13857)Memory used [KB]: 1676
% 0.60/0.79 % (13857)Time elapsed: 0.018 s
% 0.60/0.79 % (13857)Instructions burned: 34 (million)
% 0.60/0.79 % (13857)------------------------------
% 0.60/0.79 % (13857)------------------------------
% 0.60/0.79 % (13867)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on theBenchmark for (2995ds/243Mi)
% 0.60/0.79 % (13855)First to succeed.
% 0.60/0.79 % (13866)Refutation not found, incomplete strategy% (13866)------------------------------
% 0.60/0.79 % (13866)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79 % (13866)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.79
% 0.60/0.79 % (13866)Memory used [KB]: 1265
% 0.60/0.79 % (13866)Time elapsed: 0.007 s
% 0.60/0.79 % (13866)Instructions burned: 13 (million)
% 0.60/0.79 % (13866)------------------------------
% 0.60/0.79 % (13866)------------------------------
% 0.60/0.79 % (13855)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-13852"
% 0.60/0.80 % (13855)Refutation found. Thanks to Tanya!
% 0.60/0.80 % SZS status Theorem for theBenchmark
% 0.60/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.80 % (13855)------------------------------
% 0.60/0.80 % (13855)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.80 % (13855)Termination reason: Refutation
% 0.60/0.80
% 0.60/0.80 % (13855)Memory used [KB]: 1515
% 0.60/0.80 % (13855)Time elapsed: 0.022 s
% 0.60/0.80 % (13855)Instructions burned: 40 (million)
% 0.60/0.80 % (13852)Success in time 0.475 s
% 0.60/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------